Explicit routing algorithms for Internet traffic engineering

Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

Volumn , Issue , 1999, Pages 582-588

  Wang, Yufei ^a   Wang, Zheng ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIFURCATION (MATHEMATICS); INTEGER PROGRAMMING; LINEAR PROGRAMMING; MULTIPROTOCOL LABEL SWITCHING; ROUTING ALGORITHMS; TELECOMMUNICATION TRAFFIC;

BACK-BONE TOPOLOGY; HEURISTIC SCHEMES; MATHEMATICAL FORMULATION; NET WORK UTILIZATION; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; TRAFFIC DISTRIBUTIONS; TRAFFIC ENGINEERING;

TRAFFIC CONGESTION;

EID: 85013617860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.1999.805577     Document Type: Conference Paper

References (22)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows. Prentice Hall, 1993.
2. D. Awduche, J. Malcolm, M. O'Dell, and J. McManus. Requirements for traffic engineering over mpls. Internet draft, IETF, April 1998. draft-awduche-mpls-traffic-eng-00.txt.
3. F. Barahona. Network design using cut inequalities. SIAM Journal on Optimization, 6:823-837,1996.
4. L. Benmohamed, S. Dravida, P. Harshavardhana, W. Lau, and A. Mittal. Designing ip networks with performance guarantees. Bell Labs Technical Journal, December 1998.
5. D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, 1987.
6. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. Rfc-2475, IETF, December 1998.
7. J. Chifflet, P. Mahey, and V. Reynier. Proximal decomposition for multi-commodity flow problems with convex cost. Telecommunication Systems, 3:1-10,1994.
8. L. Fratta, M. Gerla, and L. Kleinrock. The flow deviation method: An approach to store-and-forwardcommunication network design. Networks, 3:97-133,1973.
9. M. Garey and D. Johnson. Computers and Intractability. W. H. Freeman and Company, 1979.
10. B. Gavish and K. Altinkemer. Backbone network design tools with economic tradeoffs. ORSA Journal on Computing,2:236-252,1990.
11. M. Gerla, J. Suruagy Monteiro, and R. Pazos. Topology design and bandwidth allocation in atm nets. IEEE Journal on Selected Areas in Communication, 7:1253-1262,1989.
12. R. Guerin and A. Orda. Qos based routing in networks with inaccurate information: theory and algorithms. INFOCOM'97,1997.
13. C. Huitema. Routingin the Internet. Prentice Hall, 1995.
14. A. E. I. Widjaja. Mate: Mpls adaptive traffic engineering. Internet draft, IETF, Aug 1998. draft-widjaja-mpls-mate-00.txt.
15. A. Kershenbaum, P. Kermani, and G. Grover. Mentor: An algorithm for mesh network topological optimization and routing. IEEE Transactions on Communications, 39:503-513,1991.
16. M. Lee and J. Yee. A logical topology and discrete capacity assignment algorithm for reconfigurable networks. Operations Research,43:102-116, 1995.
17. Q. Ma and P. Steenkiste. Routing traffic with quality-of-service guarantees in integrated service networks. In NOSSDAVV8, Cambridge, UK, 1998.
18. T. Ng and D. Hoang. Joint optimization of capacity and flow assignment in a packet-switched communications network. IEEE Transactions on Communications, COM-35.202-209,1987.
19. C. Villamizar. Ospf optimized multipath. Internet draft, IETF, March 1998. draft-ietf-ospf-omp-00.txt.
20. A. Viswanathan, N. Feldman, Z. Wang, and R. Callon. Evolution of multiprotocol label switching. IEEE Communications, may 1998.
21. Z. Wang and J. Crowcroft. Quality of service routing for supporting multimedia communications. IEEE JSAC, Sept 1996.
22. D. West. Introduction to Graph Theory. Prentice Hall, 1996.