1 / 53

Ping Pan Ellen Hahne Henning Schulzrinne

BGRP (Border Gateway Reservation Protocol) A Tree-Based Aggregation Protocol for Inter-Domain Reservations. Ping Pan Ellen Hahne Henning Schulzrinne Bell Labs + Columbia Bell Labs Columbia. Outline. Resource Reservation Applications

monita
Download Presentation

Ping Pan Ellen Hahne Henning Schulzrinne

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. BGRP (Border Gateway Reservation Protocol)A Tree-Based Aggregation Protocolfor Inter-Domain Reservations Ping Pan Ellen Hahne Henning Schulzrinne Bell Labs + Columbia Bell Labs Columbia

  2. Outline • Resource Reservation • Applications • Architectures • Challenges • Protocol Scaling Issues • BGRP Protocol • Major Messages • Performance • Conclusions & Future Work

  3. Resource Reservation • Applications • Old Architecture: Int Serv + RSVP • Challenges • New Architecture: Diff Serv + BGRP

  4. Reservation Applications • Real-Time QoS • Voice over IP • Video • Virtual Private Networks • Differentiated Services • Better than Best Effort • Traffic Engineering • Offload congested routes • Integration of ATM, Optical & IP (MPLS) • Inter-Domain Agreements

  5. Reservation Architectures • Old Solution: Int Serv + RSVP • End-to-end • Per-flow • Challenges • Data Forwarding Costs • Protocol Overhead • Inter-Domain Administration • New Solution: Diff Serv + BGRP • Aggregated • Scalable • Manageable

  6. Two Scaling Challenges • Data Forwarding Costs • Int Serv: per micro-flow • Diff Serv: ~32 AF/EF Code Points • Solves that problem ! • Control Protocol Overhead • RSVP: O(N2), N = # hosts • BGRP: O(N) , N = something much smaller • Much more to say about this !

  7. Protocol Scaling Issues • Network Structure • Network Size • How much Aggregation? • How to Aggregate?

  8. Multi-homed Stub Domain H1 H5 Transit Domain AS1 AS5 AS2 R8 AS3 AS4 R7 h1, h2, h3 h1, h2, h3 h1, h2, h3 R6 R1 R2 S2 S3 S1 R5 R3 R4 AS6 H2 Single-homed Stub Domain Network Structure: Multiple Domains (AS)

  9. Current Network Size • 108 (60,000,000) Hosts • 105 (60,000) Networks • 104 (6,000) Domains

  10. Traffic Trace(90-sec trace, 3 million IP packet headers, at MAE-West, June 1, 1999)

  11. Traffic Trace • Over 1-month span (May 1999) at MAE-West: • 4,908 Source AS seen • 5,001 Destination AS seen • 7,900,362 Source-Destination pairs seen!

  12. How many Reservations? (How much aggregation?) • 1 reserv’n per source-dest’n pair? • 1016 host pairs • 1010 network pairs • 108 domain pairs • 1 reserv’n per source OR 1 reserv’n per dest’n? • 108 hosts • 105 networks • 104 domains • Router capacity: 104 < # Reserv’ns < 106 • Conclusion: 1 reserv’n per Network or Domain for each Diff Serv traffic class

  13. Network Growth (1994-1999)

  14. Growth Rates • Graph has a Log Scale • H (# Hosts) : Exponential growth • D (# Domains) : Exponential growth • Moore’s Law can barely keep up! • Overhead of control protocols? • O(H) or O(D), May be OK • O(H2) or O(D2), Not OK !

  15. How to Aggregate? • Combine Reserv’ns from all Sources to 1 Dest’n for 1 Diff Serv class • Data & Reserv’ns take BGP route to Dest’n • BGP routes form SinkTree rooted at Dest’n domain (no load balancing) • Aggregated Reserv’ns form SinkTree • Where 2 branches meet, Sum Reserv’ns

  16. H1 H5 S1 9 S3 6 AS1 6 9 AS5 9 3 AS2 R8 3 AS3 AS4 R7 S2 h1, h2, h3 h1, h2, h3 h1, h2, h3 R2 R5 R1 R6 R4 R3 AS6 H2 A Sink Tree rooted at S3

  17. end-to-end reservation request Destination Source aggregated reservation request Border Routers User-Edge Routers A H AS 100 AS 400 G B F C AS 300 AS 200 E D How to handle end-user reservation?

  18. BGRP Protocol • Basic Operation • Comparison with RSVP • Enhancements • Performance Evaluation

  19. BGRP Basics • Inter-Domain only • Runs between Border Routers • Follows BGP Routes • Reserves for Unicast Flows • Aggregates Reserv’ns into Sink Trees • Delivers its Messages Reliably • 3 Major Messages • Probe:source to dest’n; reserv’n path discovery • Graft:dest’n to source; reserv’n establishm’t & aggreg’n • Refresh:adjacent routers; reserv’n maintenance

  20. H1 H5 S1 6 S3 6 AS1 6 6 6 6 AS5 6 R3 6 6 6 AS2 R8 AS3 AS4 S2 R7 h1, h2, h3 h1, h2, h3 h1, h2, h3 R2 R5 R6 R1 R4 AS6 H2 Tree Construction: 1st Branch

  21. H1 H5 S1 6 S3 6 +3 AS1 6 6 6 AS5 +3 3 3 +3 R3 3 3 3 3 AS2 R8 AS3 AS4 3 S2 R7 h1, h2, h3 h1, h2, h3 h1, h2, h3 R2 R6 R1 R5 R4 AS6 H2 Tree Construction: 2nd Branch

  22. H1 H5 S1 6 S3 9 AS1 6 9 AS5 9 R3 3 3 AS2 R8 AS3 AS4 R7 S2 h1, h2, h3 h1, h2, h3 h1, h2, h3 R2 R5 R6 R1 R4 AS6 H2 Tree Construction: Complete

  23. PROBE Message • Source (leaf) toward Destination (root) • Finds reservation path • Constructs Route Record: • Piggybacks Route Record in message • Checks for loops • Checks resource availability • Does not store path (breadcrumb) state • Does not make reservation

  24. GRAFT Message • Destination (root) toward Source (leaf) • Uses path from PROBE’s Route Record • Establishes reservations at each hop • Aggregates reservations into sink tree • Stores reservation state per-sink tree

  25. REFRESH Message • Sent periodically • Between adjacent BGRP hops • Bi-directional • Updates all reserv’n state in 1 message

  26. Comparison of BGRP vs. RSVP • Probing: • BGRP PROBE vs. RSVP PATH • Stateless vs. Stateful [O(N2)] • Reserving: • BGRP GRAFT vs. RSVP RESV • State-light [O(N)] vs. Stateful [O(N2)] • Aggregated vs. Shared • Refreshing: • Explicit vs. Implicit • Bundled vs. Unbundled

  27. BGRP Enhancements Keeping Our Reservation Tree Beautiful Despite: • Flapping leaves • Rushing sap • Broken branches

  28. Problem: Flapping Leaves • Over-reservation • Quantization • Hysteresis

  29. Problem: Rushing Sap • CIDR Labeling • Quiet Grafting

  30. H1 H5 S1 10 6 S3 AS1 6 6 10 10 AS5 10 R3 10 6 10 AS2 R8 AS3 AS4 R7 S2 h1, h2, h3 h1, h2, h3 h1, h2, h3 R2 R5 R6 R1 R4 AS6 H2 Quiet Grafting: 1st Branch

  31. H1 H5 S1 6 10 S3 AS1 6 10 AS5 10 3 R3 3 3 AS2 R8 AS3 AS4 3 R7 S2 h1, h2, h3 h1, h2, h3 h1, h2, h3 R2 R5 R1 R6 R4 AS6 H2 Quiet Grafting: 2nd Branch

  32. H1 H5 S1 6 S3 10 AS1 6 10 AS5 10 R3 3 3 AS2 R8 AS3 AS4 R7 S2 h1, h2, h3 h1, h2, h3 h1, h2, h3 R2 R1 R5 R6 R4 AS6 H2 Quiet Grafting: Complete

  33. Problem: Broken Branches • Self-Healing • Filtering Route Changes

  34. Performance Evaluation Show BGRP benefits as function of: • Region Size • Topology • Traffic Load • Refresh Rate • Quantum Size

  35. Flow Counts vs. Region Size

  36. Flow Counts vs. Region Size • Assume reserv’n is popular. • Aggregation is needed ! • Region-based aggregation works. • BGRP helps most when: • Aggregating Region is Large. • Reserv’n Holding Time is Long. • Theoretical “N vs. N2 ”problem is real !

  37. Number of Flows (broken down by BW)

  38. BGRP / RSVP Gain for each BW Class

  39. s0 si s1 sD l1 li l0 nD n0 n1 ni dD d1 di d0 Modeling the Topological Distribution of Demand 3 distributions: Flat, Hierarchical, Selected Source

  40. Reservation Count vs. Link Number

  41. Reservation Count vs. Node Number

  42. Gain: Nrsvp / Nbgrp

  43. - r - × ( 1 e ) P - r × - × / F T ( 1 e ) T Reservation Count vs. Traffic Load • Model for given hop H: • P paths thru H • T sink trees thru H • r micro-flows @ path (Poisson l, m, r) • # RSVP reserv’ns = • # BGRP reserv’ns = • BGRP helps most for large r • Gain ~ P / T • Graph: P =100000, T =1000

  44. Reservation Count vs. Traffic Load

  45. - r l × + h × × - 3 P 2 P ( 1 e ) - r × l × + h × × - / P T 3 P 2 T ( 1 e ) Message Rate vs. Refresh Rate • Model for given hop H: • P paths thru H • T sink trees thru H • r micro-flows @ path (Poisson l, m, r) • h refresh rate • RSVP msg rate = • BGRP msg rate = • BGRP helps most for h >> l , r >> 1 • Gain ~ P / T • Graph: P =100K, T =1000, r =10, l =.001

  46. Message Rate vs. Refresh Rate

  47. × k Q Message Reduction vs. Quantum Size • Single hop H (tree leaf) • r micro-flows on H (birth/death, Poisson) • Each micro-flow needs 1 unit of BW • H manages aggregate BW reserv’n • Quantization: Reserv’n must be • Hysteresis: Descent lags by Q

  48. l 8m l 5m l 2m l 3,3 l l l l l l l l l l l l l l l 1,3 4,6 5,6 3,6 0,3 2,6 2,3 7,9 10,12 9,12 8,12 8,9 6,9 5,9 11,12 l 5m 3m 7m 2m 8m m 9m 6m 10m 4m 11m 12m 3m 6m 9m 0, 0 6,6 12,12 9,9 Quantization with Hysteresis State Transition Diagram for Q=3

  49. å å ( / ) ¥ - 1 Q - r × × r r × × - ( ) k Q i e [ ( k Q i ) !] = = 1 0 k i Message Reduction vs. Quantum Size • Closed-form expression for state probabilities • Quantization & Hysteresis cut message rate by: • E.g., r=100 & Q=10, message rate cut by 100 • Multi-hop model with Quiet Grafting: • Further improvement • Approximate analysis • Simulation

  50. Message Reduction vs. Load & Quantum Size

More Related