MIRO: M Multi ulti- -path path MIRO: Interdomain nterdomain RO - - PowerPoint PPT Presentation

miro m multi ulti path path miro interdomain nterdomain
SMART_READER_LITE
LIVE PREVIEW

MIRO: M Multi ulti- -path path MIRO: Interdomain nterdomain RO - - PowerPoint PPT Presentation

MIRO: M Multi ulti- -path path MIRO: Interdomain nterdomain RO ROuting uting I Wen Xu and Jennifer Rexford Princeton University 1 Overlay Entertainment 1 Ming- -Tsang Tsai Tsang Tsai Overlay Entertainment 1 Ming Outline


slide-1
SLIDE 1

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 1 1 1

MIRO: MIRO: M Multi ulti-

  • path

path I Interdomain nterdomain RO ROuting uting

Wen Xu and Jennifer Rexford Princeton University

slide-2
SLIDE 2

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 2 2 2

Outline Outline

Motivation Routing Architectures MIRO Protocol Design Performance Evaluation Conclusion

slide-3
SLIDE 3

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 3 3 3

If Some is Good, More is Better If Some is Good, More is Better

More flexible path selection

Avoid a path with an undesirable hop

Better load balancing

Split traffic over multiple paths

Faster recovery from failure

Switch from one path another

Secure routing

Avoid paths controlled by an adversary

slide-4
SLIDE 4

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 4 4 4

Outline Outline

Motivation Routing Architectures MIRO Protocol Design Performance Evaluation Conclusion

slide-5
SLIDE 5

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 5 5 5

Overlay Network Overlay Network

A B C D E F Relay traffic through an intermidate node Not good for reasons

Increase latency , bandwidth consumption of relays Probing overhead

slide-6
SLIDE 6

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 6 6 6

Source Routing Source Routing

Sender determines paths for packets Difficult challenges

Scalability Limited control for intermediate ASes

A B C D E F

ADECF ABCF ABEF

slide-7
SLIDE 7

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 7 7 7

Border Gateway Protocol Border Gateway Protocol

Policy-based routing AS Relationships

Provider-customer Peer-peer

A B C D E F

Prefix AS path 1.2.3.0/ 20 A B C F A D E F

1.2.3.0/20 I have 1.2.3.0/ 20 You could reach 1.2.3.0/ 20 through me You could reach 1.2.3.0/ 20 through me A doesn’t pay for traffic transit BGP session Route propagation Outbound filter

slide-8
SLIDE 8

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 8 8 8

BGP Routing Process BGP Routing Process

Best Route Selection 1. Highest local-pref 2. Shortest AS path 3. Lowest origin type 4. Lowest MED 5. eBGP over iBGP 6. Lowest I GP cost 7. Tie-break I nbound filters Routing I nformation Base BGP routing table Outbound filters Best Route SI NGLE path routing protocol

slide-9
SLIDE 9

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 9 9 9

Outline Outline

Motivation Routing Architectures MIRO Protocol Design Performance Evaluation Conclusion

slide-10
SLIDE 10

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 10 10 10

Maybe BGP isn Maybe BGP isn’ ’t So Bad t So Bad… …

Internet is a big, federated network

Local policies for path selection & export routes Efficient propagation of path information

Add multi-path to BGP

AS-level, path-vector routing (more scalable) Extended for multi-path

slide-11
SLIDE 11

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 11 11 11

Pull Pull-

  • based Negotiation

based Negotiation

Pull-based route retrieval

Solicit routes only when necessary

Bilateral negotiation

AS relationships usually bilateral anyway

A B C D E F

ABEF* ADEF BEF* BCF DEF* DABEF CF* CEF CBEF EF* ECF

Any route to F avoiding E? How about BCF? BCF is OK

slide-12
SLIDE 12

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 12 12 12

Not Just Your Neighbors Not Just Your Neighbors

Multi-party, multi-hop Either AS can initiate the negotiation

A C D E F

ABEF* ADEF BEF BCF DEF* DABEF CF* CEF CBEF EF* ECF ABCF*

B

* * DABCF

YES BCF Any route to F avoiding EF? BCF is OK

