Presentation is loading. Please wait.

Presentation is loading. Please wait.

Computer Networking TCP/IP Dr Sandra I. Woolley. 2 Contents  TCP/IP –Overview –IPv4 –Classful addressing –Subnetting and Supernetting –Classless Inter-Domain.

Similar presentations


Presentation on theme: "Computer Networking TCP/IP Dr Sandra I. Woolley. 2 Contents  TCP/IP –Overview –IPv4 –Classful addressing –Subnetting and Supernetting –Classless Inter-Domain."— Presentation transcript:

1 Computer Networking TCP/IP Dr Sandra I. Woolley

2 2 Contents  TCP/IP –Overview –IPv4 –Classful addressing –Subnetting and Supernetting –Classless Inter-Domain Routing –IPv6 Overview –Transport Layer Protocols –Internet Routing Protocols

3 3 Internet Protocol  IP packets transfer information across Internet. Host A IP → router→ router…→ router→ Host B IP  IP layer in each router determines next hop.  Network interfaces transfer IP packets across networks. Router Internet Layer Network Interface Transport Layer Internet Layer Network Interface Transport Layer Internet Layer Network Interface Host A Host B Net 5 Net 1 Net 5 Net 2 Net 5 Net 3 Router Internet Layer Network Interface Router Internet Layer Network Interface Net 5 Net 4

4 4 HTTP SMTP RTP TCP UDP IP Network Interface 1 Network Interface 3 Network Interface 2 DNS (ICMP, ARP) Best-effort connectionless packet transfer Diverse network technologies Reliable stream service User datagram service TCP/IP Protocols

5 Internet Names and Addresses Reminder Internet Names  Each host has a unique name. –Independent of physical location –Facilitate memorization by humans –Domain Name –Organization under single administrative unit  Host Name –Name given to host computer  User Name –Name assigned to user Internet Addresses  Each IPv4 host has globally unique logical 32 bit IP address.  Separate address for each physical connection to a network.  Routing decision is done based on destination IP address.  IP address has two parts: –netid and hostid –netid unique and facilitates routing  Addresses have a dotted Decimal Notation: –e.g., Domain name service (DNS) resolves IP name to IP address

6 Internet Protocol v4  Provides best effort, connectionless packet delivery. –motivated by need to keep routers simple and for adaptability to failure of network elements. –packets may be lost, out of order, or even duplicated. –higher layer protocols must deal with these, if necessary.  Relevant RFCs are 791, 950, 919, 922, and  IP is part of Internet STD number 5*, which also includes: –Internet Control Message Protocol (ICMP), RFC 79 * Official RFCs are given STD numbers. IP STD 5 was RFC 791.

7 Inside the IPv4 Packet Header  Version  Internet header length (IHL): length of the header in 32-bit words.  Type of service (TOS): traditionally priority of packet at each router. (Differentiated Services redefines TOS field to include other services besides best effort.)  Total length: number of bytes of the IP packet including header and data. Maximum length is bytes.  Identification, Flags, and Fragment Offset: for fragmentation and reassembly.  Time to Live: hop limit

8 Inside the IPv4 Packet Header  Protocol: specifies upper-layer protocol that is to receive IP data at the destination. E.g.,TCP (protocol = 6), UDP (protocol = 17), and ICMP (protocol = 1).  Header checksum  Source IP address and destination IP address  Options: Variable length field, allows packet to request special features such as security level, route to be taken by the packet, and timestamp at each router.  Padding: This field is used to make the header a multiple of 32-bit words.

9 IPv4 Header Viewed in Protocol Analyzer

10 10 IPv4 Header Checksum  The IP header uses check bits to detect errors in the header.  A checksum is calculated from the header contents.  It is recalculated at every router, so the algorithm was selected for ease of implementation.  Let header consist of L, 16-bit words, b 0, b 1, b 2,..., b L-1  The algorithm appends a 16-bit checksum b L

