COMP 3331/9331: Computer Networks and Applications

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "COMP 3331/9331: Computer Networks and Applications"

Transcription

1 OMP /9: omputer Networks and pplications Week 9 Network Layer: Routing Reading Guide: hapter 4: Sections 4.5 Network Layer

2 nnouncements v Labs Lab 4 ongestion ontrol Lab 5 Simple Router (start up for ssignment, not marked) Lab 6 Security v Mininet Help Session Monday and Tuesday, : :, Level 5 onsultation Room, SE uilding (K7) Network Layer

3 Network Layer: outline 4. introduction 4. virtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing IMP IPv6 4.5 routing algorithms link state ance vector hierarchical routing 4.6 routing in the Internet RIP OSPF GP 4.7 broadcast and multicast routing Network Layer

4 Interplay between routing, forwarding routing algorithm local forwarding table dest address output link address-range address-range address-range address-range 4 routing algorithm deteres end-end-path through network forwarding table deteres local forwarding at this router IP destination address in arriving packet s header Network Layer 4

5 ontext utonomous and System Terology (S) or omain Region of a network under a single arative entity order Routers End hosts lients, Users End points Route or Path Interior Routers Network Layer 5

6 Internet Routing v Internet Routing works at two levels v Each S runs an intra-domain routing protocol that establishes routes within its domain (S -- region of network under a single arative entity) Link State, e.g., Open Shortest Path First (OSPF) istance Vector, e.g., Routing Information Protocol (RIP) v Ses participate in an inter-domain routing protocol that establishes routes between domains Path Vector, e.g., order Gateway Protocol (GP) Network Layer 6

7 Graph abstraction 5 graph: G = (N,E) u v x w y 5 z N = set of routers = { u, v, w, x, y, z } E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) } aside: graph abstraction is useful in other network contexts, e.g., PP, where N is set of peers and E is set of TP connections Network Layer 7

8 ddressing (abstraction) v ssume each host has a unique I (address) v No particular structure to those Is v Earlier in course we talked about real IP addressing Network Layer 8

9 Graph abstraction: costs u 5 v x w y 5 z c(x,x ) = cost of link (x,x ) e.g., c(w,z) = 5 cost of path (x, x, x,, x p ) = c(x,x ) + c(x,x ) + + c(x p-,x p ) key question: what is the least-cost path between u and z? routing algorithm: algorithm that finds that least cost path Network Layer 9

10 Quiz: How should link costs be detered? : They should all be equal. : They should be a function of link capacity. : They should take current traffic characteristics into account (congestion, delay, etc.). : They should be manually detered by network arators. E: They should be detered in some other way. Network Layer

11 Link ost v Typically simple: all links are equal v Least-cost paths => shortest paths (hop count) v Network operators add policy exceptions Lower operational costs Peering agreements Security concerns Network Layer

12 Quiz: How much information should a router know about the network? : the next hop and cost of forwarding to its neighbour(s) Less state. : the next hop and cost of forwarding to any destination : the status and cost of every link in the network. etter decisions. : some other amount of information Network Layer

13 Routing Table v t a imum, the routing table at U needs to know the next hop for each possible destination Network Layer u y x w v z 5 5 est Next Hop V V X X W X Y X Z X

14 Routing Table est Next Hop ost (Path) 5 V V X X W X 4 Y X Z X 4 u v x w y 5 z v t a imum, the routing table at U needs to know the next hop for each possible destination v Probably want more info (e.g. path cost, may be path itself) v This is a key difference between routing & forwarding Network Layer 4

15 Routing algorithm classes Link State (Global) Routers maintain cost of each link in the network onnectivity/cost changes flooded to all routers onverges quickly (less inconsistency, looping, etc.) Limited network sizes istance Vector (ecentralised) Routers maintain next hop & cost of each destination. onnectivity/cost changes iteratively propagate form neighbour to neighbour Requires multiple rounds to converge Scales to large networks Network Layer 5

16 Network Layer: outline 4. introduction 4. virtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing IMP IPv6 4.5 routing algorithms link state ance vector hierarchical routing 4.6 routing in the Internet RIP OSPF GP 4.7 broadcast and multicast routing Network Layer 6

17 Link State Routing v Each node maintains its local link state (LS) i.e., a list of its directly attached links and their costs Host (N,N) (N,N4) (N,N5) Host Host N N N N5 Host N4 Host E N6 N7 Network Layer 7

18 Link State Routing v Each node maintains its local link state (LS) v Each node floods its local link state on receiving a new LS message, a router forwards the message to all its neighbors other than the one it received the message from Host Host Host (N,N) (N, N4) (N, N5) N N4 (N,N) (N, N4) (N, N5) (N,N) (N, N4) (N, N5) (N,N) (N, N4) (N, N5) (N,N) (N, N4) (N, N5) N N5 (N,N) (N, N4) (N, N5) (N,N) (N, N4) (N, N5) N (N,N) (N, N4) (N, N5) Host Host E (N,N) (N, N4) (N, N5) N6 (N,N) (N, N4) (N, N5) N7 Network Layer 8

19 Flooding LSs v Routers transmit Link State dvertisement (LS) on links neighbouring router forwards out on all links except incog Keep a copy locally; don t forward previously-seen LSs v hallenges Packet loss Out of order arrival v Solutions cknowledgements and retransmissions Sequence numbers Time-to-live for each packet Network Layer 9

20 Link State Routing v Each node maintains its local link state (LS) v Each node floods its local link state v Hence, each node learns the entire network topology an use ijkstra s to compute the shortest paths between nodes Host Host Host E E N N N E N5 E Host N4 E Host E E N6 E N7 Network Layer

21 Link-State Routing lgorithm ijkstra s algorithm v net topology, link costs known to all nodes accomplished link state broadcast all nodes have same info v computes least cost paths from one node ( source ) to all other nodes gives forwarding table for that node v iterative: after k iterations, know least cost path to k dest. s notation: v c(x,y): link cost from node x to y; = if not direct neighbors v (v): current value of cost of path from source to dest. v v p(v): predecessor node along path from source to v v N': set of nodes whose least cost path definitively known Network Layer

22 ijsktra s lgorithm Initialization: N' = {u} for all nodes v 4 if v adjacent to u 5 then (v) = c(u,v) 6 else (v) = 7 8 Loop 9 find w not in N' such that (w) is a imum add w to N' update (v) for all v adjacent to w and not in N' : (v) = ( (v), (w) + c(w,v) ) /* 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 Layer

23 Example: ijkstra s lgorithm Step 4 5 Set N (),p(), (),p() 5, (),p(), (E),p(E) (F),p(F) 5 E 5 F Initialization: N = {}; for all nodes v 4 if v adjacent to 5 then (v) = c(,v); 6 else (v) = ; Network Layer

24 Example: ijkstra s lgorithm Step 4 5 Set N 5 (),p(), E 5 (),p() 5, F (),p(), (E),p(E) (F),p(F) 8 Loop 9 find w not in N s.t. (w) is a imum; add w to N ; update (v) for all v adjacent to w and not in N : If (w) + c(w,v) < (v) then (v) = (w) + c(w,v); p(v) = w; 4 until all nodes in N ; Network Layer

25 Example: ijkstra s lgorithm Step 4 5 Set N 5 (),p(), E 5 (),p() 5, F (),p(), (E),p(E) (F),p(F) 8 Loop 9 find w not in N s.t. (w) is a imum; add w to N ; update (v) for all v adjacent to w and not in N : If (w) + c(w,v) < (v) then (v) = (w) + c(w,v); p(v) = w; 4 until all nodes in N ; Network Layer 5

26 Example: ijkstra s lgorithm Step 4 5 Set N 5 (),p(), E 5 (),p() 5, 4, F (),p(), (E),p(E), (F),p(F) 8 Loop 9 find w not in N s.t. (w) is a imum; add w to N ; update (v) for all v adjacent to w and not in N : If (w) + c(w,v) < (v) then (v) = (w) + c(w,v); p(v) = w; 4 until all nodes in N ; Network Layer 6

27 Example: ijkstra s lgorithm Step 4 5 Set N E 5 (),p(), E 5 F (),p() 5, 4,,E (),p(), (E),p(E), (F),p(F) 4,E 8 Loop 9 find w not in N s.t. (w) is a imum; add w to N ; update (v) for all v adjacent to w and not in N : If (w) + c(w,v) < (v) then (v) = (w) + c(w,v); p(v) = w; 4 until all nodes in N ; Network Layer 7

28 Example: ijkstra s lgorithm Step 4 5 Set N E E 5 (),p(), E 5 F (),p() 5, 4,,E (),p(), (E),p(E), (F),p(F) 4,E 8 Loop 9 find w not in N s.t. (w) is a imum; add w to N ; update (v) for all v adjacent to w and not in N : If (w) + c(w,v) < (v) then (v) = (w) + c(w,v); p(v) = w; 4 until all nodes in N ; Network Layer 8

29 Example: ijkstra s lgorithm Step 4 5 Set N E E E 5 (),p(), E 5 F (),p() 5, 4,,E (),p(), (E),p(E), (F),p(F) 4,E 8 Loop 9 find w not in N s.t. (w) is a imum; add w to N ; update (v) for all v adjacent to w and not in N : If (w) + c(w,v) < (v) then (v) = (w) + c(w,v); p(v) = w; 4 until all nodes in N ; Network Layer 9

30 Example: ijkstra s lgorithm Step 4 5 Set N E E E EF 5 (),p(), E 5 F (),p() 5, 4,,E (),p(), (E),p(E), (F),p(F) 4,E 8 Loop 9 find w not in N s.t. (w) is a imum; add w to N ; update (v) for all v adjacent to w and not in N : If (w) + c(w,v) < (v) then (v) = (w) + c(w,v); p(v) = w; 4 until all nodes in N ; Network Layer

31 Example: ijkstra s lgorithm Step 4 5 Set N E E E EF (),p(), (),p() 5, 4,,E (),p(), (E),p(E), (F),p(F) 4,E 5 E 5 F To detere path (say), work backward from p(v) Network Layer

32 The Forwarding Table Running ijkstra at node gives the shortest path from to all destinations We then construct the forwarding table resulting shortest-path tree from : estination Link (,) (,) F (,) E E (,) F (,) Network Layer

33 ijkstra s algorithm: example (v) p(v) (w) p(w) (x) p(x) (y) p(y) (z) p(z) Step N' u 7,u,u 5,u uw 6,w 5,u,w uwx 6,w,w 4,x uwxv,v 4,x 4 uwxvy,y 5 uwxvyz notes: v v construct shortest path tree by tracing predecessor nodes ties can exist (can be broken arbitrarily) u 5 x w v y z Network Layer

34 Practice Problem Network Layer 4

35 Issue #: Scalability v How many messages needed to flood link state messages? O(N x E), where N is #nodes; E is #edges in graph v Processing complexity for ijkstra s algorithm? O(N ), because we check all nodes w not in S at each iteration and we have O(N) iterations more efficient implementations: O(N log(n) +E) using -heap v How many entries in the LS topology database? O(E) v How many entries in the forwarding table? O(N) Network Layer 5

36 Issue#: Transient isruptions v Inconsistent link-state database Some routers know about failure before others The shortest paths are no longer consistent an cause transient forwarding loops F F E Loop! E and think that this is the path to E thinks that this is the path to Network Layer 6

37 Oscillations oscillations possible: v e.g., support link cost equals amount of carried traffic: +e e +e +e +e +e +e +e e initially given these costs, find new routing. resulting in new costs given these costs, find new routing. resulting in new costs given these costs, find new routing. resulting in new costs Network Layer 7

38 Network Layer: outline 4. introduction 4. virtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing IMP IPv6 4.5 routing algorithms link state ance vector hierarchical routing 4.6 routing in the Internet RIP OSPF GP 4.7 broadcast and multicast routing Network Layer 8

39 How istance-vector (V) works estinations From node to to to Neighbour (next-hop) (, ): shortest ance from to Each router maintains its shortest ance to every destination each of its neighbours Network Layer 9

40 How istance-vector (V) works MIN { (,), (, ) } s ance From node vector (V) to to to to to to Each router computes its shortest ance to every destination any of its neighbors Network Layer 4

41 How istance-vector (V) works From node to?? to?? to?? s V to? to? to? How does initialize its () table and V? Network Layer 4

42 How istance-vector (V) works Link costs How does initialize its () table and V? Network Layer 4

43 How istance-vector (V) works From node s V to c(,) to c(,) to c(,) to c(,) to to Each router initializes its () table based on its immediate neighbors and link costs Network Layer 4

44 How istance-vector (V) works From node to c(,) to c(,) to s V to c(,) 5 to c(,) 6 to Each router sends its V to its immediate neighbors Network Layer 44

45 How istance-vector (V) works s V to 5 From node to 5 s V to 5 to 6 to 5 to to to to Routers process received Vs Network Layer 45

46 How istance-vector (V) works s V to 5 From node to 5 s V to 5 to 6 to 5 to to to to 7 7 new = c(,) + (, ) ) Routers process received Vs nd repeat Network Layer 46

47 istance Vector Routing v Each router knows the links to its neighbors v Each router has provisional shortest path to every other router -- its ance vector (V) v Routers exchange this V with their neighbors v Routers look over the set of options offered by their neighbors and select the best one v Iterative process converges to set of shortest paths Network Layer 47

48 istance vector routing iterative, asynchronous: each local iteration caused by: v local link cost change v V update message from neighbor ributed: v each node notifies neighbors only when its V changes neighbors then notify their neighbors if necessary each node: wait for (change in local link cost or msg from neighbor) recompute estimates if V to any dest has changed, notify neighbors Network Layer 48

49 istance Vector v v v c(i,j): link cost from node i to j Z (,V): shortest. from to V Z (,V): shortest. from to V t node Initialization: for all destinations V do if V is neighbor of 4 V (, V) = (,V) = c(,v); 5 else 6 V (, V) = (,V) = ; 7 send (, *) to all neighbors loop: 8 wait (until sees a link cost change to neighbor V /* case */ 9 or until receives (V,*) from neighbor V) /* case */ if (c(,v) changes by ±d) /* case */ for all destinations Y do V (,Y) = V (,Y) ± d else /* case : */ 4 for all destinations Y do 5 V (,Y) = c(,v) + (V, Y); 6 update (,*) 5 if (there is a change in (, *)) 6 send (, *) to all neighbors 7 forever Network Layer 49

