IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing

Size: px
Start display at page:

Download "IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing"

Transcription

1 IP orwarding - omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSP (Open Shortest Path irst) The Story So ar IP addresses are structure to reflect Internet structure IP packet headers carry these addresses When Packet rrives at Router xamine header to determine intended destination Look up in table to determine next hop in path Send packet out appropriate port This/next lecture How to generate the forwarding table Router 9/8/ Lecture : Intra-omain Routing Graph Model Routes from Represent each router as node irect link between routers represented by edge Symmetric links undirected graph dge cost c(x,y) denotes measure of difficulty of using link delay, $ cost, or congestion level Task etermine least cost path from every node to every other node Path cost d(x,y) = sum of link costs 9/8/ Lecture : Intra-omain Routing orwarding Table for est ost Next Properties Some set of shortest paths forms tree Shortest path spanning tree Solution not unique.g., ---- also has cost 9/8/ Lecture : Intra-omain Routing

2 Ways to ompute Shortest Paths entralized ollect graph structure in one place Use standard graph algorithm isseminate routing tables Link-state very node collects complete graph structure ach computes shortest paths from it ach generates own routing table istance-vector No one has copy of graph s construct their own tables iteratively ach sends information about its table to neighbors Outline istance Vector Link State Routing Hierarchy 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing istance-vector Method istance-vector Update Initial Table for est ost Next Idea t any time, have cost/next hop of best known path to destination Use cost when no path known Initially Only have entries for directly connected nodes 9/8/ Lecture : Intra-omain Routing c(x,z) x z d(z,y) d(x,y) Update(x,y,z) d c(x,z) + d(z,y) # ost of path from x to y with first hop z if d < d(x,y) # ound better path return d,z # Updated cost / next hop else return d(x,y), nexthop(x,y) # xisting cost / next hop 9/8/ Lecture : Intra-omain Routing 8 y

3 9/8/ Lecture : Intra-omain Routing 9 lgorithm ellman-ord algorithm Repeat or every node x or every neighbor z or every destination y d(x,y) Update(x,y,z) Until converge 9/8/ Lecture : Intra-omain Routing Start Table for st st Table for st st Table for st st Table for st st Table for st st Table for st st Optimum -hop paths 9/8/ Lecture : Intra-omain Routing Iteration # Table for st st Table for st st Table for st st Table for st st Table for st st Table for st st Optimum -hop paths 9/8/ Lecture : Intra-omain Routing Iteration # Table for st st Table for st st Table for st st Table for st st Table for st st Table for st st Optimum -hop paths

4 istance Vector: Link ost hanges istance Vector: Link ost hanges Link cost changes: detects local link cost change Updates distance table If cost change in least cost path, notify neighbors X Y Z Link cost changes: Good news travels fast ad news travels slow - count to infinity problem! X Y Z good news travels fast algorithm terminates algorithm continues on! 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing istance Vector: Split Horizon istance Vector: Poison Reverse If Z routes through Y to get to X : Z does not advertise its route to X back to Y??? X Y Z algorithm terminates If Z routes through Y to get to X : Z tells Y its (Z s) distance to X is infinite (so Y won t route to X via Z) liminates some possible timeouts with split horizon Will this completely solve count to infinity problem? X Y Z algorithm terminates 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing

5 Poison Reverse ailures Routing Information Protocol (RIP) Table for st st Table for st st Table for st st Table for st st 8 orced Update etter Route Table for st Table for st 9 orced Update Table for st st Table for st st orced Iterations don t converge Update st st ount to infinity Table for orced Solution st st Update Make infinity smaller Table for What is upper bound on st st orced maximum path length? Update 9 9/8/ Lecture : Intra-omain Routing arliest IP routing protocol (98 S) urrent standard is version (R ) eatures very link has cost Infinity = Limits to networks where everything reachable within hops Sending Updates very router listens for updates on UP port RIP message can contain entries for up to table entries 9/8/ Lecture : Intra-omain Routing 8 RIP Updates Initial When router first starts, asks for copy of table for every neighbor Uses it to iteratively generate own table Periodic very seconds, router sends copy of its table to each neighbor Neighbors use to iteratively update their tables Triggered When every entry changes, send copy of entry to neighbors xcept for one causing update (split horizon rule) Neighbors use to update their tables RIP Staleness / Oscillation ontrol Small Infinity ount to infinity doesn t take very long Route Timer very route has timeout limit of 8 seconds Reached when haven t received update from next hop for periods If not updated, set to infinity Soft-state refresh important concept!!! ehavior When router or link fails, can take minutes to stabilize 9/8/ Lecture : Intra-omain Routing 9 9/8/ Lecture : Intra-omain Routing

