The document discusses routing and the Internet Protocol (IP) at the network layer. It describes how IP fragmentation allows large datagrams to be divided into smaller fragments for transmission. It also covers IP addressing and subnetting, the Dynamic Host Configuration Protocol (DHCP) for dynamic address allocation, and Network Address Translation (NAT) for sharing public IP addresses. The document then discusses routing algorithms like link-state and distance-vector, and routing protocols like RIP and OSPF used in the Internet.
The document discusses routing and the Internet Protocol (IP) at the network layer. It describes how IP fragmentation allows large datagrams to be divided into smaller fragments for transmission. It also covers IP addressing and subnetting, the Dynamic Host Configuration Protocol (DHCP) for dynamic address allocation, and Network Address Translation (NAT) for sharing public IP addresses. The document then discusses routing algorithms like link-state and distance-vector, and routing protocols like RIP and OSPF used in the Internet.
The document discusses routing and the Internet Protocol (IP) at the network layer. It describes how IP fragmentation allows large datagrams to be divided into smaller fragments for transmission. It also covers IP addressing and subnetting, the Dynamic Host Configuration Protocol (DHCP) for dynamic address allocation, and Network Address Translation (NAT) for sharing public IP addresses. The document then discusses routing algorithms like link-state and distance-vector, and routing protocols like RIP and OSPF used in the Internet.
The document discusses routing and the Internet Protocol (IP) at the network layer. It describes how IP fragmentation allows large datagrams to be divided into smaller fragments for transmission. It also covers IP addressing and subnetting, the Dynamic Host Configuration Protocol (DHCP) for dynamic address allocation, and Network Address Translation (NAT) for sharing public IP addresses. The document then discusses routing algorithms like link-state and distance-vector, and routing protocols like RIP and OSPF used in the Internet.
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
You are on page 1/ 17
55490005
Chapter 4: Network Layer
(PART 2)
Computer Networking: A Top Down
Approach 6th Edition 1 Jim Kurose, Keith Ross 2
Outline IP: Internet Protocol Routing Algorithms Routing in the Internet 3
IP: Internet Protocol
IP fragmentation Network links have MTU largest possible link level frame Large IP datagram divided (fragmented) within net One datagram becomes several datagrams Reassembled only at final destination IP header bits used to identify order related fragments 4
IP: Internet Protocol
IP address 32 bit identifier for host, router interface Interface is defined as the connection between host/router and physical link Routers have many interfaces IP addresses associated with each interface 5
IP: Internet Protocol
IP address Subnet part – high order bits Host part – low order bits To determine the subnets, detach each interface from its host or router Each created isolated network is called a subnet CIDR: Classless Inter Domain Routing Subnet portion of address of arbitrary length Address format: a.b.c.d/x where x is the number of bits in subnet portion of address 6
IP: Internet Protocol
DHCP: Dynamic Host Configuration Protocol Allow host to dynamically obtain its IP address from network server when it joins network Allowsreuse of addresses Support mobile users DHCP overview: Host broadcasts DHCP discover DHCP server responds with DHCP offer Host requests IP address DHCP request DHCP server sends address DHCP ack 7
IP: Internet Protocol
NAT: Network address translation All datagrams leaving local network have same single source NAT IP address, different source port numbers Range of addresses not needed from ISP. Just one IP address for all devices Addresses of devices in local network can be changed without notifying outside word 8
IP: Internet Protocol
NAT: Network address translation NAT router must: Replace (source IP address port #) of every outgoing datagram to (NAT IP address, new port #) Remember every (source IP address port #) to (NAT IP address, new port #) translation pair Replace (NAT IP address, new port #) in dest fields of every incoming datagram with (source IP address port #) 9
IP: Internet Protocol
ICMP: Internet control message protocol Used by hosts & routers to communicate network level information Error reporting Unreachable host, network, port, protocol Echo request/reply Used by ping Network layer above IP 10
IP: Internet Protocol
IPV6 Initial motivation 32bit address space soon to be completely allocated Header format may increase speed processing/forwarding Facilitate QoS IPv6 datagram format 40-byteheader No fragmentation 11
Routing Algorithms Routing algorithm classificaiton Global or decentralized information Global All routers have complete topology link cost info Link state algorithms Decentralized Router knows physically connected neighbors link costs to neighbors Iterative process of computation Exchange of info with neighbors Distance vector algorithms 13
Routing Algorithms Routing algorithm classificaiton Static or Dynamic Static Routes change slowly over time Dynamic Routes change more quickly Periodic update In response to link cost changes 14
Routing Algorithms A link-state routing algorithm Dijkstra’s Algorithm Network topology: Link costs known to all nodes Computes least cost paths from one node to all other nodes Iterative Oscillations possible 15
Routing Algorithms Distance vector algorithm Bellman-Ford (dynamic programming) Key idea: From time-to-time each node sends its own distance vector estimate to neighbors Iterative, asynchronous Each local iteration caused by: local link cost change or DV update message from neighbor Distributed Poisoned reverse 16
Routing in the Internet
RIP (Routing Information Protocol) Included in BSD-UNIX distribution in 1982 Distance vector algorithm Distance metric: Number of hops (max= 15 hops) Each link has cost 1 DVs exchanged with neighbors every 30 sec If no advertisement heard after 180 sec, link is declared as dead 17
Routing in the Internet
OSPF (Open Shortest Path First) Publicly available Uses link state algorithm OSPF advertisement carries one entry per neighbor Advertisements flooded to entire AS