50 istance Vector v v v c(i,j): link cost from node i to j Z (,V): shortest. from to V Z (,V): shortest. from to V t node Initialization: for all destinations V do if V is neighbor of 4 V (, V) = (,V) = c(,v); 5 else 6 V (, V) = (,V) = ; 7 send (, *) to all neighbors loop: 8 wait (until sees a link cost change to neighbor V /* case */ 9 or until receives (V,*) from neighbor V) /* case */ if (c(,v) changes by ±d) /* case */ for all destinations Y do V (,Y) = V (,Y) ± d else /* case : */ 4 for all destinations Y do 5 V (,Y) = c(,v) + (V, Y); 6 update (,*) 5 if (there is a change in (, *)) 6 send (, *) to all neighbors 7 forever Network Layer 5

51 Example: Initialization from Node to to to from Node to to to to from Node to - - to to 7 to to to to 7 7 to 7 to - - from Node to 7 to to to 7

52 Example: sends update to from Node to to to from Node to to to to from Node to - - to to 7 to 7 7 to - - from Node to 7 to to to 7

53 Example: sends update to from Node to - - to to 7 to 7 7 7

54 Example: sends update to from Node to - - to 8 to 7 to

55 Example: sends update to from Node to - - to 8 7 to 7 7 to 8 8

