A Routing Strategy for Multihomed ISP to Mitigate the Impact of Overlay Traffic

Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP’s routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy. key words: ISP, multihoming, overlay routing, routing game, Nash equilibrium

[1]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[2]  Randy H. Katz,et al.  OverQoS: offering Internet QoS using overlays , 2003, CCRV.

[3]  Hisao Kameda,et al.  Mixed equilibrium (ME) for multiclass routing games , 2002, IEEE Trans. Autom. Control..

[4]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[5]  Amin Vahdat,et al.  Detour: a Case for Informed Internet Routing and Transport , 2007 .

[6]  Shantayanan Devarajan,et al.  A note of network equilibrium and noncooperative games , 1981 .

[7]  Andrew B. Whinston,et al.  The Economics of Smart Routing and Quality of Service , 2003, Networked Group Communication.

[8]  Teresa Maria Vazão,et al.  On the Impact of P2P File Sharing Traffic Restrictions on User Perceived Performance , 2008, 2008 International Conference on Information Networking.

[9]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[10]  Donald F. Towsley,et al.  On the interaction between overlay routing and underlay routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Laizhong Cui,et al.  Employing QoS Driven Neighbor Selection for Heterogeneous Peer-to-Peer Streaming , 2011, 2011 IEEE International Conference on Communications (ICC).

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

[13]  T. Roughgarden.  Potential functions and the inefficiency of equilibria , 2006 .

[14]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[15]  Yin Zhang,et al.  Optimizing cost and performance for multihoming , 2004, SIGCOMM 2004.

[16]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[17]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[18]  Sam C. M. Lee,et al.  Interaction of ISPs: Distributed Resource Allocation and Revenue Maximization , 2008, IEEE Transactions on Parallel and Distributed Systems.

[19]  Ariel Orda,et al.  Achieving network optima using Stackelberg routing strategies , 1997, TNET.

[20]  Yong Liu,et al.  Multihoming route control among a group of multihomed stub networks , 2007, Comput. Commun..

[21]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.