Cooperative Interdomain Traffic Engineering Using Nash Bargaining and Decomposition

We present a novel approach to interdomain traffic engineering based on the concepts of Nash bargaining and dual decomposition. Under this scheme, ISPs use an iterative procedure to jointly optimize a social cost function, referred to as the Nash product. We show that the global optimization problem can be separated into subproblems by introducing appropriate shadow prices on the interdomain flows. These subproblems can then be solved independently and in a decentralized manner by the individual ISPs. Our approach does not require the ISPs to share any sensitive internal information, such as network topology or link weights. More importantly, our approach is provably Pareto-efficient and fair. Therefore, we believe that our approach is highly amenable to adoption by ISPs when compared to past approaches. We also conduct simulation studies of our approach over several real ISP topologies. Our evaluation shows that the approach converges quickly, offers equitable performance improvements to ISPs, is significantly better than unilateral approaches (e.g., hot-potato routing) and offers the same performance as a centralized solution with full knowledge.

[1]  W. Norton,et al.  Internet Service Providers and Peering , 2001 .

[2]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[3]  Nick Feamster,et al.  Design and implementation of a routing control platform , 2005, NSDI.

[4]  Nick Feamster,et al.  Guidelines for interdomain traffic engineering , 2003, CCRV.

[5]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  Abraham Silberschatz,et al.  On route selection for interdomain traffic engineering , 2005, IEEE Network.

[8]  Abraham Silberschatz,et al.  Stable egress route selection for interdomain traffic engineering: model and analysis , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[9]  Ratul Mahajan,et al.  The causes of path inflation , 2003, SIGCOMM '03.

[10]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Marc Despontin,et al.  Multiple Criteria Optimization: Theory, Computation, and Application, Ralph E. Steuer (Ed.). Wiley, Palo Alto, CA (1986) , 1987 .

[12]  Renata Teixeira,et al.  Network sensitivity to hot-potato disruptions , 2004, SIGCOMM '04.

[13]  Abraham Silberschatz,et al.  On the stability of rational, heterogeneous interdomain route selection , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[14]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[15]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[16]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[17]  Ratul Mahajan,et al.  Towards Coordinated Interdomain Traffic Engineering , 2004 .

[18]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[19]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[20]  Ratul Mahajan,et al.  Negotiation-based routing between neighboring ISPs , 2005, NSDI.

[21]  E. Altman.  Utility based fair bandwidth allocation , 2002 .

[22]  K. G. Ramakrishnan,et al.  Combined economic modeling and traffic engineering: Joint optimization of pricing and routing in multi-service networks , 2001 .

[23]  Ellen W. Zegura,et al.  Interdomain Ingress Traffic Engineering Through Optimized AS-Path Prepending , 2005, NETWORKING.

[24]  Mung Chiang,et al.  Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing , 2007, IEEE Journal on Selected Areas in Communications.

[25]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[26]  W. Thomson.  The Manipulability of Resource Allocation Mechanisms , 1984 .

[27]  Ratul Mahajan,et al.  Practical and efficient internet routing with competing interests , 2005 .

[28]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[29]  Joan Feigenbaum,et al.  Incentive-compatible interdomain routing , 2006, EC '06.

[30]  Jennifer Rexford,et al.  Trafc Engineering Between Neighboring Domains , 2002 .

[31]  Ilya Segal,et al.  Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .

[32]  Eitan Altman,et al.  Fair Bandwidth allocation between service providers in a geostationary satellite network , 2002 .

[33]  Alexander Hall,et al.  Incentive-Compatible Interdomain Routing with Linear Utilities , 2007, Internet Math..

[34]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[35]  Mung Chiang,et al.  DEFT: Distributed Exponentially-Weighted Flow Splitting , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[36]  Hong Yan,et al.  A clean slate 4D approach to network control and management , 2005, CCRV.

[37]  Joan Feigenbaum,et al.  Incrementally-Deployable Security for Interdomain Routing , 2009, 2009 Cybersecurity Applications & Technology Conference for Homeland Security.

[38]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[39]  B. Quoitin,et al.  Tweak-it: BGP-based interdomain traffic engineering for transit ASs , 2005, Next Generation Internet Networks, 2005.

[40]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[41]  Joan Feigenbaum,et al.  Distributed Algorithmic Mechanism Design , 2018 .