Multicommodity flow and circuit switching

Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion. This shows that such good path selections exist for constant-degree expanders with strong expansion, generalizing a result of (Broder et al., 1994). We also show, for infinitely many n, n-vertex undirected graphs G/sub n/ along with a set T of connection requests, such that: T is fractionally realizable using flow-paths that impose a (fractional) congestion of at most 1; but any rounding of such a flow to the given set of flow-paths, leads to a congestion of /spl Omega/(log n/log log n). This is progress on a long-standing open problem.

[1]  Alan M. Frieze,et al.  Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach , 1999, Random Struct. Algorithms.

[2]  Alan M. Frieze,et al.  Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..

[3]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[4]  P. Seymour.  On Odd Cuts and Plane Multicommodity Flows , 1981 .

[5]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[6]  Eli Upfal,et al.  Constructing disjoint paths on expander graphs , 1987, Comb..

[7]  Aravind Srinivasan,et al.  An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.

[8]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[9]  Frank Thomson Leighton,et al.  Circuit Switching: A Multicommodity Flow Based Approach , 1995 .

[10]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[11]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  MATTHIAS MIDDENDORF,et al.  On the complexity of the disjoint paths problem , 1993, Comb..

[13]  Alan M. Frieze,et al.  Existence and construction of edge disjoint paths on expander graphs , 1992, STOC '92.

[14]  Alexander Schrijver,et al.  Homotopic routing methods , 1990 .

[15]  Noga Alon,et al.  A Parallel Algorithmic Version of the Local Lemma , 1991, Random Struct. Algorithms.

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[17]  Alan M. Frieze,et al.  Optimal construction of edge-disjoint paths in random graphs , 1994, SODA '94.