Download:
|
by Meshes, Monika Rauch Henzinger, Stefano Leonardi
ftp://ftp.digital.com/pub/DEC/SRC/technical-notes/SRC-1998-010.ps.gz
Add To MetaCart
Abstract:
This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput-model. The problem is a generalization of the edge-disjoint paths problem and is NPhard both on trees and meshes. We study both the offline and the online version of the problem: In the offline setting, we give the first constant-factor approximation algorithm for trees, and an O((log log n) 2)-factor approximation algorithm for meshes. In the online setting, we give the first polylogarithmic competitive online algorithm for tree and mesh topologies. No polylogarithmic-competitive algorithm is possible on general network topologies [8] and there exists a polylogarithmic lower bound on the competitive ratio of any online algorithm on tree topologies [3]. We prove the same lower bound for meshes. 1
Citations
|
409
|
Approximation Algorithms for NP-hard Problems
– Hochbaum
- 1997
|
|
271
|
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
– Raghavan
- 1988
|
|
213
|
Throughput-competitive online routing
– Awerbuch, Azar, et al.
- 1993
|
|
195
|
Fast approximation algorithms for fractional packing and covering problems
– Plotkin, Shmoys, et al.
- 1995
|
|
167
|
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
– Garg, Könemann
- 1998
|
|
114
|
Efficient Routing in All-Optical Networks
– Raghavan, Upfal
- 1994
|
|
107
|
Competitive non-preemptive call control
– Awerbuch, Bartal, et al.
- 1994
|
|
106
|
Approximate max-flow min-(multi)cut theorems and their applications
– Garg, Vazirani, et al.
|
|
71
|
On-line admission control and circuit routing for high performance computing and communication
– Awerbuch, Gawlick, et al.
- 1994
|
|
63
|
A 3-approximation for the minimum tree spanning k vertices
– Garg
- 1996
|
|
62
|
Disjoint paths in densely embedded graphs
– Kleinberg, Tardos
- 1995
|
|
60
|
Efficient access to optical band-width
– Mihail, Kaklamanis, et al.
- 1995
|
|
52
|
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
– Bartal, Fiat, et al.
- 1996
|
|
41
|
Making commitments in the face of uncertainty: How to pick a winner almost every time
– Awerbuch, Azar, et al.
- 1996
|
|
32
|
On-line randomized call control revisited
– Leonardi, Marchetti-Spaccamela, et al.
- 1998
|
|
26
|
Path coloring on the mesh
– Rabani
- 1996
|
|
19
|
On-line resource management with applications to routing and scheduling
– Leonardi, Marchetti-Spaccamela
- 1995
|
|
18
|
Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity
– van
- 1990
|
|
14
|
Online algorithms for selective multicast and maximal dense trees
– Awerbuch, Singh
- 1997
|
|
13
|
Online throughput-competitive algorithm for multicast routing and admission control
– Goel, Henzinger, et al.
- 1998
|
|
3
|
Randomized rounding without solving teh linear program
– Young
- 1995
|
|
2
|
Online selective multicastand maximal dense trees: A survey
– Awerbuch
- 1996
|
