Network Layer (Routing)

Transcription

1 Network Layer (Routing)

2 Where we are in the ourse Moving on up to the Network Layer! Application Transport Network Link Physical SE 61 University of Washington

3 Topics Network service models Datagrams (packets), virtual circuits IP (Internet Protocol) Internetworking Forwarding (Longest Matching Prefix) Helpers: ARP and DHP Fragmentation and MTU discovery Errors: IMP (traceroute!) IPv6, scaling IP to the world NAT, and middleboxs Routing Algorithms SE 61 University of Washington

4 Dijkstra s Algorithm

5 Edsger W. Dijkstra (190-00) Famous computer scientist Programming languages Distributed algorithms Program verification Dijkstra s algorithm, 1969 Single-source shortest paths, given network with non-negative link costs By Hamilton Richards, -BY-SA-.0, via Wikimedia ommons SE 61 University of Washington 5

6 Dijkstra s Algorithm Algorithm: Mark all nodes tentative, set distances from source to 0 (zero) for source, and (infinity) for all other nodes While tentative nodes remain: Extract N, a node with lowest distance Add link to N to the shortest path tree Relax the distances of neighbors of N by lowering any better distance estimates SE 61 University of Washington 6

7 Dijkstra s Algorithm () Initialization G We ll compute shortest paths from A H F A B E D SE 61 University of Washington 7

8 Dijkstra s Algorithm () Relax around A F E 10 G A B H D SE 61 University of Washington 8

9 Dijkstra s Algorithm () Relax around B F 7 7 G E A B H 6 Distance fell! D SE 61 University of Washington 9

10 Dijkstra s Algorithm (5) Relax around 7 G 0 A H F B E Distance fell again! 8 D SE 61 University of Washington 10

11 Dijkstra s Algorithm (6) Relax around G (say) 7 G 0 A H F B Didn t fall E D SE 61 University of Washington 11

12 Dijkstra s Algorithm (7) Relax around F (say) 7 G 0 A H F B Relax has no effect E D SE 61 University of Washington 1

13 Dijkstra s Algorithm (8) Relax around E 7 G 0 A H F B E D SE 61 University of Washington 1

14 Dijkstra s Algorithm (9) Relax around D 7 G 0 A H F B E D SE 61 University of Washington 1

15 Dijkstra s Algorithm (10) Finally, H done 7 G 0 A H F B E D SE 61 University of Washington 15

16 Dijkstra omments Finds shortest paths in order of increasing distance from source Leverages optimality property Runtime depends on cost of extracting min-cost node Superlinear in network size (grows fast) Gives complete source/sink tree More than needed for forwarding! But requires complete topology SE 61 University of Washington 16

17 Distance Vector Routing

18 Distance Vector Routing Simple, early routing approach Used in ARPANET, and RIP One of two main approaches to routing Distributed version of Bellman-Ford Works, but very slow convergence after some failures Link-state algorithms are now typically used in practice More involved, better behavior SE 61 University of Washington 18

19 Distance Vector Setting Each node computes its forwarding table in a distributed setting: 1. Nodes know only the cost to their neighbors; not topology. Nodes can talk only to their neighbors using messages. All nodes run the same algorithm concurrently. Nodes and links may fail, messages may be lost SE 61 University of Washington 19

20 Distance Vector Algorithm Each node maintains a vector of distances (and next hops) to all destinations 1. Initialize vector with 0 (zero) cost to self, (infinity) to other destinations. Periodically send vector to neighbors. Update vector for each destination by selecting the shortest distance heard, after adding cost of neighbor link. Use the best neighbor for forwarding SE 61 University of Washington 0

21 Distance Vector () onsider from the point of view of node A Initial vector an only talk to nodes B and E To ost A 0 B D E F G H G A H F B 10 E 1 D SE 61 University of Washington 1

22 Distance Vector () First exchange with B, E; learn best 1-hop routes To B E says says A B 0 D E 0 F G H B E A s ost A s Next 0 -- B E Learned better route G A H F B 10 E 1 D

23 Distance Vector () Second exchange; learn best -hop routes F To B E says says A 10 B 0 1 D E 0 F G H B E A s ost A s Next 0 -- B 6 B 1 E 8 B 7 B 7 B -- G A H B 10 E 1 D SE 61 University of Washington

24 Distance Vector () Third exchange; learn best -hop routes F To B E says says A 8 B 0 1 D E 0 F G 6 H 5 B E A s ost A s Next 0 -- B 6 B 8 B 7 B 7 B 7 B 9 B G A H B 10 E 1 D SE 61 University of Washington

25 Distance Vector (5) Subsequent exchanges; converged F To B E says says A 7 B 0 1 D E 0 F G 6 H 5 B E A s ost A s Next 0 -- B 6 B 8 B 8 B 7 B 7 B 9 B G A B H 10 E 1 D SE 61 University of Washington 5

26 Distance Vector Dynamics Adding routes: News travels one hop per exchange Removing routes: When a node fails, no more exchanges, other nodes forget But partitions (unreachable nodes in divided network) are a problem ount to infinity scenario SE 61 University of Washington 6

27 DV Dynamics () Good news travels quickly, bad news slowly (inferred) X Desired convergence ount to infinity scenario SE 61 University of Washington 7

28 DV Dynamics () Various heuristics to address e.g., Split horizon, poison reverse (Don t send route back to where you learned it from.) But none are very effective Link state now favored in practice Except when very resource-limited SE 61 University of Washington 8

29 RIP (Routing Information Protocol) DV protocol with hop count as metric Infinity is 16 hops; limits network size Includes split horizon, poison reverse Routers send vectors every 0 seconds Runs on top of UDP Time-out in 180 secs to detect failures RIPv1 specified in RF1058 (1988) SE 61 University of Washington 9

