A simple method for balancing network utilization and quality of routing

Proceedings - International Conference on Computer Communications and Networks, ICCCN

Volumn 2005, Issue , 2005, Pages 71-76

  Li, Yuxi ^a   Harms, Janelle ^a   Holte, Robert ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; MATRIX ALGEBRA; PROBLEM SOLVING; QUALITY OF SERVICE; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

CONFLICTING OBJECTIVES; PATH VARIATIONS; PENALTY METHODS; ROUTING SCHEMES;

ROUTERS;

EID: 33748359109     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2005.1523811     Document Type: Conference Paper

References (19)

1. CPLEX: Mathematical programming solver, http://www.cplex.com.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall Inc., 1993.
3. D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In Proceedings of SIGCOMM'03, pages 313-324. Karlsruhe, Germany, August 2003.
4. D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus. Requirements for traffic engineering over MPLS. IETF RFC 2702, September 1999.
5. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke. Optimal oblivious routing in polynomial time. In Proceedings of 35th STOC, pages 383-388. San Diego, June 2003.
6. D. P. Bertsekas and R. G. Gallager. Data Networks (2nd Edition). Printice Hall, 1992.
7. S. Bhattacharyya, C. Diot, J. Jetcheva, and N. Taft. Geographical and temporal characteristics of Inter-POP flows: View from a single POP. European Transactions on Telecommunications, 13(1):5-22, February 2002.
8. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traffic demands for operational IP networks: methodology and experience. IEEE/ACM Transactions on Networking, 3(9):265-279, June 2001.
9. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of INFOCOM'00, pages 519-528. Tel-Aviv, Israel, March 2000.
10. R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. Inferring link weights using end-to-end measurements. In Proceedings of IMW'02, pages 231-236. Marseille, France, November 2002.
11. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot. Traffic matrix estimation: existing techniques and new directions. In Proceedings of SIGCOMM'03, pages 161-174. Karlsruhe, Germany, August 2003.
12. D. Mitra and K. G. Ramakrishna. A case study of multiservice, multipriority traffic engineering design for data networks. In Proceedings of Globecom'99, pages 1077-1083. Rio de Janeiro, Brazil, December 1999.
13. A. Ouorou, P. Mahey, and J.-P. Vial. A survey of algorithms for convex multicommodity flow problems. Management Science, 46(1):126-147, January 2000.
14. H. Räcke. Minimizing congestion in general networks. In Proceedings of 43th IEEE FOCS, pages 43-52. Vancouver, Canada, November 2002.
15. E. Rosen, A. Viswanathan, and R. Callon. Multiprotocol label switching architecture. IETF RFC 3031, Standards Track, January 2001.
16. A. Soule, A. Nucci, E. Leonardi, R. Cruz, and N. Taft. How to identify and estimate top largest OD flows in a dynamic environment. In Proceedings of SIGMETRICS'04, pages 49-60. New York, June 2004.
17. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proceedings of SIGCOMM'02, pages 133-146. Pittsburgh, August 2002.
18. J. Wang, L. Li, S. H. Low, and J. C. Doyle. Cross-layer optimization in TCP/IP networks. IEEE/ACM Transactions on Networking, 13(3):568-582, June 2005.
19. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In Proceedings of SIGMETRICS'03, pages 206-217. San Diego, June 2003.