6 Outline istance Vector Link State Routing Hierarchy Link State Protocol oncept very node gets complete copy of graph very node floods network with data about its outgoing links very node computes routes to every other node Using single-source, shortest-path algorithm Process performed whenever needed When connections die / reappear 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing Sending Link States by looding ijkstra s lgorithm X Wants to Send Information Sends on all outgoing links When Y Receives Information from Z Send on all links other than Z X (a) X (c) X (b) X (d) Given Graph with source node s and edge costs c(u,v) etermine least cost path from s to every node v Shortest Path irst lgorithm Traverse graph in order of least cost from source 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing

7 ijkstra s lgorithm: oncept ijkstra s lgorithm: Initially Horizon Sets one lready have least cost path to it Horizon: Reachable in hop from node in one Unseen: annot reach directly from node in one one Label d(v) = path cost rom s to v Path Keep track of last link in path 9/8/ Lecture : Intra-omain Routing Unseen urrent Path osts No nodes done in horizon one Horizon 9/8/ Lecture : Intra-omain Routing Unseen urrent Path osts ijkstra s lgorithm: Initially ijkstra s lgorithm one Horizon urrent Path osts Unseen one Horizon urrent Path osts Unseen d(v) to node shown in red Only consider links from done nodes 9/8/ Lecture : Intra-omain Routing Select node v in horizon with minimum d(v) dd link used to add node to shortest path tree Update d(v) information 9/8/ Lecture : Intra-omain Routing 8

8 ijkstra s lgorithm ijkstra s lgorithm one Horizon urrent Path osts Unseen one Unseen urrent Path osts Horizon Repeat Update d(v) values an cause addition of new nodes to horizon 9/8/ Lecture : Intra-omain Routing 9 9/8/ Lecture : Intra-omain Routing ijkstra s lgorithm Link State haracteristics inal tree shown in green With consistent LSs*, all nodes compute consistent loop-free paths an still have transient loops *Link State ata ase X Packet from may loop around if knows about failure and & do not 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing 8

9 OSP Routing Protocol Open Open standard created by IT Shortest-path first nother name for ijkstra s algorithm More prevalent than RIP OSP Reliable looding Transmit link state advertisements Originating router Typically, minimum IP address for router Link I I of router at other end of link Metric ost of link Link-state age Incremented each second Packet expires when reaches Sequence number Incremented each time sending new link information 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing OSP looding Operation X Receives LS from Y With Sequence Number q Looks for entry with same origin/link I ases No entry present dd entry, propagate to all neighbors other than Y ntry present with sequence number p < q Update entry, propagate to all neighbors other than Y ntry present with sequence number p > q Send entry back to Y To tell Y that it has out-of-date information ntry present with sequence number p = q Ignore it 9/8/ Lecture : Intra-omain Routing looding Issues When should it be performed Periodically When status of link changes etected by connected node What happens when router goes down & back up Sequence number reset to Other routers may have entries with higher sequence numbers Router will send out LSs with number Will get back LSs with last valid sequence number p Router sets sequence number to p+ & resends 9/8/ Lecture : Intra-omain Routing 9

10 doption of OSP RIP viewed as outmoded Good when networks small and routers had limited memory & computational power OSP dvantages ast convergence when configuration changes 9/8/ Lecture : Intra-omain Routing omparison of LS and V lgorithms Message complexity LS: with n nodes, links, O(n) messages V: exchange between neighbors only Speed of onvergence LS: omplex computation ut can forward before computation may have oscillations V: convergence time varies may be routing loops count-to-infinity problem (faster with triggered updates) Space requirements: LS maintains entire topology V maintains only neighbor state 9/8/ Lecture : Intra-omain Routing 8 omparison of LS and V lgorithms Robustness: what happens if router malfunctions? LS: node can advertise incorrect link cost each node computes only its own table V: V node can advertise incorrect path cost each node s table used by others errors propagate thru network Other tradeoffs Making LSP flood reliable Outline istance Vector Link State Routing Hierarchy 9/8/ Lecture : Intra-omain Routing 9 9/8/ Lecture : Intra-omain Routing

11 Routing Hierarchies lat routing doesn t scale Storage ach node cannot be expected to store routes to every destination (or destination network) onvergence times increase ommunication Total message count increases Key observation Need less information with increasing distance to destination Need lower diameters networks Solution: area hierarchy reas ivide network into areas reas can have nested sub-areas Hierarchically address nodes in a network Sequentially number top-level areas Sub-areas of area are labeled relative to that area s are numbered relative to the smallest containing area 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing Routing Hierarchy rea Hierarchy ddressing rea-order Router ackbone reas Lower-level reas Partition Network into reas Within area ach node has routes to every other node Outside area ach node has routes for other top-level areas only Inter-area packets are routed to nearest appropriate border router onstraint: no path between two sub-areas of an area can exit that area.... 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing

