Admission control with immediate notification

Journal of Scheduling

Volumn 6, Issue 3, 2003, Pages 269-285

  Goldwasser, Michael H ^a   Kerbikov, Boris ^b  

^a LOYOLA UNIVERSITY CHICAGO   (United States)

^b NONE

Author keywords

Admission control; Firm deadlines; Notification; Online scheduling

Indexed keywords

ALGORITHMS; DECISION MAKING; MATHEMATICAL MODELS; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; REAL TIME SYSTEMS; TELECOMMUNICATION SYSTEMS;

ADMISSION CONTROL; FIRM DEADLINES; NOTIFICATION; ONLINE SCHEDULING;

SCHEDULING;

EID: 3543116688     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022956425198     Document Type: Article

References (20)

1. Awerbuch, B., Y. Azar, and S. Plotkin, "Throughput-competitive online routing," in Proc. 34th Symp. on Foundations of Computer Science, Palo Alto, California, November 1993, pp. 32-40.
2. Awerbuch, B., Y. Bartal, A. Fiat, and A. Rosén, "Competitive non-preemptive call control," in Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, Arlington, Virginia, January 1994, pp. 312-320.
3. Bar-Noy, A., R. Canetti, S. Kutten, Y. Mansour, and B. Schiber, "Bandwidth allocation with preemption," in Proc. 27th ACM Symp. on Theory of Computing, Las Vegas, Nevada, June 1995, pp. 616-625.
4. Bar-Noy, A., J. A. Garay, A. Herzberg, and S. Aggarwal, "Sharing video on demand," Manuscript, 1998. Presented at the Workshop on Algorithmic Aspects of Communication, Bologna, Italy, July 1997.
5. Bayer, R., "Symmetric binary B-trees: data structure and maintenance," Acta Informatica, 1(4), 290-306 (1972).
6. Beji-David, S., A. Borodin, R. Karp, G. Tardos, and A. Widgerson, "On the power of randomization in on-line algorithms," Algorithmica, 11(1), 2-14 (1994).
7. Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, New York, 1998.
8. Carmen, T. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, Massachusetts, 1990.
9. Garey, J., I. Gopal, and S. Kutten, "Efficient online call control algorithms," J. Algorithms, 23(1), 180-194 (1997).
10. Goldman, S., J. Parwatikar, and S. Suri, "On-line scheduling with hard deadlines," J. Algorithms, 34(2), 370-389 (February 2000).
11. Goldwasser, M. H., "Patience is a virtue: the effect of slack on competitiveness for admission control," J. Scheduling, 6(2), 183-211 (2003).
12. Graham, R., E. L. Lawler, J. K. Lenstra, and A. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: a survey," in Discrete Optimization II, Vol. 5 of Annals of Discrete Mathematics, North Holland, 1979, pp. 287-326.
13. Guibas, L. J. and R. Sedgewick, "A dichromatic framework for balanced trees," in Proc. 19th Symp. on Foundations of Computer Science, Lecture Notes in Computer Science, Springer-Verlag, 1978, pp. 8-21.
14. Jackson, J. R., "Scheduling a production line to minimize maximum tardiness," Research Report 43. Managements Sciences Research Project, UCLA, January 1955.
15. Karlin, A., M. Manasse, L. Rudolph, and D. Sleator, "Competitive snoopy paging," Algorithmica, 3(1), 70-119 (1988).
16. Kopetz, H., Real-time Systems: Design Principles for Distributed Embedded Applications, Kluwer Academic Publishers, Boston, 1997.
17. Lipton, R. and A. Tomkins, "Online interval scheduling," in Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, Arlington, Virginia, January 1994, pp. 302-311.
18. Plotkin, S.A., "Competitive routing of virtual circuits in ATM networks," IEEE J. Selected Areas Commun., 13(6), 1128-1136 (1995).
19. Raghavan, P. and M. Snir, "Memory versus randomization in on-line algorithms," IBM J. Res. Dev., 38, 683-707 (1994).
20. Sleator, D. and R. Tarjan, "Amortized efficiency of list update and paging rules," Commun. ACM, 28, 202-208 (1985).