Amortized efficiency of list update and paging rules
Communications of the ACM
Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient on-line call control algorithms
Journal of Algorithms
Online algorithms for selective multicast and maximal dense trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An improved lower bound for load balancing of tasks with unknown duration
Information Processing Letters
Routing and admission control in general topology networks with Poisson arrivals
Journal of Algorithms
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
SIAM Journal on Computing
A constant-factor approximation algorithm for the k-MST problem
Journal of Computer and System Sciences
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Throughput-competitive advance reservation with bounded path dispersion
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of requests accepted by our algorithm is O((logn + loglogM)(logn + logM)logn), where M is the number of multicast groups and n is the number of nodes in the graph. We show that this is close to optimum by presenting an Ω(lognlogM) lower bound on this ratio for any randomized online algorithm against an oblivious adversary, when M is much larger than the link capacities. Our lower bound applies even in the restricted case where the link capacities are much larger than bandwidth requested by a single multicast. We also present a simple proof showing that it is impossible to be competitive against an adaptive online adversary.As in the previous online routing algorithms, our algorithm uses edge-costs when deciding on which is the best path to use. In contrast to the previous competitive algorithms in the throughput model, our cost is not a direct function of the edge load. The new cost definition allows us to decouple the effects of routing and admission decisions of different multicast groups.