11/13/2017 Network Layer (SSL) Network-layer functions. Recall the two network-layer functions:
|
|
- Shanon Montgomery
- 5 years ago
- Views:
Transcription
1 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 Protocol 5.7 Network management and SNMP Network Laer (SSL) 5- Network-laer functions Recall the two network-laer functions: forwarding: move packets from device inputs to device outputs data routing: determine route taken b each packet from its source to control destination Two approaches to structure network control : per-router control (routers echange messages) logicall centralied control (SDN) Network Laer (SSL) 5-2
2 Per-router control Individual processes in routers interact with each other b message echange and compute forwarding tables Routing Algorithm control data Network Laer (SSL) 5-3 Graph abstraction 5 Graph: G = (N,E) N = set of routers = { u, v, w,,, } 2 u v w 5 2 E = set of links ={ (u,v), (u,), (v,), (v,w), (,w), (,), (w,), (w,), (,) } Remark: Graph abstraction is also useful in other network contets Eample: P2P, where N is set of peers and E is set of TCP connections Network Laer (SSL) 5-4 2
3 Graph abstraction: link costs u 2 5 c(, ) = cost of link (, ) v 3 w cost could be, or inversel 5 proportional to bandwidth, etc Cost of path (, 2, 3,, p ) = c(, 2 ) + c( 2, 3 ) + + c( p-, p ) Routing protocol tries to find least-cost paths cost of path computation is ad hoc if the link cost metric is not additive what if links have asmmetric costs for opposite directions? eample if queueing delas are included, then use a directed graph as model Network Laer (SSL) 5-5 Routing Algorithm classification Global or decentralied information? Global info: all routers have complete topolog, link costs link state protocols Static or dnamic? Static update onl after topolog change Decentralied info: router knows phsicallconnected neighbors, link costs to neighbors distance vector protocols Dnamic periodic update in response to link cost changes ma result in route flaps Network Laer (SSL) 5-6 3
4 Chapter 5: outline 5. introduction 5.2 routing protocols link state distance vector 5.3 intra-as routing in the Internet 5.4 routing among the ISPs: BGP 5.5 The SDN control 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer (SSL) 5-7 A Link-State Routing protocol net topolog, link costs known to ever node accomplished via link state broadcast all nodes have same info Dijkstra s algorithm (ou should have learned it) computes least cost paths from one node ( source ) to all other nodes in a graph iterative: after k iterations, source knows least-cost paths to k destinations ields forwarding table for source node Network Laer (SSL) 5-8 4
5 Link State Broadcast Flooding Source node of link state t sends packets B C to all neighbors Intermediate node A resends to neighbors ecept where packet arrived Man duplicates D E which must be recognied b nodes F Network Laer (SSL) 5-9 Distance Vector Algorithm basis Bellman-Ford Equation (dnamic programming) Define d () := cost of least-cost path from to Then d () = min {c(,v) + d v () v } where min is taken over all neighbors v of Network Laer (SSL) 5-0 5
6 Bellman-Ford eample u 2 Clearl, d v () = 5, d () = 3, d w () = 3 B-F equation sas: 5 d u () = min { c(u,v) + d v (), v 3 w c(u,) + d (), 5 c(u,w) + d w () } 2 = min {2 + 5, 3 + 3, } = 4 The node that achieves minimum is net hop in shortest path put it in forwarding table Network Laer (SSL) 5- Distance Vectors Protocol () Node knows each neighbor v: c(,v) sends its own distance vector (DV) estimate [D X (): є N ] to its neighbors periodicall where D () denotes estimate of least cost from to From each neighbor v, receives [D v (): є N ] Network Laer (SSL) 5-2 6
7 Distance Vector Protocol (2) When a node receives a new DV estimate from a neighbor, it updates its own DV estimate using B-F equation: D () min v {c(,v) + D v ()} for each node N If the v that achieves least is new, node updates its forwarding table and DV Eventuall, assuming that link costs and topolog do not change, the estimate D () converges to the actual least cost d () for all, Network Laer (SSL) 5-3 Distance Vector Protocol - summar Distributed, iterative, asnchronous Initiall, D () = c(,) if and are direct neighbors; otherwise, D () = Each node: waits for a change in local link cost or a msg from a neighbor recomputes estimates if DV estimate for an dest has changed, updates its own state and notifies its neighbors Network Laer (SSL) 5-4 7
8 =min{2+0,7+} =2 node table node table fr rom from from D () = min{c(,) + D (), c(,) + D ()} 2 0 node table 7 0 fr rom D () = min{c(,) + D (), c(,) + D ()} =min{2+,7+0} =3 update outgoing interface for dest o Each row in a table is a distance vector o Assume snchronous operations for this eample and also received their DV updates 2 7 time Network Laer (SSL) 5-5 node table node table fr rom from 2 0 node table 7 0 from fr rom from from fro om from No more change time Network Laer (SSL) 5-6 from 2 7 8
9 Distance Vector: good news travels fast detects a lower link, updates its DV, and sends new DV to node. receives s s updated DV, updates its own DV, and sends new DV to its neighbors. 4 later, receives s updated DV. s least costs do not change. 50 A similar interaction between nodes and. The DV protocol converges quickl for good news Network Laer (SSL) 5-7 Distance Vector: count to infinit problem Link cost increase: Y still has stale information saing that it can go to X via Z in 6 44 messages echanged between and before protocol stabilies Poisoned reverse: 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) will this completel solve count to infinit problem? bad news travels slowl! Network Laer (SSL) 5-8 9
10 Chapter 5: outline 5. introduction 5.2 routing protocols link state distance vector 5.3 intra-as routing in the Internet inter-as routing: BGP 5.5 The SDN control 5.6 ICMP: The Internet Control Message Protocol 5.7 Network management and SNMP Network Laer (SSL) 5-9 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 EIGRP (Cisco) distance vector with loopfreedom Network Laer (SSL)
11 RIP ( Routing Information Protocol) distance vector algorithm included in BSD-UNIX Distribution in 982 distance metric: # of hops (ma = 5 hops) From router A to subnets: u v destination hops u A B w v 2 w 2 3 C D 3 2 Network Laer (SSL) 5-2 RIP advertisements distance vectors: echanged with neighbors ever 30 sec via Response Message (also called advertisement) each advertisement: list of up to 25 destination subnets within AS Network Laer (SSL) 5-22
12 RIP Table processing RIP routing tables managed b application-level process called routed (daemon) advertisements sent in UDP packets, periodicall sent routed routed Transprt (UDP) network (IP) link phsical forwarding table forwarding table Transprt (UDP) network (IP) link phsical Network Laer (SSL) 5-23 OSPF (Open Shortest Path First) open : publicl available uses Link State algorithm OSPF advertisement carries one entr per neighbor router advertisements disseminated to entire AS (via flooding) carried in OSPF messages directl over IP (rather than TCP or UDP) securit: all OSPF messages authenticated Note: IS-IS routing protocol: nearl identical to OSPF Network Laer (SSL)
13 Hierarchical OSPF Network Laer (SSL) 5-25 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 Protocol 5.7 Network management and SNMP Network Laer (SSL)
14 Routing among ISPs scale: hundreds of millions destination i subnets: forwarding tables still too large after aggregation of prefies Link State and Distance Vector do not scale administrative autonom internet is a network of networks each network admin wants to control routing in its own network Network Laer (SSL) 5-27 Hierarchical Routing autonomous sstems (ASes) stub vs. transit ASes transit AS has an AS number from ICANN routers in an AS run the same intra-as routing protocol different ASes can run different intra-as routing protocols Gatewa router has direct link to a gatewa router in another AS for inter-as routing Network Laer (SSL)
15 Internet inter-as routing basic ideas Gatewa routers run BGP (Border Gatewa Protocol): the de facto standard an AS advertises its eistence using BGP to rest of Internet: I am here and. gatewa routers echange reachabilit information with neighboring ASes (using eternal BGP on TCP connections) and 2. the propagate p reachabilit information to all internal routers of the AS (using internal BGP on TCP connections); 3. good routes to other ASes selected based on reachabilit information and also polic Network Laer (SSL) 5-29 Forwarding table entries X 3b 3c 3a AS3 a c d b Intra-AS Routing AS Forwarding table Inter-AS Routing 2a 2c 2b AS2 intra-as protocol sets entries for internal destinations inter-as & intra-as protocols set entries for eternal destinations Network Laer (SSL)
16 Eample: Setting forwarding table in router d AS (using ebgp) learns that subnet is reachable via AS3 (gatewa c) but not via AS2 gatewa c (using ibgp) propagates this reachabilit info to all other routers in AS for subnet, router d determines from intra-as routing info that its interface I is on the least cost path to the link (identified b subnet prefi u) between c and 3a installs forwarding table entr (,I) 3c 3a 3b AS3 u a c d b AS 2a 2c 2b AS2 Note: both inter-as and intra-as protocols are used Network Laer (SSL) 5-3 BGP - advertiing paths ebgp session: two BGP routers ( peers ) echange messages advertising paths to various destination network prefies ( path vector protocol) when AS3 advertises a prefi to AS, AS3 promises it will forward datagrams towards that prefi AS3 can aggregate prefies in its advertisement other networks 3c 3a 3b AS3 BGP message c a AS d b 2a 2c 2b AS2 other networks Network Laer (SSL)
17 BGP : distributing path information using ebgp session between 3a and c, AS3 sends prefi reachabilit info to AS. c can then use ibgp to distribute new prefi info to all routers in AS when a router learns of a new prefi, it creates entr for prefi in its forwarding table. in this eample, gatewa router b can then re-advertise such new reachabilit info to AS2 over b-to-2a ebgp session other networks 3b 3a AS3 a AS c d ebgp session ibgp session 2a b 2c 2b AS2 other networks Network Laer (SSL) 5-33 Path attributes & BGP routes advertised prefi includes BGP attributes. prefi + attributes = route two important attributes: AS-PATH: contains ASes through which prefi advertisement has passed: e.g, AS 67, AS 7 NEXT-HOP: the router interface (its subnet IP address) that begins the AS path there ma be multiple links from current AS to net-hop AS when a gatewa router receives route advertisement, it checks for loop uses the AS s import polic to accept or reject route Network Laer (SSL)
18 Eamples of NEXT-HOP for dest X For routers in AS, net-hop is u, path vector is AS3, For routers in AS2, net-hop is v, path vector is AS, AS3, dest X other networks 3b 3a u AS3 a AS c d ebgp session ibgp session 2a b v 2c 2b AS2 other networks Network Laer (SSL) 5-35 BGP route selection router ma learn man routes to the same prefi. Router must select one route Criteria. local preference value attribute (polic decision) Import rule: customer routes are preferred over peer routes, which are preferred over provider routes 2. shortest AS-PATH 6. closest NEXT-HOP router: hot potato routing (additional criteria) Network Laer (SSL)
19 BGP route eport polic eample () W A B C X legend: provider network customer network: Y A,B,C are provider networks X,W,Y are customers (of provider networks) Xi is dual-homed: d attached to two networks X does not want to route from B via itself to C.. so X will not advertise to B that it has a route to C Network Laer (SSL) 5-37 BGP route eport polic eample (2) W A B C A advertises path AW to B B advertises path BAW to X X legend: Should B advertise path BAW to C? Y peer provider networks customer networks: No! B gets no revenue for routing CBAW since neither C nor A nor W is a customer of B B wants to route onl to/from its customers Eport rule: peer/provider routes advertised to customers onl; customer routes advertised to all neighbor ASes Network Laer (SSL)
20 Wh different Intra- and Inter-AS routing? Scale: hierarchical routing reduces table sie, also update traffic Polic (including financial consideration) Intra-AS: single admin, so no polic decisions needed Inter-AS: admin wants control over how its own traffic is routed (b import rule), who routes through its network (b eport rule). ) Performance: Intra-AS: can focus on performance Inter-AS: polic dominates performance Network Laer (SSL) 5-39 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 Protocol 5.7 Network management and SNMP Network Laer (SSL)
21 Software defined networking (SDN) Internet network laer historicall has been implemented via distributed, per-router approach monolithic routers run proprietar implementations of Internet protocol standards (IP, RIP, IS-IS, OSPF, BGP) in proprietar router OS (e.g., Cisco IOS), forwarding packets Other devices in data different middle boes for other network functions: firewalls, load balancers, NAT boes,.. switches for laer-2 forwarding ~2005: rethinking separation of network control from data Network Laer (SSL) 5-4 Software defined networking (SDN) 4. programmable control routing applications access control Remote Controller load balance 3. control functions eternal to data- switches control data CA 2: generalied flowbased forwarding (e.g., OpenFlow) CA CA CA CA. control, data separation Network Laer (SSL)
22 ISP Traffic engineering 5 u 3 v w Q: what if network operator wants to split u-to- traffic along uvw and u (load balancing)? A: can t do it using current protocols based upon shortest-path computation Network Laer (SSL) 5-43 Laers in SDN architecture Network-control apps use network state information provided b SDN controller SDN controller (net OS) maintains network state information, statistics, and flow tables ma be implemented as a distributed sstem for performance and fault-tolerance Data switches fast, simple, commodit switches communicate with controller to provide state information and receive flow tables routing network-control applications access control load balance northbound API SDN Controller (network operating sstem) southbound API control data Network Laer (SSL) 5-44 SDN-controlled switches 22
23 Software defined networking (SDN) Logicall centralied controller controller provides accurate network state information to network-control applications centralied computation of flow tables is easier than distributed computation using protocol messages greater fleibilit and better control of traffic flows Open standards allow unbundling of network functionalit data boes, SDN controllers can be provided d b different vendors Observation: SDN is (mainl) for networks under the same administrative control e.g., Google SDN uses both inter-as and intra-as routing protocols: BGP between datacenters and IS-IS for intra-datacenter Network Laer (SSL) 5-45 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 Protocol 5.7 Network management and SNMP Network Laer (SSL)
24 ICMP: Internet Control Message Protocol above IP in network laer ICMP msgs carried in IP datagrams error reporting: unreachable network, host, port, protocol echo request/repl (used b ping) Tpe Code description 0 0 echo repl (to ping) 3 0 dest. network unreachable 3 dest host unreachable 3 2 dest protocol unreachable 3 3 dest port unreachable 3 6 dest network unknown 3 7 dest host unknown 4 0 source quench (congestion control - not used) 8 0 echo request (ping) ICMP message tpe, code plus first 8 btes of IP datagram causing error 9 0 route advertisement t 0 0 router discover 0 TTL epired 2 0 bad IP header Network Laer (SSL) 5-47 Traceroute uses ICMP messages Source sends series of UDP segments to dest First has TTL = Second has TTL=2,, each with unlikel port number When nth datagram arrives to nth router: Router discards datagram and sends to source a TTL epired message with name of router & IP address When TTL epired message arrives, source calculates RTT Traceroute does this 3 times for each TTL value Stopping criterion for source Such a UDP segment arrives at destination host Destination returns msg dest port unreachable packet Upon receipt of this msg, source stops. Network Laer (SSL)
25 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 Protocol 5.7 Network management and SNMP Network Laer (SSL) 5-49 End of Chapter 5 Network Laer (SSL)
5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet
Chapter 5: outline 5.1 introduction 5.5 The SDN control 5.2 routing protocols plane link state 5.6 ICMP: The Internet distance vector Control Message 5.3 intra-as routing in Protocol the Internet t 5.7
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 4: Network Layer, partb
Chapter 4: Network Layer, partb The slides are adaptations of the slides available by the main textbook authors, Kurose&Ross Network Layer 4-1 Interplay between routing, forwarding routing algorithm local
More informationChapter 4: Network Layer. 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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
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 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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationBGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables
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 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 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 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 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 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 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 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 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 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer. Two Key Network-Layer Functions
当前无法显示此图像 Chapter 4: Network Laer Chapter 4 Network Laer Chapter goals: understand principles behind laer services: laer service models forwarding versus routing how a works routing (path selection) dealing
More informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Key Network-Layer Functions. Network layer.
Chapter 4 Network Laer 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: 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 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 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 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 informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer. Two Key Network-Layer Functions
Chapter 4 Network Laer 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 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 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 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 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 informationHY 335 Φροντιστήριο 8 ο
HY 335 Φροντιστήριο 8 ο Χειμερινό Εξάμηνο 2009-2010 Παπακωνσταντίνου Άρτεμις artpap@csd.uoc.gr 4/12/2009 Roadmap IP: The Internet Protocol IPv4 Addressing Datagram Format Transporting a datagram from source
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 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 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 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 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 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 informationLecture 5 The Network Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 5 The Network Layer part II Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it IP datagram format IP protocol version number header length (bytes) type of data max number remaining
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 information4.5.2 The Distance-Vector (DV) Routing Algorithm
4.5 ROUTING ALGORITHMS 371 highl congested (for eample, high-dela) links. Another solution is to ensure that not all routers run the LS algorithm at the same time. This seems a more reasonable solution,
More 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 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 informationCS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791
CS 457 Networking and the Internet Fall 2016 Indrajit Ray What is Routing A famous quotation from RFC 791 A name indicates what we seek An address indicates where it is A route indicates how we get there
More information