56 Example: now sends update to from Node to to to from Node to to to to from Node to - - to 8 to 7 to to - - from Node to 7 to to to 7

57 Example: now sends update to from Node to to to from Node to to to to from Node to - - to 8 to 7 to to - - from Node to 7 to to to 7

58 Example: now sends update to from Node to to to to from Node to - - to 8 to 7 to from Node from Node to to to to - - Make sure you know why this is 5, not 4! to 7 to to to 7

59 Example: now sends update to from Node to to to from Node to to to to from Node to - - to 8 to 7 to to - - from Node to 7 to to to 7

60 ll nodes knows the best two-hop paths. Make sure you understand why Make some sure entries you believe are still this Example: fter st Full Exchange from Node to 8 to to 9 4 to from Node to - - to 8 to 7 to from Node from Node to 5 8 to to 4 to - - to 7 to 9 4 to to 4 5

61 Example: Now sends update to from Node to 8 to to 9 4 from Node to 5 8 to to 4 5 to from Node to - - to 8 to 7 to to - - from Node to 7 to 9 4 to to 4

62 Example: Now sends update to This will come back to bite us from Node to 8 to to 5 4 from Node to 5 8 to to 4 5 to 7 from Node to - - to 8 to 7 to to - - from Node to 7 to 9 4 to to 4

63 Example: heck: ll End nodes of knows nd Full the Exchange best three-hop paths. from Node to 4 8 to to 5 4 from Node to 5 4 to to 4 4 to 7 from Node to - - to 8 to 7 to heck to - - from Node to 7 6 to 9 to to

64 No change in Vs à onvergence! Example: End of nd Full Exchange from Node to 4 7 to to 5 4 from Node to 5 4 to to 4 4 to 6 from Node to - - to 8 to 7 to to - - from Node to 7 5 to 9 to to

65 Intuition v Initial state: best one-hop paths v One simultaneous round: best two-hop paths v Two simultaneous rounds: best three-hop paths v v Kth simultaneous round: best (k+) hop paths v Must eventually converge as soon as it reaches longest best path v..but how does it respond to changes in cost? The key here is that the starting point is not the initialization, but some other set of entries. onvergence could be different! Network Layer 65

66 V: Link ost hanges 4 5 Stable state - changed sends its V to, sends its V to, sends its V to, Node to Node Note: none 5 of s 5 deduct from ances paths use link (,) (,*) and (,*) Node Link cost changes here good news travels fast Network Layer 66

67 V: Link ost hanges Stable state - changed Node to Node add 56 to ances (,*) and (,*) Node Link cost changes here Network Layer 67

68 V: Link ost hanges This is the ounting to Infinity Problem Stable state - changed sends its V to, sends its V to, sends its V to, Node to Node Node Link cost changes here bad news travels slowly (not yet converged) Network Layer 68

69 The Poisoned Reverse Rule v Heuristic to avoid count-to-infinity v If routes to get to : tells its ( s) ance to is infinite (so won t route to ) Network Layer 69

70 V: Poisoned Reverse If routes through to get to : tells its ( s) ance to is infinite Stable state - changed Node to Node Node Link cost changes here Network Layer 7

71 V: Poisoned Reverse If routes through to get to : tells its ( s) ance to is infinite Stable state - changed sends its V to, sends its V to, Node to Node Node Link cost changes here Network Layer 7

72 V: Poisoned Reverse If routes through to get to : tells its ( s) ance to is infinite Stable state - changed sends its V to, sends its V to, Node to Node Node Link cost changes here Network Layer 7

73 V: Poisoned Reverse If routes through to get to : tells its ( s) ance to is infinite Stable state - changed sends its V to, sends its V to, sends its V to, Node to Node Node Link cost changes here onverges after receives another update from 7

74 Will Poison-Reverse ompletely Solve the ount-to-infinity Problem? Numbers in blue denote the best cost to destination advertised along the link Network Layer 74

