06/02/ Local & Metropolitan Area Networks. Overview. Routing algorithm ACOE322. Lecture 6 Routing
|
|
- Rosalyn Gibbs
- 5 years ago
- Views:
Transcription
1 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 is for broadcasting networks In broadcasting routing a packet is sent simultaneously to all destinations Still routing is an issue if the source and destination are not on the same network r. L. hristofi Routing algorithm B source router R R3 destination router How to find the best path from to F? How does R chooses the best route to R4? The routing algorithm is that part of the network layer software responsible for deciding which output line an incoming packet should be transmitted on. r. L. hristofi 3 R R4 F E 06/0/006
2 Routing & forwarding Not the same thing! Routing means filling in and updating the routing tables Forwarding means handling the packets based on routing tables Routing differs in datagram and virtual-circuit networks r. L. hristofi 4 Routing - properties ertain properties are desirable in a routing algorithm:. correctness. simplicity 3. robustness updating possibility should cope with changes in the topology and traffic 4. stability must converge to equilibrium 5. fairness 6. optimality min mean packet delay max total network throughput 5 & 6 often contradictory r. L. hristofi 5 Routing algorithms YNMI (adaptive) change routing decisions to reflect changes in the topology adapt for changes in the traffic (load change) LGORITHMS: where routers get the information from? locally from adjacent routers from all routers LGORITHMS: when they change their routes? every T sec when the load changes when topology changes STTI (non-adaptive) routes computed in advance node failures, current load etc. not taken into account Note that both adaptive & non-adaptive algorithms can be either load-sensitive or load-insensitive r. L. hristofi 6 06/0/006
3 3 Global & decentralized routing algorithms. Global routing algorithm least-cost path calculated using global knowledge about network input: connectivity between all nodes & link costs nodes Link-state algorithms. ecentralized routing algorithm least-cost path calculated in an iterative, distributed manner no node has complete info about the cost of all network links begins with cost of directly attached links info exchange with neighbouring nodes istance-vector algorithms r. L. hristofi etermining the path Build a graph of the subnet: each router represented by a node node connected by a link (communication line) 5 B cost: number of hops, geographic distance in km, queuing delay, transmission delay, bandwidth, reliability, price least-cost path the minimum sum of the cost of the links shortest path crossing the smallest number of links r. L. hristofi E 5 F Static algorithms Shortest Path routing ijkstra s algorithm computes the least-cost path (route) from one node to all the other nodes Flooding omputes the shortest path (route) from one node to all the other nodes (inverse tree) r. L. hristofi 9 06/0/006 3
4 4 Shortest Path routing () Metrics (criteria for routing) istance path length = the number of hops Geographic distance in km Bandwidth elay verage traffic ommunication cost Mean queue length Measured delay By changing the weighting function, the algorithm can compute the shortest path measured according to any one of a number of criteria or to a combination of criteria r. L. hristofi 0 Shortest Path routing () Best known algorithm to compute the shortest path between two nodes is ijkstra (959) Each node is labeled with its distance from the source node along the best known path Initially, no paths are known, so all nodes are labeled with infinity s the algorithm proceeds and paths are found, the labels may change, reflecting better paths label may be either tentative or permanent Initially all labels are tentative When it is discovered that a label represents the shortest possible path from the source to that node, it is made permanent and never changed thereafter r. L. hristofi How labeling works () 6 B G E 4 F 3 The weights represent, for example, distance We want to find the shortest path from to We start by marking node as permanent (filled-in circle) Then we examine each of the nodes adjacent to, relabeling each one with the distance to H 3 r. L. hristofi 06/0/006 4
5 5 How labeling works () B (, ) E(,-) 6 G(6,) 4 (,-) 3 3 F(,-) (,-) H(,-) Whenever a node is relabeled we also label it with the node from which the probe was made so that we can reconstruct the final path later Then we examine all the tentatively labeled nodes and make the one with the smallest label permanent. This one becomes the new working node (B, in this case) We now start at B and examine all nodes adjacent to it. If the sum of the label on B and the distance from B to the node being considered is less than the label on that node, we have a shorter path, so the node is relabeled r. L. hristofi 3 How labeling works (3) B (, ) E(4,B) 6 G(6,) 4 (9,B) 3 3 F(,-) (,-) H(,-) fter all nodes adjacent to the working node (B) have been inspected and the tentative labels changed if possible, then a search is made to find the tentatively-labeled node with the smallest value This node is made permanent and becomes the new working node for the next round (node E) r. L. hristofi 4 How labeling works (4) 6 B (, ) 6 G(5,E) B (, ) G(5,E) B (, ) 6 E(4,B) 4 E(4,B) 4 E(4,B) F(6,E) (9,B) 3 3 H(,-) F(6,E) (9,B) 3 3 H(9,G) F(6,E) (9,B) 3 3 (,-) (,-) (,-) The process repeats until the shortest path is found, which is -B-E-F-H- r. L. hristofi 5 G(5,E) 4 H(8,F) 06/0/006 5
6 6 Flooding () B nother static algorithm Every incoming packet is sent out to every outgoing line except the one that the packet arrived on PROBLEM: F G E Ideally, the hop counter should be initialized to the length of the path r. L. hristofi 6 from source to destination H large number of duplicated packets consumes bandwidth SOLUTION: Have a hop counter in the header of each packet, which is decremented at each hop When counter reaches zero, the packet is discarded Flooding () Flooding always chooses the shortest path because it chooses every possible path in parallel. Flooding is not practical in most applications, but it has several important uses:. In military applications, where large numbers of routers may be blown at any instant, the tremendous robustness of flooding is highly desirable. In distributed database applications, it is sometimes necessary to update all the databases concurrently 3. In wireless networks all messages transmitted by a station can be received by all other stations within its radio range 4. metric against which other routing algorithms can be compared In selective flooding, a router sends packets out only on those lines in the general direction of the destination. That is, don't send packets out on lines that clearly lead in the wrong direction. r. L. hristofi ynamic algorithms istance-vector Routing used in the RPNET until 99 Link-State Routing used in the newer Internet Open Short Path First (OSPF) protocol r. L. hristofi 8 06/0/006 6
7 destination nodes The istance Vector Routing Operates by having each router maintain a table (vector) giving the best known distance to each destination and which line to use to get there dynamic algorithm takes current network load into account distributed each node receives information from its directly attached neighbours, performs a calculation, distribute the results back to neighbours the last one introduces overhead iterative algorithm performed in steps until no more information to change initially, each node knows only about its adjacent nodes asynchronous nodes do not operate in lockstep with each other r. L. hristofi 9 The istance Vector Routing distance tables from neighbors E () B 0 B 0 0 c( E, ) = c( E, B) = 8 c( E, ) = intermediate distance table B E s distance vector, 8,B 4, Note that this is not the final vector! B E 8, node E sends this distance vector to its neighbors re these paths X Z ( Y ) = min Z N ( X )( c( X, Z ) + ( Y )) shortest possible? r. L. hristofi 0 The count-to-infinity problem VR good news spread rapidly, bad news slowly Suppose all distance vectors sent at once Suppose that was down (link cost = ) and it just came up a metric is the number of hosts They still think that is down If node X tells Y that it has a path somewhere, Y has no way of knowing whether it itself is on the path. How can we avoid this problem? r. L. hristofi 06/0/006
8 destination nodes 8 void looping Split horizon Never send information about the routing for a particular packet in the direction from which it was received an be achieved by means of a technique called poison reverse. informing all routers that the path back to the originating node for a particular packet has an infinite metric Performance: Split horizon with poison reverse, is more effective in networks with multiple routing paths r. L. hristofi The Split horizon with poison reverse if a path to a dest node Y is through neighboring node X report to node X for destination node distance tables from neighbors E () B 0 B 0 0 intermediate distance table B c ( E, ) = ; c( E, B) = 8; c( E, ) = E s distance vector B E Note that this is not the final vector!, To : To B: 8,B 4, B 8 B, 4 4 E 0 E 0 8 To : B 8 E 0 r. L. hristofi 3 The distance vector routing Two problems. Link bandwidth not taken into account for metric, only the queue length all the lines at that time 56 Kbps. Too long time to converge QUESTION: when the algorithm converges? NSWER: when every node knows about all other nodes and networks and computes the shortest path to them will the nodes know the exact network topology by then? r. L. hristofi 4 06/0/006 8
9 9 ynamic algorithms istance Vector Routing Link State Routing r. L. hristofi 5 Link-state routing algorithm link state broadcast node learn about path costs from its neighbors inform the neighbors whenever the link cost changes hence the name link state r. L. hristofi 6 Link state routing Each router does the following (repeatedly): discover neighbors, particularly, learn their network addresses router learns about its neighbours by sending a special HELLO packet to each point-to-point line. Routers on the other end send a reply measure cost to each neighbor e.g. by exchanging a series of packets sending EHO packets and measuring the average roundtrip-time include traffic-induced delay? construct a link state packets send this packet to all other routers using what route information? chicken / egg what if re-ordered? or delayed? compute locally the shortest path to every other router when this information is received r. L. hristofi 06/0/006 9
10 0 onstructing link state packets sender subnet link state packets for this subnet When to build these packets? at regular time intervals on occurrence of some significant event link goes down (or comes back), cost change appreciably r. L. hristofi 8 istributing the link state packets Typically, flooding routers recognize packets passed earlier sequence number incremented for each new packet sent routers keep track of the (source router, sequence) pair thus avoiding the exponential packet explosion first receivers start changes already while changes are being reported sequence numbers wrap around or might be corrupted (a bit inversed instead of 4) 3 bit sequence number (3 years to wrap) To avoid corrupted sequences (or a router reboot) and therefore prevent any update, the state at each router has an age field that is decremented once a second but, need additional robustness in order to deal with errors on router-to-router lines acknowledgements r. L. hristofi 9 Routing in the Internet What would happen if hundreds of millions of routers execute the same routing algorithm to compute routing paths through the network? Scale large overhead enormous memory space in the routers no bandwidth left for data transmission would V algorithm converge? dministrative autonomy an organization should run and administer its networks as wishes but must be able to connect it to outside networks r. L. hristofi 30 06/0/006 0
11 Hierarchical routing The Internet uses hierarchical routing it is split into utonomous Systems (S) routers at the border: gateways gateways must run both intra & inter S routing protocols routers within S run the same routing algorithm the administrator can chose any Interior Gateway Protocol Routing Information Protocol (RIP) Open Shortest Path First (OSPF) between S gateways use Exterior Gateway Protocol Border Gateway Protocol (BGP) Why do we have different protocols for inter & intra S routing? r. L. hristofi 3 utonomous systems gateway H network router BGP B RIP & BGP OSPF H BGP gateways (R, R, R3, R4) use both interior & exterior routing other routers use only interior routing Note: S routing protocols in, B, & not need to be the same! r. L. hristofi 3 Routing within S The gateways are exit points routers use default routing each router knows all netid s within S packets destined to another S are sent to the default router default router is the border gateway to the next S r. L. hristofi 33 06/0/006
12 Routing Information Protocol Based on istance Vector Routing istance metric = hop count each link have cost = maximum cost path = 5 limited to S < 5 hops in diameter. each router shares its knowledge about the entire S it is unimportant how much it knows, it sends whatever it has. sharing only with neighbours 3. updates exchanged among neighbours every 30 sec RIP response message Send the distance to networks within S r. L. hristofi 34 RIP routing table estination Hop ount Next Router Other information Other information subnet mask the time a table was updated r. L. hristofi 35 RIP updating algorithm Receive: a response RIP message. dd one hop to the hop count for each advertised destination.. Repeat the following steps for each advertised destination: a. If (destination not in the routing table) I. dd the advertised information to the table. b. Else I. If (next-hop field is the same) i. Replace entry in the table with the advertised one. II. Else i. If (advertised hop count smaller than one in the table) - Replace entry in the routing table. 3. Return. r. L. hristofi 36 06/0/006
13 3 RIP updating the table r. L. hristofi 3 RIP an example destination hop next counter router initial routing tables r. L. hristofi 38 RIP an example (cnt d) destination hop next counter router final routing tables r. L. hristofi 39 06/0/006 3
14 4 Routing protocols r. L. hristofi 40 Open Shortest Path First (OSPF) Open - resources assumed to be freely usable Uses Link State algorithm Link state (LS) packet spreading Topology map at each node Route computation using ijkstra algorithm link costs set up by the administrator Separates policy from mechanism r. L. hristofi 4 OSPF advances to RIP Security: all messages between routers (for example link state updates) are authenticated Multiple same-cost path: allowed Multiple cost metric: for each link, multiple cost for each type of link (satellite connection, fiber, etc.) Support for hierarchy: S is divided into areas to handle routing efficiently r. L. hristofi 4 06/0/006 4
15 5 reas in S intra area routing involves only routers within the same area area border router routs the packet outside the area exactly area configured to be backbone area backbone routers run OSPF within backbone area S bound. router exchanges routing info with routers in other S s r. L. hristofi 43 Routing protocols Intra S routing Inter S routing r. L. hristofi 44 Inter S routing Border Gateway Protocol it is de facto standard interdomain routing protocol in today s Internet gateway H network router BGP B RIP & BGP OSPF H BGP r. L. hristofi 45 06/0/006 5
16 6 BGP Why are istance Vector Routing & Link State Routing not good candidates? route with the smallest hop count not the preferred one S not secure VR: only number of hops known to destination not path to get there LSR: Internet too big for this routing method huge databases long time to run ijsktra s algorithm r. L. hristofi 46 BGP- (cnt d) Path Vector Routing (V based) offers control to the administrator! Network Next Router Path N0 R0 S4, S3, S6 IRized destination network address N0 N03 R05 R06 S, S6, S05, S89 S6, S89, S09, S34 (8.9.40/4) N04 R S6, S0, S09 path: an ordered list of S that a packet should travel through to reach the destination Path information rather than cost information! S # s assigned by Internet orporation for ssigned Names and Numbers (INN) regional registries r. L. hristofi 4 BGP- path vector messages network next router path. router R sends a path vector advertising the detachability of N. router R receives the message, updates its table, replaces the router # with its own, adds its S # and sends a message to R3 3. r. L. hristofi 48 06/0/006 6
17 BGP activities. receiving & filtering route advertisement from directly attached neighbors Filtering: ignore advs that contain its own number in the S path (avoid looping). route selection distinguish between routing mechanism & routing policy 3. sending its route advertisement to neighbors only provides mechanism not policy r. L. hristofi 49 BGP an example S B S W X Y provider network (ISP) customer network W, X, Y source/destination off all traffic leaving/entering S How will X be prevented from forwarding traffic from B to? controlled routes advertisement X advertises to its neighbors B & that it has no paths to or Y even though he knows that path! B will not send packets for through X Should B advertise path W via B to or only to X? r. L. hristofi Traffic from should go directly via 50 Types of BGP packets Open: create a neighbor relationship a router running BGP opens a connection and sends an open message if a neighbour accepts the relationship its responds with a keep-alive Update: heart of BGP used to redraw destinations advertised previously Keep-alive: routers tell each other that they are active Notification: in case of error or when router wants to close the connection r. L. hristofi 5 06/0/006
18 8 Network ddress Translation (NT) Number of home users and small business that want to use the Internet ever increases always on-line (SL, cable, ) IPv4 address space limited Solution: NT large number of internal addresses and limited number of external addresses ddresses for private use (no permission required) Private address range to to to Total addresses r. L. hristofi 5 NT (cnt d) address translation r. L. hristofi 53 NT (cnt d) communication is always initiated by the private network only private-network host can access the same external host r. L. hristofi 54 06/0/006 8
19 9 NT (cnt d) Using pool of addresses (example: 4 external addresses instead of ) drawback: no more than 4 connections can be made to the same destination Using both IP addresses and port numbers Private ddress Private Port External ddress External Port Transport Protocol TP TP... r. L. hristofi 55 Exercises. How can flooding and broadcast be said to be similar to each other? How do they differ? Name one way in which they are similar/different.. Explain how looping can be avoided in distance-vector routing. 3. How does static routing differs from dynamic routing? Name two static and two dynamic algorithms used in routing packets. 4. Explain the operation of ijkstra s algorithm. 5. By means of appropriate diagrams explain how labeling in shortest path routing works. 6. Which problems are encountered with distance-vector routing?. Which actions does a router perform in link-state routing? 8. ontrast RIP, OSPF and BGP routing algorithms. 9. What is NT and why is it used? r. L. hristofi 56 References.S. Tanenbaum, omputer Networks, 4 th edition, Pearson Education International, 003 F. Halsall, ata ommunications, omputer Networks and Open Systems, 4 th edition, ddison Wesley, 995 r. L. hristofi 5 06/0/006 9
Chapter 22 Network Layer: Delivery, Forwarding, and Routing 22.1
Chapter 22 Network Layer: Delivery, Forwarding, and Routing 22.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 22-3 UNICAST ROUTING PROTOCOLS 22.2 A routing
More informationCEN445 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 informationRouting. 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 informationRouting. Advanced Computer Networks: Routing 1
Routing Advanced Computer Networks: Routing 1 Gateway To internet or wide area network Metropolitan Area Network (MAN) s s Organization Servers Backbone R S R R Departmental Server s R S R s S R s s s
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 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 informationIP 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 information5.2 Routing Algorithms
CEN445 Network Protocols and Algorithms Chapter 5 Network Layer 5. Routing Algorithms Dr. Mostafa Hassan Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud
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 informationETSF05/ETSF10 Internet Protocols Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet 2014, (ETSF05 Part 2), Lecture 1.1 Jens Andersson Circuit switched routing 2014 11 05 ETSF05/ETSF10 Internet Protocols 2 Packet switched 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 informationIP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing
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
More informationNetwork 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 informationETSF05/ETSF10 Internet Protocols. Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet Circuit switched routing ETSF05/ETSF10 - Internet Protocols 2 Routing in Packet Switching Networks Key design issue for (packet) switched networks
More informationRouting 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 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 informationITEC310 Computer Networks II
ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able
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 informationTelecommunication Protocols Laboratory Course. Lecture 3
Telecommunication Protocols Laboratory Course Lecture 3 Course map Last time: we discussed protocols of the Medium Access Control (MAC) sub-layer Deal with broadcast channels and their (multi-party) protocols
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 informationThird 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 informationRouting. 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 informationCHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL
CHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL Dr. Bhargavi Goswami, Associate Professor head, Department of Computer Science, Garden City College Bangalore. PACKET SWITCHED NETWORKS Transfer blocks
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 informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationHierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice
Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!
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 informationRouting 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 informationC13b: 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 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 informationComputer Networking Introduction
Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.15 Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram
More informationChapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services:
NET 331 Computer Networks Lecture 12 Internet Routing Protocols Dr. Anis Koubaa Reformatted slides from textbook Computer Networking a top-down appraoch, Fifth Edition by Kurose and Ross, (c) Pearson Education
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 informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
More informationRouting, Routing Algorithms & Protocols
Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a
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 informationOverview. 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 informationUNIT 2 ROUTING ALGORITHMS
UNIT ROUTING ALGORITHMS Routing Algorithms Structure Page Nos..0 Introduction 3. Objectives 3. Flooding 3.3 Shortest Path Routing Algorithm 5.4 Distance Vector Routing 6.4. Comparison.4. The Count-to-Infinity
More informationTopics for This Week
Topics for This Week Routing Protocols in the Internet OSPF, BGP More on IP Fragmentation and Reassembly ICMP Readings Sections 5.6.4-5.6.5 1 Hierarchical Routing aggregate routers into regions, autonomous
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 4: Network Layer. TDTS06 Computer networks. Subnets. Subnets. Subnets. IP Addressing: introduction
hapter 4: Network Layer TDTS06 omputer s Lecture 6: Network layer III Routing in the Internet Jose M. Peña, jospe@ida.liu.se ID/DIT, LiU 2009-09-16 4. 1 Introduction 4.2 Virtual circuit and datagram s
More information(Refer Slide Time: 01:08 to 01:25min)
COMPUTER NETWORKS Prof. Sujoy Ghosh Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture-27 RIP- Distance Vector Routing We have seen basic routing. Now we will
More informationChapter 4: outline. Network Layer 4-1
Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link
More informationICMP, ARP, RARP, IGMP
Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols
More informationChapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.
More informationDistance-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 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 informationEEC-684/584 Computer Networks
EEC-684/584 Computer Networks Lecture 14 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Internetworking
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 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 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 informationCS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013
CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 14, 2013 1 Reading Quiz Hierarchical routing Our routing study thus far - idealization all routers identical network flat
More informationWhy dynamic route? (1)
Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update
More informationEECS 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 informationRouting. Outline. Algorithms Scalability
Routing Outline Algorithms Scalability 1 Internetworking What is internetwork An arbitrary collection of networks interconnected to provide some sort of host-host to packet delivery service A simple internetwork
More informationBasic Idea. Routing. Example. Routing by the Network
Basic Idea Routing Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
More informationRouting. Routing. Overview. Overview. Routing vs. Forwarding. Why Routing
Routing Dr. Arjan Durresi Department of Computer Science Louisiana State University Overview Routing vs. Forwarding Routing Algorithms, Distance Vector, Link State Dijkstra s Algorithm ARPAnet Routing
More informationRouting by the Network
Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:
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
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms
More informationChapter IV: Network Layer
Chapter IV: Network Layer UG3 Computer Communications & Networks (COMN) Myungjin Lee myungjin.lee@ed.ac.uk Slides copyright of Kurose and Ross Hierarchical routing our routing study thus far - idealization
More informationRouters & 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 informationCS 43: Computer Networks. 24: Internet Routing November 19, 2018
CS 43: Computer Networks 24: Internet Routing November 19, 2018 Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small
More informationRouting Protocols of IGP. Koji OKAMURA Kyushu University, Japan
Routing Protocols of IGP Koji OKAMURA Kyushu University, Japan Routing Protocol AS (Autonomous System) Is operated autonomous in the organization. 6bit IGP (Interior Gateway Protocol) Routing Control inside
More informationCS555, Spring /5/2005. April 12, 2005 No classes attend Senior Design Projects conference. Chapter 4 roadmap. Internet AS Hierarchy
CS555, Spring 2005 April 12, 2005 No classes attend Senior Design Projects conference Network Layer 4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 VC and Datagram Networks 4.3 What
More informationRouting in the Internet
Routing in the Internet Daniel Zappala CS 460 Computer Networking Brigham Young University Scaling Routing for the Internet 2/29 scale 200 million destinations - can t store all destinations or all prefixes
More informationRouting in Switched Data Networks
in Switched Data Networks ITS323: Introduction to Data Communications Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 23 May 2012 ITS323Y12S1L10, Steve/Courses/2012/s1/its323/lectures/routing.tex,
More informationInter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley
Inter-AS routing Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Some materials copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved Chapter 4:
More informationCS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017
CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 16, 2017 1 Hierarchical routing Our routing study thus far - idealization all routers identical network flat not true in
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 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 informationWe will discuss about three different static routing algorithms 1. Shortest Path Routing 2. Flooding 3. Flow Based Routing
In this lecture we will discuss about Routing algorithms Congestion algorithms Lecture 19 The routing algorithm is that part of the network layer software, which is responsible for deciding which output
More informationLecture 19: Network Layer Routing in the Internet
Lecture 19: Network Layer Routing in the Internet COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F
More informationOverview 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 informationCS 138: Communication I. CS 138 V 1 Copyright 2012 Thomas W. Doeppner. All rights reserved.
CS 138: Communication I CS 138 V 1 Copyright 2012 Thomas W. Doeppner. All rights reserved. Topics Network Metrics Layering Reliability Congestion Control Routing CS 138 V 2 Copyright 2012 Thomas W. Doeppner.
More informationIntroduction to IP Routing. Geoff Huston
Introduction to IP Routing Geoff Huston Routing How do packets get from A to B in the Internet? A Internet B Connectionless Forwarding Each router (switch) makes a LOCAL decision to forward the packet
More informationCSC 4900 Computer Networks: Routing Protocols
CSC 4900 Computer Networks: Routing Protocols Professor Henry Carter Fall 2017 Last Time Link State (LS) versus Distance Vector (DV) algorithms: What are some of the differences? What is an AS? Why do
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 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 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 informationTDC 363 Introduction to LANs
TDC 363 Introduction to LANs Routing Protocols and RIP Greg Brewster DePaul University TDC 363 1 Dynamic Routing Routing Protocols Distance Vector vs. Link State Protocols RIPv1 & RIPv2 RIP Problems Slow
More informationICS 351: Today's plan. distance-vector routing game link-state routing OSPF
ICS 351: Today's plan distance-vector routing game link-state routing OSPF distance-vector routing game 1. prepare a list of all neighbors and the links to them, and the metric for each link 2. create
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 informationInternet Routing Protocols Tuba Saltürk
Internet Routing Protocols 15505068 Tuba Saltürk Outline Internet Routers Routing Protocol Interior Gateway Protocol (IGP) Distance- Vector Routing Protocol Routing Information Protocol (RIP) Interior
More informationLecture 12. Introduction to IP Routing. Why introduction? Routing
Lecture. Introduction to IP Routing Why introduction? Routing: very complex issue need in-depth study entire books on routing our scope: give a flavour of basic routing structure and messaging give an
More informationLecture 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 informationDistance 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 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 informationDiscussion 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 informationTop-Down Network Design
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic
More informationTCPIP Protocol Suite & Utilities. Revision no.: PPT/2K403/02
TCPIP Protocol Suite & Utilities Revision no.: PPT/2K403/02 Comparing the TCP/IP protocol Suite, the OSI Model, and the DoD Model Comparing the TCP/IP protocol Suite, the OSI Model, and the DoD Model (contd.)
More informationAdvanced 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 informationLecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 4 The Network Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Network layer functions Transport packet from sending to receiving hosts Network layer protocols in every
More informationECE 435 Network Engineering Lecture 11
ECE 435 Network Engineering Lecture 11 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 5 October 2017 Announcements Back from Memsys. Related things: fast memories for network
More informationInitial motivation: 32-bit address space soon to be completely allocated. Additional motivation:
IPv6 Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation: header format helps speed processing/forwarding header changes to facilitate QoS IPv6 datagram format:
More informationLab 4: Routing using OSPF
Network Topology:- Lab 4: Routing using OSPF Device Interface IP Address Subnet Mask Gateway/Clock Description Rate Fa 0/0 172.16.1.17 255.255.255.240 ----- R1 LAN R1 Se 0/0/0 192.168.10.1 255.255.255.252
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 informationAnnouncements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms
Announcements CS 5565 Network Architecture and Protocols Lecture 20 Godmar Back Project 2B due in 2 parts: Apr 29 and May 6 Extra Credit Opportunities: Expand simulator (and your implementation) to introduce
More informationNetwork Layer. Goals of This Lecture. Internet Reference Model. Outline of the Class
Goals of This Lecture Network Layer Kuang Chiu Huang TCM NCKU Through the lecture and in-class discussion, students are enabled to describe role and functions of the network layer, and compare different
More informationBTEC Level 3 Extended Diploma
BTEC Level 3 Extended Diploma Unit 9 Computer Network Routing and Routing Protocols BTEC Level 3 Extended Diploma Introduction to Routing Routing is the process that a router uses to forward packets toward
More information