1 / 43

cs / ee 143 Communication Networks Chapter 5 Routing

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 in the lecture

eze
Download Presentation

cs / ee 143 Communication Networks Chapter 5 Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. cs/ee 143 Communication NetworksChapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech

  2. Warning These notes are not self-contained, probably not understandable, unless you also were in the lecture They are supplement to not replacement for class attendance

  3. Lecture outline Inter-domain routing • BGP Intra-domain routing • Shortest path algortihms Coding • FEC, network coding

  4. What is routing? Choose red or blue. Internet A B

  5. How to route? • Two layers of routing: • Choose which AS? • - BGP • How to route inside an AS? • - OSPF Autonomy system (AS) e.g., AT&T, Verizon, MIT. Internet A B

  6. Why two layers? • Different objectives • Choose AS: special policies • Inside AS: minimize delay, # hops • Simplify routing • Choose AS: ignore details inside AS • Inside AS: only details inside AS

  7. Inter-domain routing: BGP • Peering relation: A-B, B-C • A, B, C carry each other’s traffic free • of charge • B only advertises B to A and to C • A does not know how to reach C through this. A must have transit relation with anther ISP (not shown here) that carries its traffic to C. • Transit relation: A-B, B-C • Customer-provider relation, e.g., B is provider for A and for C. A (C) pays B for carrying to/from A (C). • B advertises {B,C} to A and {A, B} to C so that all ISP’s know how to reach all destinations.

  8. Inter-domain routing: BGP A typical configuration

  9. Inter-domain routing: BGP BGP is policy-based routing • Generally not shortest-path • Other factors are generally more important in determining an AS-path than performance • Peering agreement • Pricing (revenue/cost) with next hop • Reliability, security, political reasons • Can lead to oscillation and bad performance

  10. Inter-domain routing: BGP Example BGP policy at Berkeley: If possible, avoid AT&T Choose path with smallest #hops Alphabetical Berkeley decision: use path Sprint-Verizon-MIT to reach MIT

  11. Border Gateway Protocol (BGP) Every AS keeps a list of (Destination, Path) pairs & policies. Policy: avoid AT&T. How to reach MIT from Berkeley? Verizon (MIT, Verizon---MIT) AT&T (MIT, AT&T---MIT) Sprint (MIT, NA) Berkeley (MIT, NA)

  12. Border Gateway Protocol (BGP) Every AS keeps a list of (Destination, Path) pairs& policies. Policy: avoid AT&T. How to reach MIT from Berkeley? Verizon (MIT, Verizon---MIT) (MIT, Verizon---AT&T---MIT) AT&T (MIT, AT&T---MIT) (MIT, AT&T---Verizon---MIT) Sprint (MIT, Sprint---Verizon---MIT) (MIT, Sprint---AT&T---MIT) Berkeley (MIT, Berkeley---AT&T---MIT)

  13. Border Gateway Protocol (BGP) Every AS keeps a list of (Destination, Path) pairs & policies. Policy: avoid AT&T. How to reach MIT from Berkeley? Verizon (MIT, Verizon---MIT) AT&T (MIT, AT&T---MIT) Sprint (MIT, Sprint---Verizon---MIT) Berkeley (MIT, Berkeley---AT&T---MIT) (MIT, Berkeley---Sprint---Verizon---MIT)

  14. Border Gateway Protocol (BGP) In BGP, each AS • Announces itself to other ASes and which ASes it can reach • Obtains ASes reachability info from neighboring Ases • Propagate reachability info to all routers internal to the AS • Determine “good” routes to ASes based on reachability info and AS policy

  15. BGP: potential oscillation Example BGP policy to reach D: Prefer 2-hop path to 1-hop Avoid 3-hop paths Oscillation: Every node will alternate between choosing an 1-hop path and 2-hop path

  16. Some questions Q1: Why not 3-level, or N-level, routing? Q2: How can a source ensure that its packets follow the inter-domain path it wants? Q3: In BGP, can one prevent a domain from lying and funneling all traffic through itself in order eavesdrop?

  17. Lecture outline Inter-domain routing • BGP Intra-domain routing • Shortest path algortihms Coding • FEC, network coding

  18. Shortest-path algorithm Input: graph , link costs dij ( ) Execution: algorithm run at each node Output: • Dijkstra: shortest-path tree rooted at the node • Bellman-Ford: next hop to all destinations from the node (entries in forwarding table) Notation: • : min cost to reach node i from x • predx(i) : parent node of i (for Dijkstra) • nextx(i) : next hop to i from x (for Bellman-Ford)

  19. Dijkstra algorithm Init: predx(i) = null Each node x sends dxi to all other nodes i while do { for all { if then { pred(j) = }if }for }while Run at each source node x Which step requires global info?

  20. Dijkstra algorithm Init: predx(i) = null Each node x sends dxi to all other nodes i while do { for all { if then { pred(j) = }if }for }while Run at each source node x Which step requires global info?

  21. Dijkstra algorithm

  22. Bellman-Ford algorithm Init: predx(i) = null Each node x sends distance vector to all its neighbors whenever changes do (execute when link cost changes or on receipt of a DV from neighbor) { for all destination nodes i { nextx(i) = }for } until no change Run at each source node x

  23. Bellman-Ford algorithm • Consider the calculations at all nodes • to reach node D • Every node has access to distance • estimates from neighbors to D • Assume synchronous operation

  24. Compare Dijsktra & BF • Message exchange • Dijkstra: every node sends only its incident link costs to all other nodes. This requires O(|V| |E|) messages. • BF: every node sends only to its neighbors least-cost estimates from itself to all other nodes • Speed of convergence • Disjstra: above implementation takes O(|V|2); can be reduced using heap • BF: can converge slowly and have routing loops during transient; count-to-infinity problem (can be solved using poisoned reverse) • No clear winner • Both are used on Internet • RIP: distance-vector protocol • OSPF: link-state protocol (meant to be successor to RIP)

  25. Count-to-infinity problem Example Link between B & C fails A and B will not realize it, a routing route is created and their cost estimate to C keeps going up A solution: poisoned reverse: instead of telling B its true cost (2) to reach C, A tells B that its cost to reach C is infinity because A uses B to reach C.

  26. Compare Dijsktra & BF • Dijkstra algorithm • Needs global information (link-state alg) • Each node broadcasts link-state packets to all other nodes in network • Each node executes Dijkstraalg to calculate shortest paths to all other nodes • After k iteration, shortest paths to k destinations are known (and they are the k shortest paths among the shortest paths to all nodes) • Terminates after N-1 iterations (N = #nodes)

  27. Compare Dijsktra & BF • Bellman-Ford algorithm • Only needs local information (distance-vector alg) • Each node exchanges with neighbors the vector of distances from itself to all other nodes • Each node then updates the next hop and associated distance to all other nodes using Bellman-Ford (DP) equation • Decentralized, asynchronous, distributed

  28. Lecture outline Inter-domain routing • BGP Intra-domain routing • Shortest path algortihms Coding • FEC, network coding

  29. FEC: packet erasure code Recover from packet loss Coding • Input: n packets • Output: m packets • = bit-by-bit XOR of a random subset of • Header of specifies the subset used to generate

  30. FEC: packet erasure code Decoding • If for some i, then for all pkts that contains • Remove from the collection of rec’d pkts • Repeat until all have been decoded • If at one step, there is no then decoding fails

  31. FEC: example : received pkt Decoding: received pkts

  32. FEC: example : received pkt Decoding:

  33. FEC: example : received pkt Decoding:

  34. FEC: example : received pkt Decoding:

  35. FEC: example : received pkt Decoding:

  36. FEC: example : received pkt Decoding:

  37. FEC: example : received pkt Decoding:

  38. FEC: example : received pkt Decoding:

  39. FEC: example : received pkt Decoding:

  40. FEC: example : received pkt Decoding:

  41. FEC: example : received pkt Decoding:

  42. Network coding: example • link rate = R • on every link • multicast to • both Y & Z throughput = 2R throughput = 1.5R

  43. Network coding: example X and Y want to exchange A & B • Without network coding, needs 4 pktxmissions • With network coding, needs 3 pktxmissions

More Related