75 omparison of LS and V algorithms message complexity v v LS: with n nodes, E links, O(nE) msgs sent V: exchange between neighbors only convergence time varies speed of convergence v v LS: O(n ) algorithm requires O(nE) msgs may have oscillations V: convergence time varies may be routing loops count-to-infinity problem robustness: what happens if router malfunctions? LS: node can advertise incorrect link cost each node computes only its own table V: V node can advertise incorrect path cost each node s table used by others error propagate thru network Network Layer 75

76 Real Protocols Link State Open Shortest Path First (OSPF) Intermediate system to intermediate system (IS- IS) istance Vector Routing Information Protocol (RIP) Interior Gateway Routing Protocol (IGRP-isco) order Gateway Protocol (GP) Network Layer 76

77 Quiz: Routing v In this link-state routing network running ijkstra s algorithm, the set N (the set of nodes to which the least cost is definitively known) is initially {u}. fter two iterations, which nodes belong to N?. u 4. ux v w. uw u 5 4. uvx E. uwx x y 5 8 z Network Layer 77

78 Quiz: Routing v In link state routing, the time for routing to reconverge after a link-cost change does NOT significantly depend on which one of the following?. Number of nodes. iameter of the network. Whether the link cost increased or decreased. Whether routing is load-dependent or not Network Layer 78

79 Network Layer: outline 4. introduction 4. virtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing IMP IPv6 4.5 routing algorithms link state ance vector hierarchical routing 4.6 routing in the Internet RIP OSPF GP 4.7 broadcast and multicast routing Network Layer 79

80 Hierarchical routing our routing study thus far - idealization v all routers identical v network flat not true in practice scale: with 6 million destinations: v can t store all dest s in routing tables! v routing table exchange would swamp links! arative autonomy v internet = network of networks v each network ad may want to control routing in its own network Network Layer 8

81 Hierarchical routing v aggregate routers into regions, autonomous systems (S) v routers in same S run same routing protocol intra-s routing protocol routers in different S can run different intra- S routing protocol gateway router: v at edge of its own S v has link to router in another S Network Layer 8

82 utonomous Systems (S) v S is a network under a single arative control currently over, Ses Think T&T, France Telecom, UNSW, IM, etc. v Ses are sometimes called domains. Hence, interdomain routing v Each S is assigned a unique identifier 6 bit S Number (SN) Network Layer 8

83 Interconnected Ses c a b S a c d b Intra-S Routing algorithm S Forwarding table Inter-S Routing algorithm a c S b v forwarding table configured by both intraand inter-s routing algorithm intra-s sets entries for internal dests inter-s & intra-s sets entries for external dests Network Layer 8

84 Inter-S tasks v suppose router in S receives datagram destined outside of S: router should forward packet to gateway router, but which one? S must:. learn which dests are reachable through S, which through S. propagate this reachability info to all routers in S job of inter-s routing! c other networks b a S a S c d b a S c b other networks Network Layer 84

85 Example: setting forwarding table in router d v suppose S learns ( inter-s protocol) that subnet x reachable S (gateway c), but not S inter-s protocol propagates reachability info to all internal routers v router d deteres from intra-s routing info that its interface I is on the least cost path to c installs forwarding table entry (x,i) c x other networks b a S a S c d b a S c b other networks Network Layer 85

86 Example: choosing among multiple Ses v now suppose S learns from inter-s protocol that subnet x is reachable from S and from S. v to configure forwarding table, router d must detere which gateway it should forward packets towards for dest x this is also job of inter-s routing protocol! c x other networks b a S a S c d? b a S c b other networks Network Layer 86

87 Example: choosing among multiple Ses v now suppose S learns from inter-s protocol that subnet x is reachable from S and from S. v to configure forwarding table, router d must detere towards which gateway it should forward packets for dest x this is also job of inter-s routing protocol! v hot potato routing: send packet towards closest of two routers. learn from inter-s protocol that subnet x is reachable multiple gateways use routing info from intra-s protocol to detere costs of least-cost paths to each of the gateways hot potato routing: choose the gateway that has the smallest least cost detere from forwarding table the interface I that leads to least-cost gateway. Enter (x,i) in forwarding table Network Layer 87

88 Network Layer: done! 4. introduction 4. virtual circuit and datagram networks 4. what s inside a router 4.4 IP: Internet Protocol datagram format, IPv4 addressing, IMP, IPv6 4.5 routing algorithms link state, ance vector, hierarchical routing 4.6 routing in the Internet (NOT OVERE) RIP, OSPF, GP 4.7 broadcast and multicast routing (NOT OVERE) v understand principles behind network layer services: network layer service models, forwarding versus routing how a router works, routing (path selection), broadcast, multicast v instantiation, implementation in the Internet Network Layer 88

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats What is Routing? Routing implements the core function of a network: : Shortest Path Routing Ion Stoica Ts: Junda Liu, K Moon, avid Zats http://inst.eecs.berkeley.edu/~ee/fa9 (Materials with thanks to Vern

More information

Chapter 4: Network Layer, partb

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 information

EE 122: Intra-domain routing

