Maximum Throughput Routing of Traffic in the Hose Model

A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.

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

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

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

[4]  Vijay Kumar,et al.  Multicast routing in self-routing multistage networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

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

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

[8]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

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

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

[11]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2002, TNET.

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

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

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

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

[16]  Scott Shenker,et al.  Internet indirection infrastructure , 2004, TNET.

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

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

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