DCN_rpj13

DCN_rpj13 - NT503 Data Communication Networking Internet...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Internet Fundamentals and Addressing
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Protocol stack for TCP and IP
Background image of page 2
3 Protocol stack for TCP and IP ¾ IP is transmission mechanism in TCP/IP protocol suite for the delivery of packets ± IP is unreliable but fast ± Uses connectionless/ datagram approach ± Packet switching technique ± No error checking and tracking ± Best effort to deliver the packet, but no guarantee ± For reliability, IP is paired with TCP (which supports guaranteed delivery, provides ACK etc.)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 IP datagram Packets at IP layer are called datagrams IP datagrams are: – Transported separately – May travel along different routes – May arrive out of sequence – Since IP is connectionless, no call set up is required – Variable length (up to 65536 bytes) • 20 to 40 bytes header
Background image of page 4
5 IP datagram (for IP version 4) ¾ Version (4-bits): 0100 : current version is IPv4 ¾ Header Length: 4-bits (0-15) multiplied by 4 ¾ Service Type: Priority, Throughput, reliability, delay ¾ Total Length (header plus data): 20 to 65536 bytes
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 IP datagram (for IP version 4) ¾ Identification: Used for identifying the packet in case the packet is fragmented All the fragments carry the same packet identification number ¾ Flags: (3-bit field) ± Indicate whether datagram can be further fragmented or not ¾ Fragmentation Offset: ± shows relative position of the fragment with respect to the whole datagram ¾ Time to live: ± Defines maximum number of hops a datagram can travel before it is discarded ± Sender sets its value and is decremented at each router ± Prevents the datagram from floating around in the network
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/15/2011 for the course ECO 2023 taught by Professor Mr.raza during the Summer '10 term at FAU.

Page1 / 32

DCN_rpj13 - NT503 Data Communication Networking Internet...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online