12 Path Sub-optimality Next Lecture: GP an result in sub-optimal paths.... start end.... How to connect together different ISPs.. hop red path vs. hop green path.. 9/8/ Lecture : Intra-omain Routing 9/8/ Lecture : Intra-omain Routing RIP Table Processing XTR SLIS RIP routing tables managed by application-level process called route-d (daemon) advertisements sent in UP packets, periodically repeated The rest of the slides are YI 9/8/ Lecture : Intra-omain Routing 8

13 ijsktra s lgorithm ijkstra s algorithm: example Initialization: N = {} for all nodes v if v adjacent to then (v) = c(,v) else (v) = infinity 8 Loop 9 find w not in N such that (w) is a minimum add w to N update (v) for all v adjacent to w and not in N: (v) = min( (v), (w) + c(w,v) ) /* new cost to v is either old cost to v or known shortest path cost to w plus cost from w to v */ until all nodes in N Step start N (),p(),,, (),p(),,,, (),p(), (),p() infinity, (),p() infinity infinity,,, 9/8/ Lecture : Intra-omain Routing 9 9/8/ Lecture : Intra-omain Routing

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing IP Forwarding 5-44 omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) The Story So Far IP addresses are structured to reflect Internet

More information

Third Generation Routers

Third Generation Routers IP orwarding 5-5- omputer Networking 5- Lecture : Routing Peter Steenkiste all www.cs.cmu.edu/~prs/5-- The Story So ar IP addresses are structured to reflect Internet structure IP packet headers carry

More information

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP

More information

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats What is Routing? Routing implements the core function of a network: : Shortest Path Routing Ion Stoica Ts: Junda Liu, K Moon, avid Zats http://inst.eecs.berkeley.edu/~ee/fa9 (Materials with thanks to Vern

More information

2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept

2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept //8 Outline - omputer Networking Lecture Routing Link tate OP Peter teenkiste epartments of omputer cience and Electrical and omputer Engineering IP Multicast ervice asics - Networking, pring 8 http://www.cs.cmu.edu/~dga/-/8

More information

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues Review: Routing in Packet Networks Shortest Path lgorithms: ijkstra s & ellman-ford Routing: Issues How are routing tables determined? Who determines table entries? What info used in determining table

More information

CS 43: Computer Networks. 23: Routing Algorithms November 14, 2018

CS 43: Computer Networks. 23: Routing Algorithms November 14, 2018 S 3: omputer Networks 3: Routing lgorithms November, 08 Last class NT: Network ddress Translators: NT is mostly bad, but in some cases, it s a necessary evil. IPv6: Simpler, faster, better Tunneling: IPv6

More information

EE 122: Intra-domain routing

EE 122: Intra-domain routing EE : Intra-domain routing Ion Stoica September 0, 00 (* this presentation is based on the on-line slides of J. Kurose & K. Rose) Internet Routing Internet organized as a two level hierarchy First level

More information

COMP 3331/9331: Computer Networks and Applications

COMP 3331/9331: Computer Networks and Applications OMP /9: omputer Networks and pplications Week 9 Network Layer: Routing Reading Guide: hapter 4: Sections 4.5 Network Layer nnouncements v Labs Lab 4 ongestion ontrol Lab 5 Simple Router (start up for ssignment,

More information

Let s focus on clarifying questions. More Routing. Logic Refresher. Warning. Short Summary of Course. 10 Years from Now.

Let s focus on clarifying questions. More Routing. Logic Refresher. Warning. Short Summary of Course. 10 Years from Now. Let s focus on clarifying questions I love the degree of interaction in this year s class More Routing all Scott Shenker http://inst.eecs.berkeley.edu/~ee/ Materials with thanks to Jennifer Rexford, Ion

More information

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra)

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra) ontents ÉOL POLYTHNIQU ÉÉRL LUSNN! 1. Link state flooding topology information finding the shortest paths (ijkstra)! 2. Hierarchical routing with areas! 3. OSP Link State Routing database modelling neighbor

More information

COMP/ELEC 429/556 Introduction to Computer Networks

COMP/ELEC 429/556 Introduction to Computer Networks OMP/ELE 49/6 Introduction to omputer Networks Intra-domain routing Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu

More information

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives Routers & Routing -44: omputer Networking High-speed router architecture Intro to routing protocols ssigned reading [McK9] Fast Switched ackplane for a Gigabit Switched Router Know RIP/OSPF L-4 Intra-omain

