A hybrid multicommodity routing algorithm for traffic engineering

Networks

Volumn 43, Issue 3, 2004, Pages 125-140

  Ouaja, Wided ^a   Richards, Barry ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Constraint programming; Integer multi commodity flows; Lagrangian relaxation; Network routing; Optimization; Traffic engineering

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER NETWORKS; CONSTRAINT THEORY; DATA ACQUISITION; INTERNET; LAGRANGE MULTIPLIERS; ONLINE SYSTEMS; OPTIMIZATION; ROUTERS;

LAGRANGIAN RELAXATION; MULTICOMMODITY FLOWS; TRAFFIC ENGINEERING; TRAFFIC MATRICES;

TELECOMMUNICATION TRAFFIC;

EID: 2542603157     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10110     Document Type: Review

References (31)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms and applications, Prentice-Hall, Upper Saddle River, NJ, 1993.
2. D.O. Awduche, J. Malcom, M. O'Dell, and J. McManus, Requirements for traffic engineering over MPLS, draft-awduche-mpls-traffic-eng-00.txt, IETF Internet Draft, April 1998.
3. M.S. Bazaraa and H.D. Sherali, On the choice of step size in subgradient method, Eur J OR 7 (1981), 380-388.
4. D.P. Bertsekas, Network optimization: Continuous and discrete models, Athena Scientific, Belmont, MA, 1998.
5. P.M. Camerini, L. Fratta, and F. Maffioli, On improving relaxation methods by modified gradient techniques, Math Program Study 3 (1975), 26-34.
6. Cisco Systems, OSPF design guide, http://www.cisco.com/warp/public/104/2. html, 1996.
7. H. Crowder, Computational improvements for subgradient optimization, Symp Math 19 (1976), 357-372.
8. B. Davie and Y. Rekhter, MPLS technology and applications, Morgan Kaufmann, San Francisco, 2000.
9. M. Garey and D. Johnson, Computers and intractability, Freeman, New York, 1979.
10. R. Guerin, A. Orda, and D. Williams, QoS routing mechanisms and OSPF extensions, draft-guerin-qos-routing-ospf-00.txt, IETF Internet Draft, November 1996.
11. M. Guignard, Efficient cuts in Lagrangean relax-and-cut schemes, J Oper R 105 (1998), 216-223.
12. M. Held, P. Wolfe, and H.P. Crowder, Validation of subgradient optimization, Math Program 6 (1974), 62-88.
13. J.N. Hooker, Logic, optimization and constraint programming, INFORMS J Comput 14 (2002), 295-321.
14. e User Manual, IC-PARC, Imperial College London, 2000.
15. ILOG, CPLEX 6.5 Manual, http://www.cplex.com, 1999.
16. J. Jaffar and J.L. Lassez, Constraint logic programming: A survey, J Log Program 19 (1994), 503-581.
17. N. Jussein and F. Laburthe (Editors), Proc of the 4th Int Workshop on the Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, Le Croisic, France, 2002.
18. A. Juttner, B. Szviatovski, I. Mecs, and Z. Rajko, Lagrange relaxation based method for the QoS routing, Proc INFOCOM'01, 2001, pp. 859-868.
19. K. Kompella and D.O. Awduche, Notes on path computation in constraint-based routing, draft-kompella-te-path-comp-OO.txt, IETF Internet Draft, July 2000.
20. C. Lemarechal, "Lagrangian relaxation," Computational combinatorial optimization: Optimal or provably near-optimal solutions, M. Jünger and D. Naddef (Editors), Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, 2001, pp. 112-156.
21. Q. Ma and P. Steenkiste, On path selection for traffic with bandwidth guarantees, Proc IEEE Int Conf on Network Protocols, Atlanta, 1997, pp. 191-202.
22. H.D. Sherali and G. Choi, Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs, OR Lett 19 (1996), 105-113.
23. S. Suri, M. Waldvogel, D. Bauer, and P.R. Warkhede, Profile-based routing and traffic engineering, Comput Commun 26 (2003), 351-365.
24. E. Tsang, Foundations of constraint satisfaction, Academic Press, London, 1993.
25. Y. Wang and Z. Wang, Explicit routing algorithms for internet traffic engineering, Proc IEEE Int Conf on Computer Communications and Networks, 1999, pp. 582-588.
26. Z. Wang and J. Crowcroft, Quality-of-service routing for supporting multimedia applications, IEEE J Sel Areas Commun 14 (1996), 1228-1234.
27. W.L. Winston, Operations research, applications and algorithms, Duxbury Press, Belmont, CA, 1994.
28. L.A. Wolsey, Integer programming, Wiley, New York, 1998.
29. X. Xiao, A. Hannan, B. Bailey, S. Carter, and L. Ni, Traffic engineering with MPLS in the internet, IEEE Network 5 (2000), 28-33.
30. X. Xiao and L. Ni, Internet QoS: A big picture, IEEE Network 13 (1999), 8-18.
31. H.H. Yen and Y.S. Lin, Near-optimal delay constrained routing in virtual circuit networks, Proc INFOCOM'01, 2001, pp. 750-756.