slide-13
SLIDE 13

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 13 13 13

Tunnels for Forwarding Data Packets Tunnels for Forwarding Data Packets

Direct packet along alternate route

Destination-based forwarding not enough Encapsulate the packet to egress point A B C D E F

ABEF* ADEF BEF* BCF DEF* DABEF CF* CEF CBEF EF* ECF

Tunnel id = 7 BCF is OK

A’s outgoing tunnel table F B, 7 BCF BCF A-> F 7 B’s incoming tunnel table

F F F F

slide-14
SLIDE 14

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 14 14 14

Advantages Advantages

Flexibility for edge AS

AS can learn and use multiple paths

Control for intermediate ASes

Selective export of extra routes

Scalability of the global system

AS-level routing protocol (extension to BGP) Pull-based route retrieval Selective export of routes

slide-15
SLIDE 15

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 15 15 15

Outline Outline

Motivation Routing Architectures MIRO Protocol Design Performance Evaluation Conclusion

slide-16
SLIDE 16

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 16 16 16

Infer AS Graph & Relationships Infer AS Graph & Relationships

RouteViews BGP data in 2000, 2003, and 2005 Gao inference algorithm

A B C D E F

Observed paths A B E F A D E F B C F C E F

provider-customer peer-peer

slide-17
SLIDE 17

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 17 17 17

Three Variations on Export Rules Three Variations on Export Rules

Strict(/s): all paths in the same class Export(/e): all policy-compliant paths Flexible(/a): all of the paths, relationship independent

A B C D E F provider-customer peer-peer provider route peer route customer route

slide-18
SLIDE 18

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 18 18 18

Evaluation Methodology Evaluation Methodology

Who to negotiate with?

Neighboring ASes ASes along the default path

How many ASes initiate negotiation?

Only sending AS

What path-selection policies?

Avoid a particular AS in default path

slide-19
SLIDE 19

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 19 19 19

Exposing the Underlying Path Diversity Exposing the Underlying Path Diversity

5% have no alternate paths > 10 alternates > 100 alternates

slide-20
SLIDE 20

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 20 20 20

Avoiding an AS: Avoiding an AS: Success Ratio Success Ratio

Date BGP MIRO/s MIRO/e MIRO/a Source Routing 2000 27.8% 65.4% 72.9% 75.3% 89.5% 2003 31.2% 67.0% 74.6% 76.6% 90.4% 2005 29.5% 67.8% 73.7% 76.0% 91.1%

MI RO is much better than BGP Source routing only 10-15% better

slide-21
SLIDE 21

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 21 21 21

Avoiding an AS: Overhead (for 2005) Avoiding an AS: Overhead (for 2005)

Policy Success Rate AS# /tuple Path# /tuple Strict 67.8% 2.80 36.6 Export 73.7% 2.53 58.9 Flexible 76.0% 2.38 139.0

With more flexible policies

Negotiate with fewer ASes But learn more paths from each AS

slide-22
SLIDE 22

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 22 22 22

Incremental Deployment Incremental Deployment

20 40 60 80 100 0.01 0.1 1 10 100 Percentage of ASes Adopted MI RO (log scale) Percentage of total gain 2005/ s 2005/ e 2005/ a nodes with more than 200 neighbors nodes with degree greater than 40 Even if only a few ASes adopt MI RO, it’s still effective!

slide-23
SLIDE 23

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 23 23 23

Outline Outline

Motivation Routing Architectures MIRO Protocol Design Performance Evaluation Conclusion

slide-24
SLIDE 24

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 24 24 24

Conclusion Conclusion

Multi-path extension to BGP

Retain AS-level, path-vector routing Add pull-based route retrieval Selective export of extra routes Tunnels for forwarding data packets

Evaluation results

Satisfies the AS’s policy goals Avoids state explosion Offers benefits in small deployments

slide-25
SLIDE 25

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 25 25 25

Reference Reference

Slides from Wen Xu (many thanks!)

slide-26
SLIDE 26

Ming Ming-

  • Tsang Tsai

Tsang Tsai Overlay Entertainment Overlay Entertainment 26 26 26

Happy Entertainment Happy Entertainment

Thank you~ kero kero kero