Admission control to minimize rejections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 155-164

  Blum, Avrim ^a   Kalai, Adam ^a   Kleinberg, Jon ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Department of Molecular Biology and Genetics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; HARDNESS;

CAPACITY LIMITATION; COMPETITIVE RATIO; MINIMIZING THE NUMBER OF; ON-LINE ALGORITHMS; OPTIMAL COMPETITIVE RATIOS; REAL WORLD SETTING; UPPER AND LOWER BOUNDS; VERTEX COVER PROBLEMS;

ALGORITHMS;

EID: 84958051380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_15     Document Type: Conference Paper

References (11)

1. R. Adler and Y. Azar. Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In Proceedings of 10th SODA, pages 1–10, 1999.
2. N. Alon, U. Arad, and Y. Azar. Independent sets in hypergraphs with applications to routing via fixedpaths. In Proceedings of 2nd APPROX, pages 16–27, 1999.
3. Baruch Awerbuch, Yossi Azar, andSerge Plotkin. Throughputcompetitive online routing. In Proc. 34th Symp. Foundations of Computer Science, pages 32–40, 1993.
4. Baruch Awerbuch, Yair Bartal, Amos Fiat, andAd i Rosén. Competitive non-preemptive call control. In Proc. 5th Symp. on Discrete Algorithms, pages 312–320, 1994.
5. Baruch Awerbuch, Rainer Gawlick, Tom Leighton, and Yuval Rabani. Online admission control and circuit routing for high performance computing andcomm unication. In Proc. 35th Symp. Foundations of Computer Science, pages 412–423, 1994.
6. Juan A. Garay and I. S. Gopal. Call preemption in communications networks. In Proc. INFOCOM’92, pages 1043–1050, 1992.
7. Juan A. Garay, I. S. Gopal, Shay Kutten, Yishay Mansour, and M. Yung. Efficient on-line call control algorithms. In Proc. 2nd Israel Symp. on Theory of Computing and Systems, pages 285–293, 1993.
8. A. Kamath, O. Palmon, and Serge Plotkin. Routing andad mission control in general topology networks with poisson arrivals. In Proc. 7th Symp. on Discrete Algorithms, pages 269–278, 1996.
9. S. Leonardi. On-line network routing. In A. Fiat and G. Woeginger, editors, On-line Algorithms. Springer-Verlag, 1998
10. Stefano Leonardi, Alberto Marchetti-Spaccamela, A. Presciutti, and Adi Rosén. On-line randomized call-control revisited. In Proc. 9th Symp. on Discrete Algorithms, pages 323–332, 1998.
11. Serge Plotkin. Competitive routing in atm networks. IEEE J. Selected Areas in Communications, pages 1128–1136, 1995.