1 praveen k. muthuswamy electrical computer and systems engineering rensselaer polytechnic institute...
TRANSCRIPT
![Page 1: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/1.jpg)
1
ISPs as Nodes or Sets of Links?
Praveen K. MuthuswamyElectrical Computer and Systems Engineering
Rensselaer Polytechnic Institute
In collaboration withKoushik Kar, Aparna Gupta (RPI)
Hasan T. Karaoglu, Murat Yuksel (UNR)
![Page 2: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/2.jpg)
2
Motivation
Contract-Switching Architecture
Internet Traffic Engineering using Contract-switching
Numerical study and Benchmarking
Distributed TE Solution
Contributions and Future work
Outline
![Page 3: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/3.jpg)
Attain high-efficiency inter-domain TE
Numerous methods for intra-domain TE
Inter-domain TE involves many factors ranging from
technology to economics and policy
Current Inter-domain TE techniques are constrained to
outbound traffic load balancing
Cooperative inter-domain traffic engineering among
neighboring ISPs is necessary
Motivation
![Page 4: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/4.jpg)
ISP is abstracted as a single node or as a set of nodes
(in case of multiple ASes)
Node abstraction simplifies inter-domain routing
Loss of path selection and flexibility beyond shortest-
path routing in terms of AS hops.
Sufficient flexibility at the routing level is crucial for TE
Internet Routing Limitations
![Page 5: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/5.jpg)
Link-state mechanisms to inter-domain routing
◦ K. Levchenko, G. M. Voelker, R. Paturi, and S. Savage. Xl: an efficient network
routing algorithm. In Proc. SIGCOMM, 2008.
Pathlet Routing abstracts ISP as virtual nodes
◦ Scott Shenker, P. Brighten Godfrey, Igor Ganichev, and Ion Stoica, Pathlet routing.
Proc. SIGCOMM, 2009.
Inter-AS source routing and GMPLS
◦ Xiaowei Yang, David Clark, and Arthur Berger, NIRA: A new inter-domain routing
architecture. IEEE/ACM Transactions on Networking, 15:775–788, 2007.
◦ E. Mannie. Generalized mpls architecture, RFC 3945
Related Work
![Page 6: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/6.jpg)
6
Contract-Switching Paradigm for Internet value flows and risk management, Yuksel et al. 2008
ISP is abstracted as a set of contract links
Contract link – Advertisable contract between edge nodes (peering points) of an ISP
Contract-Switching Paradigm
Network Coreaccessed onlyby contracts
Customers
EdgeRouter
EdgeRouter
EdgeRouter
EdgeRouter
EdgeRouter
EdgeRouter
Stations of the provider computing and advertising local prices for edge-to-
edge contracts.
30Mbps, 45 min, $9
![Page 7: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/7.jpg)
7
Each contract link follows a single, fixed intra-AS path End-to-end flows are optimally split along contract links Optimal inter-domain traffic engineering, but simple intra-
domain routing
Internet Traffic Engineering using CSP
![Page 8: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/8.jpg)
Notations
- Bandwidth capacity of router-to-router link
- Physical links used to construct edge-to-edge link
- Total traffic at edge router for destination
- Flow on the contract or peering link
![Page 9: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/9.jpg)
9
Maximum Throughput Routing
Optimal TE formulation (1/2)
Capacity constraints
Flow-conservation constraints
Edge-to-edge flows
Throughput
![Page 10: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/10.jpg)
10
Minimum Delay Routing
Vxy(f) is a convex-cost with each router-to-router link. Consider M/M/1 delay cost.
Minimum Bandwidth Routing
Optimal TE formulation (2/2)
![Page 11: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/11.jpg)
11
Global Optimum (OPT) – Complete Internet topology
without abstractions (optimal inter and intra-domain
routing)
BGP framework – Least ISP hops for inter-domain and
OSPF/RIP for intra-domain
Frameworks for Benchmarking
![Page 12: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/12.jpg)
12
Random topology◦ Inter-domain and Intra-domain are random
BRITE topology◦ BRITE model for inter-domain◦ Rocketfuel Topologies (ABILENE and GEANT) for
intra-domain GTITM topology
◦ GTITM model for inter-domain◦ Rocketfuel Topologies (ABILENE and GEANT) for
intra-domain
Simulation Results
![Page 13: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/13.jpg)
13
Average throughput on 50 random topologies
Maximum Throughput
![Page 14: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/14.jpg)
14
Delay on Sample Random topology and Sample BRITE topology
Minimum Delay
![Page 15: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/15.jpg)
Average total bandwidth on 50 BRITE topologies
Minimum Bandwidth
![Page 16: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/16.jpg)
Derived using the gradient descent approach to penalized objective function
Traffic rate variables for each destination at each edge-link
Updating of traffic rates requires only “local” information Gradient projection method for AS j involves projection
on , the intra-domain capacity region Gradient projection method for e-edge links requires the
congestion along the link and local communication between the end nodes
Distributed TE solution
![Page 17: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/17.jpg)
17
Generate Internet topologies according to BRITE Size of each AS is 10 routers Obtain ratio of converged cost to optimum cost
Both average and maximum ratio is close to 1 Converged cost of the proposed TE solution is close to
the optimum
Numerical Study
Number of ASes
10 20 30
Average 1.0039 1.0057 1.0059
Maximum 1.0046 1.01 1.0093
![Page 18: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/18.jpg)
18
Average convergence time
Convergence if cost does not vary beyond 0.5% Convergence time seems to increase sub-linearly with
number of ASes, and number of destinations
![Page 19: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/19.jpg)
19
Contract link abstraction provides significant
improvement in routing performance over BGP
Close to the best achievable performance
Link abstraction is good for inter-domain traffic
engineering
Developed distributed TE solution based on gradient
descent and studied its performance numerically
Conclusion
![Page 20: 1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)](https://reader037.vdocuments.site/reader037/viewer/2022103111/55189a6c550346a61f8b45e2/html5/thumbnails/20.jpg)
Thank You !!Questions ?