30 Flood Routing

31 Flooding Rule used at each node: Sends an incoming message on to all other neighbors Remember the message so that it is only flood once Inefficient because one node may receive multiple copies of message SE 61 University of Washington 1

32 Flooding () onsider a flood from A; first reaches B via AB, E via F AE G E A B D H SE 61 University of Washington

33 Flooding () Next B floods B, BE, BF, BG, and E floods EB, E, ED, F EF F gets copies G E E and B send to each other A B D H SE 61 University of Washington

34 Flooding () floods D, H; D floods D; F floods FG; G floods GF F gets another copy F G E A B D H

35 Flooding (5) H has no-one to flood and we re done G F E Each link carries the message, and in at least one direction A B D H SE 61 University of Washington 5

36 Flooding Details Remember message (to stop flood) using source and sequence number So next message (with higher sequence) will go through To make flooding reliable, use ARQ So receiver acknowledges, and sender resends if needed SE 61 University of Washington 6

37 Link-State Routing

38 Link-State Routing One of two approaches to routing Trades more computation than distance vector for better dynamics Widely used in practice Used in Internet/ARPANET from 1979 Modern networks use OSPF and IS-IS SE 61 University of Washington 8

39 Link-State Setting Nodes compute their forwarding table in the same distributed setting as for distance vector: 1. Nodes know only the cost to their neighbors; not topology. Nodes can talk only to their neighbors using messages. All nodes run the same algorithm concurrently. Nodes/links may fail, messages may be lost SE 61 University of Washington 9

40 Link-State Algorithm Proceeds in two phases: 1. Nodes flood topology with link state packets Each node learns full topology. Each node computes its own forwarding table By running Dijkstra (or equivalent) SE 61 University of Washington 0

41 Phase 1: Topology Dissemination Each node floods link state packet (LSP) that describes their portion of the topology Node E s LSP flooded to A, B,, D, and F Seq. # A 10 B 1 D F G A H F B 10 E 1 D SE 61 University of Washington 1

42 Phase : Route omputation Each node has full topology By combining all LSPs Each node simply runs Dijkstra Replicated computation, but finds required routes directly ompile forwarding table from sink/source tree That s it folks! SE 61 University of Washington

43 Forwarding Table SE 61 University of Washington To Next A B D D E -- F F G F H A B D E F G H 1 10 Source Tree for E (from Dijkstra) E s Forwarding Table

44 Handling hanges On change, flood updated LSPs, re-compute routes E.g., nodes adjacent to failed link or node initiate B s LSP Seq. # A E F G F s LSP Seq. # B E G Failure! G XXXX A H F B SE 61 University of Washington 10 E 1 D

45 Handling hanges () Link failure Both nodes notice, send updated LSPs Link is removed from topology Node failure All neighbors notice a link has failed Failed node can t update its own LSP But it is OK: all links to node removed SE 61 University of Washington 5

46 Handling hanges () Addition of a link or node Add LSP of new node to topology Old LSPs are updated with new link Additions are the easy case SE 61 University of Washington 6

47 Link-State omplications Things that can go wrong: Seq. number reaches max, or is corrupted Node crashes and loses seq. number Network partitions then heals Strategy: Include age on LSPs and forget old information that is not refreshed Much of the complexity is due to handling corner cases SE 61 University of Washington 7

48 DV/LS omparison Goal Distance Vector Link-State orrectness Distributed Bellman-Ford Replicated Dijkstra Efficient paths Approx. with shortest paths Approx. with shortest paths Fair paths Approx. with shortest paths Approx. with shortest paths Fast convergence Slow many exchanges Fast flood and compute Scalability Excellent storage/compute Moderate storage/compute SE 61 University of Washington 8

49 IS-IS and OSPF Protocols Widely used in large enterprise and ISP networks IS-IS = Intermediate System to Intermediate System OSPF = Open Shortest Path First Link-state protocol with many added features E.g., Areas for scalability SE 61 University of Washington 9

50 Equal-ost Multi-Path Routing

51 Multipath Routing Allow multiple routing paths from node to destination be used at once Topology has them for redundancy Using them can improve performance Questions: How do we find multiple paths? How do we send traffic along them? SE 61 University of Washington 51

52 Equal-ost Multipath Routes One form of multipath routing Extends shortest path model by keeping set if there are ties onsider A E ABE = + = 8 ABE = + + = 8 ABDE = = 8 Use them all! G A H F B 10 E 1 1 D SE 61 University of Washington 5

53 Source Trees With EMP, source/sink tree is a directed acyclic graph (DAG) Each node has set of next hops Still a compact representation Tree DAG SE 61 University of Washington 5

54 Source Trees () F Find the source tree for E Procedure is Dijkstra, simply remember set of next hops ompile forwarding table similarly, may have set of next hops Straightforward to extend DV too Just remember set of neighbors G A B H 10 E 1 1 D SE 61 University of Washington 5

55 Source Trees () Source Tree for E F E s Forwarding Table G A B H 10 E New for EMP 1 1 D Node Next hops A B,, D B B,, D, D D D E -- F F G F H, D SE 61 University of Washington 55

56 Forwarding with EMP ould randomly pick a next hop for each packet based on destination Balances load, but adds jitter Instead, try to send packets from a given source/destination pair on the same path Source/destination pair is called a flow Map flow identifier to single next hop No jitter within flow, but less balanced SE 61 University of Washington 56

57 Forwarding with EMP () Multipath routes from F/E to /H G A H F B 10 E 1 1 D E s Forwarding hoices Flow Possible Example next hops choice F H, D D F, D D E H, D E, D Use both paths to get to one destination SE 61 University of Washington 57