Internet Technology. 08. Routing. Paul Krzyzanowski. Rutgers University. Spring CS Paul Krzyzanowski
|
|
- Lee Griffin
- 6 years ago
- Views:
Transcription
1 Internet Technolog 08. Routing Paul Kranoski Rutgers Universit Spring 06 March, 06 CS 0-06 Paul Kranoski
2 Routing algorithm goal st hop router = source router last hop router = destination router router router sitch LAN LAN Routing algorithm: given routers connected ith links, hat is a good (best?) path a source to a destination router good = least cost cost = time or mone March, 06 CS 0-06 Paul Kranoski
3 Routing graphs, neighbors, and cost v u Graph G = (N, E) N = set of nodes (routers) E = set of edges (links) Each edge = pair of connected nodes in N Node is a neighbor of node if (, ) E Cost Each edge has a value representing the cost of the link c(, ) = cost of edge beteen nodes & if (, ) E, then c(, ) = We ill assume c(, ) = c(, ) March, 06 CS 0-06 Paul Kranoski
4 Path cost, least-cost path, & shortest path v u A path in a graph G = (N, E) is a sequence of nodes (,,, p ) such that each of the pairs (, ), (, ),, ( p-, p ) are edges in E. The cost of a path is the sum of edge costs: c(, ), c(, ),, c( p-, p ) There could be multiple paths beteen to nodes, each ith a different cost. One or more of these is a least-cost path. Eample: the least-cost path beteen u and is (u,,, ) c(u,,, ) = If all edges have the same cost, then least-cost path = shortest path March, 06 CS 0-06 Paul Kranoski 4
5 Algorithm classifications Global routing algorithms Compute the least-cost path using complete knoledge of the netork The algorithm knos the connectivit beteen all nodes & costs Centralied algorithm These are link-state (LS) algorithms Decentralied routing algorithms No node has complete information about the costs of all links A node initiall knos onl its direct links Iterative process: calculate & echange info ith neighbors Eventuall calculate the least-cost path to a destination Distance-Vector (DV) algorithm March, 06 CS 0-06 Paul Kranoski
6 Additional algorithm classifications Static routing algorithms Routes change ver slol over time Dnamic routing algorithms Change routing paths as netork traffic loads or topolog change Load-sensitive algorithms Link costs var to reflect the current level of congestion Load-insensitive algorithms Ignore current or recent levels of congestion March, 06 CS 0-06 Paul Kranoski 6
7 Link-State (LS): Dijkstra s Algorithm Assumption: Entire netork topolog & link costs are knon Each node broadcasts link-state packets to all other nodes All nodes have an identical, complete vie of the netork Compute least-cost path one node to all other nodes in the netork Iterative algorithm After k iterations, least-cost paths are knon to k nodes March, 06 CS 0-06 Paul Kranoski 7
8 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path Initialie: N = current node N = { u } for all nodes v if v is a neighbor of u D(v) = c(u, v) else D(v) = u v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() 0 u,u,u,u March, 06 CS 0-06 Paul Kranoski 8
9 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path Loop until N = N: Find a node n not in N such that D(n) is a minimum Node has minimum D(n) add n to N N = {u, } for each neighbor m of n not in N : for each neighbor of node D(m) = min( D(m), D(n) + c(n, m) ) ne cost = old cost or cost through if D(m) changed, set p(m) = n u Skip: u N v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() Least cost path 0 u,u,u,u u,u 4,, Cost to v is not better through Cost to is better through Ignore ; it is in N We no have a path to March, 06 CS 0-06 Paul Kranoski 9
10 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path Loop until N = N: find n not in N such that D(n) is a minimum Nodes v & have minimum D(n) Pick an one: e choose add n to N N = {u,, } for each neighbor m of n not in N : for each neighbor of node D(m) = min( D(m), D(n) + c(n, m) ) ne cost = old cost or cost through if D(m) changed, set p(m) = n u v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() 0 u,u,u,u u,u 4,, u,u, 4, Cost to is even better through Least cost path Skip: and are in N We no have a path to March, 06 CS 0-06 Paul Kranoski 0
11 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path Loop until N = N: find n not in N such that D(n) is a minimum Node v has minimum D(n) add n to N N = {u,,, v} for each neighbor m of n not in N : for each neighbor of node v D(m) = min( D(m), D(n) + c(n,m) ) ne cost = old cost or cost through if D(m) changed, set p(m) = n u v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() 0 u,u,u,u u,u 4,, u,u, 4, uv, 4, No improvement (+) No change: is not a neighbor March, 06 CS 0-06 Paul Kranoski
12 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path Loop until N = N: find n not in N such that D(n) is a minimum Node has minimum D(n) add n to N N = {u,,, v, } for each neighbor m of n not in N : for each neighbor of node D(m) = min( D(m), D(n) + c(n,m) ) ne cost = old cost or cost through if D(m) changed, set p(m) = n u v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() 0 u,u,u,u u,u 4,, u,u, 4, uv, 4, 4 uv 4, No improvement (+) 4 March, 06 CS 0-06 Paul Kranoski
13 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path Loop until N = N: find n not in N such that D(n) is a minimum Node is the onl one left! u v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() 0 u,u,u,u add n to N N = {u,,, v,, } for each neighbor m of n not in N : There are no neighbors not in N! We re done u,u 4,, u,u, 4, uv, 4, 4 uv 4, uv March, 06 CS 0-06 Paul Kranoski
14 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path N = N: All nodes are in N u v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() () u is s predecessor For each node, e have the total cost the source and the predecessor along that path. We can look up the predecessor to find its predecessor E.g., least-cost path u is u 0 u,u,u,u u,u 4,, u,u, 4, uv, () is s 4, predecessor 4 uv 4, uv () is s predecessor March, 06 CS 0-06 Paul Kranoski 4
15 Dijkstra s Algorithm D(v): cost of least-cost path source to v p(v): previous node (neighbor of v) along the least-cost path to v N : subset of nodes for hich e found the least-cost path We can create a forarding table that stores the net hop on the least-cost route Forarding table for node u Destination v Link uv u u u u u v step N D(v), p(v) D(), p() D(),p() D(),p() D(),p() 0 u,u,u,u u,u 4,, u,u, 4, uv, 4, 4 uv 4, uv March, 06 CS 0-06 Paul Kranoski
16 Dijkstra s Algorithm Computational cost st iteration: search n nodes to find the minimum cost node nd iteration: search n- nodes rd iteration: search n- nodes n th iteration: search node n Total of n iterations = n + (n - ) + (n - ) + = i=0 (n i) We need to search n(n+)/ nodes Compleit = O(n ) March, 06 CS 0-06 Paul Kranoski 6
17 Oscillations ith congestion-based routing If link cost = load carried on the link Link costs are not smmetric c(u, v) = c(v, u) onl if the same load flos in both directions Eample loads Load of comes into for Load of comes into for Load of e comes into for When LS is run determines ( ) cost is compared to ( ) cost, hich is +e determines that is a loer-cost path +e 0 0 e 0 Initial routing e March, 06 CS 0-06 Paul Kranoski 7
18 Oscillations ith congestion-based routing After route updates, LS is run again,, and detect 0-cost path counterclockise +e 0 0 +e +e e e Clockise routing Counterclockise routing March, 06 CS 0-06 Paul Kranoski 8
19 Oscillations ith congestion-based routing After route updates, LS is run et again,, and no detect 0-cost path clockise 0 +e +e e 0 0 e e Counterclockise routing Clockise routing March, 06 CS 0-06 Paul Kranoski 9
20 Avoiding oscillations Ensure that not all routers run the LS algorithm at the same time Avoid snchronied routers b randomiing the time hen a router advertises its link state March, 06 CS 0-06 Paul Kranoski 0
21 Distance-Vector Routing Algorithm Initial assumption Each router (node) knos the reach its directl-connected neighbors Iterative, asnchronous, distributed algorithm Multiple iterations Each iteration caused b local link cost change or distance vector update message neighbor Asnchronous Does not require lockstep snchroniation Distributed Each node receives information one or more directl attached neighbors Notifies neighbors onl hen its distance-vector changes March, 06 CS 0-06 Paul Kranoski
22 Bellman-Ford Equation What it sas If is not directl connected to, it needs to first hop to some neighbor v The loest cost is (the cost of the first hop to v) + (the loest cost v to ) = c(, v) + d v () the least cost path to, d (), is the minimum of the loest cost of all of s neighbors d () = min v { c(, v) + d v () } The value of v that satisfies the equation is the forarding table entr in s router for destination v' d v () c(,v ) c(,v ) v d v () March, 06 CS 0-06 Paul Kranoski
23 Distance-Vector Routing Algorithm At each node e store: c(, v) = cost for the direct link to v for each neighbor v D () = estimate of the cost of the least-cost path to Distance Vector is the set of D () for all nodes in N D = [ D (): N ] Least-cost estimates to all other nodes Distance vectors received its neighbors D v = [ D v (): N ] Set of least-cost estimates each neighbor v to each node Each node v periodicall sends its distance vector, D v to its neighbors When a node receives a distance vector, it saves it and updates its on distance vector using the Bellman-Ford equation D () = min v { c(, v) + D v () } for each node N If this results in a change to s DV, it sends the ne DV to its neighbors Each cost estimate D () converges to the actual least-cost D () March, 06 CS 0-06 Paul Kranoski
24 Distance-Vector Eample Node DV table Node DV table Node DV table March, 06 CS 0-06 Paul Kranoski 4
25 Distance-Vector Eample Node DV table Node DV table Node DV table Node sends its DV {0,, 7} to nodes and Node DV table 0 7 Node DV table Node DV table c(, ) = c(, ) = 7 March, 06 CS 0-06 Paul Kranoski
26 Distance-Vector Eample Node DV table Node DV table Node DV table Node sends its DV {, 0, } to nodes and Node sends its DV {7,, 0} to nodes and Node DV table Node DV table Node DV table c(, ) = From : c(,) is c(, ) = c(, ) + c(,) = c(, ) = = + = Less than old value, 7 Ever update to a node s DV also updates the forarding table From : c(,) is c(, ) = c(,) + c(,) = = + = Less than old value, 7 March, 06 CS 0-06 Paul Kranoski 6
27 Distance-Vector Eample Node DV table Node DV table Node DV table Node DV table Node DV table Node DV table Node sends its DV {0,, 7} to nodes and Node s vector did not change it stas quiet Node sends its DV {, 0, } to nodes and We converged. Everone has the same vie of the netork. Nobod has updates to send. March, 06 CS 0-06 Paul Kranoski 7
28 Link cost changes The DV algorithm remains quiet once it converges until some link cost changes If a node detects link cost change beteen itself and a neighbor It updates its distance vector If there is a change in the cost of an least-cost path it informs its neighbors of the ne distance vector Each neighbor computes a ne least cost If the value changed its previous value, it sends its DV to its neighbors Recompute until values converge March, 06 CS 0-06 Paul Kranoski 8
29 Link loss Distance to C = Distance to C = A B C We created a Routing Loop Suppose e lose the link to C: c(b,c) = B ill send an update to A but A thinks its C is B ill think there is a route to C: B A C ith a cost of (c(b,a) + ) = 4 Distance to C = Distance to C =4 A B C Update (A,C)= Distance to C = Distance to C =4 A B C Update (B,C)=4 This continues ad infinitum! March, 06 CS 0-06 Paul Kranoski 9
30 Mitigation: Poison Reverse If A routes through B to get to C A ill advertise to B that its distance is infinit B ill then never attempt to route through A This does not ork ith loops involving or more nodes! Other approaches Limit sie of netork b setting a hop (cost) limit Send full path information in route advertisement Perform eplicit queries for loops March, 06 CS 0-06 Paul Kranoski 0
31 The end March, 06 CS 0-06 Paul Kranoski
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 informationInterplay 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 informationRouting 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 informationChapter 4: outline. 4.5 routing algorithms link state distance vector hierarchical routing. 4.6 routing in the Internet RIP OSPF BGP
Chapter 4: outline 4. introduction 4. irtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IP4 addressing ICMP IP6 4.5 routing algorithms link state
More informationCS 3516: Advanced Computer Networks
Welcome to CS 56: Adanced Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: Fuller 0 Fall 06 A-term Some slides are originall from the course materials of the tetbook Computer
More informationInitialization: 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 information4.5 Routing Algorithms
4.5 ROUTING ALGORITHMS 363 to hosts enjo the securit services provided b IPsec. On the sending side, the transport laer passes a segment to IPsec. IPsec then encrpts the segment, appends additional securit
More informationNetwork 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 informationChapter 4: Network Layer
Chapter 4: Introdction (forarding and roting) Reie of qeeing theor Roting algorithms Link state, Distance Vector Roter design and operation IP: Internet Protocol IP4 (datagram format, addressing, ICMP,
More informationCMPE 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 informationAnnouncements. 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 informationCS 3516: Advanced Computer Networks
Welcome to CS 56: Adanced Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: Fuller 0 Fall 07 A-term Some slides are originall the course materials of the tetbook Computer Networking:
More informationComputer Networks. Instructor: Niklas Carlsson
Computer Networks Instructor: Niklas Carlsson Email: niklas.carlsson@liu.se Notes derived Computer Networking: A Top Down Approach, b Jim Kurose and Keith Ross, Addison-Wesle. The slides are adapted and
More informationChapter IV: Network Layer
Chapter IV: Network Laer UG3 Computer Communications & Networks (COMN) Mungjin Lee mungjin.lee@ed.ac.uk Slides copright of Kurose and Ross IP addresses: how to get one? Q: How does a host get IP address?
More information4.5.2 The Distance-Vector (DV) Routing Algorithm
4.5 ROUTING ALGORITHMS 371 highl congested (for eample, high-dela) links. Another solution is to ensure that not all routers run the LS algorithm at the same time. This seems a more reasonable solution,
More informationInternet Technology 3/21/2016
Intrnt Tchnolog //6 Roting algorithm goal st hop rotr = sorc rotr last hop rotr = dstination rotr rotr Intrnt Tchnolog 8. Roting sitch rotr LAN Pal Kranoski Rtgrs Unirsit Spring 6 LAN Roting algorithm:
More informationComputer Networking. Rou1ng Algorithms. Rou1ng Algorithms. Interplay between rou1ng, forwarding. routing algorithm
Computer Networking Interpla between roung, forwarding routing algorithm local forwarding table header alue output link 000 00 0 00 alue in arriing packet s header 0 Graph abstracon Graph: G = (N,E) u
More informationRouting. 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 informationInterplay tra routing e forwarding
Interpla tra routing e forwarding routing algorithm local forwarding table header value output link 000 00 0 00 value in arriving packet s header 0 Network Laer 4- Grafi Grafo: G = (N,E) u v w N = insieme
More informationEthernet Basics Learning Switches. based on Chapter 4 of CompTIA Network+ Exam Guide, 4 th ed., Mike Meyers
Ethernet Basics Learning Sitches based on Chapter 4 of CompTIA Netork+ Eam Guide, 4 th ed., Mike Meers Sitch Forarding A sitch forards frames based on destination MAC address Ho does the sitch kno hich
More informationChapter 4: Network Layer: Part II
4: Network Laer Chapter 4: Network Laer: Part II (last revision 9/04/05. v3) 4. Introduction 4. Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format
More informationNetwork Layer: Control Plane 5-2
Network Laer: Control Plane EECS34 8-03-05 4- Chapter 5: network laer control plane chapter goals: understand principles behind network control plane traditional routing algorithms SDN controlllers Internet
More informationAgenda. 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 informationFlooding. Routing: Outlook. Flooding Algorithms. Spanning Tree. Flooding
Roting: Otlook Flooding Flooding Link-State: complete, global knoledge Distance-Vector: iteratie, distribted calclation Goal: To distribte a packet in the hole netork (i.e. to realie a netork-ide broadcast)
More informationDATA 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 information11/13/2017 Network Layer (SSL) Network-layer functions. Recall the two network-layer functions:
Chapter 5: outline 5. introduction 5.2 routing protocols link state distance vector 5.3 intra-as routing in the Internet 5.4 inter-as routing: BGP 5.5 The SDN control 5.6 ICMP: The Internet Control Message
More informationNetwork 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 informationInitial motivation: 32-bit address space soon to be completely allocated. Additional motivation:
IPv6 Initial motivation: 3-bit address space soon to be completel allocated. Additional motivation: Header format helps speed processing/forwarding Header changes to facilitate QoS (service classes) Reduction
More informationCS 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 informationCSC 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 informationChapter 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 informationIntra-AS Routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley.
Intra-AS Routing Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesle http://xkcd.com/85/ Some materials copright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved
More informationChapter 5: Network Layer Control Plane. understand principles behind network control plane : traditional routing algorithms
Introduction to Computer Networking Gu Leduc Chapter 5 Network Laer: The Control Plane Computer Networking: A Top Down Approach, 7 th edition. Jim Kurose, Keith Ross Addison-Wesle, April 06. From Computer
More informationNetwork layer. Two Key Network-Layer Functions. Datagram Forwarding table. IP datagram format. IP Addressing: introduction
Netork laer transport segment sending to receiing host on sending side encapslates segments into grams on rcing side, deliers segments to transport laer laer protocols in eer host, roter roter eamines
More informationCSCD 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 informationCSCD 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 informationNetwork 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 informationAnnouncement. 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 informationEE 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 informationGraph 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 informationRouting Algorithms. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Routing Algorithms Daniel Zappala CS 460 Computer Networking Brigham Young University Routing 2/20 How does the Internet determine which path to use from the source to the destination? Challenges need
More informationAssignments. Computer Networks LECTURE 7 Network Layer: Routing and Addressing. Network Layer Function. Internet Architecture
ompter Netorks LETURE Netork Laer: Roting and ddressing ssignments Project : Web Pro Serer DUE OT Sandha Darkadas Department of ompter Science Uniersit of Rochester Internet rchitectre Bottom-p: phsical:
More informationRouting Algorithms. 1 Administrivia. Tom Kelliher, CS 325. Apr. 25, Announcements. Assignment. Read 4.6. From Last Time. IP protocol.
Routing Algorithms Tom Kelliher, CS 325 Apr. 25, 2008 1 Administrivia Announcements Assignment Read 4.6. From Last Time IP protocol. Outline 1. Introduction. 2. Link state routing. 3. Distance vector routing.
More informationChapter 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 informationChapter 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 informationCSC 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 informationNetwork layer: Overview. Network layer functions Routing IP Forwarding
Network layer: Overview Network layer functions Routing IP Forwarding Network Layer Functions Transport packet from sending to receiving hosts Network layer protocols in every host, router application
More informationRouting 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 informationRedes 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 informationHow Routing Algorithms Work
How Routing Algorithms Work A router is used to manage network traffic and find the best route for sending packets. But have you ever thought about how routers do this? Routers need to have some information
More informationComputer Networks. Routing Algorithms
Computer Networks Routing Algorithms Topics Routing Algorithms Shortest Path (Dijkstra Algorithm) Distance Vector Routing Count to infinity problem Solutions for count to infinity problem Link State Routing
More informationCSCE 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 informationChapter 4: Network Layer. TDTS06 Computer networks. Chapter 4: Network Layer. Network layer. Two Key Network-Layer Functions
Chapter : Netork Laer TDTS06 Compter s Lectre : Netork laer II Roting algorithms Jose M. Peña, jospe@ida.li.se ID/DIT, LiU 009-09- Chapter goals: nderstand principles behind laer serices: laer serice models
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 13
CMPE 50/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 3 Lab3 online Due March 4 th. Introduction -2 IP addresses: how to get one? Q: how does network
More informationRouting Protocols and the IP Layer
Routing Protocols and the IP Layer CS244A Review Session 2/0/08 Ben Nham Derived from slides by: Paul Tarjan Martin Casado Ari Greenberg Functions of a router Forwarding Determine the correct egress port
More informationCMPE 80N: Introduction to Networking and the Internet. Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 20
CMPE 80N: Introduction to Networking and the Internet Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 0 Announcements Final exam: June 7 th at 4pm. Comprehensive. Photo id required.
More informationInternet 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 informationNetwork 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 informationIntra-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 informationComputer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley
Intra- AS Rou-ng h0p://kcd.com/85/ Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesle Some materials copright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved
More informationAnnouncements. CS 5565 Network Architecture and Protocols. Count-To-Infinity. Poisoned Reverse. Distance Vector: Link Cost Changes.
Announcements CS 6 Network Architecture and Protocols Lecture 20 Project 2B Part/ due Wed Apr 27 :9pm Part/2 due Wed Ma :9pm Current reading assignment: Chapter.6.7, Chapter Final Ma 0, 3:2pm, MCB 26 Godmar
More informationCS4450. 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 informationChapter 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 informationInternet 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 informationChapter 4 Network Layer
Chapter 4 Network Layer CPSC 335 Data Communication Systems Readings: 4.4.3, 4.4.4, 4.5, 4.5.1 David Nguyen Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
More informationCOM-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 informationEnd-to-end path: route
Multi-hop Wireless Netorks CMU CS 15-829: Internet-Scale Sensor Sstems Overvie: Large-Scale Wireless Sstems Small-Scale: Ho to build single-hop ireless LAN; ho to make TCP perform ell over it Large-Scale:
More informationChapter 4 Network Layer
Chapter 4 Network Laer A note on the use of these ppt slides: The notes used in this course are substantiall based on powerpoint slides developed and coprighted b J.F. Kurose and K.W. Ross, 1996-2007 Computer
More informationChapter 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 informationIntroduction to Intra-Domain Routing
Introduction to Intra-Domain Routing Stefano Vissicchio UCL Computer Science COMP3 Agenda We delve into network layer s main functionality. Setting Context Routing players. Intra-domain routing problem
More informationLast 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 informationChapter 12. Routing and Routing Protocols 12-1
Chapter 12 Routing and Routing Protocols 12-1 Routing in Circuit Switched Network Many connections will need paths through more than one switch Need to find a route Efficiency Resilience Public telephone
More informationLecture 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 informationChapter 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 informationCS 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 informationcs/ee 143 Communication Networks
cs/ee 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were
More informationCSCE 463/612 Networks and Distributed Processing Spring 2017
CSCE 46/6 Networks and Distributed Processing Spring 07 Network Layer III Dmitri Loguinov Texas A&M University April, 07 Original slides copyright 996-004 J.F Kurose and K.W. Ross Homework #4 Grading Default
More informationLecture 4 Wide Area Networks - Routing
DATA AND COMPUTER COMMUNICATIONS Lecture 4 Wide Area Networks - Routing Mei Yang Based on Lecture slides by William Stallings 1 ROUTING IN PACKET SWITCHED NETWORK key design issue for (packet) switched
More informationELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ELEC / COMP 177 Fall 01 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Homework #4 Due Thursday, Nov 1 st Project # Due Tuesday, Nov 6 th Later this semester: Homework #5 Due Thursday,
More informationCOMP/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 informationWhat 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 informationRouting 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 informationMissing Pieces of the Puzzle
Missing Pieces of the Puzzle EE122 Fall 2011 Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson and other colleagues at Princeton and
More informationProtocoles et Interconnexions
Protocoles et Interconneions Course Overview and Introduction Dario Vieira Department of Computer Science EFREI Routing Protocol BGP TCP Computer Networking Preliminaries Transport Laer Network Laer Introduction
More informationIn this edition of HowStuffWorks, we'll find out precisely what information is used by routers in determining where to send a packet.
How Routing Algorithms Work by Roozbeh Razavi If you have read the HowStuffWorks article How Routers Work, then you know that a router is used to manage network traffic and find the best route for sending
More informationLecture 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 information6.02 Fall 2014! Lecture #21. Failures in routing Routing loops Counting to infinity
6.02 Fall 2014! Lecture #21 Failures in routing Routing loops Counting to infinity Unanswered questions (about packet-switched networks) How do nodes determine routes to every other node? Nodes determine
More informationCOMP 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 informationShortest 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 informationComputer 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 informationCSc 450/550 Computer Networks Internet Routing
CSc 450/550 Computer Networks Internet Routing Jianping Pan Summer 2007 7/12/07 CSc 450/550 1 Review Internet Protocol (IP) IP header addressing class-based, classless, hierarchical, NAT routing algorithms
More informationICS 351: Today's plan. netmask exercises network and subnetwork design dynamic routing RIP distance-vector routing
ICS 351: Today's plan netmask exercises network and subnetwork design dynamic routing RIP distance-vector routing Netmask exercises how many bits in this netmask: 255.128.0.0 using this netmask and the
More informationData and Computer Communications. Chapter 12 Routing in Switched Networks
Data and Computer Communications Chapter 1 Routing in Switched Networks Routing in Packet Switched Network Select route between end nodes Characteristics required: Correctness Simplicity Robustness Stability
More informationInternet Architecture. Network Layer Overview. Fundamental Network Layer Function. Protocol Layering and Data. Computer Networks 9/23/2009
omputer Networks 9//9 Network Layer Overview Kai Shen Internet rchitecture ottom-up: : electromagnetic signals on the wire : data transfer between neighboring elements encoding, framing, error correction,
More informationReview: 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 informationDistance Vector Routing
ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE Routing in General Distance Vector Routing Jean Yves Le Boudec Fall 22 Contents. Routing in General 2. Distance vector: theory. Distance vector: practice 4. Dynamic
More informationCS 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network Layer. Chapter goals:
Chapter 4 Network Laer A note on the use of these ppt slides: The notes used in this course are substantiall based on powerpoint slides developed and coprighted b J.F. Kurose and K.W. Ross, 996-7 Computer
More informationCS118 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 informationCS118 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