Skip to main content
SpringerLink
Log in

Multicommodity Flow Problems and Decomposition in Telecommunications Networks

  • Chapter
Handbook of Optimization in Telecommunications

Abstract

The purpose of this chapter is to investigate multicommodity flow problems that appear in the network design and operation of modern broadband packet-switched networks. We present arc-node and arc-path models and analyze specialized formulations corresponding to hard to solve instances like the minimax congestion problem and the capacity assignment of data networks in the presence of failures. Decomposition methods are studied to cope with the coupling constraints which define interactions between commodities on critical arcs or the combinatorial choice between normal and spare capacities. We focus here mainly on continuous flow models with linear or convex costs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Bellcore Technical Advisory. Synchronous optical networks (sonet) fiber optic transmission systems requirements and objectives. Technical Report TA-NWT-000253, Bellcore, 1990.

    Google Scholar 

  • R. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory and Algorithms. Prentice-Hall, Englewood Cliffs, 1993.

    Google Scholar 

  • C. Arbib, U. Mocci, and C. Scoglio. Methodological aspects of ring network design. Lecture Notes in Control and Information Sciences, 180:135–144, 1992.

    Article  MathSciNet  Google Scholar 

  • A. Balakrishnan, T.L. Magnanti, J.S. Sokol, and Y. Wang. Telecommunication link restoration planning with multiple facility types. Annals of Operations Research, 106:127–154, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  • D. Banerjee and B. Mukherjee. A practical approach for routing and wavelength assignment in large wavelength-routed optical networks design. IEEE journal on selected areas in telecommunications, 14(5):903–908, 1996.

    Article  Google Scholar 

  • J.F. Benders. Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik, 4:238–252, 1962.

    Article  MATH  MathSciNet  Google Scholar 

  • D. Bertsekas and R. Gallager. Data networks. Prentice-Hall, Englewood Cliffs, 1987.

    Google Scholar 

  • D. P. Bertsekas. Nonlinear Programming. Prentice-Hall, Englewood Cliffs, 1995.

    MATH  Google Scholar 

  • D. Bienstock. Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Kluwer Publishers, 2003.

    Google Scholar 

  • D. Bienstock and O. Günlük. Computational experience with a difficult mixed-integer multicommodity flow problem. Mathematical Programming, 68:213–237, 1995.

    MathSciNet  Google Scholar 

  • D. Bienstock and O. Raskina. Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Mathematical Programming, 91:479–492, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  • Z.R. Bogdanowicz. A new optimal algorithm for backbone topology design in communications networks. Mathematical and Computer Modelling, 17(8):49–61, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  • J.F. Bonnans, M. Haddou, A. Lisser, and R. Rébaï. Proximal decomposition method for solving global survivability in telecommunication networks. Technical Report INRIA RR-4055, INRIA, Rocquencourt, 2000.

    Google Scholar 

  • C.A. Brackett. Dense wavelength division networks: principles and applications. IEEE Journal of Selected Areas in Communications, 8:948–964, 1990.

    Article  Google Scholar 

  • S.G. Chang. Fair integration of routing and flow control in communication-networks. IEEE Transactions on Communications, COM-40(4):821–834, 1992.

    Article  Google Scholar 

  • S.G. Chang. An efficient approach to real-time traffic routing for telephone network management. Journal of Operational Research Society, 45(2): 187–201, 1994.

    Article  MATH  Google Scholar 

  • Y.G. Chang, J.L.C. Wu, and H.J. Ho. Optimal virtual circuit routing in computer networks. IEE Proceedings-I Communications Speech and Vision, 139(6):625–632, 1992.

    Google Scholar 

  • P. Chardaire and A. Lisser. Minimum cost multicommodity flows. In P.M. Pardalos and M.G.C. Resende, editors, Handbook on Applied Optimization, pages 404–422. Oxford University Press, 2002a.

    Google Scholar 

  • P. Chardaire and A. Lisser. Simplex and interior point specialization algorithms for solving non-oriented multicommodity flow problems. Operations Research, 50(2): 260–276, 2002b.

    Article  MathSciNet  Google Scholar 

  • D. Coudert and H. Rivano. Lightpath assignment for multifibers wdm networks with wavelength translators. IEEE Global Telecommunications Conference, 21(1):2693–2697, 2002.

    Google Scholar 

  • G.B. Dantzig and P. Wolfe. The decomposition algorithm for linear programming. Econometrica, 29(4):767–778, 1961.

    Article  MATH  MathSciNet  Google Scholar 

  • J. Eckstein. Parallel alternating direction multiplier decomposition of convex programs. JOTA, 80, 1994.

    Google Scholar 

  • J. Eckstein and M. Fukushima. Some reformulations and applications of the alternating direction method of multipliers. In Large-scale optimization: State of the art. Kluwer Academic Publishers, 1993.

    Google Scholar 

  • N.D. Fonseca, A.P. Castro, and A.T. Rios. A procedure for resource allocation in switchlet networks. GLOBECOM 2002, IEEE Global Telecommunications Conference, 21(1):1895–1898, 2002.

    Google Scholar 

  • M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3:95–110, 1956.

    Article  MathSciNet  Google Scholar 

  • L. Fratta, M. Gerla, and L. Kleinrock. The flow deviation method: an approach to store-and-forward computer-communication network design. Networks, 3, 1973.

    Google Scholar 

  • N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proc. 39th Ann. Symp. on Foundations of Computer Science, 1998.

    Google Scholar 

  • A. Girard and B. Sanso. Multicommodity flow models, failure propagation, and reliable loss network design. IEEE-ACM transactions on Networking, 6(1):82–93, 1998.

    Article  Google Scholar 

  • R. Glowinski and A. Marocco. Sur 1’approximation par éléments finis d’ordre 1 et la resolution par pénalisation-dualité d’une classe de problèmes de dirchlet non linéaires. RAIRO, 2, 1975.

    Google Scholar 

  • J.-L. Goffin, A. Haurie, and J.-P. Vial. Cutting planes and column generation techniques with the projective algorithm. Journal of Optimization Theory and Applications, 65:409–429, 1992.

    Article  Google Scholar 

  • L. Gouveia. Multicommodity flow models for spanning trees with hop constraints. European journal of Operational Research, 95(1): 178–190, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  • M. D. Grigoriadis and L. G. Khachiyan. Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization, 4(1):86–107, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  • W.D. Grover. Design of a meta-mesh of chain subnetworks: Enhancing the attractiveness of mesh-restorable wdm networking on low connectivity graphs. IEEE Journal on Selected Areas in Communications, 20(1):47–61, 2002.

    Article  MathSciNet  Google Scholar 

  • S. Gupta and H. Pirkul. Design of centralized telecommunication networks. International Transactions in Operational Research, 3(1): 1–21, 1996.

    Article  Google Scholar 

  • J. Kennington and M. Lewis. The path restoration version of the spare capacity allocation problem with modularity restrictions: Models, algorithms, and an empirical analysis. INFORMS Journal on Computing, 13(3): 181–190, 2001.

    Article  Google Scholar 

  • J.F.P. Labourdette and A.S. Acampora. Logically rearrangeable multihop lightwave networks. IEEE transactions on Communications, COM-39(11):464–484, 1991.

    Google Scholar 

  • L. B. J. LeBlanc, R. Helgason, and D.E. Boyce. Improved efficiency of the frank-wolfe algorithm for convex network programs. Transportation Sci., 19:445–462, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  • L.J. LeBlanc, J.S. Park, V. Sridhar, and J. Kalvenes. Topology design and bridge-capacity assignment for interconnecting token ring lans: A simulated annealing approach. Telecommunication Systems, 6(1):21–43, 1996.

    Article  Google Scholar 

  • F. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228–243, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  • A. Lisser, R. Sarkissian, and J.P. Vial. Mid-range planning of survivable telecommunications networks: joint optimal synthesis of base and spare network capacities. Technical Report 14, France Telecom R&D, 1998.

    Google Scholar 

  • A. Lisser, R. Sarkissian, and J.P. Vial. Solving lp relaxation for survivability problems in telecommunication networks. Investigación Operativa, 9(1–2–3):21–47, 2000.

    Google Scholar 

  • P. Mahey, S. Oualibouch, and Pham D.T. Proximal decomposition on the graph of a maximal monotone operator. SIAM J. Optimization, 5:454–466, 1995.

    Article  MATH  Google Scholar 

  • D. Medhi and S. Guptan. Network dimensioning and performance of multiservice, multirate loss networks using dynamic routing. IEEE-ACM transactions on Networking, 5(6):994–957, 1975.

    Google Scholar 

  • E.A. Medova. Chance constrained stochastic programming for integrated services network management. Annals of Operations Research, 81:213–229, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Minoux. Mathematical Programming: Theory and Algorithms. Wiley-Interscience, 1986.

    Google Scholar 

  • VS. Mirrokni, M. Thottan, H. Uzunalioglu, and S. Paul. A simple polynomial time framework for reduced-path decomposition in multi-path routing. IEEE INFOCOM 2004, The Conference on Computer Communications, 23(1):739–749, 2004.

    Google Scholar 

  • K. Murakami and H.S. Kim. Virtual path routing for survivable ATM networks. IEEE-ACM transactions on Networking, 4(1):22–39, 1996.

    Article  Google Scholar 

  • A. Ouorou, P. Mahey, and J.P. Vial. A survey of algorithms for convex multicommodity flow problems. Management Science, 46:126–147, 2000.

    Article  Google Scholar 

  • Serge A. Plotkin, David B. Shmoys, and Eva Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20(2):257–301, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  • C. Ribeiro and D. Elbaz. A dual method for optimal routing in packet-switched networks. Lecture Notes in Control and Information Sciences, (180):199–208, 1992.

    Article  MathSciNet  Google Scholar 

  • A. Riedl. Optimized routing adaptation in ip networks utilizing ospf and mpls. ICC 2003-IEEE International Conference on Communications, 26(1): 1754–1758, 2003.

    Article  Google Scholar 

  • A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003.

    Google Scholar 

  • F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37:318–334, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  • J. Shaio. A family of algorithms for network reliability problems. ICC 2002-IEEE International Conference on Communications, 25(1):2167–2173, 2002.

    Article  Google Scholar 

  • C.S. Sung and K.B. Lee. A routing algorithm for virtual circuit data-networking with unreliable links. Engineering Optimization, 24(2):119–136, 1995.

    Article  Google Scholar 

  • L. Xiao, M. Johansson, and S.P. Boyd. A simultaneous routing and resource allocation via dual decomposition. IEEE Transactions on Communications, 52(7):1136–1144, 2004.

    Article  Google Scholar 

  • G.R. Yee and S.Y.S. Lin. A routing algorithm for virtual circuit data-networks with multiple sessions per o-d pair. Networks, 22(2): 185–208, 1992.

    Article  MATH  Google Scholar 

  • M.G. Yoon, Y.H. Baek, and D.W. Tcha. Design of distributed fiber transport network with hubbing topology. European journal of Operational Research, 104(3):510–520, 1998.

    Article  MATH  Google Scholar 

  • Z. Zhang and H.L. Hartmann. On the non-bifurcated routing in virtual circuit communication networks. European transactions on Telecommunications, 3(1):45–53, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRI - UMR 8623, Université de Paris Sud, Bât 490, 91405, Orsay Cedex, France

    Abdel Lisser

  2. LIMOS - UMR 6158, Université Blaise Pascal, B.P. 10125, 63173, Aubière Cedex, France

    Philippe Mahey

Authors
  1. Abdel Lisser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Mahey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs Research, Florham Park, New Jersey

    Mauricio G. C. Resende

  2. University of Florida, Gainesville, Florida

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Lisser, A., Mahey, P. (2006). Multicommodity Flow Problems and Decomposition in Telecommunications Networks. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_10

Download citation

Publish with us

Policies and ethics

Search

Navigation