Maximum throughput routing of traffic in the hose model

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Kodialam, M ^a   Lakshman, T V ^a   Sengupta, Sudipta ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; NETWORK ROUTING;

MAXIMUM THROUGHPUT ROUTING; MODEL CONSTRAINTS; TWO-PHASE ROUTING;

TELECOMMUNICATION TRAFFIC;

EID: 39049137874     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.91     Document Type: Conference Paper

References (18)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, February 1993.
2. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke, "Optimal oblivious routing in polynomial time", 35th ACM Symposium on the Theory of Computing (STOC), 2003.
3. "Configuring OSPF", Cisco Systems Product Documentation, http://www.cisco.com/univercd/home/home.htm.
4. ILOG CPLEX, http://www.ilog.com.
5. N. G. Duffield, P. Goyal, A. G. Greenberg, P. P. Mishra, K. K. Ramakrishnan, J. E. van der Merwe, "A flexible model for resource management in virtual private network", ACM SIGCOMM 1999, August 1999.
6. T. Erlebach and M. Rüegg, "Optimal Bandwidth Reservation in HoseModel VPNs with Multi-Path Routing", IEEE Infocom 2004, March 2004.
7. J. A. Fingerhut, S. Suri, and J. S. Turner, "Designing Least-Cost Nonblocking Broadband Networks", Journal of Algorithms, 24(2), pp. 287-309, 1997.
8. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, B. Yener, "Provisioning a Virtual Private Network: A Network Design Problem for Multicommodity Flow", ACM Symposium on Theory of Computing (STOC) 2001, July 2001.
9. M. Kodialam, T. V. Lakshman, and S. Sengupta, "Efficient and Robust Routing of Highly Variable Traffic", Third Workshop on Hot Topics in Networks (HotNets-III), November 2004.
10. A. Kumar, R. Rastogi, A. Silberschatz , B. Yener, "Algorithms for provisioning VPNs in the hose model", ACM SICCOMM 2001, August 2001.
11. O. L. Mangasarian, "Linear and Nonlinear Separation of Patterns by Linear Programming", Operations Research 13, 1965, pp. 444-452.
12. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, C. Diot, "Traffic Matrix Estimation: Existing Techniques and New Directions", ACM SICCOMM 2002, August 2002.
13. E. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol Label Switching Architecture", RFC 3031, January 2001.
14. A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, 1986.
15. F. Shahrokhi and D. Matula, "The Maximum Concurrent Flow Problem", Journal of ACM, 37(2):318-334, 1990.
16. N. Spring, R. Mahajan, D. Wetherall, and T. Anderson, "Measuring ISP Topologies with Rocketfuel", IEEE/ACM Transactions on Networking, vol. 12, no. 1, pp. 2-16, February 2004.
17. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, S. Surana, "Internet Indirection Infrastructure", ACM SICCOMM 2002, August 2002.
18. R. Zhang-Shen and N. McKeown "Designing a Predictable Internet Backbone Network", Third Workshop on Hot Topics in Networks (HotNets-III), November 2004.