toward programmable interdomain routing
play

Toward Programmable Interdomain Routing Qiao Xiang 1 , J. Jensen - PowerPoint PPT Presentation

Toward Programmable Interdomain Routing Qiao Xiang 1 , J. Jensen Zhang 1, 2 , Franck Le 3 , Y. Richard Yang 4, 1 1 Yale University, 2 Tongji University, 3 IBM T.J. Watson Research Center, 4 Peng Cheng Laboratory, 07/30/2020, ACM/IRTF ANRW'20


  1. Toward Programmable Interdomain Routing Qiao Xiang 1 , J. Jensen Zhang 1, 2 , Franck Le 3 , Y. Richard Yang 4, 1 1 Yale University, 2 Tongji University, 3 IBM T.J. Watson Research Center, 4 Peng Cheng Laboratory, 07/30/2020, ACM/IRTF ANRW'20

  2. Background: What is Interdomain Routing • Determine routes for source-destination pairs that span multiple ASes • Ideally, allow policy-routing, flexible traffic engineering and etc. • De facto interdomain routing protocol: Border Gateway Protocol (BGP) 2

  3. Background: What is Interdomain Routing • Determine routes for source-destination pairs that span multiple ASes • Ideally, allow policy-routing, flexible traffic engineering and etc. • De facto interdomain routing protocol: Border Gateway Protocol (BGP) • BGP in a nutshell : Each AS makes and executes its own policy to select routes and export the selected routes in terms of path vectors (i.e., AS path), to its neighbor ASes 3

  4. Background: What is Interdomain Routing • Determine routes for source-destination pairs that span multiple ASes • Ideally, allow policy-routing, flexible traffic engineering and etc. • De facto interdomain routing protocol: Border Gateway Protocol (BGP) • BGP in a nutshell : Each AS makes and executes its own policy to select routes and export the selected routes in terms of path vectors (i.e., AS path), to its neighbor ASes [E, G, I, D] [A, B, E, G, I, D] [E, F, D] B F [A, C, E, G, I, D] [E, H, D] A E G I D S [S, A, B, E, G, I, D] IP prefix p C H 4

  5. Background: What is Interdomain Routing • Determine routes for source-destination pairs that span multiple ASes • Ideally, allow policy-routing, flexible traffic engineering and etc. • De facto interdomain routing protocol: Border Gateway Protocol (BGP) • BGP in a nutshell : Each AS makes and executes its own policy to select routes and export the selected routes in terms of path vectors (i.e., AS path), to its neighbor ASes • BGP can implement policy-routing, but not other use cases such as flexible traffic engineering [E, G, I, D] [A, B, E, G, I, D] [E, F, D] B F [A, C, E, G, I, D] [E, H, D] A E G I D S [S, A, B, E, G, I, D] IP prefix p C H 5

  6. Limitation of BGP: Lacking Mechanisms for Flexible End-to-End Interdomain Route Control [E, G, I, D] [A, B, E, G, I, D] [E, F, D] B F [A, C, E, G, I, D] [E, H, D] A E G I D S [S, A, B, E, G, I, D] IP prefix p C H 6

  7. Limitation of BGP: Lacking Mechanisms for Flexible End-to-End Interdomain Route Control • Example : Shorter AS-paths can be achieved, but S cannot select them [E, G, I, D] [A, B, E, G, I, D] [E, F, D] B F [A, C, E, G, I, D] [E, H, D] A E G I D S [S, A, B, E, G, I, D] IP prefix p C H 7

  8. Limitation of BGP: Lacking Mechanisms for Flexible End-to-End Interdomain Route Control • Example : Shorter AS-paths can be achieved, but S cannot select them • BGP does not provide mechanisms for S to control E's route selection [E, G, I, D] [A, B, E, G, I, D] [E, F, D] B F [A, C, E, G, I, D] [E, H, D] A E G I D S [S, A, B, E, G, I, D] IP prefix p C H 8

  9. Goal of This Paper 9

  10. Goal of This Paper • A systematic formulation of the software-defined internetworking (SDI) model, extending intradomain SDN to generic interdomain SDN to support flexible, end- to-end interdomain route control 10

  11. Goal of This Paper • A systematic formulation of the software-defined internetworking (SDI) model, extending intradomain SDN to generic interdomain SDN to support flexible, end- to-end interdomain route control • Conceptually program every single packet end-to-end in an interdomain network • Save users from the trouble of configuring and reasoning low-level details of interdomain routing (e.g., AS-path prepending, offline negotiation with different ASes and tunnel management) 11

  12. Outline • Introduction • SDI network control model 12

  13. Control Model: Abstract AS as Virtual Switch • Single domain SDN is very well understood, SDI aims to achieve similar things in interdomain setting Port 1 packet Match Action Port 2 13 Single domain SDN

  14. Control Model: Abstract AS as Virtual Switch • Single domain SDN is very well understood, SDI aims to achieve similar things in interdomain setting Port 1 packet Match Action Port 2 D S B A 14 Single domain SDN Interdomain Network

  15. Control Model: Abstract AS as Virtual Switch • Single domain SDN is very well understood, SDI aims to achieve similar things in interdomain setting • Each AS abstracted as a virtual switch with a pipeline of match-action tables and path-ports (i.e., AS paths), and exposed through north-bound protocol (e.g., ALTO) Port 1 packet Match Action Port 2 D S B A 15 Single domain SDN Interdomain Network

  16. Control Model: Abstract AS as Virtual Switch • Single domain SDN is very well understood, SDI aims to achieve similar things in interdomain setting • Each AS abstracted as a virtual switch with a pipeline of match-action tables and path-ports (i.e., AS paths), and exposed through north-bound protocol (e.g., ALTO) Each AS becomes an SDI-net Port 1 [A, B, D] packet Port 1 packet Match Port 2 Match Action [B, D] Action Port 2 Pipeline of Flexible match-action tables forwarding S A B D D S B A 16 Single domain SDN Interdomain Network

  17. Control Model: Control SDI Network • A client connects to SDI-nets to control paths in interdomain network F B E G I B A D F H T S E D S A C G H C 17

  18. Control Model: Control SDI Network • A client connects to SDI-nets to control paths in interdomain network • A client may select to control a subset of SDI-nets to simplify management and business arrangements F B E G I B A D F H T S E D S A C G H C 18

  19. SDI vs. SDN: Key Difference • Dynamic and dependent path-ports in SDI-nets • Upstream path-ports depend on downstream path-ports 19

  20. SDI vs. SDN: Key Difference • Dynamic and dependent path-ports in SDI-nets • Upstream path-ports depend on downstream path-ports [E, G, I, D] [E, F, D] [A, B, E, G, I, D] [E, H, D] [A, C, E, G, I, D] F B E G I B A D F H T S E D S A C G H 20 C

  21. SDI vs. SDN: Key Difference • Dynamic and dependent path-ports in SDI-nets • Upstream path-ports depend on downstream path-ports • Example : When E selects [E, F, D] and does not export to B, A's path-port would become [A, C, E, F, D] [E, G, I, D] [E, G, I, D] [E, F, D] [E, F, D] [A, B, E, G, I, D] [E, H, D] [E, H, D] [A, C, E, G, I, D] F B E G I B A D F H T S E D S A C G H 21 C

  22. SDI vs. SDN: Key Difference • Dynamic and dependent path-ports in SDI-nets • Upstream path-ports depend on downstream path-ports • Example : When E selects [E, F, D] and does not export to B, A's path-port would become [A, C, E, F, D] [E, G, I, D] [E, G, I, D] [E, F, D] [E, F, D] [E, H, D] [E, H, D] [A, C, E, F, D] F B E G I B A D F H T S E D S A C G H 22 C

  23. SDI vs. SDN: Key Difference • Dynamic and dependent path-ports in SDI-nets • Upstream path-ports depend on downstream path-ports • Example : When E selects [E, F, D] and does not export to B, A's path-port would become [A, C, E, F, D] [E, G, I, D] [E, G, I, D] [E, F, D] [E, F, D] [E, H, D] [E, H, D] [A, C, E, F, D] F B E Path selections at SDI-nets must be consistent G I B A D F H T S E D S A C G H 23 C

  24. Select Consistent Paths • Issue: when a client selects a different path-port at downstream, path ports at upstream may change, causing churns and disruption 24

  25. Select Consistent Paths • Issue: when a client selects a different path-port at downstream, path ports at upstream may change, causing churns and disruption • Solution : (1) Three-layer design of SDI-net, (2) Two-phase-commit path selection Shadow Shadow control plane control plane (RIB / FIB in (RIB / FIB in transition) transition Control plane (RIB) Control plane (RIB) Interdomain routing protocol Data plane (FIB) Data plane (FIB) data link 25

  26. Select Consistent Paths • Issue: when a client selects a different path-port at downstream, path ports at upstream may change, causing churns and disruption • Solution : (1) Three-layer design of SDI-net, (2) Two-phase-commit path selection Phase 1 : select paths and test consistency in shadow CP Shadow Shadow control plane control plane (RIB / FIB in (RIB / FIB in transition) transition Control plane (RIB) Control plane (RIB) Interdomain routing protocol Data plane (FIB) Data plane (FIB) data link 26

  27. Select Consistent Paths • Issue: when a client selects a different path-port at downstream, path ports at upstream may change, causing churns and disruption • Solution : (1) Three-layer design of SDI-net, (2) Two-phase-commit path selection Phase 1 : select paths and test consistency in shadow CP Shadow Shadow control plane control plane (RIB / FIB in (RIB / FIB in Interdomain transition) transition routing protocol Control plane (RIB) Control plane (RIB) Interdomain routing protocol Data plane (FIB) Data plane (FIB) data link 27

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend