Multicommodity Flow Problems and Decomposition in Telecommunications Networks

Abdel Lisser () and Philippe Mahey ()
Additional contact information
Abdel Lisser: Université de Paris Sud, LRI - UMR 8623
Philippe Mahey: Université Blaise Pascal, LIMOS - UMR 6158

Chapter 10 in Handbook of Optimization in Telecommunications, 2006, pp 241-267 from Springer

Abstract: 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.

Keywords: Multicommodity flow problems; network design; packet-switched networks; arc-node models; arc-path models; minimax congestion; capacity assignment; decomposition methods; continuous flow models (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-30165-5_10

Ordering information: This item can be ordered from
http://www.springer.com/9780387301655

DOI: 10.1007/978-0-387-30165-5_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().