Network Layer: Control Plane 5-2
|
|
- Magnus Newton
- 6 years ago
- Views:
Transcription
1 Network Laer: Control Plane EECS Chapter 5: network laer control plane chapter goals: understand principles behind network control plane traditional routing algorithms SDN controlllers Internet Control Message Protocol network management and their instantiation, implementation in the Internet: OSPF, BGP, OpenFlow, ODL and ONOS controllers, ICMP, SNMP Network Laer: Control Plane 5-
2 Chapter 5: outline 5. introduction 5. routing protocols link state distance vector 5.3 intra-as routing in the Internet: OSPF 5.4 routing among the ISPs: BGP 5.5 The SDN control plane 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer: Control Plane 5-3 Network-laer functions Recall: two network-laer functions: forwarding: move packets from router s input to appropriate router s output routing: determine route taken b packets from source to destination data plane control plane Two approaches to structuring network control plane: per-router control (traditional) logicall centralied control (software defined networking) Network Laer: Control Plane 5-4
3 Per-router control plane Individual routing algorithm components in each and ever router interact with each other in control plane to compute forwarding tables Routing Algorithm Local forwarding table header output control plane data plane Network Laer: Control Plane 5-5 Logicall centralied control plane A distinct (tpicall remote) controller interacts with local control agents (CAs) in routers to compute forwarding tables Remote Controller CA CA CA CA CA control plane data plane Network Laer: Control Plane 5-6 3
4 Chapter 5: outline 5. introduction 5. routing protocols link state distance vector 5.3 intra-as routing in the Internet: OSPF 5.4 routing among the ISPs: BGP 5.5 The SDN control plane 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer: Control Plane 5-7 Routing protocols Routing protocol goal: determine good paths (equivalentl, routes), from sending hosts to receiving host, through network of routers path: sequence of routers packets will traverse in going from given initial source host to given final destination host good : least cost, fastest, least congested routing: a top-0 networking challenge! Network Laer: Control Plane 5-8 4
5 Graph abstraction of the network 5 graph: G = ( V, E ) u v 3 3 w 5 V = set of routers = { u, v, w,,, } E = set of links ={ (u,v), (u,), (v,), (v,w), (,w), (,), (w,), (w,), (,) } aside: graph abstraction is useful in other network contets, e.g., PP, where V is set of peers and E is set of TCP connections Network Laer: Control Plane 5-9 Graph abstraction: costs u 5 v 3 3 w 5 c(, ) = cost of link (, ) e.g., c(w,) = 5 cost could alwas be one (hop), or inversel related to bandwidth, or inversel related to congestion cost of path (,, 3,, p ) = c(, ) + c(, 3 ) + + c( p-, p ) ke question: what is the least-cost path between u and? routing algorithm: algorithm that finds that least cost path Network Laer: Control Plane 5-0 5
6 Routing algorithm classification Q: global or decentralied information? global: all routers have complete topolog, link cost info link state algorithms decentralied: router knows phsicallconnected neighbors, link costs to neighbors iterative process of computation, echange of info with neighbors distance vector algorithms Q: static or dnamic? static: routes change slowl over time dnamic: routes change more quickl periodic updates in response to link cost changes more responsive but more route oscillation; routing loops Network Laer: Control Plane 5- Chapter 5: outline 5. introduction 5. routing protocols link state distance vector 5.3 intra-as routing in the Internet: OSPF 5.4 routing among the ISPs: BGP 5.5 The SDN control plane 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer: Control Plane 5-6
7 A link-state routing algorithm Dijkstra s algorithm net topolog, link costs known to all nodes accomplished via link state broadcast all nodes have same info computes least cost paths from one node ( source ) to all other nodes gives forwarding table for that node iterative: after k iterations, know least cost paths to k destinations Notation: c(,): link cost from node to ; = if not direct neighbors D(v): current value of cost of path from source to destination v p(v): predecessor node along path from source to destination v N': set of nodes whose least cost paths definitivel known Network Laer: Control Plane 5-3 Dijsktra s algorithm Initialiation: N' = {u} 3 for all nodes v 4 if v adjacent to u 5 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) ) 3 /* new cost to v is either old cost to v or known 4 shortest path cost to w plus cost from w to v */ 5 until all nodes in N' Network Laer: Control Plane 5-4 7
8 Dijkstra s algorithm: eample D(v) D(w) D() D() D() Step N' p(v) p(w) p() p() p() 0 u 7,u 3,u 5,u uw 6,w 5,u,w uw 6,w,w 4, 3 uwv 0,v 4, 4 5 uwv uwv, 9 notes: v v construct shortest path tree b tracing predecessor nodes ties can eist (can be broken arbitraril) u 5 3 w v Network Laer: Control Plane 5-5 Dijkstra s algorithm: another eample Step N' u u u uv uvw uvw D(v),p(v),u,u,u D(w),p(w) 5,u 4, 3, 3, D(),p(),u D(),p(), D(),p() 4, 4, 4, 5 u v 3 3 w 5 * Check out the online interactive eercises for more eamples: Network Laer: Control Plane 5-6 8
9 Dijkstra s algorithm: eample () resulting shortest-path tree from u: u v w resulting forwarding table in u: destination v w link (u,v) (u,) (u,) (u,) (u,) Network Laer: Control Plane 5-7 Dijkstra s algorithm, discussion algorithm compleit: n nodes each iteration: need to check all nodes, w, not in V n(n+)/ comparisons: O(n ) more efficient implementation using a heap: O(nlogn) oscillations possible: e.g., support link cost equals amount of carried traffic D A +e e B C e initiall D A +e 0 0 +e C B given these costs, find new routing. resulting in new costs 0 D A 0 +e 0 0 C +e B given these costs, find new routing. resulting in new costs D A +e 0 0 +e C B given these costs, find new routing. resulting in new costs Network Laer: Control Plane
10 Chapter 5: outline 5. introduction 5. routing protocols link state distance vector 5.3 intra-as routing in the Internet: OSPF 5.4 routing among the ISPs: BGP 5.5 The SDN control plane 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer: Control Plane 5-9 Distance vector algorithm Bellman-Ford equation (dnamic programming) Let d () := cost of least-cost path from to then d () = min {c(,v) + d v () } v cost from neighbor v to destination cost to neighbor v min taken over all neighbors v of Network Laer: Control Plane 5-0 0
11 Bellman-Ford eample 5 Compute cost from u to : v 3 w Clearl, d v () = 5, d () = 3, d w () = 3 5 u B-F equation sas: 3 d u () = min { c(u,v) + d v (), c(u,) + d (), c(u,w) + d w () } = min { + 5, + 3, 5 + 3} = 4 Node achieving minimum is net hop in shortest path, used in forwarding table Network Laer: Control Plane 5- Distance vector algorithm: variables D () = estimate of least cost from to maintains distance vector D = [D (): є N ] node : knows cost to each neighbor v: c(,v) maintains its neighbors distance vectors. For each neighbor v, maintains D v = [D v (): є N ] Network Laer: Control Plane 5-
12 Distance vector algorithm: ke idea ke idea: from time-to-time, each node sends its own distance vector estimate to neighbors when receives new DV estimate from neighbor, it updates its own DV using B-F equation: D () min v {c(,v) + D v ()} for each node N v under minor, natural conditions, the estimate D () converge to the actual least cost d () Network Laer: Control Plane 5-3 Distance vector algorithm: properties iterative, asnchronous: each local iteration caused b: local link cost change DV update message from neighbor distributed: each node notifies neighbors onl when its DV changes neighbors then notif their neighbors if necessar each node: wait for (change in local link cost or msg from neighbor) recompute estimates if DV to an dest has changed, notif neighbors Network Laer: Control Plane 5-4
13 node table from cost to 0 7 D () = min{c(,) + D (), c(,) + D ()} = min{+0, 7+} = from cost to D () = min{c(,) + D (), c(,) + D ()} = min{+, 7+0} = 3 node table from cost to 0 7 node table from cost to 7 0 time Network Laer: Control Plane 5-5 node table from node table from cost to 0 7 cost to D () = min{c(,) + D (), c(,) + D ()} = min{+0, 7+} = 0 from from cost to cost to from from cost to cost to D () = min{c(,) + D (), c(,) + D ()} = min{+, 7+0} = 3 7 node table from cost to 7 0 from cost to from cost to time Network Laer: Control Plane 5-6 3
14 Distance vector: link cost changes link cost changes: v node detects local link cost change v updates routing info, recalculates distance vector v if DV changes, notif neighbors 4 50 good news travels fast t 0 : detects link-cost change, updates its DV, informs its neighbors. t : receives update from, updates its table, computes new least cost to, sends its neighbors its DV. t : receives s update, updates its distance table. s least costs do not change, so does not send a message to. * Check out the online interactive eercises for more eamples: Network Laer: Control Plane 5-7 Distance vector: link cost changes () link cost changes: v node detects local link cost change v bad news travels slow - count to infinit problem! v 44 iterations before algorithm stabilies: see tet 4 poisoned reverse: v If Z routes through Y to get to X : Z tells Y its (Z s) distance to X is infinite (so Y won t route to X via Z) v will this completel solve count to infinit problem? Network Laer: Control Plane 5-8 4
15 Comparison of LS and DV algorithms message compleit LS: with n nodes, E links, O(nE) messages sent DV: echange between neighbors onl convergence time varies speed of convergence LS: O(n ) algorithm requires O(nE) messages ma have oscillations DV: convergence time varies ma cause routing loops count-to-infinit problem robustness: what happens if router malfunctions? LS: node can advertise incorrect link cost each node computes onl its own table DV: DV node can advertise incorrect path cost each node s table used b others errors propagate through network Network Laer: Control Plane 5-9 Chapter 5: outline 5. introduction 5. routing protocols link state distance vector 5.3 intra-as routing in the Internet: OSPF 5.4 routing among the ISPs: BGP 5.5 The SDN control plane 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer: Control Plane
16 Making routing scalable our routing stud thus far - idealied all routers identical network flat not true in practice scale: with billions of destinations: can t store all destinations in routing tables! routing table echange would swamp links! administrative autonom internet = network of networks each network administrator ma want to control routing in their own network Network Laer: Control Plane 5-3 Internet approach to scalable routing Aggregate routers into regions known as autonomous sstems (AS) (a.k.a. domains ) intra-as routing routing among hosts, routers in same AS ( network ) all routers in AS must run same intra-domain protocol routers in different AS can run different intra-domain routing protocols gatewa router: at edge of its own AS, has link(s) to router(s) in other AS es inter-as routing routing among AS es gatewas perform interdomain routing (as well as intra-domain routing) Network Laer: Control Plane 5-3 6
17 Interconnected ASes 3c 3a 3b AS3 a c d b Intra-AS Routing algorithm AS Forwarding table Inter-AS Routing algorithm a c b AS forwarding table configured b both intraand inter-as routing algorithms intra-as routing determine entries for destinations within AS inter-as and intra-as determine entries for eternal destinations Network Laer: Control Plane 5-33 Inter-AS tasks suppose router in AS receives datagram destined outside of AS: router should forward packet to gatewa router, but which one? AS must:. learn which destinations are reachable through AS, which through AS3. propagate this reachabilit info to all routers in AS job of inter-as routing! other networks 3c 3a 3b AS3 a AS c d b a AS c b other networks Network Laer: Control Plane
18 Intra-AS Routing also known as interior gatewa protocols (IGP) most common intra-as routing protocols: RIP: Routing Information Protocol OSPF: Open Shortest Path First (IS-IS protocol essentiall same as OSPF) IS: Intermediate Sstem IGRP: Interior Gatewa Routing Protocol (Cisco proprietar for decades, until 06) Network Laer: Control Plane 5-35 OSPF (Open Shortest Path First) open : publicl available uses link-state algorithm link state packet dissemination topolog map at each node route computation using Dijkstra s algorithm router floods OSPF link-state advertisements to all other routers in entire AS link state: for each attached link carried in OSPF messages directl over IP (rather than TCP or UDP) IS-IS routing protocol: nearl identical to OSPF Network Laer: Control Plane
19 OSPF: More Details Carries OSPF messages directl over IP protocol 89 supports reliable message transfer supports link state broadcast Checks if links are operational sending HELLO messages Obtains link-state database from neighbor routers OSPF messages are sent if link states change periodicall (30 minutes) Network Laer 4-37 OSPF advanced features securit: all OSPF messages authenticated (to prevent malicious intrusion) multiple same-cost paths allowed (onl one path allowed in RIP) integrated unicast and multicast support: Multicast OSPF (MOSPF, RFC 584) uses same topolog database as OSPF hierarchical OSPF in large domains Network Laer: Control Plane
20 Hierarchical OSPF boundar router backbone router area border routers backbone area 3 area area internal routers Network Laer: Control Plane 5-39 Hierarchical OSPF two-level hierarch: local area, backbone. link-state advertisements onl in area each nodes has detailed area topolog, but onl knows direction (shortest path) to networks in other areas. area border routers: summarie distances to networks in its own area; advertise this info to other area border routers. backbone routers: run OSPF routing within the backbone. boundar routers: connect to other AS es. Network Laer: Control Plane
21 Hierarchical OSPF Routing Packet routing within a domain: local router > area border router (intra-area) > backbone router(s) > area border router of destination network > destination local router Inter-AS routing: local router > area border router (intra-area) > backbone router(s) > boundar router > another AS Network Laer 4-4 Chapter 5: outline 5. introduction 5. routing protocols link state distance vector 5.3 intra-as routing in the Internet: OSPF 5.4 routing among the ISPs: BGP 5.5 The SDN control plane 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer: Control Plane 5-4
22 Internet inter-as routing: BGP BGP (Border Gatewa Protocol)(RFC 47): the de facto inter-domain routing protocol glue that holds the Internet together BGP provides each AS a means to: ebgp: obtain subnet reachabilit information from neighboring AS es (gatewa routers) ibgp: propagate reachabilit information to all ASinternal routers. determine good routes to other networks based on reachabilit information and polic allows subnet to advertise its eistence to the rest of Internet: I am here Network Laer: Control Plane 5-43 BGP Forwarding Tables Packets routed using CIDRied prefies, e.g., / Forwarding table entries have the form (prefi, interface) Network Laer 4-44
23 ebgp, ibgp connections b b a c 3b a c d 3a 3c d AS 3d AS ebgp connection ibgp connection AS 3 c gatewa routers run both ebgp and ibgp protocols Other routers: internal routers Network Laer: Control Plane 5-45 BGP basics BGP connection: two BGP routers ( peers ) echange BGP messages over a semi-permanent TCP connection (port 79): advertising paths to different destination network prefies (BGP is a path vector protocol) when AS3 gatewa router 3a advertises path AS3,X to AS gatewa router c: AS3 promises to AS it will forward datagrams towards X AS b AS 3 3b a d c AS a b c 3a 3d 3c BGP advertisement: AS3, X X d Network Laer: Control Plane
24 BGP path advertisement AS b AS3 3b a c d AS,AS3,X AS a b c 3a AS3,X 3d 3c X d AS router c receives path advertisement AS3, X (via ebgp) from AS3 router 3a Based on AS polic, AS router c accepts path AS3,X, propagates (via ibgp) to all AS routers Based on AS polic, AS router a advertises (via ebgp) path AS, AS3, X to AS router c Network Laer: Control Plane 5-47 BGP path advertisement () AS b AS3,X AS3 3b a c d AS,AS3,X AS a b c 3a AS3,X 3d 3c X d gatewa router ma learn about multiple paths to destination: AS gatewa router c learns path AS,AS3,X from a AS gatewa router c learns path AS3,X from 3a Based on polic, AS gatewa router c chooses path AS3,X, and advertises path within AS via ibgp Network Laer: Control Plane
25 Path attributes and BGP routes advertised prefi includes BGP attributes prefi + attributes = route two important attributes: AS-PATH: list of ASes through which prefi advertisement has passed NEXT-HOP: IP addresses of the router interface that begins the AS-PATH Network Laer: Control Plane 5-49 BGP, OSPF, forwarding table entries Q: how does router set forwarding table entr to distant prefi? AS a local link interfaces at a, d b AS3,X c d AS,AS3,X AS a b d AS3,X c AS3 3a AS3,X 3b 3d 3c phsical link X dest interface X recall: a, b, c learn about dest X via ibgp from c: path to X goes through c d: OSPF intra-domain routing: to get to c, forward over outgoing local interface Network Laer: Control Plane
26 BGP, OSPF, forwarding table entries () Q: how does router set forwarding table entr to distant prefi? AS a b d c AS a b c AS3 3a 3b 3d 3c X d dest interface X recall: a, b, c learn about dest X via ibgp from c: path to X goes through c d: OSPF intra-domain routing: to get to c, forward over outgoing local interface a: OSPF intra-domain routing: to get to c, forward over outgoing local interface Network Laer: Control Plane 5-5 BGP route selection router ma learn about more than one route to destination AS, selects route based on the following elimination rules:. local preference value attribute: polic decision. shortest AS-PATH 3. closest NEXT-HOP router: hot potato routing 4. additional criteria Polic-based routing: gatewa receiving route advertisement uses import polic to accept/decline path (e.g., never route through AS Y). AS polic also determines whether to advertise path to other other neighboring ASes Network Laer: Control Plane 5-5 6
27 BGP: achieving polic via advertisements W A B C X legend: provider network customer network: Y Suppose an ISP onl wants to route traffic to/from its customer networks (does not want to carr transit traffic between other ISPs) A advertises path Aw to B and to C B chooses not to advertise BAw to C: B gets no revenue for routing CBAw, since none of C, A, w are B s customers C does not learn about CBAw path C will route CAw (not using B) to get to w Network Laer: Control Plane 5-53 BGP: achieving polic via advertisements () W A B C X legend: provider network customer network: Y Suppose an ISP onl wants to route traffic to/from its customer networks (does not want to carr transit traffic between other ISPs) A,B,C are provider networks X,W,Y are customer (of provider networks) X is dual-homed: attached to two networks polic to enforce: X does not want to route from B to C via X.. so X will not advertise to B a route to C Network Laer: Control Plane
28 Shortest AS-PATH AS b AS3,X AS3 3b a c d AS,AS3,X AS a b c 3a AS3,X 3d 3c X d gatewa router ma learn about multiple paths to destination: AS gatewa router c learns path AS,AS3,X from a AS gatewa router c learns path AS3,X from 3a Shortest AS-PATH is AS3,X Network Laer: Control Plane 5-55 Hot Potato Routing AS b AS3 3b a d c AS,AS3,X AS b 5 a c 0 63 d 3a AS3,X 3c 3d X OSPF link weights d learns (via ibgp) it can route to X via a or c hot potato routing: choose local gatewa that has least intradomain cost (e.g., d chooses a, even though more AS hops to X); does not consider inter-domain cost! selfish; ma lead to longer end-to-end dela > appl shortest AS-PATH before hot potato. Network Laer: Control Plane
29 BGP messages BGP messages echanged between peers over TCP connections BGP messages: OPEN: opens TCP connection to remote BGP peer and authenticates sending BGP peer UPDATE: advertises new path (or withdraws old path) KEEPALIVE: keeps connection alive in absence of UPDATES; also ACKs OPEN request NOTIFICATION: reports errors in previous message; also used to close connection Network Laer: Control Plane 5-57 Wh different Intra-, Inter-AS routing? polic: inter-as: admin wants control over how its traffic routed, who routes through its net. intra-as: single admin, so no polic decisions needed scale: hierarchical routing saves table sie, reduced update traffic performance: intra-as: can focus on performance inter-as: polic ma dominate over performance Network Laer: Control Plane
30 Chapter 5: outline 5. introduction 5. routing protocols link state distance vector 5.3 intra-as routing in the Internet: OSPF 5.4 routing among the ISPs: BGP 5.5 The SDN control plane 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer: Control Plane
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 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 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 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: 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 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 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 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 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 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: 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 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 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 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 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: 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 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 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 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 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 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 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 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 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. 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 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 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 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: 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 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 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 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 informationCOMP211 Chapter 5 Network Layer: The Control Plane
COMP211 Chapter 5 Network Layer: The Control Plane All material copyright 1996-2016 J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationChapter 5 Network Layer: The Control Plane
Chapter 5 Network Layer: The Control Plane Lu Su Assistant Professor Department of Computer Science and Engineering State University of New York at Buffalo Adapted from the slides of the book s authors
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 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 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 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 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 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 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 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 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 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 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 informationNetwork layer functions. Chapter 4 Network Layer. Network layer functions. Network layer functions
Network layer functions Chapter 4 Network Layer transport packet from sending to receiving hosts layer entity in every host, router functions: path determination: route taken by packets from source to
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 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 204: BGP. Jiasi Chen Lectures: MWF 12:10-1pm Humanities and Social Sciences
CS 204: BGP Jiasi Chen Lectures: MWF 12:10-1pm Humanities and Social Sciences 1403 http://www.cs.ucr.edu/~jiasi/teaching/cs204_spring17/ 1 Overview AS relationships Inter-AS routing BGP Example Paper discussion
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 informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Dr. Nils
More informationNetwork Layer. CMPS 4750/6750: Computer Networks
Network Layer CMPS 4750/6750: Computer Networks 1 Outline Overview of network layer Forwarding (data plane) Routing (control plane) The Internet Protocol (IP) Routing in the Internet: OSPF, BGP 2 Network
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 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 informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department of Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Stephan Günther
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 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 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 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 CONTROL PLANE
NETWORK LAYER CONTROL PLANE 1 GOALS Understand principles behind network control plane Traditional routing algorithms SDN controlllers Internet Control Message Protocol Network management And their instantiation,
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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer
Chapter 4 Network Laer A note on the use of these ppt slides: We re making these slides freel available to all (facult, students, readers). The re in PowerPoint form so ou can add, modif, and delete slides
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 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 informationInternet Technology. 08. Routing. Paul Krzyzanowski. Rutgers University. Spring CS Paul Krzyzanowski
Internet Technolog 08. Routing Paul Kranoski Rutgers Universit Spring 06 March, 06 CS 0-06 Paul Kranoski Routing algorithm goal st hop router = source router last hop router = destination router router
More informationNetwork Layer: Routing. Routing. Routing protocol. Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links
Network Layer: Routing 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 can add, modify, and delete
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 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 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 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 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 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 informationChapter 4: Network Layer
Mecanismes d Echange d Informations 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
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 information