Cost effective resource allocation of overlay routing relay nodes

Overlay routing in a very attractive scheme that allows improving certain properties of the routing without the need to change the standards of the current underlying routing. However, deploying overlay routing requires the placement and maintenance of overlay infrastructure. This gives rise to the following optimization problem: find a minimal set of overlay nodes such that the required routing properties are satisfied. In this paper we rigorously study this optimization problem. We show that it is NP hard and derive a non-trivial approximation algorithm for it, where the approximation ratio depends on specific properties of the problem at hand. We examine the practical aspects of the scheme by evaluating the gain one can get over two real scenarios. The first one is BGP routing, and we show, using up-to-date data reflecting the current BGP routing policy in the Internet, that a relative small number of less than 100 relay servers are sufficient to enable routing over shorter paths from a single source to all ASes, reducing the average path length of inflated paths by 40%. We also demonstrate that using the scheme for TCP performance improvement, results in an almost optimal placement of overlay nodes.

[1]  Cengiz Alaettinoglu,et al.  Routing Policy Specification Language (RPSL) , 1998, RFC.

[2]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[3]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[4]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[5]  G. Huston,et al.  Interconnection, Peering and Settlements , 2003 .

[6]  Sudipta Sengupta,et al.  Efficient and robust routing of highly variable traffic , 2005 .

[7]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Reuven Cohen,et al.  Using proxies to enhance TCP performance over hybrid fiber coaxial networks , 1999 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[12]  Jennifer Rexford,et al.  Inherently safe backup routing with BGP , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Aman Shaikh,et al.  Placing Relay Nodes for Intra-Domain Path Diversity , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Jennifer Rexford,et al.  Stable internet routing without global coordination , 2001, TNET.

[15]  Reuven Cohen,et al.  The "Global-ISP" paradigm , 2007, Comput. Networks.

[16]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[18]  Lixin Gao,et al.  The extent of AS path inflation by routing policies , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[19]  Lili Qiu,et al.  On the Placement of Infrastructure Overlay Nodes , 2009, IEEE/ACM Transactions on Networking.

[20]  Rami Cohen,et al.  The Internet Dark Matter - on the Missing Links in the AS Connectivity Map , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Kirk Lougheed,et al.  Border Gateway Protocol (BGP) , 2021, IP Routing Protocols.

[22]  Deborah Estrin,et al.  The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[23]  Amin Vahdat,et al.  Detour: informed Internet routing and transport , 1999, IEEE Micro.

[24]  Yuval Shavitt,et al.  DIMES: let the internet measure itself , 2005, CCRV.