1 / 21

Breaking the Single-Path Barrier

Breaking the Single-Path Barrier. Brad Smith Jack Baskin SoE Research Review Day 10/20/2011. Outline. Research Corporate Partnership Open Source Network Lab. The Internet is Single-Path. Compute best path per destination Destination-based (“hop-by-hop”) forwarding 2 problems

evania
Download Presentation

Breaking the Single-Path Barrier

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. Breaking the Single-Path Barrier Brad Smith Jack Baskin SoE Research Review Day 10/20/2011

  2. Outline • Research • Corporate Partnership • Open Source Network Lab Jack Baskin SoE Research Review Day

  3. The Internet is Single-Path • Compute best path per destination • Destination-based (“hop-by-hop”) forwarding • 2 problems • Quality-of-Service • Congestion S Jack Baskin SoE Research Review Day

  4. Problem – Quality-of-Service • Requires multiple paths per destination • Example – 2 paths • 2Mbps, 200ms • 100Kbps, 20ms • Depends on application! • Video streaming • Voice over IP (VoIP) b/w = 2Mbps latency = 200ms a Next hop for D? D S b b/w = 100Kbps latency = 20ms Jack Baskin SoE Research Review Day

  5. Problem – Congestion 32 32 45 32 16 16 32 7 7 7 4 7 16 18 16 4 4 45 18 18 45 7 4 7 16 16 18 7 7 16 32 16 32 32 32 45 Strong tendency for paths to share links… Jack Baskin SoE Research Review Day

  6. Previous Work • Circuit switch – special path per flow • Solve part of the problem • Congestion – only need a small number (≤ 4) • Minimum delay • Partial solutions - disjoint widest and shortest • In practice - over-provision a single path • Challenge – what are enough paths? Jack Baskin SoE Research Review Day

  7. Best Set of Paths • Paths as points in multi-dimensional space • Some paths are “better” than others • Best set of paths are those with none better • Paths that provide the full range of performance 100Kbps, 20ms 100Kbps, 20ms 100Kbps, 20ms Jack Baskin SoE Research Review Day

  8. Using the Best Set of Paths • Assign flows to paths that satisfy QoS • In general, there is more than one… • …choose one that minimizes congestion 100Kbps, 20ms Jack Baskin SoE Research Review Day

  9. Simulations • Generate random networks • Compute routing tables at all nodes • Total bandwidth • Delay • Generate random stream of flows • Use oracle to assign flows to paths • Satisfies QoS • Has bandwidth Jack Baskin SoE Research Review Day

  10. Simulations (cont) • Measure Call Acceptance Ratio • % flow requests successfully routed • Across range of networks • Size – number of vertices • Connectivity – average degree (# neighbors) Jack Baskin SoE Research Review Day

  11. CAR: 350 Vertices, Degree 32 Jack Baskin SoE Research Review Day

  12. CAR: 350 Vertices, Degree 16 Jack Baskin SoE Research Review Day

  13. CAR: 350 Vertices, Degree 4 Jack Baskin SoE Research Review Day

  14. Converge when lightly loaded and over-loaded • Multipath does better in-between • Fewer resources  poorer and less distinct performance Jack Baskin SoE Research Review Day

  15. Target CAR Flow Rate 95% 600 Load supported by given infrastructure & routing architecture. Jack Baskin SoE Research Review Day

  16. 95% CAR Rate: Degree 32 Multipath provides dramatic capacity increase with same infrastructure. Jack Baskin SoE Research Review Day

  17. MP @ 95% CAR Rate – # Vertices Solid gains with increasing infrastructure. Jack Baskin SoE Research Review Day

  18. Ratio MP:SP 95% CAR – # Vertices 4 to 11x gains… with opportunities for improvement(!). Jack Baskin SoE Research Review Day

  19. From 1 to many layers… Jack Baskin SoE Research Review Day

  20. Future Work • Routing protocols (path computation) • Link state • Distance vector • Congestion management (path selection) • Routing • Network feedback Jack Baskin SoE Research Review Day

  21. Thank you!

More Related