More information

ECE 158A: Lecture 5. Fall 2015

ECE 158A: Lecture 5. Fall 2015 8: Lecture Fall 0 Routing ()! Location-ased ddressing Recall from Lecture that routers maintain routing tables to forward packets based on their IP addresses To allow scalability, IP addresses are assigned

More information

Distance-Vector Routing: Distributed B-F (cont.)

Distance-Vector Routing: Distributed B-F (cont.) istance-vector Routing: istributed - (cont.) xample [ istributed ellman-ord lgorithm ] ssume each node i maintains an entry (R(i,x), L(i,x)), where R(i,x) is the next node along the current shortest path

More information

Initialization: Loop until all nodes in N

Initialization: Loop until all nodes in N Routing Routing lgorithm classification Routing protocol Goal: determine good path (sequence of routers) thru netork from source to dest. Graph abstraction for routing s: graph nodes are routers graph

More information

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016 9/9/6 S 7 Networking and the Internet Fall 06 Shortest-Path Problem Given: network topology with link costs c(x,y): link cost from node x to node y Infinity if x and y are not direct neighbors ompute:

More information

Routing. 9: Intro to Routing Algorithms. Routing. Roadmap. Routing Algorithm classification: Static or Dynamic?

Routing. 9: Intro to Routing Algorithms. Routing. Roadmap. Routing Algorithm classification: Static or Dynamic? Routing 9: Intro to Routing lgorithms Last Modified: // :: PM : Netork Layer a- IP Routing each router is supposed to send each IP datagram one step closer to its Ho do they do that? Static Routing Hierarchical

More information

CSE/EE 461 Distance Vector Routing

CSE/EE 461 Distance Vector Routing S/ 46 istance Vector Routing Last Time Introduction to the Network layer Internetworks atagram and virtual circuit services Internet Protocol (IP) packet format The Network layer Provides end-to-end data

More information

Routing Algorithm Classification. A Link-State Routing Algorithm

Routing Algorithm Classification. A Link-State Routing Algorithm Routing Algorithm lassification Global or decentralied information? Global: All routers have complete topolog, link cost info Link state algorithms Decentralied: Router knows phsicallconnected neighbors,

More information

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to.

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to. Netork Layer (part ) y the end of this lecture, you should be able to. xplain the operation of distance vector routing algorithm xplain shortest path routing algorithm escribe the major points of RIP and

More information

Network Layer (Routing)

Network Layer (Routing) Network Layer (Routing) Topics Network service models Datagrams (packets), virtual circuits IP (Internet Protocol) Internetworking orwarding (Longest Matching Prefix) Helpers: ARP and DHP ragmentation

More information

CSCE 463/612 Networks and Distributed Processing Spring 2018

CSCE 463/612 Networks and Distributed Processing Spring 2018 CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter

More information

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni 3/4/04 EN44 Network Protocols and lgorithms hapter Routing lgorithms Dr. Ridha Ouni Department of omputer Engineering ollege of omputer and Information Sciences King Saud University References Some slides

More information

WAN Technology and Routing

WAN Technology and Routing PS 60 - Network Programming WN Technology and Routing Michele Weigle epartment of omputer Science lemson University mweigle@cs.clemson.edu March, 00 http://www.cs.clemson.edu/~mweigle/courses/cpsc60 WN

More information

Chapter 4: Network Layer, partb

Chapter 4: Network Layer, partb Chapter 4: Network Layer, partb The slides are adaptations of the slides available by the main textbook authors, Kurose&Ross Network Layer 4-1 Interplay between routing, forwarding routing algorithm local

More information

06/02/ Local & Metropolitan Area Networks. Overview. Routing algorithm ACOE322. Lecture 6 Routing

06/02/ Local & Metropolitan Area Networks. Overview. Routing algorithm ACOE322. Lecture 6 Routing Local & Metropolitan rea Networks OE3 Lecture 6 Routing r. L. hristofi Overview The main function of the network layer is routing packets from the source to the destination machine. The only exception

More information

CSC 4900 Computer Networks: Routing Algorithms

CSC 4900 Computer Networks: Routing Algorithms CSC 4900 Computer Networks: Routing Algorithms Professor Henry Carter Fall 2017 Last Time Subnets provide granularity for address assignment and ease management. What is 192.168.8.0? 192.168.32.0? 192.168.8.0:

More information

Distance vector and RIP

Distance vector and RIP DD2490 p4 2008 Distance vector and RIP Olof Hagsand KTHNOC/NADA Literature RIP lab RFC 245: RIPv2. Sections 1 2 contains some introduction that can be useful to understand the context in which RIP is specified..1.4

