CSE123A discussion session 2007/03/08 Ryo Sugihara.

Slides:



Advertisements
Similar presentations
Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Advertisements

CSE 561 – Bridging and Routing David Wetherall Spring 2000.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Courtesy: Nick McKeown, Stanford
1 LINK STATE PROTOCOLS (contents) Disadvantages of the distance vector protocols Link state protocols Why is a link state protocol better?
Distance-Vector and Path-Vector Routing Sections , 4.3.2, COS 461: Computer Networks Spring 2011 Mike Freedman
Routing - I Important concepts: link state based routing, distance vector based routing.
Routing So how does the network layer do its business?
Network Layer CS176A Ramya Raghavendra. Routing table [Q1] Destination Address Range Link Interface Through
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 22 Introduction to Computer Networks.
RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.
Chapter 4 Distance Vector Problems, and Link-State Routing Professor Rick Han University of Colorado at Boulder
Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer The service should be independent of the router.
CSE 461: Distance Vector Routing. Next Topic  Focus  How do we calculate routes for packets?  Routing is a network layer function  Routing Algorithms.
1 Computer Networks Routing Algorithms. 2 IP Packet Delivery Two Processes are required to accomplish IP packet delivery: –Routing discovering and selecting.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
Routing Protocols and the IP Layer CS244A Review Session 2/01/08 Ben Nham Derived from slides by: Paul Tarjan Martin Casado Ari Greenberg.
Delivery, Forwarding and
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)
Routing and Routing Protocols Dynamic Routing Overview.
Link State Routing Protocols Last Update Copyright Kenneth M. Chipps Ph.D.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.
CS551: Unicast Routing Christos Papadopoulos (
Network Layer r Introduction r Datagram networks r IP: Internet Protocol m Datagram format m IPv4 addressing m ICMP r What’s inside a router r Routing.
1 Chapter 22 Network layer Delivery, Forwarding and Routing (part2)
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.
1 Week 5 Lecture 2 IP Layer. 2 Network layer functions transport packet from sending to receiving hosts transport packet from sending to receiving hosts.
The Network Layer.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
Networking and internetworking devices. Repeater.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Ch 22. Routing Direct and Indirect Delivery.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
CS440 Computer Networks 1 Link State Routing and OSPF Neil Tang 10/31/2008.
Spring Routing: Part I Section 4.2 Outline Algorithms Scalability.
Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.
Network Layer (2). Review Physical layer: move bits between physically connected stations Data link layer: move frames between physically connected stations.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
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.
Chapter 7 Packet-Switching Networks Shortest Path Routing.
IP tutorial - #2 Routing KAIST Dept. of CS NC Lab.
CS 5565 Network Architecture and Protocols
Centralized vs Distributed Routing
Routing: Link State Algorithm
16장. Networking and Internetworking Devices
Routing Protocols and Concepts
COMP 3270 Computer Networks
Link-State Routing Protocols
Network Layer Introduction Datagram networks IP: Internet Protocol
Intra-Domain Routing Jacob Strauss September 14, 2006.
Routing: Distance Vector Algorithm
Lecture 13 review Explain how distance vector algorithm works.
Routing in Packet Networks Shortest Path Routing
CS 3700 Networks and Distributed Systems
Link-State Routing Protocols
Intradomain Routing Outline Introduction to Routing
CS 640: Introduction to Computer Networks
CS4470 Computer Networking Protocols
CS 3700 Networks and Distributed Systems
Chapter 22. Network Layer: Routing
Link-State Routing Protocols
Communication Networks
Advanced Computer Networks
Network Layer (contd.) Routing
Routing: Link State Algorithm
Communication Networks
OSPF Protocol.
Presentation transcript:

CSE123A discussion session 2007/03/08 Ryo Sugihara

Topics Review –Network Layer (2,3): Route computation Distance vector Link state

Where are we now?

Route computation Router needs to know “which port to forward” –Done by “routing table” But how to make routing table? –By exchanging routing information –What kind of information? Router A B C D PrefixLink 001*A 0*B 01*C 11*C 110*D defaultB Routing table

Distance vector & Link state Two ways to exchange routing info –Distance vector Exchange “distance to a destination” Each router knows the next hop for each dest –One hop of the stortest path to the dest –Link state Exchange “my neighbors (and costs)” Each router knows whole network topology –compute the shortest paths by Dijkstra’s algorithm

Example R1 R2 R3 R4 R CSE ( /24) 1

General strategy R1 (somehow) knows CSE is distance one from itself R1 tells the neighbors (=R2, R3) about it –DV: “CSE is distance one from me” –LS: “I have link with CSE (d=1), R2 (d=5), and R3 (d=1)” R1 R2 R3 R4 R CSE 1

Distance vector R1 tells “CSE is distance one from me!” –to R2 and R3 R1 R2 R3 R4 R CSE “CSE = 1” 1

What happens at R2? p1 p2 p3 “CSE = 1” R2 Netdist... CSE6... Netdist... CSEinf... Netdist... CSEinf... Netdist... CSE6... iface... p1... Routing table Table for each interface One routing table

Distance vector Router forwards distance info to others when its routing table is updated R1 R2 R3 R4 R CSE “CSE = 6” “CSE = 2” “CSE = 6” 1

What happens at R2? p1 p2 p3 R2 Netdist... CSE6... Netdist... CSE4... Netdist... CSEinf... Netdist... CSE6... iface... p1... “CSE = 2” 4p2 Routing table

In case of link failure, Switch to backup route Problem: “Count-to-infinity problem” (next) p1 p2 p3 R2 Netdist... CSE6... Netdist... CSE4... Netdist... CSEinf... Netdist... CSE4... iface... p2... Routing table inf 6 p1

Count-to-infinity problem R CSE p1 p2 p3 p4 Netdist CSE2 Netdist CSE6 Netdist CSE2 iface p3 Routing table Netdist CSE3 Netdist CSE5 Netdist CSE3 iface p1 Routing table inf 5 p26 p4 “CSE = 5” 8 8 p4 “CSE = 8” p2 R2 R3 1

Link state R1 broadcasts “I have link with CSE (d=1), R2 (d=5), and R3 (d=1)” –It will be flooded to the entire network R1 R2 R3 R4 R CSE LSP R1 R2 R3 CSE LSP = 1

Link state Each router has the entire graph –In DV, it only knew next hop for each dest. Each router computes next hop for each dest. –By Dijkstra’s algorithm R1 R2 R3 R4 R CSE 1

Intelligent flooding Without “intelligence”, LSP may loop Solution: add “sequence number” to LSP –If a router received a “newer” LSP, it forwards –Otherwise, it discards Other issues: –Subtle problems: “source jumping”, “aging”  lecture notes –How Dijkstra’s algorithm works  R1 R2 R3 R4 R CSE LSP 1

BACKUP