EE 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 information

CSC 4900 Computer Networks: Routing Algorithms

CSC 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 information

Chapter 4 Network Layer

Chapter 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 information

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016

CS 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 information

Internet 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 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 information

Chapter 4: Network Layer

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 information

Chapter 5 Network Layer: The Control Plane

Chapter 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 information

CSC 401 Data and Computer Communications Networks

CSC 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 information

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 13

CMPE 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 information

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Last 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 information

CMPE 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 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 information

Interplay Between Routing, Forwarding

Interplay 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 information

ECE 158A: Lecture 5. Fall 2015

ECE 158A: Lecture 5. Fall 2015 8: Lecture Fall 0 Routing ()! Location-ased ddressing Recall from Lecture that routers maintain routing tables to forward packets based on their IP addresses To allow scalability, IP addresses are assigned

More information

CSCD 330 Network Programming Spring 2018

CSCD 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 information

Chapter 4 Network Layer

Chapter 4 Network Layer Chapter 4 Network Layer CPSC 335 Data Communication Systems Readings: 4.4.3, 4.4.4, 4.5, 4.5.1 David Nguyen Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March

More information

CSCD 330 Network Programming Spring 2017

CSCD 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 information

Chapter 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.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 information

CMPE 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 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 information

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to.

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to. Netork Layer (part ) y the end of this lecture, you should be able to. xplain the operation of distance vector routing algorithm xplain shortest path routing algorithm escribe the major points of RIP and

More information

Interplay between routing, forwarding

Interplay 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 information

COMP/ELEC 429/556 Introduction to Computer Networks

COMP/ELEC 429/556 Introduction to Computer Networks OMP/ELE 49/6 Introduction to omputer Networks Intra-domain routing Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu

More information

IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing

IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing IP orwarding - omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSP (Open Shortest Path irst) The Story So ar IP addresses are structure to reflect Internet structure

More information

Network Layer: Routing

Network Layer: Routing Network Laer: Routing Instructor: Anirban Mahanti Office: ICT 74 Email: mahanti@cpsc.ucalgar.ca Class Location: ICT Lectures: MWF :00 :0 hours Notes derived Computer Networking: A Top Down Approach Featuring

More information

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing IP Forwarding 5-44 omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) The Story So Far IP addresses are structured to reflect Internet

More information

CSCE 463/612 Networks and Distributed Processing Spring 2018

CSCE 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 information

Routing. Outline. Algorithms Scalability

Routing. 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 information

Lecture 4. The Network Layer (cont d)

Lecture 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 information

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet

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 information

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues Review: Routing in Packet Networks Shortest Path lgorithms: ijkstra s & ellman-ford Routing: Issues How are routing tables determined? Who determines table entries? What info used in determining table

More information

CSC 8560 Computer Networks: Control Plane

CSC 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 information

TCP/IP Networking. Part 3: Forwarding and Routing

TCP/IP Networking. Part 3: Forwarding and Routing TP/IP Networking Part 3: Forwarding and Routing Routing of IP Packets There are two parts to routing IP packets:. How to pass a packet from an input interface to the output interface of a router ( IP forwarding

More information

Announcement. Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online

Announcement. Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online Announcement Project 2 extended to 2/20 midnight Project 3 available this weekend Homework 3 available today, will put it online Outline Introduction and Network Service Models Routing Principles Link

More information

Dynamic Routing. The Protocols

Dynamic 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 information

Inter-AS routing and BGP. Network Layer 4-1

Inter-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 information

CSCE 463/612 Networks and Distributed Processing Spring 2017

CSCE 463/612 Networks and Distributed Processing Spring 2017 CSCE 46/6 Networks and Distributed Processing Spring 07 Network Layer III Dmitri Loguinov Texas A&M University April, 07 Original slides copyright 996-004 J.F Kurose and K.W. Ross Homework #4 Grading Default

More information

Computer Networks. Instructor: Niklas Carlsson

Computer 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 information

Hierarchical 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 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 information

Hierarchical 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 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 information

CSC 4900 Computer Networks: Routing Protocols

CSC 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 information

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives Routers & Routing -44: omputer Networking High-speed router architecture Intro to routing protocols ssigned reading [McK9] Fast Switched ackplane for a Gigabit Switched Router Know RIP/OSPF L-4 Intra-omain

More information

CS 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 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 information

Network Layer: Control Plane 5-2

Network 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 information

Discussion 8: Link State Routing. CSE 123: Computer Networks Marti Motoyama & Chris Kanich

Discussion 8: Link State Routing. CSE 123: Computer Networks Marti Motoyama & Chris Kanich iscussion 8: Link State Routing S : omputer Networks Marti Motoyama & hris Kanich Schedule Project Questions: mail hris, post to moodle, or attend his OH Homework Questions? Link State iscussion S iscussion

More information

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS 9/6/16 COMP 631: NETWORKED & DISTRIBUTED SYSTEMS. Internet Routing. Jasleen Kaur.

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS 9/6/16 COMP 631: NETWORKED & DISTRIBUTED SYSTEMS. Internet Routing. Jasleen Kaur. OMP 3: NETWORKE & ISTRIUTE SSTEMS // OMP 3: NETWORKE & ISTRIUTE SSTEMS Internet Routing Jasleen Kaur Fall 0 Forwarding vs. Routing: Local vs. istributed oth datagram and virtual-circuit based networks

More information

Routing Algorithms : Fundamentals of Computer Networks Bill Nace

Routing Algorithms : Fundamentals of Computer Networks Bill Nace Routing Algorithms 4-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 Recall from Last Time Routing Algorithm

More information

Intra-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-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 information

The Internet network layer

The Internet network layer The Internet network layer host, router network layer functions: transport layer: TCP, UDP network layer routing protocols path selection RIP, OSPF, BGP forwarding table link layer physical layer IP protocol

More information

Chapter 4: Network Layer. TDTS06 Computer networks. Subnets. Subnets. Subnets. IP Addressing: introduction

Chapter 4: Network Layer. TDTS06 Computer networks. Subnets. Subnets. Subnets. IP Addressing: introduction hapter 4: Network Layer TDTS06 omputer s Lecture 6: Network layer III Routing in the Internet Jose M. Peña, jospe@ida.liu.se ID/DIT, LiU 2009-09-16 4. 1 Introduction 4.2 Virtual circuit and datagram s

More information

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP

More information

Computer Networking Introduction

Computer 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 information

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni 3/4/04 EN44 Network Protocols and lgorithms hapter Routing lgorithms Dr. Ridha Ouni Department of omputer Engineering ollege of omputer and Information Sciences King Saud University References Some slides

More information

Data 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 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 information

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra)

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra) ontents ÉOL POLYTHNIQU ÉÉRL LUSNN! 1. Link state flooding topology information finding the shortest paths (ijkstra)! 2. Hierarchical routing with areas! 3. OSP Link State Routing database modelling neighbor

