On solving large maximum concurrent flow problems
- 1 January 1987
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 205-209
- https://doi.org/10.1145/322917.322949
Abstract
The maximum concurrent flow problem (MCFP) is readily illustrated by problems such as traffic flow in road networks and message transfer in packet switched networks. The MCFP was introduced in [MA85] and can be solved using either linear programming techniques or using the flow routing algorithms [BM86, TM86]. Application of these techniques has typically been limited to problems of small size (40 vertices or less). We present a refinement of the algorithm in [BM86] which operates successfully on problems three times larger than those solved by the previous techniques. Empirical polynomially bounded storage and time complexity is demonstrated and applications in packet switched networks are investigated.Keywords
This publication has 0 references indexed in Scilit: