AC
Uploaded byaiswarya chelikani
PDF, PPTX3,141 views

network layer description and features including protocols advantages

This document summarizes key topics from Chapter 5 of the book "Computer Networks" by Andrew Tanenbaum and David Wetherall, which discusses the network layer. It covers network layer design issues like packet switching, services provided to the transport layer, and implementation of connectionless and connection-oriented services. It also summarizes routing algorithms like shortest path, distance vector, link state routing and comparisons of virtual circuit and datagram networks.

Embed presentation

Download as PDF, PPTX
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Chapter 5
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Network Layer Design Issues • Store-and-forward packet switching • Services provided to transport layer • Implementation of connectionless service • Implementation of connection-oriented service • Comparison of virtual-circuit and datagram networks
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Store-and-Forward Packet Switching The environment of the network layer protocols. ISP’s equipment
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Services Provided to the Transport Layer 1. Services independent of router technology. 2. Transport layer shielded from number, type, topology of routers. 3. Network addresses available to transport layer use uniform numbering plan – even across LANs and WANs
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Implementation of Connectionless Service Routing within a datagram network ISP’s equipment A’s table (initially) A’s table (later) C’s Table E’s Table
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Implementation of Connection-Oriented Service Routing within a virtual-circuit network ISP’s equipment A’s table C’s Table E’s Table
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Comparison of Virtual-Circuit and Datagram Networks Comparison of datagram and virtual-circuit networks
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing Algorithms (1) • Optimality principle • Shortest path algorithm • Flooding • Distance vector routing • Link state routing • Routing in ad hoc networks
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing Algorithms (2) • Broadcast routing • Multicast routing • Anycast routing • Routing for mobile hosts • Routing in ad hoc networks
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Fairness vs. Efficiency Network with a conflict between fairness and efficiency.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Optimality Principle (a) A network. (b) A sink tree for router B.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (1) The first five steps used in computing the shortest path from A to D. The arrows indicate the working node
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (2) Dijkstra’s algorithm to compute the shortest path through a graph. . . .
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (3) Dijkstra’s algorithm to compute the shortest path through a graph. . . . . . .
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (4) Dijkstra’s algorithm to compute the shortest path through a graph. . . .
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 (a) A network. (b) Input from A, I, H, K, and the new routing table for J. Distance Vector Routing
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Count-to-Infinity Problem The count-to-infinity problem
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Link State Routing 1. Discover neighbors, learn network addresses. 2. Set distance/cost metric to each neighbor. 3. Construct packet telling all learned. 4. Send packet to, receive packets from other routers. 5. Compute shortest path to every other router.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Learning about the Neighbors (1) Nine routers and a broadcast LAN.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Learning about the Neighbors (2) A graph model of previous slide.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Building Link State Packets (a) A network. (b) The link state packets for this network.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Distributing the Link State Packets The packet buffer for router B in previous slide
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Hierarchical Routing Hierarchical routing.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Broadcast Routing Reverse path forwarding. (a) A network. (b) A sink tree. (c) The tree built by reverse path forwarding.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Multicast Routing (1) (a) A network. (b) A spanning tree for the leftmost router. (c) A multicast tree for group 1. (d) A multicast tree for group 2.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Multicast Routing (2) (a) Core-based tree for group 1. (b) Sending to group 1.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Anycast Routing (a) Anycast routes to group 1. (b) Topology seen by the routing protocol.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing for Mobile Hosts Packet routing for mobile hosts
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing in Ad Hoc Networks (a) Range of A’s broadcast. (b) After B and D receive it. (c) After C, F, and G receive it. (d) After E, H, and I receive it. The shaded nodes are new recipients. The dashed lines show possible reverse routes. The solid lines show the discovered route.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Congestion Control Algorithms (1) • Approaches to congestion control • Traffic-aware routing • Admission control • Traffic throttling • Load shedding
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Congestion Control Algorithms (2) When too much traffic is offered, congestion sets in and performance degrades sharply.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Approaches to Congestion Control Timescales of approaches to congestion control
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic-Aware Routing A network in which the East and West parts are connected by two links.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Throttling (1) (a) A congested network. (b) The portion of the network that is not congested. A virtual circuit from A to B is also shown.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Throttling (2) Explicit congestion notification
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Load Shedding (1) A choke packet that affects only the source..
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Load Shedding (2) A choke packet that affects each hop it passes through.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Quality of Service • Application requirements • Traffic shaping • Packet scheduling • Admission control • Integrated services • Differentiated services
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Application Requirements (1) How stringent the quality-of-service requirements are.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Categories of QoS and Examples 1. Constant bit rate • Telephony 2. Real-time variable bit rate • Compressed videoconferencing 3. Non-real-time variable bit rate • Watching a movie on demand 4. Available bit rate • File transfer
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Shaping (1) (a) Shaping packets. (b) A leaky bucket. (c) A token bucket
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Shaping (2) (a) Traffic from a host. Output shaped by a token bucket of rate 200 Mbps and capacity (b) 9600 KB, (c) 0 KB.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Shaping (3) Token bucket level for shaping with rate 200 Mbps and capacity (d) 16000 KB, (e) 9600 KB, and (f) 0KB..
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Scheduling (1) Kinds of resources can potentially be reserved for different flows: 1. Bandwidth. 2. Buffer space. 3. CPU cycles.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Scheduling (2) Round-robin Fair Queuing
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Scheduling (3) (a) Weighted Fair Queueing. (b) Finishing times for the packets.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Admission Control (1) An example flow specification
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Admission Control (2) Bandwidth and delay guarantees with token buckets and WFQ.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Integrated Services (1) (a) A network. (b) The multicast spanning tree for host 1. (c) The multicast spanning tree for host 2.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Integrated Services (2) (a) Host 3 requests a channel to host 1. (b) Host 3 then requests a second channel, to host 2. (c) Host 5 requests a channel to host 1.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Differentiated Services (1) Expedited packets experience a traffic-free network
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Differentiated Services (2) A possible implementation of assured forwarding
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Internetworking • How networks differ • How networks can be connected • Tunneling • Internetwork routing • Packet fragmentation
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 How Networks Differ Some of the many ways networks can differ
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 How Networks Can Be Connected (a) A packet crossing different networks. (b) Network and link layer protocol processing.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Tunneling (1) Tunneling a packet from Paris to London.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Tunneling (2) Tunneling a car from France to England
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (1) Packet size issues: 1. Hardware 2. Operating system 3. Protocols 4. Compliance with (inter)national standard. 5. Reduce error-induced retransmissions 6. Prevent packet occupying channel too long.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (2) (a) Transparent fragmentation. (b) Nontransparent fragmentation
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (3) Fragmentation when the elementary data size is 1 byte. (a) Original packet, containing 10 data bytes.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (4) Fragmentation when the elementary data size is 1 byte (b) Fragments after passing through a network with maximum packet size of 8 payload bytes plus header.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (5) Fragmentation when the elementary data size is 1 byte (c) Fragments after passing through a size 5 gateway.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (6) Path MTU Discovery
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Principles (1) 1. Make sure it works 2. Keep it simple 3. Make clear choices 4. Exploit modularity 5. Expect heterogeneity . . .
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Principles (2) . . . 6. Avoid static options and parameters 7. Look for good design (not perfect) 8. Strict sending, tolerant receiving 9. Think about scalability 10.Consider performance and cost
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer in the Internet (1) • The IP Version 4 Protocol • IP Addresses • IP Version 6 • Internet Control Protocols • Label Switching and MPLS • OSPF—An Interior Gateway Routing Protocol • BGP—The Exterior Gateway Routing Protocol • Internet Multicasting • Mobile IP
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer in the Internet (2) The Internet is an interconnected collection of many networks.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The IP Version 4 Protocol (1) The IPv4 (Internet Protocol) header.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The IP Version 4 Protocol (2) Some of the IP options.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (1) An IP prefix.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (2) Splitting an IP prefix into separate networks with subnetting.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (3) A set of IP address assignments
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (4) Aggregation of IP prefixes
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (5) Longest matching prefix routing at the New York router.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (6) IP address formats
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (7) Special IP addresses
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (8) Placement and operation of a NAT box.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 Goals • Support billions of hosts • Reduce routing table size • Simplify protocol • Better security • Attention to type of service • Aid multicasting • Roaming host without changing address • Allow future protocol evolution • Permit coexistence of old, new protocols. . .
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (1) The IPv6 fixed header (required).
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (2) IPv6 extension headers
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (3) The hop-by-hop extension header for large datagrams (jumbograms).
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (4) The extension header for routing.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Internet Control Protocols (1) The principal ICMP message types.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Internet Control Protocols (2) Two switched Ethernet LANs joined by a router
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Label Switching and MPLS (1) Transmitting a TCP segment using IP, MPLS, and PPP.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Label Switching and MPLS (2) Forwarding an IP packet through an MPLS network
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (1) An autonomous system
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (2) A graph representation of the previous slide.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (3) The relation between ASes, backbones, and areas in OSPF.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (4) The five types of OSPF messages
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 BGP—The Exterior Gateway Routing Protocol (1) Examples of routing constraints: 1. No commercial traffic for educat. network 2. Never put Iraq on route starting at Pentagon 3. Choose cheaper network 4. Choose better performing network 5. Don’t go from Apple to Google to Apple
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 BGP—The Exterior Gateway Routing Protocol (2) Routing policies between four Autonomous Systems
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 BGP—The Exterior Gateway Routing Protocol (3) Propagation of BGP route advertisements
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Mobile IP Goals 1. Mobile host use home IP address anywhere. 2. No software changes to fixed hosts 3. No changes to router software, tables 4. Packets for mobile hosts – restrict detours 5. No overhead for mobile host at home.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 End Chapter 5

