Multicommodity flow problems with a bounded number of paths: A flow deviation approach

Networks

Volumn 49, Issue 1, 2007, Pages 80-89

  Duhamel, Christophe ^a   Mahey, Philippe ^a  

^a CNRS   (France)

Author keywords

Flow deviation; Multicommodity flow; Routing

Indexed keywords

APPROXIMATION THEORY; BROADBAND NETWORKS; CONGESTION CONTROL (COMMUNICATION); LINEAR PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION;

FLOW DEVIATION; MULTICOMMODITY FLOW; MULTIPLE PROTOCOLS AND LABEL-SWITCHED PATHS (MPLS); NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTION; PATH GENERATION;

NETWORK PROTOCOLS;

EID: 33947578257     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20143     Document Type: Conference Paper

References (22)

1. R. Ahuja, T. Magnanti, and J. Orlin, Network flows: Theory and algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. G. Baier, E. Köehler, and M. Skutella, On the k-splittable flow problem, Algorithmica 42 (2005), 231-248.
3. D. Banerjee and B. Mukherjee, Wavelength-routed optical networks: Linear formulation, resource-budgeting tradeoffs and a reconfiguration study, IEEE/ACM Trans Networking 8 (2000), 598-607.
4. D. Bertsekas, Nonlinear programming, Prentice-Hall, Englewood Cliffs, NJ, 1995.
5. D. Bertsekas and R. Gallager, Data networks, Prentice-Hall, Englewood Cliffs, NJ, 1987.
6. D. Bienstock, Potential function methods for approximately solving linear programming problems: Theory and practice, Kluwer Publishers, Boston, 2003.
7. D. Bienstock and O. Raskina, Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem, Math Program 91 (2002), 479-492.
8. J. Burns, T. Ott, A. Krzesinski, and K. Muller, Path selection and bandwidth allocation in MPLS networks: A non linear programming approach, Perform Evaluat 52 (2003), 133-152.
9. M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Res Logistics Q 3 (1956), 95-110.
10. L. Fratta, M. Gerla, and L. Kleinrock, The flow deviation method: An approach to store-and-forward computer-communication network design, Networks 3 (1973), 97-133.
11. N. Garg and J. Koenemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems" FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Washington DC, 1998, pp. 300-309.
12. M.D. Grigoriadis and L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM J Optimizat 4 (1994), 86-107.
13. J. Kleinberg, Approximation algorithms for disjoint path problems, PhD thesis, MIT, Cambridge, 1996.
14. L.J. LeBlanc, R. Helgason, and D. Boyce, Improved efficiency of the Frank-Wolfe algorithm for convex network programs, Transport Sci 19 (1985), 445-462.
15. L.J. LeBlanc, P. Mahey, and J. Chifflet, Packet routing in telecommunications networks with path and flow restrictions, INFORMS J Comput 11 (1999), 188-197.
16. L.J. LeBlanc, E. Morlock, and W. Pierskalla, An efficient approach to solving the road network equilibrium traffic assignment problem, Trans Res 3 (1975), 309-318.
17. F.T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, J Comput Syst Sci 50 (1995), 228-243.
18. M. Martens and M. Skutella, Flows on few paths: Algorithms and lower bounds, Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04), S. Albers and T. Radzik (Editors), Lecture Notes in Computer Science, Springer, Berlin, 2004, Vol. 3221, pp. 520-531.
19. V. Mirrokni, M. Thottan, H. Uzunalioglu, and S. Paul, "A simple polynomial time framework for reduced-path decomposition in multi-path routing," Proc. INFOCOM, 2004, pp. 739-749.
20. S.A. Plotkin, D.B. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math Oper Res 20 (1995), 257-301.
21. F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, J ACM 37 (1990), 318-334.
22. B. Vatinlen, C. Duhamel, F. Chauvet, and P. Mahey, "Minimizing congestion with a bounded number of paths," Proc. Algotel'03, Banyuls, 2003, pp. 155-160.