Presentation is loading. Please wait.

Presentation is loading. Please wait.

9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.

Similar presentations


Presentation on theme: "9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow."— Presentation transcript:

1 9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow

2  Autonomous System (AS)  Border Gateway Protocol (BGP)  Internet Service Provider (ISP) 9/15/2015CS622 - MIRO Presentation2

3  Single route advertisement is not flexible enough  BGP is sufficient for most traffic  Control over path properties rather than complete path is desirable  Intermediate router may be willing direct traffic along another path  Current methods for influencing path choices are limited 9/15/2015CS622 - MIRO Presentation3

4  BGP  Single best path selection  Source Routing  End to end path selection  Overlay Networks  Virtual network topology 9/15/2015CS622 - MIRO Presentation4

5 9/15/2015CS622 - MIRO Presentation5

6 9/15/2015CS622 - MIRO Presentation6

7 9/15/2015CS622 - MIRO Presentation7

8  Extension of BGP  AS-Level path selection  Negotiation for alternate routes  Policy driven export of alternate routes  Tunnels to direct traffic on alternate routes 9/15/2015CS622 - MIRO Presentation8

9 9/15/2015CS622 - MIRO Presentation9

10 9/15/2015CS622 - MIRO Presentation10

11  Intra-AS Architecture  AS may consist of many internal routers and paths  Data Plane Packet Encapsulation  IP over IP encapsulation  Control Plane Tunnel Management  Creation and destruction of tunnels based upon negotiation 9/15/2015CS622 - MIRO Presentation11

12 Simulated operating environment Infer AS relationships Assume each AS selects and exports routes based on business relationships Each AS treated as one node GAO Algorithm – L. Gao, “On inferring Autonomous System relationships in the Internet,” IEEE/ACM Trans. Networking, vol. 9, no. 6, pp. 733–745, 2001. Data (October 2000, 2003, 2005) – www.routeviews.org www.routeviews.org 9/15/2015CS622 - MIRO Presentation12

13 9/15/2015CS622 - MIRO Presentation13

14  Strict Policy  Responding AS announces routes with same local preference as the original default route  Respect Export Policy  Responding AS announces alternate routes using an export policy  Most Flexible Policy  Responding AS announces all possible routes 9/15/2015CS622 - MIRO Presentation14

15 1) 1-hop set  AS negotiates with each immediate neighbor 2) Path set  AS negotiates with any AS along BGP path  300 million (source,destination) pairs evaluated 9/15/2015CS622 - MIRO Presentation15

16 9/15/2015CS622 - MIRO Presentation16

17  Avoid for security or performance reasons  Calculate triple for every  (Source, Destination, AS to avoid)  Don’t avoid immediate neighbors 9/15/2015CS622 - MIRO Presentation17

18 9/15/2015CS622 - MIRO Presentation18

19 9/15/2015CS622 - MIRO Presentation19

20  Assumptions  Each source generates equal traffic  Total traffic estimated by number of sources using link  All traffic sent through an intermediate AS always transits through that AS  Total traffic a single AS can move if switched to a different route  Power node concept  Node lies on destination path for many sources 9/15/2015CS622 - MIRO Presentation20

21 9/15/2015CS622 - MIRO Presentation21

22  10,383 multi-homed AS studied  Around 90% can move 10% of traffic  50% can move  40% of traffic under flexible policy  25% of traffic under strict policy 9/15/2015CS622 - MIRO Presentation22

23  90% of Power Nodes had 200+ neighbors  Most likely Tier 1 AS  Immediate neighbors only constitute 9% of Power Nodes  68% of Power Nodes are 2 hops away 9/15/2015CS622 - MIRO Presentation23

24  Need negotiation rules  Establish and manages negotiation process  Need route selection rules  Filter and rank available alternatives 9/15/2015CS622 - MIRO Presentation24

25  Potential for oscillation  Solution:  If upstream AS does not advertise the tunnel MIRO is guaranteed to converge whenever BGP converges 9/15/2015CS622 - MIRO Presentation25

26  MIRO is backward compatible with BGP  MIRO can provide the flexibility to negotiate alternate routes as needed  MIRO can provide transit AS more control over traffic across their network  MIRO is comparable to Source Routing at avoiding an intermediate AS  Most alternate route possibilities are provided by the most connected nodes (ISP’s) 9/15/2015CS622 - MIRO Presentation26

27  Build prototype  Explore security via AS trust relationships  Devise centralized load balancing scheme to prevent oscillation  Explore the incorporation of price, performance and load information into the route selection process 9/15/2015CS622 - MIRO Presentation27

28 9/15/2015CS622 - MIRO Presentation28

29  Border Gateway Protocol (BGP)  http://www.rfc-editor.org/rfc/rfc4271.txt http://www.rfc-editor.org/rfc/rfc4271.txt 9/15/2015CS622 - MIRO Presentation29


Download ppt "9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow."

Similar presentations


Ads by Google