11 11 IPv4 Checksum Calculation The checksum b L is calculated as follows:  Treating each 16-bit word as an integer, find x = b 0 + b 1 + b b L-1 modulo  The checksum is then given by: b L = - x modulo  If the header is free of errors, then: 0 = b 0 + b 1 + b b L-1 + b L modulo Header Processing 1.Compute header checksum for correctness and check that fields in the header (e.g. version and total length) contain valid values. 2.Consult the routing table to determine the next hop. 3.Change fields that require updating (TTL, header checksum). Note: b L is actually the ones' complement of the ones' complement sum of the header's 16-bit words.

12 12 IPv4 Addressing  Described in RFC Each host on the Internet has a unique 32 bit IP address.  Each address has two parts: netid and hostid.  Internet addressing is globally coordinated by the Internet Assigned Numbers Authority (IANA) and delegated to –American Registry for Internet Numbers (ARIN) –Latin America and Caribbean (LACNIC) –Reseaux IP Europeens (RIPE) –Asia Pacific Network Information Centre (APNIC) –African Network Information Center (AfriNIC)  A separate address is required for each physical connection of a host to a network; “multi-homed” hosts.  Dotted-Decimal Notation: –IP address of is in dotted-decimal notation.

13 13 IPv4 Classful Addresses netid hostid 7 bits24 bits 14 bits 16 bits Class A Class B 126 networks with up to 16 million hosts 16,382 networks with up to 64,000 hosts to to netidhostid 21 bits 8 bits Class C 0 2 million networks with up to 254 hosts to multicast address 28 bits 1 0 Class D to Up to 250 million multicast groups

14 14 Reserved and Private IP Addresses  A Class E of reserved addresses was defined from to  Specific ranges of IP addresses set aside for use in private networks (RFC 1918) –Range 1: to –Range 2: to –Range 3: to  Network Address Translation (NAT) is used to convert between private and global IP addresses. Entire groups of private addresses can make use a single IP address with network address translation.  Address with host ID of all 0’s is reserved for the network address.  Address with host ID of all 1s is reserved for broadcast.

15 15 Example of IPv4 Addressing R Network Network H H H H H R = router H = host Interface Address is Interface Address is Address with host ID=all 0s refers to the network Address with host ID=all 1s refers to a broadcast packet

16 16 Subnet Addressing  Subnet addressing introduces another hierarchical level.  Subnets are transparent to remote networks.  Simplifies management of multiple LANs.  Masking is used to find the subnet number.

17 17 Subnetting Example  Organization has Class B address (16 host ID bits) with network ID:  Create subnets with up to 100 hosts each –7 bits sufficient for host IDs for each subnet* –16-7=9 bits for subnet ID  Apply ( AND ) subnet mask to IP addresses to find corresponding subnet Example: Find subnet for given the mask below IP addr. = Mask = AND Subnet = * 2 7 = 128 For non-reserved host IDs we need to subtract 2, so allocating 7 bits will provide for up to 126 host IDs.

18 R1 H1H2 H3H4 R2H5 To the rest of the Internet Subnet Example

19 19 Routing Table Routing table search order and action  Complete destination address; send as per next-hop.  Destination network ID; send as per next-hop.  Default router entry; send as per next-hop.  Declare packet undeliverable; send ICMP “host unreachable error” packet to originating host.

20 20 IPv4 Address Problems  In the 1990, two problems became apparent. IP addresses were being exhausted and routing tables were growing very large.  IP Address Exhaustion –Class address structures were inefficient  Class A and B addresses accommodated far too many hosts for most organizations and the rate of allocation suggested exhaustion by  Class C addresses did not accommodate enough hosts.  IP routing table size –The growth of the Internet was reflected in the number of table entries.  From 1991 to 1995, routing tables doubled in size every 10 months, stressing router processing power and memory allocation.  The short-term solution: –Classless Interdomain Routing (CIDR), RFC 1518 –New allocation policy for regional internet registry (RFC 2050) –Private IP addresses set aside for intranets  The long-term solution: IPv6 with a much bigger address space.

21 New Address Allocation Policy  Class A & B assigned only for clearly demonstrated need.  Consecutive blocks of class C assigned (up to 64 blocks) –All IP addresses in the range have a common prefix, and every address with that prefix is within the range –Arbitrary prefix length for network ID improves efficiency  Lower half of class C space assigned to regional authorities Address Requirement Address Allocation < 2561 Class C 256<,<5122 Class C 512<,<10244 Class C 1024<,<20488 Class C 2048<,< Class C 4096<,< Class C 8192<,< Class C