More information

CS118 Discussion Week 7. Taqi

CS118 Discussion Week 7. Taqi CS118 Discussion Week 7 Taqi Outline Hints for project 2 Lecture review: routing About Course Project 2 Please implement byte-stream reliable data transfer Cwnd is in unit of bytes, not packets How to

More information

Routing Algorithms : Fundamentals of Computer Networks Bill Nace

Routing Algorithms : Fundamentals of Computer Networks Bill Nace Routing Algorithms 4-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Recall from Last Time Routing Algorithm

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Chapter 4: Network Laer 4. Introduction 4. Virtual circuit and datagram networks 4. What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4. Routing algorithms Link

More information

Communication Networks

Communication Networks ommunication Networks Prof. Laurent Vanbever ommunication Networks Spring 08 Roland Meier / Thomas Holterbach Slides: Laurent Vanbever nsg.ee.ethz.ch TH ürich (-ITT) pril 9 08 Materials inspired from Scott

More information

Important Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)

Important Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP) Important Lessons From Last Lecture 15-441 Computer Networking Inter-Domain outing BGP (Border Gateway Protocol) Every router needs to be able to forward towards any destination Forwarding table must be

More information

Routing in a network

Routing in a network Routing in a network Focus is small to medium size networks, not yet the Internet Overview Then Distance vector algorithm (RIP) Link state algorithm (OSPF) Talk about routing more generally E.g., cost

More information

More on Network Routing and Internet Protocol

More on Network Routing and Internet Protocol omputer Networks //03 More on Network Routing and Internet Protocol Kai Shen Network Routing Link state routing: ijkstra s algorithm efficient approach to calculate least cost routes all routers need complete

More information

DATA COMMUNICATOIN NETWORKING

DATA COMMUNICATOIN NETWORKING DATA COMMUNICATOIN NETWORKING Instructor: Ouldooz Baghban Karimi Course Book & Slides: Computer Networking, A Top-Down Approach By: Kurose, Ross Introduction Course Overview Basics of Computer Networks

More information

CSCD 330 Network Programming Spring 2018

CSCD 330 Network Programming Spring 2018 CSCD 330 Network Programming Spring 018 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 017 1 Network

More information

CSCD 330 Network Programming Spring 2017

CSCD 330 Network Programming Spring 2017 CSCD 330 Network Programming Spring 017 Lecture 16 Network Layer Routing Protocols Reading: Chapter 4 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright 1996-007

More information

Internet rou)ng. V. Arun CS491G: Computer Networking Lab University of MassachuseFs Amherst

Internet rou)ng. V. Arun CS491G: Computer Networking Lab University of MassachuseFs Amherst Internet rou)ng V. Arun CS491G: Computer Networking Lab University of MassachuseFs Amherst Slide material copyright 1996-2013 J.F Kurose and K.W. Ross, All Rights Reserved Graph abstraction 5 graph: G

More information

Announcement. Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online

Announcement. Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online Announcement Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online Outline Introduction and Network Service Models Routing Principles Link

More information

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost

More information

CS4450. Computer Networks: Architecture and Protocols. Lecture 11 Rou+ng: Deep Dive. Spring 2018 Rachit Agarwal

CS4450. Computer Networks: Architecture and Protocols. Lecture 11 Rou+ng: Deep Dive. Spring 2018 Rachit Agarwal CS4450 Computer Networks: Architecture and Protocols Lecture 11 Rou+ng: Deep Dive Spring 2018 Rachit Agarwal 2 Goals for Today s Lecture Learning about Routing Protocols Link State (Global view) Distance

More information

Network Layer: Routing

Network Layer: Routing Network Layer: Routing The Problem A B R 1 R 2 R 4 R 3 Goal: for each destination, compute next hop 1 Lecture 9 2 Basic Assumptions Trivial solution: Flooding Dynamic environment: links and routers unreliable:

More information

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS 9/6/16 COMP 631: NETWORKED & DISTRIBUTED SYSTEMS. Internet Routing. Jasleen Kaur.

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS 9/6/16 COMP 631: NETWORKED & DISTRIBUTED SYSTEMS. Internet Routing. Jasleen Kaur. OMP 3: NETWORKE & ISTRIUTE SSTEMS // OMP 3: NETWORKE & ISTRIUTE SSTEMS Internet Routing Jasleen Kaur Fall 0 Forwarding vs. Routing: Local vs. istributed oth datagram and virtual-circuit based networks

More information

Chapter 5 Network Layer: The Control Plane

Chapter 5 Network Layer: The Control Plane Chapter 5 Network Layer: The Control Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you