More Related Content

PPT
Chapter 4 data link layer
byNaiyan Noor
 
PPTX
Data link layer
byMukesh Chinta
 
PPTX
Computer Network - Network Layer
byManoj Kumar
 
PPTX
TCP/IP Protocol Architeture
byManoj Kumar
 
PPTX
Computer network switching
byShivani Godha
 
PPTX
Introduction for internet connectivity (IoT)
byFabMinds
 
PPTX
Transport layer services (cn)
byJay Limbachiya
 
PPT
Switching techniques
byGupta6Bindu
 
Chapter 4 data link layer
byNaiyan Noor
 
Data link layer
byMukesh Chinta
 
Computer Network - Network Layer
byManoj Kumar
 
TCP/IP Protocol Architeture
byManoj Kumar
 
Computer network switching
byShivani Godha
 
Introduction for internet connectivity (IoT)
byFabMinds
 
Transport layer services (cn)
byJay Limbachiya
 
Switching techniques
byGupta6Bindu
 

What's hot

PPT
Chapter1 computer introduction note
byarvind pandey
 
PPT
TCP/IP Network ppt
byextraganesh
 
PPTX
Internet protocol (ip) ppt
byDulith Kasun
 
PPTX
Unit 1 introduction to computer networks
bypavan kumar Thatikonda
 
