Graph abstraction: costs. Graph abstraction 10/26/2018. Interplay between routing and forwarding
|
|
- Mildred Osborne
- 5 years ago
- Views:
Transcription
1 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 value in arriving packet s header 0 Graph abstraction Graph abstraction: costs v w u z x Graph: G = (N,E) N = set of routers = { u, v, w, x,, z } E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,), (w,), (w,z), (,z) } Remark: Graph abstraction is useful in other network contexts Example: PP, where N is set of peers and E is set of TCP connections u c(x,x ) = cost of link (x,x ) v x w z - e.g., c(w,z) = cost could alwas be, or inversel related to bandwidth, or inversel related to congestion Cost of path (x, x, x,, x p ) = c(x,x ) + c(x,x ) + + c(x p-,x p ) Question: What s the least-cost path between u and z? Routing algorithm: find good paths source to destination router. 4
2 0/6/08 A Link-State Routing Algorithm Dijsktra s Algorithm Dijkstra s algorithm net topolog, link costs known to all nodes o accomplished via link state broadcast o all nodes have same info computes least cost paths one node ( source ) to all other nodes o gives forwarding table for that node iterative: after k iterations, know least cost path to k dest. s Notation: c(x,): link cost node x to ; = if not direct neighbors D(v): current value of cost of path source to dest. v p(v): predecessor node along path source to v N': set of nodes whose least cost path definitivel known Initialization: N' = {u} for all nodes v 4 if v adjacent to u then D(v) = c(u,v) 6 else D(v) = 7 8 Loop 9 find w not in N' such that D(w) is a minimum 0 add w to N' update D(v) for all v adjacent to w and not in N' : D(v) = min( D(v), D(w) + c(w,v) ) /* new cost to v is either old cost to v or known 4 shortest path cost to w plus cost w to v */ until all nodes in N' 6 Dijkstra s algorithm: example Step 0 4 N' u ux ux uxv uxvw uxvwz D(v),p(v),u,u,u D(w),p(w),u 4,x,, D(x),p(x),u D(),p(),x D(z),p(z) 4, 4, 4, u v x w z 7 8
3 0/6/08 Distance Vector Algorithm Distance vector algorithm D x () = estimate of least cost x to Distance vector: D x = [D x (): є N ] Node x knows cost to each neighbor v: c(x,v) Node x maintains D x Node x also maintains its neighbors distance vectors For each neighbor v, x maintains D v = [D v (): є N ] Basic idea: Each node periodicall sends its own distance vector estimate to neighbors When node a node x receives new DV estimate neighbor, it updates its own DV using B-F equation: D x () min v {c(x,v) + D v ()} for each node N Under some conditions, the estimate D x () converge the actual least cost d x () 9 0 DV example Distance Vector Algorithm u v x w z Clearl, d v (z) =, d x (z) =, d w (z) = d u (z) = min { c(u,v) + d v (z), c(u,x) + d x (z), c(u,w) + d w (z) } = min { +, +, + } = 4 Node that achieves minimum is next hop in shortest path forwarding table Iterative, asnchronous: each local iteration caused b: local link cost change DV update message neighbor Distributed: each node notifies neighbors when its DV changes o neighbors then notif their neighbors if necessar Each node: wait for (change in local link cost of msg neighbor) recompute estimates if DV to an dest has changed, notif neighbors
4 0/6/08 D x () = min{c(x,) + D (), c(x,z) + D z ()} D x (z) = min{c(x,) + = min{+0, 7+} = D (z), c(x,z) + D z (z)} node x table = min{+, 7+0} = cost to cost to cost to x 0 7 x 0 x z z 7 0 z 0 node table cost to cost to cost to x x 0 7 x 0 x z z z 7 0 z 0 node z table cost to cost to cost to x z 7 0 x z x z time Problem: Count-to-Infinit With distance vector routing, good news travels fast, but bad news travels slowl When a router goes down, it takes can take a reall long time before all the other routers become aware of it 4 Count-to-Infinit Comparison of LS and DV algorithms A B C D E etc to infinit Initiall After exchange After exchanges After exchanges After 4 exchanges After exchanges Message complexit LS: with n nodes, E links, O(nE) msgs sent DV: exchange between neighbors onl Speed of Convergence LS: O(n ) algorithm requires O(nE) msgs o ma have oscillations DV: convergence time varies o ma have routing loops o count-to-infinit problem Robustness: what happens if router malfunctions? LS: o node can advertise incorrect link cost o each node computes onl its own table DV: o DV node can advertise incorrect path cost o each node s table used b others error propagate thru network 6 4
5 0/6/08 Interconnected ASes c a b AS a c d b Intra-AS Routing algorithm AS Forwarding table Inter-AS Routing algorithm c a b AS Forwarding table is configured b both intra- and inter-as routing algorithm o Intra-AS sets entries for internal dests o Inter-AS & Intra-As sets entries for external dests 7 Inter-AS tasks Obtain reachabilit information neighboring AS(s) Propagate this info to all routers within the AS All Internet gatewa routers run a protocol called BGPv4 (we will talk about this soon) c a b AS a c d b AS c a b AS 8 Internet inter-as routing: BGP BGP (Border Gatewa Protocol): the de facto standard BGP provides each AS a means to:. Obtain subnet reachabilit information neighboring ASs.. Propagate the reachabilit information to all routers internal to the AS.. Determine good routes to subnets based on reachabilit information and polic. Allows a subnet to advertise its existence to rest of the Internet: I am here 9 BGP basics Pairs of routers (BGP peers) exchange routing info over semipermanent TCP conctns: BGP sessions Note that BGP sessions do not correspond to phsical links. When AS advertises a prefix to AS, AS is promising it will forward an datagrams destined to that prefix towards the prefix. AS can aggregate prefixes in its advertisement c a b AS a AS c d b c a b AS ebgp session ibgp session 0
6 0/6/08 BGP protocol (Chapter 4.6.) OPEN Message BGP uses TCP as its transport protocol, on port 79. On connection start, BGP peers exchange complete copies of their routing tables, which can be quite large. However, onl changes (deltas) are then exchanged, which makes long running BGP sessions more efficient than shorter ones. Four Basic messages: Open: Establishes BGP session (uses TCP port #79) Notification: Report unusual conditions Update: Inform neighbor of new routes that become active Inform neighbor of old routes that become inactive Keepalive: Inform neighbor that connection is still viable During session establishment, two BGP speakers exchange their AS numbers BGP identifiers (usuall one of the router s IP addresses) A BGP speaker has option to refuse a session Select the value of the hold timer: maximum time to wait to hear something other end before assuming session is down. authentication information (optional) NOTIFICATION and KEEPALIVE Messages NOTIFICATION Indicates an error terminates the TCP session gives receiver an indication of wh BGP session terminated Examples: header errors, hold timer expir, bad peer AS, bad BGP identifier, malformed attribute list, missing required attribute, AS routing loop, etc. KEEPALIVE protocol requires some data to be sent periodicall. If no UPDATE to send within the specified time period, then send KEEPALIVE message to assure partner that connection still alive UPDATE Message used to either advertise and/or withdraw previousl announced prefixes path attributes: list of attributes that pertain to ALL the prefixes in the Reachabilit Info field FORMAT: Withdrawn routes length ( octets) Withdrawn routes (variable length) Total path attributes length ( octets) Path Attributes (variable length) (NLRI) Reachabilit Information (variable length) 4 6
7 0/6/08 BGP update message Advertising a prefix Withdrawn Routes: Length field Btes Withdrawn route list Path attributes: Length field btes Path attributes list NLRI list : a list of entries Length field ( bte), Prefix (variable length) Path attributes appl to all the prefixes in the NLRI list When a router advertises a prefix to one of its BGP neighbors: information is valid until first router explicitl advertises that the information is no longer valid BGP does not require routing information to be refreshed if node A advertises a path for a prefix to node B, then node B can be sure node A is using that path itself to reach the destination. NLRI Network Laer Reachabilit Information 6 BGP attributes PATH ATTRIBUTES BGP protocol announcements carries with it several attributes Attribute describes characteristics of a prefix BGP chooses a single path for a given prefix based on attributes (can choose to ignore!) BGP alwas announces the best path to neighbors Attributes ORIGIN AS_PATH NEXT_HOP 4 MED LOCAL_PREF 6 WEIGHT 7 COMMUNITY 8 AGGREGATOR ORIGIN(TYPE CODE=): Who originated the announcement? Where was a prefix injected into BGP? Manuall configured, directl connected, b other intra-routing protocols IGP, EGP, default incomplete (learnt some other means) AS-PATH (TYPE CODE =) a list of AS s through which the announcement for a prefix has passed each AS prepends its AS # to the AS-PATH attribute when forwarding an announcement useful to detect and prevent loops AS length can be used to select among routes unless a LOCAL PREF attribute overrides AS /6 AS, AS, AS AS AS AS, AS AS 7 8 7
8 0/6/08 Attribute: Local Preference (tpe code = ) Use of local pref Used to indicate preference among multiple paths for the same prefix anwhere in the internet. The higher the value the more it is preferred Default value is 00 Local to the AS (nontransitive) Often used to select a specific exit point for outbound traffic Override influence of AS path length /0 AS AS AS AS4 BGP table at AS4: Destination AS Path Local Pref 98..4/0 AS AS /0 AS AS /8 OC Local-pref=00 Local-pref= /8 T 9 0 Attribute: NEXT HOP (code=) Use of next hop When AS boundaries are Crossed, the next hop field is Changed and replaced with the Address of the border router ebgp address of external neighbor ibgp nexthop ebgp E? A ibgp ibgp D / C ibgp B Destination / ebgp Destination / BGP Table at Router A: / Nexthop BGP Table at Router C: Nexthop Next hop= for /4 AS Destination Next hop? /4 e-bgp AS /4 Next hop=
9 0/6/08 Attribute: Multi-Exit Discriminator (MED) (code=4) when AS s interconnected via or more links AS path length are same AS announcing prefix, sets MED value enables AS to indicate its preference (lower MED is better) AS receiving prefix uses MED to select link a wa to specif how close a prefix is to the link it is announced on AS Link B Link A MED=00 MED=00 AS AS AS4 Med values the same AS are compared A lower MED value is preferred MED values exchanged between ASs- non-transitive Ref: BGP Tutorial Sam Halabi- Cisco 4 Use of MED Path attributes & BGP routes When advertising a prefix, advert includes BGP attributes. prefix + attributes = route When gatewa router receives route advert, uses import polic to accept/decline. Export polic is defined b a series of rules.0.0.0/8 MED = / MED = /8 MED = / MED = 0 L L Router C 6 9
10 0/6/08 BGP Decision Process. Choose route with highest LOCAL-PREF. If have more than route, select route with shortest AS-PATH. If have more than route, select according to lowest ORIGIN tpe where IGP (i) < E-BGP (e) < default (?) 4. If have more than route, select route with lowest MED value. Select e-bgp learned over i-bgp learned path 6. Select min cost path to NEXT HOP using IGP metrics (lowest IGP cost to BGP egress) 7. If have multiple internal paths, use lowest BGP Router ID to break the tie. 7 0
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 informationChapter 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 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 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 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 informationOther Developments: CIDR
Other Developments: CIDR CIDR (classless Inter domain routing) Too many small networks requiring multiple class C addresses Running out of class B addresses, not enough nets in class A Assign contiguous
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 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 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 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 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 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 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 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 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 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 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 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 informationNetwork layer: Overview. Network layer functions Routing IP Forwarding
Network layer: Overview Network layer functions Routing IP Forwarding 1 Network Layer Functions Transport packet from sending to receiving hosts (processes) Network layer protocols in every host, router
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 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 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 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 informationInter-Domain Routing: BGP
Inter-Domain Routing: BGP Richard T. B. Ma School of Computing National University of Singapore CS 3103: Compute Networks and Protocols Inter-Domain Routing Internet is a network of networks Hierarchy
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 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 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 informationCourse on Computer Communication and Networks. Lecture 7 Network Layer, Chapter 4 (6/e) - Part B (7/e Ch5)
Course on Computer Communication and Networks Lecture 7 Network Layer, Chapter 4 (6/e) - Part B (7/e Ch5) EDA344/DIT 420, CTH/GU Based on the book Computer Networking: A Top Down Approach, Jim Kurose,
More informationPART III. Implementing Inter-Network Relationships with BGP
PART III Implementing Inter-Network Relationships with BGP ICNP 2002 Routing Protocols Autonomous System BGP-4 BGP = Border Gateway Protocol Is a Policy-Based routing protocol Is the de facto EGP of today
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 information5.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 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 informationCSC 8560 Computer Networks: Control Plane
CSC 8560 Computer Networks: Control Plane 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: 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 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 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 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 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 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 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 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: 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 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 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 BGP v4. Fall 2014
CS 457 - BGP v4 Fall 2014 Autonomous Systems What is an AS? a set of routers under a single technical administration uses an interior gateway protocol (IGP) and common metrics to route packets within the
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 informationEC441 Fall 2018 Introduction to Computer Networking Chapter 5: Network Layer Control Plane
EC441 Fall 2018 Introduction to Computer Networking Chapter 5: Network Layer Control Plane This presentation is adapted from slides produced by Jim Kurose and Keith Ross for their book, Computer Networking:
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.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 informationDynamic Routing. The Protocols
Dynamic Routing The Protocols Desirable Characteristics of Dynamic Routing Automatically detect and adapt to topology changes Provide optimal routing Scalability Robustness Simplicity Rapid convergence
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 informationInternet Routing : Fundamentals of Computer Networks Bill Nace
Internet Routing 14-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 Looking Ahead Lab #2 just due Quiz #2
More informationInter-AS routing and BGP. Network Layer 4-1
Inter-AS routing and BGP Network Layer 4-1 Review: intra-as routing v Also known as interior gateway protocols (IGP) v Most common intra-as routing protocols: RIP: Routing Information Protocol, distance
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 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 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 informationInterplay Between Routing, Forwarding
Internet Routing 1 Interplay Between Routing, Forwarding routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 1 value in arriving packet s header 0111 3 1 Graph Abstraction
More informationCSCI Topics: Internet Programming Fall 2008
CSCI 491-01 Topics: Internet Programming Fall 2008 Network Layer Derek Leonard Hendrix College November 17, 2008 Original slides copyright 1996-2007 J.F Kurose and K.W. Ross 1 Chapter 4: Roadmap 4.1 Introduction
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 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 informationDepartment of Computer Science Southern Illinois University Carbondale
Department of Computer Science Southern Illinois University Carbondale CS441 Mobile & Wireless Computing Overview of Computer Networking Network Layer of TCP/IP Model Data and Computer Communications 7
More informationRouting Between Autonomous Systems (Example: BGP4) RFC 1771
CS 4/55231 Internet Engineering Kent State University Dept. of Computer Science LECT-7B Routing Between Autonomous Systems (Example: BGP4) RFC 1771 52 53 BGP4 Overview Example of Operations BGP4 is a path
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 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 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 informationCS321: Computer Networks Unicast Routing
CS321: Computer Networks Unicast Routing Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Introduction The goal of the network layer is deliver a datagram from
More informationCS4450. Computer Networks: Architecture and Protocols. Lecture 15 BGP. Spring 2018 Rachit Agarwal
CS4450 Computer Networks: Architecture and Protocols Lecture 15 BGP Spring 2018 Rachit Agarwal Autonomous System (AS) or Domain Region of a network under a single administrative entity Border Routers Interior
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 informationInternet Interconnection Structure
Internet Interconnection Structure Basic Concepts (1) Internet Service Provider (ISP) Provider who connects an end user customer with the Internet in one or few geographic regions. National & Regional
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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer. Chapter goals:
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 004. Chapter 4: Network Layer Chapter goals: understand principles
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 informationInternet inter-as routing: BGP
Internet inter-as routing: BGP BGP (Border Gateway Protocol): the de facto standard BGP provides each AS a means to: 1. Obtain subnet reachability information from neighboring ASs. 2. Propagate the reachability
More informationBGP. Autonomous system (AS) BGP version 4
BGP Border Gateway Protocol (an introduction) dr. C. P. J. Koymans Informatics Institute University of Amsterdam March 11, 2008 General ideas behind BGP Background Providers, Customers and Peers External
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 informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology internet technologies and standards Piotr Gajowniczek BGP (Border Gateway Protocol) structure of the Internet Tier 1 ISP Tier 1 ISP Google
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 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 informationData Communications & Networks. Session 7 Main Theme Networks: Part II Circuit Switching, Packet Switching, The Network Layer
Data Communications & Networks Session 7 Main Theme Networks: Part II Circuit Switching, Packet Switching, The Network Layer Dr. Jean-Claude Franchitti New York University Computer Science Department Courant
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 informationBGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)
BGP Border Gateway Protocol (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 1.9, 2012/03/14 10:21:22) Monday, March 12, 2012 General ideas behind BGP Background Providers,
More informationRouting Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of
Routing Protocols MITA DUTTA The routers in an internet are responsible for receiving and forwarding IP datagrams through the interconnected set of sub-networks from source to destination. Routing protocols
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 informationBGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)
BGP Border Gateway Protocol A short introduction Karst Koymans Informatics Institute University of Amsterdam (version 18.3, 2018/12/03 13:53:22) Tuesday, December 4, 2018 General ideas behind BGP Background
More informationBGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)
BGP Border Gateway Protocol (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 16.4, 2017/03/13 13:32:49) Tuesday, March 14, 2017 General ideas behind BGP Background
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 informationBGP Configuration. BGP Overview. Introduction to BGP. Formats of BGP Messages. Header
Table of Contents BGP Configuration 1 BGP Overview 1 Introduction to BGP 1 Formats of BGP Messages 1 BGP Path Attributes 4 BGP Route Selection 8 Configuring BGP 8 Configuration Prerequisites 8 Configuration
More informationBGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)
BGP Border Gateway Protocol (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 310, 2014/03/11 10:50:06) Monday, March 10, 2014 General ideas behind BGP Background Providers,
More informationBGP. Autonomous system (AS) BGP version 4
BGP Border Gateway Protocol (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 1.5, 2011/03/06 13:35:28) Monday, March 7, 2011 General ideas behind BGP Background Providers,
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 informationBGP Attributes (C) Herbert Haas 2005/03/11 1
BGP Attributes (C) Herbert Haas 2005/03/11 1 Attribute Types Well-known Optional Mandatory Discretionary Non-Transitive Transitive ORIGIN (1) AS_PATH (2) NEXT_HOP (3) LOCAL_PREFERENCE (5) ATOMIC_AGGREGATE
More informationBGP. Border Gateway Protocol A short introduction. Karst Koymans. Informatics Institute University of Amsterdam. (version 18.3, 2018/12/03 13:53:22)
BGP Border Gateway Protocol A short introduction Karst Koymans Informatics Institute University of Amsterdam (version 18.3, 2018/12/03 13:53:22) Tuesday, December 4, 2018 Karst Koymans (UvA) BGP Tuesday,
More informationBGP. Autonomous system (AS) BGP version 4
BGP Border Gateway Protocol (an introduction) dr. C. P. J. Koymans Informatics Institute University of Amsterdam (version 1.3, 2010/03/10 20:05:02) Monday, March 8, 2010 General ideas behind BGP Background
More informationCS 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 informationBorder Gateway Protocol (an introduction) Karst Koymans. Tuesday, March 8, 2016
.. BGP Border Gateway Protocol (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 15.6, 2016/03/15 22:30:35) Tuesday, March 8, 2016 Karst Koymans (UvA) BGP Tuesday,
More informationTELE 301 Network Management
TELE 301 Network Management Lecture 24: Exterior Routing and BGP Haibo Zhang Computer Science, University of Otago TELE301 Lecture 16: Remote Terminal Services 1 Today s Focus How routing between different
More informationBGP. Border Gateway Protocol (an introduction) Karst Koymans. Informatics Institute University of Amsterdam. (version 17.3, 2017/12/04 13:20:08)
BGP Border Gateway Protocol (an introduction) Karst Koymans Informatics Institute University of Amsterdam (version 17.3, 2017/12/04 13:20:08) Tuesday, December 5, 2017 Karst Koymans (UvA) BGP Tuesday,
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 informationModule 3 Network Layer CS755! 3-1!
Module 3 Network Layer CS755 3-1 Please note: Most of these slides come from this book. Note their copyright notice below A note on the use of these ppt slides: We re making these slides freely available
More informationEE 122: Inter-domain routing Border Gateway Protocol (BGP)
EE 122: Inter-domain routing Border Gateway Protocol (BGP) Ion Stoica October 2, 2002 (* this presentation is based on Lakshmi Subramanian s slides) Big Picture Large ISP Large ISP St u b D i al - U p
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 information