Single-Sink Multicommodity Flow with Side Constraints

F. Bruce Shepherd ()
Additional contact information
F. Bruce Shepherd: McGill University, Department of Mathematics and Statistics

Chapter 20 in Research Trends in Combinatorial Optimization, 2009, pp 429-450 from Springer

Abstract: Summary In recent years, several new models for network flows have been analyzed, inspired by emerging telecommunication technologies. These include models of resilient flow, motivated by the introduction of high capacity optical links, coloured flow, motivated by Wavelength-Division-Multiplexed optical networks, unsplittable flow motivated by SONET networks, and confluent flow motivated by next-hop routing in internet protocol (IP) networks. In each model, the introduction of new side-constraints means that a max-flow min-cut theorem does not necessarily hold, even in the setting where all demands are destined to a common node (sink) in the network. In such cases, one may seek bounds on the “flow-cut gap” for the model. Such approximate max-flow min-cut theorems are a useful measure for bounding the impact of new technology on congestion in networks whose traffic flows obey these side constraints.

Date: 2009
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-3-540-76796-1_20

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

DOI: 10.1007/978-3-540-76796-1_20

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 ().