PPT
Unit 3 Network Layer PPT
byKalpanaC14
 
PPTX
internet protocol
byrajshreemuthiah
 
PPTX
Physical layer OSI Model & Transmission Media
byMukesh Chinta
 
PPT
TCP/IP Protocols With All Layer Description
byShubham Khedekar
 
PPTX
Qos Quality of services
byHayderThary
 
PPTX
Broadband isdn
byEr Varun Kumar
 
PPT
Introduction to Application layer
byDr. C.V. Suresh Babu
 
PDF
Circuit Switching, Packet Switching, Virtual Circuit Networks and Datagram Ne...
byKaushik Panta
 
PPTX
Guided Transmission Media
byRajapriya82
 
PPTX
Multiplexing in mobile computing
byZituSahu
 
PPTX
Tcp
byVarsha Kumar
 
PPTX
message communication protocols in IoT
byFabMinds
 
PPTX
Transmission Control Protocol (TCP)
byk33a
 
PPSX
Token ring
byselvakumar_b1985
 
PPT
Sliding window protocol
byShehara Abeythunga
 
PPT
Lecture3 Physical Layer
byWaqas !!!!
 
Chapter1 computer introduction note
byarvind pandey
 
TCP/IP Network ppt
byextraganesh
 
Internet protocol (ip) ppt
byDulith Kasun
 
Unit 1 introduction to computer networks
bypavan kumar Thatikonda
 
Unit 3 Network Layer PPT
byKalpanaC14
 
internet protocol
byrajshreemuthiah
 
Physical layer OSI Model & Transmission Media
byMukesh Chinta
 
TCP/IP Protocols With All Layer Description
byShubham Khedekar
 
Qos Quality of services
byHayderThary
 
Broadband isdn
byEr Varun Kumar
 
Introduction to Application layer
byDr. C.V. Suresh Babu
 
Circuit Switching, Packet Switching, Virtual Circuit Networks and Datagram Ne...
byKaushik Panta
 
Guided Transmission Media
byRajapriya82
 
Multiplexing in mobile computing
byZituSahu
 
Tcp
byVarsha Kumar
 
message communication protocols in IoT
byFabMinds
 
Transmission Control Protocol (TCP)
byk33a
 
Token ring
byselvakumar_b1985
 
Sliding window protocol
byShehara Abeythunga
 
Lecture3 Physical Layer
byWaqas !!!!
 

Similar to network layer description and features including protocols advantages

PPT
Chapter1-Introduction.ppt
byrupeshchavan36
 
PPT
chapter- 6 network layer of computer network
byStuti36
 
PPT
Chapter6-TransportLayer-Computer Netrworks.ppt
byDhamodhar M
 
PPTX
Network Layer
byreshmadayma
 
PDF
Chapter3-DataLinkLayer-EzharulShort2.pdf
byfourthyearproject
 
PPT
Chapter7-ApplicationLayer.ppt-COMMUNICATION NETWORKS
byponni2
 
PPT
capa de transporte tanenbaum voy llenar mas
byrbandav1
 
PPTX
network.pptx
byKrishnaMoorthy122770
 
PDF
Chapter4-MediumAccessControlSublayer.pdf
byrbandav1
 
PPT
Chapter1-Introduction.ppt wawadadadaadnkfknen
bypranavyadav1603
 
PDF
Computer networks bharathiyar Unit I.pdf
byYuvaraj471177
 
PPT
Chapter1_Introduction1.1_1.3 and moredetails
byithod13
 
PPT
INTRODUCTION TO COMPUTER NETWORKS , CHQPTER 1
byAnanyaSharma434998
 
PDF
Chapter5.pdf
byMuhammadAsifAfzal2
 
PDF
Chapter1.2-1.7-Introduction_EzharulShort.pdf
byfourthyearproject
 
PPTX
Computer networks
byshanthishyam
 
PPTX
VY NETWORK LAYER 66j6jPART 1 3r324 25.pptx
bydarade4651
 
PPTX
Network layer design issues and related concepts of network layer.pptx
byvaishalibagewadikar1
 
PPTX
CN_UNIT_IV.pptx
bySSooraj1
 
PPT
QSpiders - Good to Know Network Concepts
byQspiders - Software Testing Training Institute
 
Chapter1-Introduction.ppt
byrupeshchavan36
 
chapter- 6 network layer of computer network
byStuti36
 
Chapter6-TransportLayer-Computer Netrworks.ppt
byDhamodhar M
 
Network Layer
byreshmadayma
 
Chapter3-DataLinkLayer-EzharulShort2.pdf
byfourthyearproject
 
Chapter7-ApplicationLayer.ppt-COMMUNICATION NETWORKS
byponni2
 
capa de transporte tanenbaum voy llenar mas
byrbandav1
 
network.pptx
byKrishnaMoorthy122770
 
Chapter4-MediumAccessControlSublayer.pdf
byrbandav1
 
Chapter1-Introduction.ppt wawadadadaadnkfknen
bypranavyadav1603
 
Computer networks bharathiyar Unit I.pdf
byYuvaraj471177
 
Chapter1_Introduction1.1_1.3 and moredetails
byithod13
 
INTRODUCTION TO COMPUTER NETWORKS , CHQPTER 1
byAnanyaSharma434998
 
Chapter5.pdf
byMuhammadAsifAfzal2
 
Chapter1.2-1.7-Introduction_EzharulShort.pdf
byfourthyearproject
 
Computer networks
byshanthishyam
 
VY NETWORK LAYER 66j6jPART 1 3r324 25.pptx
bydarade4651
 
Network layer design issues and related concepts of network layer.pptx
byvaishalibagewadikar1
 
CN_UNIT_IV.pptx
bySSooraj1
 
QSpiders - Good to Know Network Concepts
byQspiders - Software Testing Training Institute
 

Recently uploaded

PDF
Beyond Basics: How to Build Scalable, Intelligent Imagery Pipelines
bySafe Software
 
PDF
KMWorld - KM & AI Bring Collectivity, Nostalgia, & Selectivity
byJonathan Ralton
 
PDF
Mastering UiPath Maestro – Session 2 – Building a Live Use Case - Session 2
byDianaGray10
 
PPTX
Understanding the digital experience of FE teaching staff in 2024/25
byJisc
 
PPTX
Support, Monitoring, Continuous Improvement & Scaling Agentic Automation [3/3]
byUiPathCommunity
 
PDF
Running Non-Cloud-Native Databases in Cloud-Native Environments_ Challenges a...
byAlkin Tezuysal
 
PDF
THE THREATS OF INSTABILITY IN BRAZIL'S INTERCONNECTED ELECTRICAL SYSTEM AND H...
byFaga1939
 
PDF
IDSECCONF2025 - Faisal Ilham - Semi Automating Vulnerability Scanner and Expl...
byidsecconf
 
PDF
Build an AI/ML-driven image archive processing workflow: Image archive, analy...
bywesley chun
 
PPTX
Neo4j Fraud GraphTalk Singapore Nov 2025
bygourisachdeva2
 
PDF
IDSECCONF2025 - Budi Rahardjo - Cyber Security and AI.pdf
byidsecconf
 
PDF
OutSystsems User Group Brabant November 2025
bymail496323
 
PDF
Raj Jain, Recent Advances, Issues, and Challenges in Cybersecurity, Keynote a...
byrjain51
 
PPTX
Opening Plenary - Esri UK Welsh Conference 2025
byEsri UK
 
PPTX
Streamlining Business Processes with UiPath Apps
byTracy Dixon
 
PDF
IDSECCONF2025 - Ali - DursGo–Web Security Scanner with AI Analysis.pdf
byidsecconf
 
PDF
SELinux Basics: Managing SELinux Modes and Context - RHCSA+.pdf
byLinuxCert Guru
 
PDF
IDSECCONF2025 - Nosa Shandy - Discovering and Disclosing Privacy Vulnerabilit...
byidsecconf
 
PPTX
Agentic AI presentation with Python Exercises
byParth Mane
 
PPTX
Redcentric Data Centres: vision, mission and values
byRedcentric
 
Beyond Basics: How to Build Scalable, Intelligent Imagery Pipelines
bySafe Software
 
KMWorld - KM & AI Bring Collectivity, Nostalgia, & Selectivity
byJonathan Ralton
 
Mastering UiPath Maestro – Session 2 – Building a Live Use Case - Session 2
byDianaGray10
 
Understanding the digital experience of FE teaching staff in 2024/25
byJisc
 
Support, Monitoring, Continuous Improvement & Scaling Agentic Automation [3/3]
byUiPathCommunity
 
Running Non-Cloud-Native Databases in Cloud-Native Environments_ Challenges a...
byAlkin Tezuysal
 
THE THREATS OF INSTABILITY IN BRAZIL'S INTERCONNECTED ELECTRICAL SYSTEM AND H...
byFaga1939
 
IDSECCONF2025 - Faisal Ilham - Semi Automating Vulnerability Scanner and Expl...
byidsecconf
 
Build an AI/ML-driven image archive processing workflow: Image archive, analy...
bywesley chun
 
Neo4j Fraud GraphTalk Singapore Nov 2025
bygourisachdeva2
 
IDSECCONF2025 - Budi Rahardjo - Cyber Security and AI.pdf
byidsecconf
 
OutSystsems User Group Brabant November 2025
bymail496323
 
Raj Jain, Recent Advances, Issues, and Challenges in Cybersecurity, Keynote a...
byrjain51
 
Opening Plenary - Esri UK Welsh Conference 2025
byEsri UK
 
Streamlining Business Processes with UiPath Apps
byTracy Dixon
 
IDSECCONF2025 - Ali - DursGo–Web Security Scanner with AI Analysis.pdf
byidsecconf
 
SELinux Basics: Managing SELinux Modes and Context - RHCSA+.pdf
byLinuxCert Guru
 
IDSECCONF2025 - Nosa Shandy - Discovering and Disclosing Privacy Vulnerabilit...
byidsecconf
 
Agentic AI presentation with Python Exercises
byParth Mane
 
Redcentric Data Centres: vision, mission and values
byRedcentric
 
In this document
Powered by AI

Introduction to Chapter 5 on The Network Layer from Computer Networks, Fifth Edition.

Key design issues including packet switching, connection-oriented and connectionless services.

Explanation of store-and-forward packet switching, discussing the network layer protocols.

Services provided by the network layer to the transport layer, including addressing and router independence.

Overview of routing in a datagram network with reference to various routing tables.

Routing in a virtual-circuit network exemplified with tables showing connections between nodes.

Comparison of virtual-circuit and datagram networks, emphasizing their fundamental differences.

Introduction to routing algorithms including optimality principles, shortest path algorithms, and other methods.

