Presentation is loading. Please wait.

Presentation is loading. Please wait.

Routing Games for Traffic Engineering F. Larroca and J.L. Rougier IEEE International Conference on Communications (ICC 2009) Dresden, Germany, June 14-18.

Published byAmos Pearson Modified over 8 years ago

Similar presentations

Presentation on theme: "Routing Games for Traffic Engineering F. Larroca and J.L. Rougier IEEE International Conference on Communications (ICC 2009) Dresden, Germany, June 14-18."— Presentation transcript:

1 Routing Games for Traffic Engineering F. Larroca and J.L. Rougier IEEE International Conference on Communications (ICC 2009) Dresden, Germany, June 14-18 2009

2 page 1 Introduction Current traffic is highly dynamic and unpredictable How may we define a routing scheme that performs well under these demanding conditions? Possible answer: Dynamic Load-Balancing We connect each Origin-Destination (OD) pair with several pre-established paths Traffic distribution depends on current TM and network condition Greedy algorithms on path cost function f P : Minimum coordination Routing Game Ideal case study for game theory: Routing Game F. Larroca and J.L. Rougier IEEE ICC 2009

3 page 2 Introduction First Contribution: New routing game designed for elastic traffic Basic Idea: use load-balancing to further maximize the utility obtained by TCP flows Second Contribution: Performance comparison of three routing games Considered games: -Congestion Game -Bottleneck Game -Our proposition F. Larroca and J.L. Rougier IEEE ICC 2009

4 page 3 Agenda Introduction Basic Definitions and Results New Routing Game Evaluation Conclusions F. Larroca and J.L. Rougier IEEE ICC 2009

5 page 4 Definitions 3 functions to define a Routing Game: Link cost: f l (  l ) Path cost: f P =g ({ f l (  l )} lP ) Social Cost: SC(d) Congestion Game: Equilibrium minimizes instead of SC(d) To converge to the optimum we should use Example: MPLS adaptive traffic engineering (MATE) [EJLW01] F. Larroca and J.L. Rougier IEEE ICC 2009

6 page 5 Definitions 3 functions to define a Routing Game: Link cost: f l (  l ) Path cost: f P =g ({ f l (  l )} lP ) Social Cost: SC(d) Bottleneck Game: Equilibrium and social optimum coincide! Examples: TeXCP [KKDC05] and REPLEX [FKF06] F. Larroca and J.L. Rougier IEEE ICC 2009

7 page 6 Agenda Introduction Basic Definitions and Results New Routing Game Evaluation Conclusions F. Larroca and J.L. Rougier IEEE ICC 2009

8 page 7 New Routing Game: Intuition Assume each OD pair s has exactly N s TCP flows Congestion Control Problem (x = TCP rate): N si (flows per path) are given. Why not optimize in both x and N? First idea: à la Multi-Path TCP (optimized by end-users) Our idea: keep the separation between end-to-end congestion control (maximization on x) and routing (maximization on N) F. Larroca and J.L. Rougier IEEE ICC 2009

9 page 8 New Routing Game: Definition First problem: Considered time-scale Time-Scale(TCP) << Time-Scale(Routing) Approximations of x si and N si are necessary: Second problem: U si (x) is not known by routing Use arbitrary U(x) Result: Equilibrium and SC optimum are not the same! However, we provide an adaptation of f l (  l ) F. Larroca and J.L. Rougier IEEE ICC 2009

10 page 9 Agenda Introduction Basic Definitions and Results New Routing Game Evaluation Conclusions F. Larroca and J.L. Rougier IEEE ICC 2009

11 page 10 Evaluation: simple examples Example 1: Congestion Game is reluctant to use longer paths => bigger maximum link utilization F. Larroca and J.L. Rougier IEEE ICC 2009

12 page 11 Evaluation: simple examples Example 2: Path lengths relatively similar (even if link capacities are different) => UM and CG obtain similar results (plus: difference with BG not as important) F. Larroca and J.L. Rougier IEEE ICC 2009

13 page 12 Evaluation: simple examples Example 3: The only mechanism that enforce fairness at a path level is Utility Maximization F. Larroca and J.L. Rougier IEEE ICC 2009

14 Evaluation: Realistic Topologies page 13F. Larroca and J.L. Rougier IEEE ICC 2009 ABW si is always bigger in our proposal Not very big over CG in mean ( 15%). Origin: fairness More important with respect to BG Link utilization relatively similar among all games CG obtains a bigger maximum (5-10%)

15 page 14 Agenda Introduction Basic Definitions and Results New Routing Game Evaluation Conclusions F. Larroca and J.L. Rougier IEEE ICC 2009

