The Network Layer Chapter 5 Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011.

Slides:



Advertisements
Similar presentations
The Network Layer Chapter 5. Network Layer Design Issues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of.
Advertisements

The Network Layer Chapter 5. Network Layer Design Isues a)Store-and-Forward Packet Switching b)Services Provided to the Transport Layer c)Implementation.
The Network Layer Chapter Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.
Computer Networks NYUS FCSIT Spring 2008 Milos STOLIC, Bs.C. Teaching Assistant
1 The Network Layer Chapter 5. 2 Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation.
1 Quality of Service Requirements Techniques for Achieving Good Quality of Service Integrated Services Differentiated Services Label Switching and MPLS.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 23 Introduction to Computer Networks.
Summary The Problem The Dijkstra’s Shortest Path Algorithm
Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer The service should be independent of the router.
Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 13.
Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation.
Extending Networks. Three Levels of Extension Physical Layer –Repeaters Link Layer –Bridges –Switches Network –Routers: “Connecting networks”
Kazi Fall 2007 CSCI 370/EENG 4801 CSCI-370/EENG-480 Computer Networks Khurram Kazi.
Kazi Fall 2007 CSCI 370/EENG CSCI-370/EENG-480 Computer Networks Khurram Kazi.
EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.
Introduction Chapter Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.
Ad Hoc Wireless Routing COS 461: Computer Networks
The Network Layer Chapter 5. Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of.
The Network Layer Chapter 5.
Network Technologies essentials Week 4: Internetworking Compilation made by Tim Moors, UNSW Australia Original slides by David Wetherall, University of.
SAvPS – úvod Genči 2009 (bsaed on Tanenbaum’s slides.
Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.
Chapter 5 The Network Layer.
The Network Layer Week 5. Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless.
November 29, 2004 Prof. Paul Lin 1 CPET Internetworking, Addressing, and Routing Paul I-Hai Lin, Professor Electrical and Computer Engineering.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
The Network Layer Chapter 5. Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of.
April 5, 2004 Prof. Paul Lin 1 CPET The Network Layer Paul I-Hai Lin, Professor Electrical and Computer Engineering Technology Purdue University,
Computer Networks A.S. Tanenbaum 5 th Edition 2011 Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
10/19/20151 The Network Layer. 10/19/20152 Introduction Route packets through subnet So, it must know the topology of the subnet It should also be able.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Network Technologies essentials Week 5: Routing Compilation made by Tim Moors, UNSW Australia Original slides by David Wetherall, University of Washington.
CS 350 Chapter-9,10. Implementation of Connectionless Service Routing within a datagram network ISP’s equipment A’s table (initially) A’s table (later)
The Network Layer.
Network Layer4-1 Datagram networks r no call setup at network layer r routers: no state about end-to-end connections m no network-level concept of “connection”
THE NETWORK LAYER.
Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.
The Network Layer Chapter 5 1/4/2016www.ishuchita.com1.
Chapter 5 The Network Layer.
1 Addressing, Internetworking. 2 Collection of Subnetworks The Internet is an interconnected collection of many networks.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Network Layer Chapter 5 CN5E by Tanenbaum & Wetherall, © Pearson Education-Prentice Hall and D. Wetherall, 2011 Design Issues Routing Algorithms Congestion.
Fundamentals of Computer Networks ECE 478/578
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Chapter 5.
The Network Layer Design Issues & Routing Algorithms Chapter 5.
Chapter 5 Network Layer.
Assignment 1  Chapter 1:  Question 11  Question 13  Question 14  Question 33  Question 34  Chapter 2:  Question 6  Question 39  Chapter 3: 
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Network Layer Chapter
The Network Layer UNIT-4 snistforum.com. Network Layer Design Issues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation.
1 Most important algorithms! Routing Algorithms Properties Shortest Path Routing Flooding Distance Vector Routing Link State routing Hierarchical routing.
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CPSC 335 Data Communication.
A comparison of Ad-Hoc Routing Protocols
THE NETWORK LAYER.
Chapter 5 The Network Layer.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Network Layer Functions
ECE 544 Protocol Design Project 2016
Network classes Internet addresses are allocated by the InterNIC ( the organization that administers the Internet. These IP addresses.
Tanenbaum Chapter 5 Network
ECE 544 Protocol Design Project 2016
The Network Layer Network Layer Design Issues:
The Data Link Layer Chapter
Network Layer I have learned from life no matter how far you go
Introduction Chapter 1 Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.
Computer network technology
Chapter 5 The Network Layer.
Chapter 5: Link Layer 5.1 Introduction and services
Presentation transcript:

The Network Layer Chapter 5 Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented Service Comparison of Virtual-Circuit and Datagram Subnets Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Routing Algorithms The Optimality Principle Shortest Path Routing Flooding Distance Vector Routing Link State Routing Hierarchical Routing Broadcast Routing Multicast 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

Routing Algorithms (2) Conflict between fairness and optimality. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

The Optimality Principle (a) A subnet. (b) A sink tree for router B. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Shortest Path Routing The first 5 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

Distance Vector Routing (a) A subnet. (b) Input from A, I, H, K, and the new routing table for J. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Distance Vector Routing (2) The count-to-infinity problem. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Link State Routing Each router must do the following: 1.Discover its neighbors, learn their network address. 2.Measure the delay or cost to each of its neighbors. 3.Construct a packet telling all it has just learned. 4.Send this packet to all other routers. 5.Compute the 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 (a) Nine routers and a LAN. (b) A graph model of (a). Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Measuring Line Cost A subnet in which the East and West parts are connected by two lines. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Building Link State Packets (a) A subnet. (b) The link state packets for this subnet. 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 the previous slide (Fig. 5-13). Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Route Discovery a)(a) Range of A's broadcast. b)(b) After B and D have received A's broadcast. c)(c) After C, F, and G have received A's broadcast. d)(d) After E, H, and I have received A's broadcast. Shaded nodes are new recipients. Arrows show possible reverse routes. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Route Discovery (2) Format of a ROUTE REQUEST packet. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Route Discovery (3) Format of a ROUTE REPLY packet. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Route Maintenance (a) D's routing table before G goes down. (b) The graph after G has gone down. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Fragmentation (a) Transparent fragmentation. (b) Nontransparent fragmentation. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011

Fragmentation (2) Fragmentation when the elementary data size is 1 byte. (a) Original packet, containing 10 data bytes. (b) Fragments after passing through a network with maximum packet size of 8 payload bytes plus header. (c) Fragments after passing through a size 5 gateway. Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education- Prentice Hall, 2011