Regular ArticleEfficient On-Line Call Control Algorithms☆
References (15)
- B. Awerbuch, Y. Azar, S. Plotkin, November 1993, Throughout competitive on-line routing, Proc. 34th IEEE Annual Symp....
- B. Awerbuch, Y. Azar, S. Plotkin, O. Waarts, January 1994, Competitive routing of virtual circuits with unknown...
- B. Awerbuch, Y. Bartal, A. Fiat, A. Rosén, January 1994, Competitive non-preemptive call control, Proc. 5th Annual...
- B. Awerbuch, R. Gawlick, T. Leighton, Y. Rabani, November 1994, Online admission control and circuit routing for high...
Int. J. Digital Analog. Cabled Syst.
(1988)- A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, B. Schieber, May 1995, Bandwidth allocation with preemption, Proc. 27th...
- S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, F. Wang, 1991, On the competitiveness of...
There are more references available in the full text version of this article.
Cited by (48)
Competitive buffer management for packets with latency constraints
2021, Computer NetworksImproved bounds for randomized preemptive online matching
2018, Information and ComputationOnline time-constrained scheduling in linear and ring networks
2010, Journal of Discrete AlgorithmsCitation Excerpt :We now turn to show the competitive ratio guarantee of MT. MNU is an adaptation to our model of the algorithm given by Garay et al. in [7], for the problem of call admission, where a call's value is its route length. We will use the above lemma, to analyze the performance of algorithm MNU.
Scheduling to maximize participation
2008, Theoretical Computer ScienceAn online throughput-competitive algorithm for multicast routing and admission control
2005, Journal of AlgorithmsAny-Order Online Interval Selection
2023, arXiv
- ☆
A preliminary version of this paper appeared inProceedings of the 2nd Israel Symposium on the Theory of Computing and Systems, pp. 285–293, Natanya, Israel, June 1993.
Copyright © 1997 Academic Press. All rights reserved.