16 page 15 Conclusions and Future Work The proposed game is the most balanced one: It generally outperforms the rest When it does not, the difference is not important However, it is more difficult to implement We are interested in the total mean delay Answer: Congestion Routing Game Heavily depends on the assumed model Load-balancing mechanism that converges to the minimum-delay configuration without assuming any model? Yes! [LR09][LR09a] F. Larroca and J.L. Rougier IEEE ICC 2009

17 page 16 References [EJLW01]: A. Elwalid; C. Jin; S. Low and I. Widjaja "MATE: MPLS adaptive traffic engineering" INFOCOM 2001. [KKDC05]: S. Kandula; D. Katabi; B. Davie and A. Charny "Walking the tightrope: responsive yet stable traffic engineering" ACM SIGCOMM '05 [FKF06]: S. Fischer; N. Kammenhuber and A. Feldmann "REPLEX: dynamic traffic engineering based on wardrop routing policies" CoNEXT '06 [LR09]: F. Larroca and J.L. Rougier "Minimum-Delay Load-Balancing Through Non-Parametric Regression" IFIP/TC6 NETWORKING 2009 [LR09a]: F. Larroca and J.L. Rougier "Robust Regression for Minimum-Delay Load-Balancing" 21st International Teletraffic Congress (ITC 21) Thank you Questions? F. Larroca and J.L. Rougier IEEE ICC 2009

Download ppt "Routing Games for Traffic Engineering F. Larroca and J.L. Rougier IEEE International Conference on Communications (ICC 2009) Dresden, Germany, June 14-18."

Similar presentations

Responsive Yet Stable Traffic Engineering Srikanth Kandula Dina Katabi, Bruce Davie, and Anna Charny.

Responsive Yet Stable Traffic Engineering Srikanth Kandula Dina Katabi, Bruce Davie, and Anna Charny.
Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.

Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.
Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma, Jiang Chen, Yang Richard Yang and Arvind Krishnamurthy Yale University University.

Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma, Jiang Chen, Yang Richard Yang and Arvind Krishnamurthy Yale University University.
PATH SELECTION AND MULTIPATH CONGESTION CONTROL BY P. KEY, L. MASSOULIE, AND D. TOWSLEY R02 – Network Architectures Michaelmas term, 2013 Ulku Buket Nazlican.

PATH SELECTION AND MULTIPATH CONGESTION CONTROL BY P. KEY, L. MASSOULIE, AND D. TOWSLEY R02 – Network Architectures Michaelmas term, 2013 Ulku Buket Nazlican.
Internet Protocols Steven Low CS/EE netlab.CALTECH.edu October 2004 with J. Doyle, L. Li, A. Tang, J. Wang.

Internet Protocols Steven Low CS/EE netlab.CALTECH.edu October 2004 with J. Doyle, L. Li, A. Tang, J. Wang.
Price Of Anarchy: Routing

Price Of Anarchy: Routing
1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, Bandwidth sharing: objectives and algorithms,“

1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“
Noam Nisan, Michael Schapira, Gregory Valiant, and Aviv Zohar.

Noam Nisan, Michael Schapira, Gregory Valiant, and Aviv Zohar.
Dynamic Traffic Engineering Techniques for the Internet Federico Larroca Supervisor: Jean-Louis Rougier December 18th 2009.

Dynamic Traffic Engineering Techniques for the Internet Federico Larroca Supervisor: Jean-Louis Rougier December 18th 2009.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.

Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Bilal Gonen University of Alaska Anchorage Murat Yuksel University of Nevada, Reno.

Bilal Gonen University of Alaska Anchorage Murat Yuksel University of Nevada, Reno.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.

1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.

XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.

Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
Can Congestion Control and Traffic Engineering be at Odds? Jiayue He, Mung Chiang, Jennifer Rexford Princeton University November 30 th, 2006.

Can Congestion Control and Traffic Engineering be at Odds? Jiayue He, Mung Chiang, Jennifer Rexford Princeton University November 30 th, 2006.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.

Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Lecture 9. Unconstrained Optimization Need to maximize a function f(x), where x is a scalar or a vector x = (x 1, x 2 ) f(x) = -x 1 2 - x 2 2 f(x) = -(x-a)

Lecture 9. Unconstrained Optimization Need to maximize a function f(x), where x is a scalar or a vector x = (x 1, x 2 ) f(x) = -x x 2 2 f(x) = -(x-a)
Competitive Routing in Multi-User Communication Networks Presentation By: Yuval Lifshitz In Seminar: Computational Issues in Game Theory (2002/3) By: Prof.

Competitive Routing in Multi-User Communication Networks Presentation By: Yuval Lifshitz In Seminar: Computational Issues in Game Theory (2002/3) By: Prof.
Bottleneck Routing Games in Communication Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.

Bottleneck Routing Games in Communication Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.

Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.

Similar presentations

Ads by Google