More information

4/25/12. The Problem: Distributed Methods for Finding Paths in Networks Spring 2012 Lecture #20. Forwarding. Shortest Path Routing

4/25/12. The Problem: Distributed Methods for Finding Paths in Networks Spring 2012 Lecture #20. Forwarding. Shortest Path Routing //1 The Problem: istributed Methods for Finding Paths in Networks L 1.0 Spring 01 Lecture #0 addressing, forwarding, routing liveness, advertisements, integration distance-vector routing link-state routing

More information

CSC 401 Data and Computer Communications Networks

CSC 401 Data and Computer Communications Networks CSC 40 Data and Computer Communications Networks Network Layer NAT, Routing, Link State, Distance Vector Prof. Lina Battestilli Fall 07 Chapter 4 Outline Network Layer: Data Plane 4. Overview of Network

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Chapter 4: Network Layer Chapter goals: understand principles behind layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, mobility instantiation and implementation

More information

Routing Outline. EECS 122, Lecture 15

Routing Outline. EECS 122, Lecture 15 Fall & Walrand Lecture 5 Outline EECS, Lecture 5 Kevin Fall kfall@cs.berkeley.edu Jean Walrand wlr@eecs.berkeley.edu Definition/Key Questions Distance Vector Link State Comparison Variations EECS - Fall

More information

CS118 Discussion 1A, Week 7. Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m.

CS118 Discussion 1A, Week 7. Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m. CS118 Discussion 1A, Week 7 Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m. 1 Outline Network control plane Routing Link state routing (OSPF) Distance vector routing (RIP) BGP ICMP Midterm/Project 2

More information

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan Internet Protocol: Routing Algorithms Srinidhi Varadarajan Routing Routing protocol Goal: determine good path (sequence of routers) thru network from source to dest. Graph abstraction for routing algorithms:

More information

Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli

Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli Dipartimento di Informatica Rome University La Sapienza G205: Fundamentals of Computer Engineering

More information

Chapter 4: Network Layer

Chapter 4: Network Layer hapter 4: Network Layer hapter goals: understand principles behind layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, multicast instantiation and implementation

More information

Chapter 4 Network Layer. Network Layer 4-1

Chapter 4 Network Layer. Network Layer 4-1 Chapter 4 Network Layer Network Layer 4- Chapter 4: Network Layer 4. Introduction 4. Virtual circuit and datagram networks 4. What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing

More information

Intra-domain Routing

Intra-domain Routing Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm CS 640 1 Goal Build router forwarding tables in an internetwork using intra-domain routing protocols High level approach Distributed

More information

Discussion 8: Link State Routing. CSE 123: Computer Networks Marti Motoyama & Chris Kanich

Discussion 8: Link State Routing. CSE 123: Computer Networks Marti Motoyama & Chris Kanich iscussion 8: Link State Routing S : omputer Networks Marti Motoyama & hris Kanich Schedule Project Questions: mail hris, post to moodle, or attend his OH Homework Questions? Link State iscussion S iscussion

More information

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics. EECS 122, Lecture 16 Kevin Fall kfall@cs.berkeley.edu edu Link Costs and Metrics Routing protocols compute shortest/cheapest paths using some optimization criteria Choice of criteria has strong effect

More information

CS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791

CS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791 CS 457 Networking and the Internet Fall 2016 Indrajit Ray What is Routing A famous quotation from RFC 791 A name indicates what we seek An address indicates where it is A route indicates how we get there

More information

Link-State Routing OSPF

Link-State Routing OSPF CE Computer Networks Link-State Routing OSPF Behnam Momeni Computer Engineering Department Sharif University of Technology Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer

More information

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms Announcements CS 6 Network Architecture and Protocols Lecture 8 Godmar Back Project A due Apr 8 (toda) Project B due in parts: Apr 9 and Ma 6 See link to NY Times article on RFC Project B Project B Highlevel

More information

Chapter 4 Network Layer

Chapter 4 Network Layer Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations; and

More information

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C

More information

Network Layer: Routing

Network Layer: Routing Network Laer: Routing Instructor: Anirban Mahanti Office: ICT 74 Email: mahanti@cpsc.ucalgar.ca Class Location: ICT Lectures: MWF :00 :0 hours Notes derived Computer Networking: A Top Down Approach Featuring

More information

TCP/IP Networking. Part 3: Forwarding and Routing

