Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems

We present improved approximation algorithms for a family of problems involving edge-disjoint paths and unsplittable flow, and for some related routing problems. The central theme of all our algorithms is the underlying multi-commodity flow relaxation.

[1]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

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

[4]  Shekhar Y. Borkar,et al.  iWarp: an integrated solution to high-speed parallel computing , 1988, Proceedings. SUPERCOMPUTING '88.

[5]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[7]  Prabhakar Raghavan.  Randomized Approximation Algorithms in Combinatorial Optimization , 1994, FSTTCS.

[8]  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.

[9]  C. Fortuin,et al.  Correlation inequalities on some partially ordered sets , 1971 .

[10]  Paul Erdös,et al.  On a Combinatorial Game , 1973, J. Comb. Theory A.

[11]  Aravind Srinivasan,et al.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria , 1997, STOC '97.

[12]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[13]  Joel H. Spencer.  A Useful Elementary Correlation Inequality, II , 1998, J. Comb. Theory, Ser. A.

[14]  Richard Cole,et al.  On the benefit of supporting virtual channels in wormhole routers , 1996, SPAA '96.

[15]  J. Vitter,et al.  Approximations with Minimum Packing Constraint Violation , 1992 .

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

[17]  Bruce M. Maggs,et al.  On-Line Algorithms for Path Selection in a Nonblocking Network , 1996, SIAM J. Comput..

[18]  Michael D. Noakes,et al.  The J-machine multicomputer: an architectural evaluation , 1993, ISCA '93.

[19]  Friedhelm Meyer auf der Heide,et al.  Universal algorithms for store-and-forward and wormhole routing , 1996, STOC '96.

[20]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[21]  Eli Upfal.  An ) deterministic packet routing scheme , 1989, STOC 1989.

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

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

[24]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[25]  Aravind Srinivasan,et al.  Improved approximations of packing and covering problems , 1995, STOC '95.

[26]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[27]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[28]  Richard Cole,et al.  Routing on butterfly networks with random faults , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[29]  Yuval Rabani,et al.  Path coloring on the mesh , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[30]  Éva Tardos,et al.  Approximations for the disjoint paths problem in high-diameter planar networks , 1995, STOC '95.

[31]  Eli Upfal,et al.  Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). , 1997, STOC 1997.

[32]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[33]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[34]  Anthony S. Acampora,et al.  Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1992, IEEE Trans. Commun..

[35]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[36]  Alok Aggarwal,et al.  Efficient routing in optical networks , 1996, JACM.

[37]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[38]  Eli Upfal,et al.  Static and dynamic path selection on expander graphs: a random walk approach , 1999 .