Continuation on routing algorithms covering broadcast, multicast, and routing in mobile and ad hoc networks.

Discussion of the conflict between fairness and efficiency in network management.

Explanation of the optimality principle in network routing with graphical example.

Stepwise illustration of calculating shortest path from node A to D using algorithm.

Detailed explanation of Dijkstra’s algorithm for finding shortest paths in a network through several steps.

The count-to-infinity problem in distance vector routing, detailing the issue's impact.

Steps involved in link state routing techniques, including neighbor discovery and path computation.

Graphical representation of learning about neighbors in network routing using routers.

How to build link state packets for routers in a network to facilitate communication.

Mechanism for distributing link state packets among routers to ensure routing efficiency.

Explanation and benefits of hierarchical routing in network structures.

Techniques such as reverse path forwarding in networks demonstrated with visuals.

Approaches to multicast routing including spanning trees for group communications.

Exploration of anycast routing methods and their network topology implications.

Challenges and considerations for packet routing in mobile host scenarios.

Illustration of packet routing sequences in ad hoc networks with examples.

Overview of congestion control algorithms and the impact of over-traffic on network performance.

Detailed discussions on approaches including traffic-aware routing, throttling, and load shedding.

Exploration of QoS requirements, examples, and their significance in network applications.

Techniques for traffic shaping and scheduling to manage network flow effectively.

Introduction to flow specifications and mechanisms for controlling network admission.

Concepts and implementations of differentiated services enhancing network performance.

Explaining the differences between networks, connection methods, and tunneling concepts.

Mechanisms for tunneling packets across different networks, illustrated with examples.

Overview of packet fragmentation, its causes, and implications for network protocols.

Fundamental principles guiding the design and implementation of network layers.

Insights into how the network layer functions within the internet architecture.Detailed exploration of the IPv4 protocol header and its components.

Techniques for IP addressing, subnetting, and aggregation within networks.

Key objectives for the further development and implementation of IPv6 technology.

Details on IPv6 headers and extensions aimed at improving internet efficiency.

ICMP message types and their role in error handling in the network.

Understanding label switching and the role of MPLS in efficient data transmission.

Overview and mechanics of OSPF as an interior gateway routing protocol.

BGP routing protocol details including routing constraints and pattern propagation.

Key goals and functionalities of Mobile IP aimed at supporting mobile hosts.

Conclusion and transition to the next segment of the document.

network layer description and features including protocols advantages

  • 1.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Chapter 5
  • 2.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Network Layer Design Issues • Store-and-forward packet switching • Services provided to transport layer • Implementation of connectionless service • Implementation of connection-oriented service • Comparison of virtual-circuit and datagram networks
  • 3.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Store-and-Forward Packet Switching The environment of the network layer protocols. ISP’s equipment
  • 4.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Services Provided to the Transport Layer 1. Services independent of router technology. 2. Transport layer shielded from number, type, topology of routers. 3. Network addresses available to transport layer use uniform numbering plan – even across LANs and WANs
  • 5.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Implementation of Connectionless Service Routing within a datagram network ISP’s equipment A’s table (initially) A’s table (later) C’s Table E’s Table
  • 6.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Implementation of Connection-Oriented Service Routing within a virtual-circuit network ISP’s equipment A’s table C’s Table E’s Table
  • 7.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Comparison of Virtual-Circuit and Datagram Networks Comparison of datagram and virtual-circuit networks
  • 8.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing Algorithms (1) • Optimality principle • Shortest path algorithm • Flooding • Distance vector routing • Link state routing • Routing in ad hoc networks
  • 9.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing Algorithms (2) • Broadcast routing • Multicast routing • Anycast routing • Routing for mobile hosts • Routing in ad hoc networks
  • 10.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Fairness vs. Efficiency Network with a conflict between fairness and efficiency.
  • 11.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Optimality Principle (a) A network. (b) A sink tree for router B.
  • 12.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (1) The first five steps used in computing the shortest path from A to D. The arrows indicate the working node
  • 13.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (2) Dijkstra’s algorithm to compute the shortest path through a graph. . . .
  • 14.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (3) Dijkstra’s algorithm to compute the shortest path through a graph. . . . . . .
  • 15.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Shortest Path Algorithm (4) Dijkstra’s algorithm to compute the shortest path through a graph. . . .
  • 16.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 (a) A network. (b) Input from A, I, H, K, and the new routing table for J. Distance Vector Routing
  • 17.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Count-to-Infinity Problem The count-to-infinity problem
  • 18.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Link State Routing 1. Discover neighbors, learn network addresses. 2. Set distance/cost metric to each neighbor. 3. Construct packet telling all learned. 4. Send packet to, receive packets from other routers. 5. Compute shortest path to every other router.
  • 19.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Learning about the Neighbors (1) Nine routers and a broadcast LAN.
  • 20.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Learning about the Neighbors (2) A graph model of previous slide.
  • 21.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Building Link State Packets (a) A network. (b) The link state packets for this network.
  • 22.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Distributing the Link State Packets The packet buffer for router B in previous slide
  • 23.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Hierarchical Routing Hierarchical routing.
  • 24.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Broadcast Routing Reverse path forwarding. (a) A network. (b) A sink tree. (c) The tree built by reverse path forwarding.
  • 25.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Multicast Routing (1) (a) A network. (b) A spanning tree for the leftmost router. (c) A multicast tree for group 1. (d) A multicast tree for group 2.
  • 26.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Multicast Routing (2) (a) Core-based tree for group 1. (b) Sending to group 1.
  • 27.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Anycast Routing (a) Anycast routes to group 1. (b) Topology seen by the routing protocol.
  • 28.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing for Mobile Hosts Packet routing for mobile hosts
  • 29.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Routing in Ad Hoc Networks (a) Range of A’s broadcast. (b) After B and D receive it. (c) After C, F, and G receive it. (d) After E, H, and I receive it. The shaded nodes are new recipients. The dashed lines show possible reverse routes. The solid lines show the discovered route.
  • 30.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Congestion Control Algorithms (1) • Approaches to congestion control • Traffic-aware routing • Admission control • Traffic throttling • Load shedding
  • 31.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Congestion Control Algorithms (2) When too much traffic is offered, congestion sets in and performance degrades sharply.
  • 32.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Approaches to Congestion Control Timescales of approaches to congestion control
  • 33.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic-Aware Routing A network in which the East and West parts are connected by two links.
  • 34.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Throttling (1) (a) A congested network. (b) The portion of the network that is not congested. A virtual circuit from A to B is also shown.
  • 35.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Throttling (2) Explicit congestion notification
  • 36.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Load Shedding (1) A choke packet that affects only the source..
  • 37.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Load Shedding (2) A choke packet that affects each hop it passes through.
  • 38.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Quality of Service • Application requirements • Traffic shaping • Packet scheduling • Admission control • Integrated services • Differentiated services
  • 39.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Application Requirements (1) How stringent the quality-of-service requirements are.
  • 40.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Categories of QoS and Examples 1. Constant bit rate • Telephony 2. Real-time variable bit rate • Compressed videoconferencing 3. Non-real-time variable bit rate • Watching a movie on demand 4. Available bit rate • File transfer
  • 41.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Shaping (1) (a) Shaping packets. (b) A leaky bucket. (c) A token bucket
  • 42.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Shaping (2) (a) Traffic from a host. Output shaped by a token bucket of rate 200 Mbps and capacity (b) 9600 KB, (c) 0 KB.
  • 43.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Traffic Shaping (3) Token bucket level for shaping with rate 200 Mbps and capacity (d) 16000 KB, (e) 9600 KB, and (f) 0KB..
  • 44.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Scheduling (1) Kinds of resources can potentially be reserved for different flows: 1. Bandwidth. 2. Buffer space. 3. CPU cycles.
  • 45.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Scheduling (2) Round-robin Fair Queuing
  • 46.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Scheduling (3) (a) Weighted Fair Queueing. (b) Finishing times for the packets.
  • 47.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Admission Control (1) An example flow specification
  • 48.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Admission Control (2) Bandwidth and delay guarantees with token buckets and WFQ.
  • 49.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Integrated Services (1) (a) A network. (b) The multicast spanning tree for host 1. (c) The multicast spanning tree for host 2.
  • 50.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Integrated Services (2) (a) Host 3 requests a channel to host 1. (b) Host 3 then requests a second channel, to host 2. (c) Host 5 requests a channel to host 1.
  • 51.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Differentiated Services (1) Expedited packets experience a traffic-free network
  • 52.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Differentiated Services (2) A possible implementation of assured forwarding
  • 53.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Internetworking • How networks differ • How networks can be connected • Tunneling • Internetwork routing • Packet fragmentation
  • 54.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 How Networks Differ Some of the many ways networks can differ
  • 55.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 How Networks Can Be Connected (a) A packet crossing different networks. (b) Network and link layer protocol processing.
  • 56.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Tunneling (1) Tunneling a packet from Paris to London.
  • 57.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Tunneling (2) Tunneling a car from France to England
  • 58.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (1) Packet size issues: 1. Hardware 2. Operating system 3. Protocols 4. Compliance with (inter)national standard. 5. Reduce error-induced retransmissions 6. Prevent packet occupying channel too long.
  • 59.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (2) (a) Transparent fragmentation. (b) Nontransparent fragmentation
  • 60.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (3) Fragmentation when the elementary data size is 1 byte. (a) Original packet, containing 10 data bytes.
  • 61.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (4) Fragmentation when the elementary data size is 1 byte (b) Fragments after passing through a network with maximum packet size of 8 payload bytes plus header.
  • 62.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (5) Fragmentation when the elementary data size is 1 byte (c) Fragments after passing through a size 5 gateway.
  • 63.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Packet Fragmentation (6) Path MTU Discovery
  • 64.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Principles (1) 1. Make sure it works 2. Keep it simple 3. Make clear choices 4. Exploit modularity 5. Expect heterogeneity . . .
  • 65.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Principles (2) . . . 6. Avoid static options and parameters 7. Look for good design (not perfect) 8. Strict sending, tolerant receiving 9. Think about scalability 10.Consider performance and cost
  • 66.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer in the Internet (1) • The IP Version 4 Protocol • IP Addresses • IP Version 6 • Internet Control Protocols • Label Switching and MPLS • OSPF—An Interior Gateway Routing Protocol • BGP—The Exterior Gateway Routing Protocol • Internet Multicasting • Mobile IP
  • 67.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer in the Internet (2) The Internet is an interconnected collection of many networks.
  • 68.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The IP Version 4 Protocol (1) The IPv4 (Internet Protocol) header.
  • 69.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The IP Version 4 Protocol (2) Some of the IP options.
  • 70.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (1) An IP prefix.
  • 71.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (2) Splitting an IP prefix into separate networks with subnetting.
  • 72.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (3) A set of IP address assignments
  • 73.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (4) Aggregation of IP prefixes
  • 74.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (5) Longest matching prefix routing at the New York router.
  • 75.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (6) IP address formats
  • 76.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (7) Special IP addresses
  • 77.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Addresses (8) Placement and operation of a NAT box.
  • 78.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 Goals • Support billions of hosts • Reduce routing table size • Simplify protocol • Better security • Attention to type of service • Aid multicasting • Roaming host without changing address • Allow future protocol evolution • Permit coexistence of old, new protocols. . .
  • 79.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (1) The IPv6 fixed header (required).
  • 80.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (2) IPv6 extension headers
  • 81.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (3) The hop-by-hop extension header for large datagrams (jumbograms).
  • 82.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 IP Version 6 (4) The extension header for routing.
  • 83.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Internet Control Protocols (1) The principal ICMP message types.
  • 84.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Internet Control Protocols (2) Two switched Ethernet LANs joined by a router
  • 85.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Label Switching and MPLS (1) Transmitting a TCP segment using IP, MPLS, and PPP.
  • 86.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Label Switching and MPLS (2) Forwarding an IP packet through an MPLS network
  • 87.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (1) An autonomous system
  • 88.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (2) A graph representation of the previous slide.
  • 89.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (3) The relation between ASes, backbones, and areas in OSPF.
  • 90.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 OSPF—An Interior Gateway Routing Protocol (4) The five types of OSPF messages
  • 91.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 BGP—The Exterior Gateway Routing Protocol (1) Examples of routing constraints: 1. No commercial traffic for educat. network 2. Never put Iraq on route starting at Pentagon 3. Choose cheaper network 4. Choose better performing network 5. Don’t go from Apple to Google to Apple
  • 92.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 BGP—The Exterior Gateway Routing Protocol (2) Routing policies between four Autonomous Systems
  • 93.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 BGP—The Exterior Gateway Routing Protocol (3) Propagation of BGP route advertisements
  • 94.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Mobile IP Goals 1. Mobile host use home IP address anywhere. 2. No software changes to fixed hosts 3. No changes to router software, tables 4. Packets for mobile hosts – restrict detours 5. No overhead for mobile host at home.
  • 95.
    Computer Networks, FifthEdition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 End Chapter 5