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

Slides:

Advertisements

Similar presentations

4/12/2015© 2009 Raymond P. Jefferis IIILect Internet Protocol - Continued.

Advertisements

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.

Network Layer Chapter 5 Design Issues Routing Algorithms Congestion Control Quality of Service Internetworking Network Layer of the Internet.

Routing So how does the network layer do its business?

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 22 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.

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”

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.

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.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Medium Access Control Sublayer Chapter.

The Network Layer Chapter 5.

Introduction Chapter 1 Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.

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.

Network Layer introduction 4.2 virtual circuit and datagram networks 4.3 what’s inside a router 4.4 IP: Internet Protocol  datagram format  IPv4.

The Network Layer Week 5. Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless.

CS 381 Final Exam Study Guide Final Exam Date: Tuesday, May 12 th Time: 10:30am -12:30pm Room: SB 105 Exam aid: 8 ½ x 11 page of notes front and back.

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

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.

Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.

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.

Networking and internetworking devices. Repeater.

THE NETWORK LAYER.

Network Layer Chapter 5 Design Issues Routing Algorithms

The Network Layer Chapter 5 1/4/2016www.ishuchita.com1.

Introduction Chapter

4: Network Layer4-1 Chapter 4: Network Layer Last time: r Internet routing protocols m RIP m OSPF m IGRP m BGP r Router architectures r IPv6 Today: r IPv6.

Transport Layer3-1 Network Layer Every man dies. Not every man really lives.

Chapter 5 The Network Layer.

Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.

18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.

Network Layer Chapter 5 CN5E by Tanenbaum & Wetherall, © Pearson Education-Prentice Hall and D. Wetherall, 2011 Design Issues Routing Algorithms Congestion.

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

7. Network Layer Design Issues Routing Algorithms −distance vector −link state routing Congestion Control Quality of Service Network Layer of the Internet.

Distributed Systems 8. Network Layer Theory Simon Razniewski Faculty of Computer Science Free University of Bozen-Bolzano A.Y. 2015/2016.

CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.

The Network Layer Design Issues & Routing Algorithms Chapter 5.

COMPUTER NETWORKS CS610 Lecture-17 Hammad Khalid Khan.

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: 

The Network Layer UNIT-4 snistforum.com. Network Layer Design Issues Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation.

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

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 Routing Networks: Routing.

Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)

Chapter 5 The Network Layer.

THE NETWORK LAYER.

Chapter 5 The Network Layer.

18-WAN Technologies and Dynamic routing

Tanenbaum Chapter 5 Network

The Network Layer Network Layer Design Issues:

Communication Networks NETW 501

Network Layer Routing Networks: Routing.

Chapter 22. Network Layer: Routing

Introduction Chapter 1 Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.

COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.

Computer network technology

CS 381: Introduction to Computer Networks

Chapter 5 The Network Layer.

Presentation transcript:

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

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.