22 22 Supernetting  A “supernet” is a block of contiguous subnetworks addressed as a single subnet.  Summarize a contiguous group of class C addresses using variable-length mask  Example: /20 IP Address ( ) & mask length (20) IP add = Mask = Contains 16 Class C blocks: From i.e Up to i.e

23 23 Classless Inter-Domain Routing (CIDR)  CIDR slowed the growth of routing tables by allocating IP addresses on any bit boundary rather than only on the 8-bit boundaries of the classful addresses. –Networks represented by prefix and mask. –Pre-CIDR: Network with range of 16 contiguous class C blocks required 16 entries. –Post-CIDR: Network with range of 16 contiguous class C blocks required 1 entry.  Solution: Route according to prefix of address, not class Routing table entry has Example: / min address mask IP prefix max address mask same IP prefix

24 24 CIDR Allocation Principles (RFC )  IP address assignment reflects physical topology of network.  Network topology follows continental/national boundaries. –IP addresses should be assigned on this basis.  Routing tables and routing protocols must carry IP address and mask.  Multiple entries may match a given IP destination address.  Example: Routing table may contain – /22 which corresponds to a given supernet. – /20 which results from aggregation of a larger number of destinations into a supernet. –Packet must be routed using the more specific route, that is, the longest prefix match.  Several fast longest-prefix matching algorithms are available.

25 ARP, RARP and DHCP

26 26 Address Resolution Protocol (ARP)  Although an IP address identifies a host, the packet is physically delivered by an underlying network (e.g., Ethernet) which uses its own physical address (MAC address in Ethernet).  How do we map an IP address to a physical address? H1H2H3H4 H1H2H3H4 ARP request (what is the MAC address of ?) ARP response (my MAC address is 08:00:5a:3b:94) H1 wants to learn physical address of H3 -> broadcasts an ARP request Every host receives the request, but only H3 replies with its physical address

27 27 RARP and DHCP  In some situations a host may know its MAC address but not its IP address. Reverse Address Resolution Protocol (RARP) was the protocol that originally achieved this.  RARP has since been made obsolete by DHCP.  Dynamic Host Configuration Protocol (RFC 2131)  DHCP allows servers to deliver configuration information to a host –Used extensively to assign temporary IP addresses to hosts. –Allows ISP to maximize usage of their limited IP addresses.

28 28 DHCP Operation  Host broadcasts DHCP Discover message on its physical network.  Server replies with Offer message (IP address + configuration information)  Host selects one offer and broadcasts DHCP Request message.  Server allocates IP address for lease time T –Sends DHCP ACK message with T, and threshold times T1 (=1/2 T) and T2 (=.875T)  At T1, host attempts to renew lease by sending DHCP Request message to original server.  If no reply by T2, host broadcasts DHCP Request to any server.  If no reply by T, host must relinquish IP address and start from the beginning.

29 IPv6

30 30 IPv6  Longer address field: –128 bit addresses. Can support up to 3.4 x hosts. –Groups of 16 bits represented by 4 hexadecimal digits and separated by colons e.g., 4BF5:AA12:0216:FEBC:BA5F:039A:BE9A:2176  Simplified header format: –Simpler format to speed up processing of each header IPv4 vs IPv6 fields: –Same: Version –Dropped: Header length, ID/flags/frag offset, header checksum –Replaced:  Datagram length by Payload length  Protocol type by Next header  TTL by Hop limit  TOS by traffic class –New: Flow label Version Traffic Class Flow Label Payload Length Next Header Hop Limit Source Address Destination Address

31 31 Other IPv6 Features  Flexible support for options: more efficient and flexible options encoded in optional extension headers.  Flow label capability: “flow label” to identify a packet flow that requires a certain Quality-of-Service (QoS).  Security: built-in authentication and confidentiality.  Large packets: supports payloads that are longer than 64 K bytes, called jumbo payloads.  Fragmentation at source only: source should check the minimum maximum transmission unit (MTU) along the path.  No checksum field: removed to reduce router packet processing.