More information

Inter-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 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 information

Module 3 Network Layer CS755! 3-1!

Module 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 information

Chapter 4: Network Layer

Chapter 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 information

Chapter 4: Network Layer: Part II

Chapter 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 information

UNIT III THE NETWORK LAYER

UNIT III THE NETWORK LAYER UNIT III THE NETWORK LAYER Introduction-Virtual Circuit and Datagram Networks- Inside a Router- The Internet Protocol (IP): Forwarding and Addressing in the Internet-Routing Algorithms Routing in the Internet-Broadcast

More information

Distance Vector: Link Cost Changes. Interdomain Routing. Distance Vector: Count to Infinity Problem. Distance Vector: Poisoned Reverse

Distance Vector: Link Cost Changes. Interdomain Routing. Distance Vector: Count to Infinity Problem. Distance Vector: Poisoned Reverse istance Vector: Link ost hanges 7 loop: Interdomain Routing 8 wait (until sees a link cost change to neighbor V 9 or until receives update from neighbor V) 0 if ((, V) changes by d) for alldestinations

More information

Chapter IV: Network Layer

Chapter 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 information

Network Layer: Routing. Routing. Routing protocol. Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links

Network 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

Chapter 5 Network Layer: The Control Plane

Chapter 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 information

Computer Networking. Rou1ng Algorithms. Rou1ng Algorithms. Interplay between rou1ng, forwarding. routing algorithm

Computer 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 information

Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli

Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli Shortest Paths Algorithms and the Internet: The Distributed Bellman Ford Lecturer: Prof. Chiara Petrioli Dipartimento di Informatica Rome University La Sapienza G205: Fundamentals of Computer Engineering

More information

Chapter 4: network layer

Chapter 4: network layer Chapter 4: network layer chapter goals: understand principles behind network layer services: network layer service models forwarding versus routing how a router works routing (path selection) broadcast,

More information

COMP211 Chapter 5 Network Layer: The Control Plane

COMP211 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 information

cs/ee 143 Communication Networks

cs/ee 143 Communication Networks cs/ee 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also were

More information

Foundations of Telematics

Foundations of Telematics Foundations of Telematics Chapter 4 Network Layer cknowledgement: These slides have been prepared by J.F. Kurose and K.W. Ross with a couple of additions from various sources (see references) Foundations

More information

CSc 450/550 Computer Networks Internet Routing

CSc 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 information

Routing in the Internet

Routing 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 information

Redes de Computadores. Shortest Paths in Networks

Redes de Computadores. Shortest Paths in Networks Redes de Computadores Shortest Paths in Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto » What is a graph?» What is a spanning tree?» What is a shortest path tree?» How are

More information

CS 3516: Advanced Computer Networks

CS 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 information

Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation:

Initial 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 information

Inter-Autonomous-System Routing: Border Gateway Protocol

Inter-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 information

Telecomunicazioni. Docente: Andrea Baiocchi. DIET - Stanza 107, 1 piano palazzina P. Piga Via Eudossiana 18

