ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
|
|
- Julie Booker
- 6 years ago
- Views:
Transcription
1 ELEC / COMP 177 Fall 2010 Some slides from Kurose and Ross, Computer Networking, 5 th Edition
2 Project #2 Due Thursday, Nov 10 th Homework #5 Due Thursday, Nov 17 th Later this semester: Homework #6 - Presentation on security/privacy Topic selection Due Tuesday, Nov 22 nd Slides Due Monday, Nov 28 th Present! Tuesday, Nov 29 th (and Thursday?) Project #3 Due Tue, Dec 6 th 2
3 Forwarding Move packets from router s input to appropriate router output Router does a longest prefix match (LPM) on entries in the forwarding table to determine output port Routing Determine path (route) taken by packets from source to destination Routing algorithms 3
4 Global Information All routers have complete topology, link cost info link state algorithms Decentralized Router knows physically- connected neighbors and link costs to neighbors Iterative process of computation, exchange of info with neighbors distance vector algorithms 4
5 Network topology and link costs are 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 Produces forwarding table for that node Iterative: after k iterations, know least cost path to k destinations Notation: u: the source ( you ) c(x,y): link cost from node x to y; = if not direct neighbors D(v): current value of cost of path from source to dest. v p(v): predecessor node along path from source to v N': set of nodes whose least cost path definitively known 5
6 Step N' u ux uxy uxyv uxyvw uxyvwz D(v),p(v) 2,u 2,u 2,u D(w),p(w) 5,u 4,x 3,y 3,y D(x),p(x) 1,u D(y),p(y) 2,x D(z),p(z) 4,y 4,y 4,y u y x w v z
7 Resulting shortest- path tree from u: Resulting forwarding table in u: u v x w y z destination v x y w z link (u,v) (u,x) (u,x) (u,x) (u,x) 7
8 Iterative, asynchronous: each local iteration caused by: local link cost change DV update message from neighbor Distributed: each node notifies neighbors only when its DV changes neighbors then notify their neighbors if necessary Each node: wait for (change in local link cost or msg from neighbor) recompute estimates if DV to any dest has changed, notify neighbors 8
9 Define: d x (y) := cost of least- cost path from x to y Then: Something I know Something my neighbor told me d x (y) = min {c(x,v) + d v (y) } v where min is taken over all neighbors v of x 9
10 Clearly, d v (z) = 5, d x (z) = 3, d w (z) = 3 u v 2 x w y z B- F equation says: d u (z) = min { c(u,v) + d v (z), c(u,x) + d x (z), c(u,w) + d w (z) } = min {2 + 5, 1 + 3, 5 + 3} = 4 (by way of x!) The node that provides the minimum cost is entered in the router forwarding table as the next hop 10
11 When a link cost changes: node detects local link cost change updates routing info, recalculates distance vector if DV changes, notify neighbors x 1 4 y 50 1 z Good news travels fast At time t 0, y detects the link- cost change, updates its DV, and informs its neighbors. At time t 1, z receives the update from y and updates its table. It computes a new least cost to x and sends its neighbors its DV. At time t 2, y receives z s update and updates its distance table. y s least costs do not change and hence y does not send any message to z. 11
12 Bad news travels slow Previously: D y (x)=4, D y (z)=1, D z (y)=1, D z (x)=5 At time t 0, y detects the link- cost change. What is D y (x)? D y (x) = min{c(y,x)+d x (x), c(y,z)+d z (x)} = {60+0, 1+5} = 6 This best route is wrong, but y doesn t know that! y updates its DV, and informs its neighbors. 60 x 4 y 50 1 z At time t 1, z receives the update from y and updates its table. D z (x) = min{c(z,x)+d x (x), c(z,y)+d y (x)} = {50+0, 1+6} = 7 This best route is also wrong, but z doesn t know that! Now we have an infinite loop! z computes a new least cost to x and sends its neighbors its DV. Count to Infinity Problem we escape this once z learns that its least- cost path to x is the direct link (cost 50), as the cost through y keeps incrementing ( counting ) upwards by 1 each iteration 12
13 Poisoned- reverse solution If z routes to x through y, then z advertises to y that its distance to x is infinity Prevents y from creating a routing loop through z Doesn t work for more complicated networks (loops involving 3 or more routers) x 4 y 50 1 z 13
14 Continue discussing network layer Routing algorithms used in the Internet Routing Information Protocol (RIP) Open Shortest Path First (OSPF) Border Gateway Protocol (BGP) 14
15 Our routing discussion thus far has been idealized All routers are identical The network is flat This is not true in practice! Problem 1 Scale Hundreds of millions of destinations: Can t store all destinations in routing tables! Routing table exchange would swamp links! Distance- vector would never converge Problem 2 - Administrative autonomy Internet = network of networks Each network admin wants to control routing in his/her own network 15
16 Aggregate routers into regions (aka autonomous systems - AS) Routers in same AS run same routing protocol Intra- AS routing protocol Routers in different AS can run different intra- AS routing protocol Gateway router Direct link to router in another AS 16
17 The Internet uses hierarchical routing The Internet is split into Autonomous Systems Independent networks on the Internet Typically owned/controlled by a single entity Share a common routing policy Example autonomous systems Pacific (18663), Exxon (1766), IBM (16807), Level3 (3356) Different routing protocols within and between autonomous systems Interior gateway/routing protocol (e.g. OSPF) Border gateway protocol (e.g. BGP) 17
18 AS A AS B AS C BGP BGP Interior Routing Protocol Interior Routing Protocol Interior Routing Protocol Stub AS Transit AS e.g. backbone service provider Stub AS 18
19 AS A Forwarding table configured by both intra- and inter- AS routing algorithm Intra- AS sets entries for internal destinations Inter- AS & intra- As sets entries for external destinations Interior Routing Protocol Intra-AS Routing algorithm Inter-AS Routing algorithm Stub AS Forwarding table 19
20 Routing inside the autonomous system Also known as Interior Gateway Protocols (IGP) Most common Intra- AS routing protocols: RIP: Routing Information Protocol OSPF: Open Shortest Path First IGRP: Interior Gateway Routing Protocol (Cisco proprietary) 20
21 21
22 Distance vector algorithm Included in BSD- UNIX Distribution in 1982 Distance metric: # of hops (max = 15 hops) From router A to subnets: z u A C B D v y w x destination hops u 1 v 2 w 2 x 3 y 3 z 2 22
23 Distance vectors Exchanged among neighbors every 30 seconds via Response Message (also called advertisement) Each advertisement lists up to 25 destination subnets within AS 23
24 w x y A D B C Routing/Forwarding table in D: Destination Network Next Router # of Hops to Destination w A 2 y B 2 z B 7 x z 24
25 Dest Next Hops w x z C 4 w x y A D B Advertisement from A to D z C Routing/Forwarding table in D: Destination Network Next Router # of Hops to Destination w A 2 y B 2 z B A 7 5 x
26 If no advertisement heard after 180 sec, the neighbor/link declared dead Failure recovery Routes via neighbor invalidated New advertisements sent to neighbors Neighbors in turn send out new advertisements (if tables changed) Link failure info quickly propagates to entire net 26
27 27
28 Networks are partitioned into areas OSPF only runs within a specific area Other protocols (i.e., BGP) used to route outside an area Link- state algorithm Each node has full topology map Route computation using Dijkstra s algorithm 28
29 Routers periodically send hello and link state packets to their neighbors Learn who your neighbors are dynamically Decide link/router down if no more hellos Announce changes to the topology Broadcast throughout the area Carried in OSPF messages directly over IP (rather than TCP or UDP 29
30 Router link advertisements Sent by all routers State and cost of the router s links to the area Network link advertisements Sent only by designated routers Describes all routers attached to the network Summary link advertisements Sent only by area border routers Describes routes to other areas AS external link advertisements Sent only by AS boundary routers Describes routes to other autonomous systems 30
31 Link state packets (LSP) delivered throughout the area Flooded throughout the area Sequence numbers and TTLs Reliable Flooding If newer sequence number, then forward packet over all links other than the ingress link, otherwise drop packet Resend unacknowledged packets Link State Detection If no hello packets during dead interval, assume link is down 31
32 Security: all OSPF messages authenticated To prevent malicious intrusion Multiple same- cost paths allowed Only one path in RIP For each link, multiple cost metrics for different TOS (e.g., satellite link cost set low for best effort; high for real time) Hierarchical OSPF in large domains 32
33 33
34 Two- level hierarchy: local area, backbone. Link- state advertisements only in area each nodes has detailed area topology; only know direction (shortest path) to nets in other areas. Area border routers: summarize distances to nets in own area, advertise to other Area Border routers. Backbone routers: run OSPF routing limited to backbone. Boundary routers: connect to other AS s 34
35 OSPF doesn t scale Broadcasts all link states to all routers Calculates shortest path to all routers Autonomous systems are independent Run by different organizations May use different link cost metrics 35
36 Need a border gateway protocol Global routing protocol across autonomous systems Global connectivity is at stake! Must settle on one protocol What are the requirements? Scalability Flexibility in choosing routes 36
37 37
38 BGP is the de facto standard BGP provides each AS a means to: Obtain subnet reachability information from neighboring ASs Propagate reachability information to all routers inside an AS Determine good routes to subnets based on reachability information and policy Allows subnet to advertise its existence to rest of Internet: I am here 38
39 Pairs of routers (BGP peers) exchange routing info over semi- permanent TCP connections: BGP sessions BGP sessions need not correspond to physical links. When AS2 advertises a prefix to AS1: AS2 promises it will forward datagrams towards that prefix. AS2 can aggregate prefixes in its advertisement 3c 3a 3b AS3 1a AS1 1c 1d ebgp session ibgp session 1b 2a AS2 2c 2b 39
40 Using ebgp session between 3a and 1c, AS3 sends prefix reachability info to AS1. 1c can then use ibgp do distribute new prefix info to all routers in AS1 1b can then re- advertise new reachability info to AS2 over 1b- to- 2a ebgp session When router learns of new prefix, it creates entry for prefix in its forwarding table. 3c 3a 3b AS3 1a AS1 1c 1d ebgp session ibgp session 1b 2a AS2 2c 2b 40
41 BGP uses path vectors (AS_PATH) Advertises complete paths a list of autonomous systems The network /16 can be reached via the path {AS1, AS5, AS13} Makes no use of distance vectors or link states Path selection Supports classless inter- domain routing Paths with loops are detected locally and ignored Local policies pick the preferred path among options When a link/router fails, the path is withdrawn 41
42 Advertised prefix includes BGP attributes. prefix + attributes = route Two important attributes: AS- PATH: contains ASs through which prefix advertisement has passed: e.g, AS 67, AS 17 NEXT- HOP: indicates specific internal- AS router to next- hop AS. (may be multiple links from current AS to next- hop- AS) When gateway router receives route advertisement, uses import policy to accept/ decline 42
43 Router may learn about more than 1 route to some prefix Must select best route Elimination rules: 1. Local preference value attribute: policy decision 2. Shortest AS- PATH 3. Closest NEXT- HOP router: hot potato routing 4. Additional criteria 43
44 BGP messages exchanged using TCP. BGP messages: OPEN: opens TCP connection to peer and authenticates sender UPDATE: advertises new path (or withdraws old) KEEPALIVE keeps connection alive in absence of UPDATES; also ACKs OPEN request NOTIFICATION: reports errors in previous msg; also used to close connection 44
45 Transit AS (i.e., ISP) Non- transit AS (i.e., company) Transit AS (i.e., ISP) Traffic shouldn t flow through the non- transit AS Paying ISPs for connectivity, not to route traffic for them! Don t advertise any BGP routes between transit AS s Pacific is dual- homed to TCTC (Time Warner) and SWIS (AT&T) 45
46 W A B C X Legend: provider network customer network Y A advertises path AW to B B advertises path BAW to X Should B advertise path BAW to C? No way! B gets no $$$ for routing CBAW since neither W nor C are customers of B B wants to force C to route to w via A B wants to route only to/from its customers! 46
47 Policy Inter- AS: admin wants control over how its traffic is routed and who routes through its net Intra- AS: single admin, so no policy decisions needed Scale Hierarchical routing saves table size and reduces update traffic Performance Intra- AS: can focus on performance Inter- AS: policy may dominate over performance 47
48 dhcp :~ shafer$ traceroute -a traceroute to ( ), 64 hops max, 52 byte packets 1 [AS0] ( ) ms ms ms 2 [AS0] ( ) ms ms ms 3 [AS4323] sjc1-pr1-xe us.twtelecom.net ( ) ms ms ms 4 [AS6453] if core3.sqn-sanjose.as6453.net ( ) ms * [AS6453] if core3.sqn-sanjose.as6453.net ( ) ms 5 [AS6453] if mcore4.pdi-paloalto.as6453.net ( ) ms [AS6453] if mcore4.pdi-paloalto.as6453.net ( ) ms [AS6453] if mcore4.pdi-paloalto.as6453.net ( ) ms 6 [AS11029] if mcore3.njy-newark.as6453.net ( ) ms ms ms 7 [AS15706] if core1.fv0-frankfurt.as6453.net ( ) ms ms ms 8 [AS15706] if core1.fr1-frankfurt.as6453.net ( ) ms ms ms 9 [AS6453] if core1.stk-stockholm.as6453.net ( ) ms ms ms 10 [AS6453] ix core1.stk-stockholm.as6453.net ( ) ms ms ms 11 [AS3267] b57-1-gw.spb.runnet.ru ( ) ms ms ms 12 [AS3267] bl16-1-gw.spb.runnet.ru ( ) ms ms ms 13 [AS3267] bm18-1-gw.spb.runnet.ru ( ) ms ms ms 14 [AS3267] tv11-1-gw.msk.runnet.ru ( ) ms ms ms 15 [AS3267] m9-2-gw.msk.runnet.ru ( ) ms ms ms 16 [AS3267] msu.msk.runnet.ru ( ) ms ms ms 17 [AS2848] ( ) ms ms ms 18 [AS2848] ( ) ms!z ms!z ms!z 48
49 AS Name 0 Reserved (local use) Pacific is here 4323 Time Warner Telecom 6453 Tata Communications A Tier- 1 ISP headquartered in India This is their Canada- based AS number Tata Communications (again!) Strange registry entry corporate buyout? Tata Communications (yet again!) Strange registry entry corporate buyout? 3267 Runnet - State Institute of Information Technologies & Telecommunications (SIIT&T "Informika") 2848 Moscow State University 49
50 BGP designed for policy, not performance Susceptible to misconfiguration Intentionally / accidentally announce routes to networks you cannot reach Incompatible policies might render networks unreachable 50
51 1. February Pakistan government orders Pakistan Telecom (AS 17557) to block access to YouTube 2. Pakistan Telecom advertises a route for /24 (YouTube) to its customers leading to a black hole 3. That route is accidentally advertised to its provider (PCCW) This is more specific than YouTube s (AS 36561) real advertisements ( /22) Multiple routes More specific route preferred 4. PCCW failed to verify that Pakistan Telecom actually owned YouTube s netblock (very common) BGP uses transitive trust PCCW trusted P.T., and upstream providers trusted PCCW 5. Within about 3 minutes, a large fraction of the Internet had the bad route YouTube traffic was routed to AS instead of AS AS can then just drop the received traffic 51
52 6. ~1 hour later, YouTube advertises that its addresses have been hijacked to its providers YouTube verifiably owns that address space and its AS number 7. Autonomous systems stop using the bad route YouTube also advertises its own /25 routes 8. ~1 hour later, Pakistan Telecom s provider (Hong Kong- based PCCW) withdraws bogus routes to AS
Chapter 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: 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 Layer UG3 Computer Communications & Networks (COMN) Myungjin Lee myungjin.lee@ed.ac.uk Slides copyright of Kurose and Ross Hierarchical routing our routing study thus far - idealization
More informationChapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services:
NET 331 Computer Networks Lecture 12 Internet Routing Protocols Dr. Anis Koubaa Reformatted slides from textbook Computer Networking a top-down appraoch, Fifth Edition by Kurose and Ross, (c) Pearson Education
More 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 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 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 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 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 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 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 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 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 informationInter-AS routing and BGP. Network Layer 4-1
Inter-AS routing and BGP Network Layer 4-1 Review: intra-as routing v Also known as interior gateway protocols (IGP) v Most common intra-as routing protocols: RIP: Routing Information Protocol, distance
More informationRouting 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationLecture 4. The Network Layer (cont d)
Lecture 4 The Network Layer (cont d) Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest Path First Protocols
More informationChapter 5 Network Layer: The Control Plane
Chapter 5 Network Layer: The Control Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you
More 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 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 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 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 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 informationELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ELEC / COMP 177 Fall 2011 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Homework #6 - Presentation on security/ privacy Topic selection Due Tuesday, Nov 22 nd Slides Due Monday, Nov
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. 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationRouting. Jens A Andersson Communication Systems
Routing Jens A Andersson Communication Systems R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 R5 10 Router A router is a type of internetworking device that passes data
More informationRouting Unicast routing protocols
Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type
More 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 informationBorder Gateway Protocol (BGP)
Advanced Computer Networking CYBR 230 Jeff Shafer University of the Pacific Border Gateway Protocol (BGP) 2 Overview Advanced Computer Networking Fall 2018 3 Ethernet Switch How does a switch learn the
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: Part II
4: Network Laer Chapter 4: Network Laer: Part II (last revision 9/04/05. v3) 4. Introduction 4. Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format
More informationInternet Routing : Fundamentals of Computer Networks Bill Nace
Internet Routing 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Looking Ahead Lab #2 just due Quiz #2
More 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 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 informationDepartment of Computer and IT Engineering University of Kurdistan. Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri
Department of Computer and IT Engineering University of Kurdistan Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri Internet structure: network of networks local ISP Tier
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 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 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. The Global Internet (Then) The Global Internet (And Now) 10/4/16. Fall 2016
CS 457 Networking and the Internet Fall 2016 The Global Internet (Then) The tree structure of the Internet in 1990 The Global Internet (And Now) A simple multi-provider Internet 1 The Global Internet Some
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 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 5 Network Layer: The Control Plane
Chapter 5 Network Layer: The Control Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you
More informationCSC 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 informationDynamic Routing. The Protocols
Dynamic Routing The Protocols Desirable Characteristics of Dynamic Routing Automatically detect and adapt to topology changes Provide optimal routing Scalability Robustness Simplicity Rapid convergence
More 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 informationUnit 3: Dynamic Routing
Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about
More informationNetwork Layer: Routing
Network Layer: Routing The Problem A B R 1 R 2 R 4 R 3 Goal: for each destination, compute next hop 1 Lecture 9 2 Basic Assumptions Trivial solution: Flooding Dynamic environment: links and routers unreliable:
More 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 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 informationCNT Computer and Network Security: BGP Security
CNT 5410 - Computer and Network Security: BGP Security Professor Kevin Butler Fall 2015 Internet inter-as routing: BGP BGP (Border Gateway Protocol): the de facto standard BGP provides each AS a means
More informationChapter 4: Network Layer. Chapter 4 Network Layer. Chapter 4: Network Layer. Network layer. Chapter goals:
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 004. Chapter 4: Network Layer Chapter goals: understand principles
More informationNetwork 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 informationRouting on the Internet! Hierarchical Routing! The NSFNet 1989! Aggregate routers into regions of autonomous systems (AS)!
Routing on the Internet! Hierarchical Routing! Aggregate routers into regions of autonomous systems (AS)! In the beginning there was the ARPANET:! route using GGP (Gateway-to-Gateway Protocol)," a distance
More informationIP Addressing & Interdomain Routing. Next Topic
IP Addressing & Interdomain Routing Next Topic IP Addressing Hierarchy (prefixes, class A, B, C, subnets) Interdomain routing Application Presentation Session Transport Network Data Link Physical Scalability
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 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 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 informationInter-Autonomous-System Routing: Border Gateway Protocol
Inter-Autonomous-System Routing: Border Gateway Protocol Antonio Carzaniga Faculty of Informatics University of Lugano June 14, 2005 Outline Hierarchical routing BGP Routing Routing Goal: each router u
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 informationCS118 Discussion Week 7. Taqi
CS118 Discussion Week 7 Taqi Outline Hints for project 2 Lecture review: routing About Course Project 2 Please implement byte-stream reliable data transfer Cwnd is in unit of bytes, not packets How to
More 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 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 informationCOMP/ELEC 429 Introduction to Computer Networks
COMP/ELEC 429 Introduction to Computer Networks Lecture 11: Inter-domain routing Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at
More informationCS4700/CS5700 Fundamentals of Computer Networks
CS4700/CS5700 Fundamentals of Computer Networks Lecture 12: Inter-domain routing Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu
More informationCS321: Computer Networks Unicast Routing
CS321: Computer Networks Unicast Routing Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Introduction The goal of the network layer is deliver a datagram from
More informationInter-Autonomous-System Routing: Border Gateway Protocol
Inter-Autonomous-System Routing: Border Gateway Protocol Antonio Carzaniga Faculty of Informatics University of Lugano December 10, 2014 Outline Hierarchical routing BGP Routing 2005 2007 Antonio Carzaniga
More informationNetwork layer. Network Layer 4-1. application transport network data link physical. network data link physical. network data link physical
Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on receiving side, delivers segments to transport layer network layer protocols in every
More informationRouting on the Internet. Routing on the Internet. Hierarchical Routing. Computer Networks. Lecture 17: Inter-domain Routing and BGP
Routing on the Internet Computer Networks Lecture 17: Inter-domain Routing and BGP In the beginning there was the ARPANET: route using GGP (Gateway-to-Gateway Protocol), a distance vector routing protocol
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 information