32 32 Extension Headers Daisy chains of extension headers Basic header Next header = TCP TCP segment Basic header Next header = routing Routing header Next header = fragment Fragment header Next header = authentication TCP segment Authentication header Next header = TCP

33 33 Tunneling IPv6 Across IPv4 Networks Source Destination IPv6 network Link (b) Source Destination IPv6 network IPv4 network IPv6 network Tunnel Tunnel head-end Tunnel tail-end IPv6 header IPv4 header (a)  Dual IP stacks: routers run IPv4 and IPv6  IPv6 can tunnel across IPv4 networks

34 Transport Layer Protocols: UDP and TCP

35 35 UDP – User Datagram Protocol  UDP is a best effort datagram service.  Simple transmitter and receiver –Connectionless: no handshaking and no connection state. –Low header overhead. –No flow control, no error control, no congestion control. –UDP datagrams can be lost or out-of-order.  Applications –Multimedia, e.g., Real-Time Transport Protocol (RTP) –Network services, e.g., Domain Name Service (DNS) and Simple Network Management Protocol (SNMP).

36 UDP Datagram  –Well-known ports  Source and destination port numbers –Client ports are ephemeral. –Server ports are well-known. –Max number is 65,535.  UDP length –Total number of bytes in datagram (including header.) –8 bytes ≤ length ≤ 65,535  UDP Checksum –Optionally detects errors in UDP datagram (all 0's if not used.) Source Port Destination Port UDP Length UDP Checksum Data

37 37 TCP – Transmission Control Protocol  TCP provides a reliable byte-stream service.  More complex transmitter and receiver –Connection-oriented: connection between client and server processes. –Connection setup, connection state, connection release. –Higher header overhead. –Error control, flow control, and congestion control. –Higher delay than UDP.  Most applications use TCP –HTTP, SMTP, FTP, …

38 38 Each TCP segment has header of 20 or more bytes + 0 or more bytes of data Source port Destination port Sequence number Acknowledgment number Checksum Urgent pointer Options Padding U R G A C K P S H R S T S Y N F I N Header length Reserved Window size Data TCP Segment Format

39 TCP Header Port Numbers  A socket address identifies a connection endpoint.  Well-known ports –FTP 20 –DNS 53 –HTTP 80 Sequence Number  First byte in segment.  Initial sequence number is selected during connection setup. Acknowledgement Number  Sequence number of next byte expected by receiver.  Acknowledges that all prior bytes in stream have been received correctly.  Valid if ACK flag is set. Header length  Length of header in multiples of 32-bit words

40 TCP Header  Control  6 bits  URG: urgent pointer flag –Urgent message end = SN + urgent pointer  ACK: ACK packet flag  PSH: override TCP buffering  RST: reset connection –Upon receipt of RST, connection is terminated and application layer notified  SYN: establish connection  FIN: close connection  Window Size  16 bits to advertise window size  Used for flow control  Sender will accept bytes with SN from ACK to ACK + window  Maximum window size is bytes  TCP Checksum and Urgent Pointer  The checksum is a simple checksum on header and payload. The urgent pointer is an indicator for the remote host and does not affect network treatment.

41 TCP Header  Options  Variable length  NOP (No Operation) option is used to pad TCP header to multiple of 32 bits  Time stamp option is used for round trip measurements.  Options  Maximum Segment Size (MSS) option specifies largest segment a receiver wants to receive  Window Scale option increases TCP window from 16 to 32 bits

42 42 Host AHost B SYN, Seq_no = x SYN, Seq_no = y, ACK, Ack_no = x+1 Seq_no = x+1, ACK, Ack_no = y+1 TCP Connection Establishment “Three-way Handshake” Initial sequence numbers (ISN) chosen to protect against segments from prior connections

43 43 Host AHost B SYN, Seq_no = n, ACK, Ack_no = n+1 Seq_no = n+1, ACK, Ack_no = n+1 Delayed segment with Seq_no = n+2 will be accepted If Host Always Uses the Same ISN

44 44 “Graceful Close” Acknowledge FIN statements FIN, seq = 5086 Ack = 5087 Data, seq. = 303, Ack=5087 Delivers data bytes FIN, seq. =453, Ack = 5087 Ack = 454 Host A Host B Ack = 453 TCP Connection Closing

45 45 TCP Flow Control and Congestion Control  TCP flow control stops the sender from sending too fast for the receiver. The receiver informs the sender about its free buffer space via the Receive Window Field (the “window size” in the TCP header.) This limits the number of unacknowledged bytes in transit.  TCP congestion control controls the rate of data entering the network. Senders and receivers use acknowledgements (or lack of acknowledgements) and estimates of round trip time to infer network conditions and adjust behaviour accordingly.

46 Internet Routing Protocols

47 47 Autonomous Systems  The Internet contains a collection of autonomous systems.  An autonomous system (AS) is a collection of connected Internet Protocol (IP) routing prefixes under the control of one or more network operators that presents a common, clearly defined routing policy to the Internet.  A stub AS: has only a single connection to another AS.  A multihomed AS: has connections to more than one AS but does not carry transit traffic.  A transit AS: carries transit traffic from other AS’s across itself.  AS numbers are provided by the Regional Internet Registries: RIPE, AfriNIC, APNIC, ARIN and LACNIC.

48 48 Routing within and Between AS’s  Interior Gateway Protocol (IGP): routing within AS – Routing Information Protocol (RIP) - a distance vector protocol – Open Shortest Path First (OSPF) - a link state protocol  Exterior Gateway Protocol (EGP): routing between AS’s –Border Gateway Protocol (BGP) – a path vector protocol (like a distance vector protocol but decisions also incorporate policies and rules).  Border Gateways perform both IGP & EGP routing R R R R R R R R AS A AS B AS C IGP EGPIGP

49 49 EGP Requirements  The Internet is woven into a coherent whole by exterior gateway protocol (EGP) between AS’s.  EGP enables two AS’s to exchange routing information about: –The networks that are contained within them. –The AS’s that can be reached through them.  EGP path selection guided by policy and rules not only path optimality –Trust, peering arrangements, etc.  * Notes. There was an exterior gateway protocol simply called “Exterior Gateway Protocol” which is now obsolete. BGPv4 is now used. BGPv4 is an exterior gateway protocol.  There was also an interior gateway protocol invented by Cisco called “Interior Gateway Routing Protocol” (IGRP) which is now obsolete. It was replaced by an “Enhanced” version; EIGRP.

50 Border Gateway Protocol v4  BGP (RFC 1771) is an EGP “routing” protocol to exchange network reachability information among BGP routers (also called BGP speakers.)  Network reachability information contains a sequence of ASs that packets traverse to reach a destination network.  Information exchanged between BGP speakers allows a router to construct a graph of AS connectivity.  BGP peers use TCP (port 179) to exchange messages.  Initially, BGP peers exchange entire BGP routing table –Incremental updates sent subsequently –Keepalive messages sent periodically (30 seconds)  Internal BGP (iBPG) for within AS.  External BGP (eBGP) for across AS borders. AS1 AS2 AS3 AS4 AS5 AS6 AS7

51 51 iBGP and eBGP  eBGP to exchange reachability information in different AS’s  iBGP to ensure reachability information is consistent among the BGP speakers in the same AS R R R R iBGP eBGP R R R R iBGP

52 52 Path Selection  Each BGP speaker –Evaluates the paths to a destination from an AS border router. –Selects the best that complies with policies. –Advertises that route to all BGP neighbours.  BGP assigns a preference order to each path and selects the path with highest preference.  When multiple paths to a destination exist, BGP maintains all of the paths, but only advertises the one with highest preference value.

53 53 BGP Policy  Examples of policy: –Never use AS X. –Never use AS X to get to a destination in AS Y. –Never use AS X and AS Y in the same path.  Import policies to accept, deny, or set preferences on route advertisements from neighbours.  Export policies to determine which routes should be advertised to which neighbours. –A route is advertised only if AS is willing to carry traffic on that route.  There are occasional disagreements between AS’s regarding peering arrangements and connectivity can be compromised.

54 Thank You


Download ppt "Computer Networking TCP/IP Dr Sandra I. Woolley. 2 Contents  TCP/IP –Overview –IPv4 –Classful addressing –Subnetting and Supernetting –Classless Inter-Domain."

Similar presentations


Ads by Google