Telecomunicazioni. Docente: Andrea Baiocchi. DIET - Stanza 107, 1 piano palazzina P. Piga Via Eudossiana 18 University of Roma La Sapiena Telecomunicaioni Docente: Andrea Baiocchi DIET - Stana 07, piano palaina P. Piga Via Eudossiana 8 E-mail: andrea.baiocchi@uniroma.it Corso di Laurea in Ingegneria Gestionale

More information

Chapter 4: Network Layer

Chapter 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 information

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

Announcements. 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 information

Inter-Autonomous-System Routing: Border Gateway Protocol

Inter-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 information

DATA COMMUNICATOIN NETWORKING

DATA 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 information

What s a protocol? CE80N Introduction to Networks & The Internet. Communication Protocol. Protocol Layers. Dr. Chane L. Fullmer UCSC Winter 2002

What s a protocol? CE80N Introduction to Networks & The Internet. Communication Protocol. Protocol Layers. Dr. Chane L. Fullmer UCSC Winter 2002 E80N Introduction to Networks & The Internet Reading hapter 15 IP: Software To reate A Virtual Network Dr. hane L. Fullmer US Winter 2002 January 22 2002 E80N -- Lecture #6 1 January 22 2002 E80N -- Lecture

More information

Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation:

Initial 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 information

Communication Networks

Communication Networks ommunication Networks Prof. Laurent Vanbever ommunication Networks Spring 08 Roland Meier / Thomas Holterbach Slides: Laurent Vanbever nsg.ee.ethz.ch TH ürich (-ITT) pril 9 08 Materials inspired from Scott

More information

Network layer functions. Chapter 4 Network Layer. Network layer functions. Network layer functions

Network 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 information

CS 3516: Advanced Computer Networks

CS 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 information

2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept

2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept //8 Outline - omputer Networking Lecture Routing Link tate OP Peter teenkiste epartments of omputer cience and Electrical and omputer Engineering IP Multicast ervice asics - Networking, pring 8 http://www.cs.cmu.edu/~dga/-/8

More information

Chapter 4 Network Layer

Chapter 4 Network Layer Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Slides adopted from original ones proided by the textbook authors. Network

More information

DSDV: Proactive. Distance Vector (Basic idea) Distance Vector. Distance Vector Algorithm: Tables 12/13/2016

DSDV: Proactive. Distance Vector (Basic idea) Distance Vector. Distance Vector Algorithm: Tables 12/13/2016 estination Sequenced istance Vector (SV) Routing [Perkins94] SV: Proactive SV is a proactive protocol means it maintains up-to-date routing information for all available nodes in the network. No extra

More information

Link-State Routing OSPF

Link-State Routing OSPF CE Computer Networks Link-State Routing OSPF Behnam Momeni Computer Engineering Department Sharif University of Technology Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer

More information

EECS 3214: Computer Networks Protocols and Applications

EECS 3214: Computer Networks Protocols and Applications EECS 3214: Computer Networks Protocols and Applications Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/3214 These slides

More information

Introduction to Internet Routing

Introduction to Internet Routing Introduction to Internet Routing (RCSE) Lecture Based on Slides by Prof. Dr. Günter Schäfer Page Topics of Special course on planning aspects in communication networks Prior attendance of courses Telematics

More information

Destination Sequenced Distance. [Perkins94] CSE 6811 : Lecture 6

Destination Sequenced Distance. [Perkins94] CSE 6811 : Lecture 6 estination Sequenced istance Vector (SV) Routing [Perkins94] SE 6811 : Lecture 6 SV: Proactive SV is a proactive protocol means it maintains up to date routing information for all available nodes in the

More information

Routing by the Network

Routing by the Network Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:

More information

Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley

Computer 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 information

Deployment of IGRP/EIGRP

Deployment of IGRP/EIGRP 1 eployment of IGRP/EIGRP Session 2 Presentation_I.scr 1 Understanding EIGRP Understanding and deploying EIGRP is like driving a car 3 genda Fundamentals of EIGRP UL Summarization and Load alancing EIGRP/IGRP

More information

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition ELEC / COMP 177 Fall 2010 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Project #2 Due Thursday, Nov 10 th Homework #5 Due Thursday, Nov 17 th Later this semester: Homework #6 - Presentation

More information

ETSF05/ETSF10 Internet Protocols Routing on the Internet

ETSF05/ETSF10 Internet Protocols Routing on the Internet ETSF05/ETSF10 Internet Protocols Routing on the Internet 2014, (ETSF05 Part 2), Lecture 1.1 Jens Andersson Circuit switched routing 2014 11 05 ETSF05/ETSF10 Internet Protocols 2 Packet switched Routing

More information

TDC 363 Introduction to LANs

TDC 363 Introduction to LANs TDC 363 Introduction to LANs Routing Protocols and RIP Greg Brewster DePaul University TDC 363 1 Dynamic Routing Routing Protocols Distance Vector vs. Link State Protocols RIPv1 & RIPv2 RIP Problems Slow

More information

Inter-Domain Routing: BGP

Inter-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 information