TCP/IP Networking. Part 3: Forwarding and Routing TP/IP Networking Part 3: Forwarding and Routing Routing of IP Packets There are two parts to routing IP packets:. How to pass a packet from an input interface to the output interface of a router ( IP forwarding

More information

Where we are in the Course

Where we are in the Course Where we are in the ourse More fun in the Network Layer! We ve covered packet forwarding Now we ll learn about roung Applicaon Transport Network Link Physical SE 61 University of Washington 1 Roung versus

More information

Overview 4.2: Routing

Overview 4.2: Routing Overview 4.2: Routing Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph A 6 1

More information

The Problem: Finding Paths Spring 2011 Lecture #19. Forwarding. Shortest Path Routing

The Problem: Finding Paths Spring 2011 Lecture #19. Forwarding. Shortest Path Routing The Problem: Finding Paths 1 6.02 Spring 20 Lecture # addressing, forwarding, routing liveness, advertisements, integration distance-vector routing routing loops, counting to infinity 6.02 Spring 20 Lecture,

More information

Redes de Computadores. Shortest Paths in Networks

Redes de Computadores. Shortest Paths in Networks Redes de Computadores Shortest Paths in Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto » What is a graph?» What is a spanning tree?» What is a shortest path tree?» How are

More information

Interplay between routing, forwarding

Interplay between routing, forwarding Chapter 4: outline 4. introduction 4. virtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link state

More information

C13b: Routing Problem and Algorithms

C13b: Routing Problem and Algorithms CISC 7332X T6 C13b: Routing Problem and Algorithms Hui Chen Department of Computer & Information Science CUNY Brooklyn College 11/20/2018 CUNY Brooklyn College 1 Acknowledgements Some pictures used in

More information

Routing. Effect of Routing in Flow Control. Relevant Graph Terms. Effect of Routing Path on Flow Control. Effect of Routing Path on Flow Control

Routing. Effect of Routing in Flow Control. Relevant Graph Terms. Effect of Routing Path on Flow Control. Effect of Routing Path on Flow Control Routing Third Topic of the course Read chapter of the text Read chapter of the reference Main functions of routing system Selection of routes between the origin/source-destination pairs nsure that the

More information

AODV Route Requests (RREQ) are forwarded in a manner similar to DSR

AODV Route Requests (RREQ) are forwarded in a manner similar to DSR d oc On-emand istance Vector (OV) R includes source routes in packet headers Resulting large headers can sometimes degrade performance particularly when data contents of a packet are small OV attempts

More information

Distance Vector: Link Cost Changes. Interdomain Routing. Distance Vector: Count to Infinity Problem. Distance Vector: Poisoned Reverse

Distance Vector: Link Cost Changes. Interdomain Routing. Distance Vector: Count to Infinity Problem. Distance Vector: Poisoned Reverse istance Vector: Link ost hanges 7 loop: Interdomain Routing 8 wait (until sees a link cost change to neighbor V 9 or until receives update from neighbor V) 0 if ((, V) changes by d) for alldestinations

More information

DSDV: Proactive. Distance Vector (Basic idea) Distance Vector. Distance Vector Algorithm: Tables 12/13/2016

DSDV: Proactive. Distance Vector (Basic idea) Distance Vector. Distance Vector Algorithm: Tables 12/13/2016 estination Sequenced istance Vector (SV) Routing [Perkins94] SV: Proactive SV is a proactive protocol means it maintains up-to-date routing information for all available nodes in the network. No extra

More information

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 14

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 14 CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 14 1 Two notes on routing algorithm Do not believe ou can understand an routing protocol, e.g.,

More information

Routing Unicast routing protocols

Routing Unicast routing protocols Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type

More information

Distance Vector Routing Protocols

Distance Vector Routing Protocols Distance Vector Routing Protocols Routing Protocols and Concepts Chapter 4 Version 4.0 1 Objectives Identify the characteristics of distance vector routing protocols. Describe the network discovery process

More information

Advanced Computer Networks

Advanced Computer Networks istance Vector dvanced omputer Networks Internal routing - distance vector protocols Prof. ndrzej uda duda@imag.fr ontents Principles of internal routing istance vector (ellman-ford) principles case of

More information

Lecture 12: Link-state Routing. Lecture 12 Overview. Router Tasks. CSE 123: Computer Networks Chris Kanich. Routing overview

Lecture 12: Link-state Routing. Lecture 12 Overview. Router Tasks. CSE 123: Computer Networks Chris Kanich. Routing overview Lecture : Link-state Routing CSE 3: Computer Networks Chris Kanich Lecture Overview Routing overview Intra vs. Inter-domain routing Link-state routing protocols CSE 3 Lecture : Link-state Routing Router

More information

CS 268: Lecture 9. Intra-domain Routing Protocols. Internet Routing. Example. Routing Problem. Routing

CS 268: Lecture 9. Intra-domain Routing Protocols. Internet Routing. Example. Routing Problem. Routing Internet Routing S 68: Lecture 9 Intradomain Routing Protocols Ion Stoica omputer Science ivision epartment of lectrical ngineering and omputer Sciences University of alifornia, erkeley erkeley, 96 Internet

More information

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers Table of Contents RIP Configuration 1 RIP Overview 1 Operation of RIP 1 Operation of RIP 2 RIP Version 2 RIP Message Format 3 Protocols and Standards 4 Configuring RIP Basic Functions 5 Configuration Prerequisites

More information

CSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes

CSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes CSE 46 Routing Routing Focus: How to find and set up paths through a network Distance-vector and link-state Shortest path routing Key properties of schemes Application Transport Network Link Physical Forwarding

More information

Lecture 4. The Network Layer (cont d)

Lecture 4. The Network Layer (cont d) Lecture 4 The Network Layer (cont d) Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest Path First Protocols

More information

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet Chapter 5: outline 5.1 introduction 5.5 The SDN control 5.2 routing protocols plane link state 5.6 ICMP: The Internet distance vector Control Message 5.3 intra-as routing in Protocol the Internet t 5.7

More information

SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP

SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 4.1.1 What are the three distance vector routing protocols? What are the key characteristics of RIP? What are the key characteristics of IGRP?

More information

Agenda. distance-vector (what you invented last Friday) hierarchical routing routing in the Internet. v DNS assignment Q&A v Routing Algorithms

Agenda. distance-vector (what you invented last Friday) hierarchical routing routing in the Internet. v DNS assignment Q&A v Routing Algorithms Agenda v DNS assignment Q&A v Routing Algorithms distance-vector (what ou invented last Frida) hierarchical routing routing in the Internet Network Laer 4- Chapter 4 Network Laer A note on the use of these

More information

Fairness Example: high priority for nearby stations Optimality Efficiency overhead

Fairness Example: high priority for nearby stations Optimality Efficiency overhead Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency

More information

Routing. 4. Mar INF-3190: Switching and Routing

Routing. 4. Mar INF-3190: Switching and Routing Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines

More information

Network layer. Network Layer 4-1. application transport network data link physical. network data link physical. network data link physical

Network layer. Network Layer 4-1. application transport network data link physical. network data link physical. network data link physical Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on receiving side, delivers segments to transport layer network layer protocols in every

More information

Lecture 9. Network Layer (cont d) Network Layer 1-1

Lecture 9. Network Layer (cont d) Network Layer 1-1 Lecture 9 Network Layer (cont d) Network Layer 1-1 Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest

More information

Graph abstraction: costs. Graph abstraction 10/26/2018. Interplay between routing and forwarding

Graph abstraction: costs. Graph abstraction 10/26/2018. Interplay between routing and forwarding 0/6/08 Interpla between routing and forwarding Routing Algorithms Link State Distance Vector BGP routing routing algorithm local forwarding table header value output link 000 00 0 00 value in arriving

More information

Network Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture

Network Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture Network Routing Packet Routing, Routing Algorithms, Routers, Router Architecture Routing Routing protocol Goal: determine good path (sequence of routers) thru network from source to dest. Graph abstraction

More information

CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella

CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol) Intra-domain routing The Story So Far Routing protocols generate the forwarding

More information

Routing Algorithms. CS158a Chris Pollett Apr 4, 2007.

Routing Algorithms. CS158a Chris Pollett Apr 4, 2007. Routing Algorithms CS158a Chris Pollett Apr 4, 2007. Outline Routing Algorithms Adaptive/non-adaptive algorithms The Optimality Principle Shortest Path Routing Flooding Distance Vector Routing Routing

More information

Routing. Jens A Andersson Communication Systems

Routing. Jens A Andersson Communication Systems Routing Jens A Andersson Communication Systems R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 R5 10 Router A router is a type of internetworking device that passes data

More information

COM-208: Computer Networks - Homework 6

COM-208: Computer Networks - Homework 6 COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each

More information

Distance Vector Routing

Distance Vector Routing ÉOL POLYTHNIQU FÉÉRL LUSNN istance Vector Routing Jean Yves Le oudec 20 ontents. Routing in General 2. istance vector: theory 3. istance vector: practice (RIP) 4. Software efined Networking (SN) Textbook

More information

Lecture 9. Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1

Lecture 9. Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1 Lecture 9 Reminder: Homework 3, Programming Project 2 due today. Questions? Thursday, September 22 CS 475 Networks - Lecture 9 1 Outline Chapter 3 - Internetworking 3.1 Switching and Bridging 3.2 Basic

More information

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing

More information