ISPs as nodes or sets of links?

We consider the contract-switching paradigm for studying the inter-domain traffic engineering problem. In the contract-switching paradigm, each ISP in the Internet is abstracted as a set of edge-to-edge contract links. We formulate the optimal routing problem for the contract-switching paradigm by considering three objectives, namely: 1) maximizing throughput, 2) minimizing delay, and 3) minimizing bandwidth usage. We solve the optimization problems on realistic network topologies and show that the routing solutions developed using the contract-switching paradigm provides significant improvement in performance compare to the BGP routing framework with respect to the three objectives. Moreover, our simulation study also reveals that the contract-switching paradigm performs close to the best performance that can be achieved in the Internet in the absence of any abstractions.

[1]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[2]  X.. Yang,et al.  NIRA: A New Inter-Domain Routing Architecture , 2007, IEEE/ACM Transactions on Networking.

[3]  Brighten Godfrey,et al.  Pathlet routing , 2009, SIGCOMM '09.

[4]  Stefan Savage,et al.  Xl: an efficient network routing algorithm , 2008, SIGCOMM '08.

[5]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[6]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

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

[8]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[9]  M. Yuksel,et al.  Contract-switching paradigm for internet value flows and risk management , 2008, IEEE INFOCOM Workshops 2008.

[10]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[11]  Murat Yuksel,et al.  Value flows: Inter-domain routing over contract links , 2010, 2010 IEEE Globecom Workshops.

[12]  Albert G. Greenberg,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM.

[13]  Jean-Louis Le Roux,et al.  A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths , 2009, RFC.

[14]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[15]  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).

[16]  Guy Leduc,et al.  Combined intra- and inter-domain traffic engineering using hot-potato aware link weights optimization , 2008, SIGMETRICS '08.

[17]  Aditya Akella,et al.  Cooperative Interdomain Traffic Engineering Using Nash Bargaining and Decomposition , 2007, IEEE/ACM Transactions on Networking.