Traffic-Oblivious Routing in the Hose Model

Routing traffic subject to hose model constraints has been of much recent research interest. Two-phase routing has been proposed as a mechanism for routing traffic in the hose model. It has desirable properties in being able to statically preconfigure the transport network and in being able to handle constraints imposed by specialized service overlays. In this paper, we investigate whether the desirable properties of two-phase routing come with any resource overhead compared to: 1) direct source-destination path routing; and 2) optimal scheme among the class of all schemes that are allowed to even make the routing dynamically dependent on the traffic matrix. In the pursuit of this endeavor, we achieve several milestones. First, we develop a polynomial-size linear programming (LP) formulation for maximum throughput routing of hose traffic along direct source-destination paths. Second, we develop a polynomial-size LP formulation for maximum throughput two-phase routing of hose traffic for a generalized version of the scheme proposed in our previous work. Third, we develop a polynomial-size LP formulation for minimum-cost two-phase routing of hose traffic for the generalized version of the scheme. We also give a second (simpler) LP formulation and fast combinatorial algorithm for this problem using an upper bound on the end-to-end traffic demand. Fourth, we prove that the throughput (and cost) of two-phase routing is within a factor of 2 of that of the optimal scheme. Using the polynomial-size LP formulations developed, we compare the throughput of two-phase routing to that of direct source-destination path routing and optimal scheme on actual Internet service provider topologies collected for the Rocketfuel project and three research network topologies. The throughput of two-phase routing matches that of direct source-destination path routing and is close to that of the optimal scheme on all evaluated topologies. We conclude that two-phase routing achieves its robustness to traffic variation without imposing any appreciable additional resource requirements over previous approaches.

[1]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[2]  N. McKeown,et al.  Designing a Predictable Internet Backbone Network , 2004 .

[3]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[4]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[5]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[6]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[7]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

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

[9]  O. Mangasarian.  Linear and Nonlinear Separation of Patterns by Linear Programming , 1965 .

[10]  Thomas Erlebach,et al.  Optimal bandwidth reservation in hose-model VPNs with multi-path routing , 2004, IEEE INFOCOM 2004.

[11]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[12]  Naveen Garg,et al.  Fast approximation algorithms for fractional Steiner forest and related problems , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[13]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[14]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..

[15]  Murali S. Kodialam,et al.  Maximum Throughput Routing of Traffic in the Hose Model , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Scott Shenker,et al.  Internet indirection infrastructure , 2004, IEEE/ACM Transactions on Networking.

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

[18]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.

[19]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[20]  Murali S. Kodialam,et al.  A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Murali S. Kodialam,et al.  Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  Kavé Salamatian,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.

[23]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.