On-line admission control and packet scheduling with interleaving

This paper presents a comprehensive study of the effect of job interleaving by preemption on the throughput of a single server where requests arrive with a given processing time and slack. The problem is to decide which requests to serve so as to maximize the server's utilization. This simple model captures many situations, both at the application (e.g., delivery of video) as well as at the network/transmission levels (e.g., scheduling of packets from input to output interface of a switch). The problem is on-line in nature, and thus we use competitive analysis for measuring the performance of our scheduling algorithms. We consider two modes of operation - with and without commitment - and derive upper and lower bounds for each case. Since competitive analysis is based on the worst-case scenario, the average-case performance of the algorithms is also examined by a simulation study.

[1]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[2]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[4]  Moti Yung,et al.  Efficient On-Line Call Control Algorithms , 1997, J. Algorithms.

[5]  Sanjoy K. Baruah,et al.  On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[6]  Serge A. Plotkin.  Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[7]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[8]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[9]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[10]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[11]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[12]  Grenville Armitage.  Quality of Service in IP Networks , 2000 .

[13]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[14]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.

[15]  Bhaskar DasGupta,et al.  Online real-time preemptive scheduling of jobs with deadlines , 2000, APPROX.

[16]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[17]  Sanjoy K. Baruah,et al.  Scheduling for Overload in Real-Time Systems , 1997, IEEE Trans. Computers.

[18]  Vijay Sivaraman,et al.  Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  Michael H. Goldwasser.  Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control , 1999, SODA '99.

[20]  Subhash Suri,et al.  Online Scheduling with Hard Deadlines , 2000, J. Algorithms.

[21]  Yossi Azar,et al.  Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[24]  Eugene Levner,et al.  Computational Complexity of Approximation Algorithms for Combinatorial Problems , 1979, MFCS.

[25]  Domenico Ferrari,et al.  Exact admission control for networks with a bounded delay service , 1996, TNET.

[26]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[27]  Bhaskar Das Gupta,et al.  Online real-time preemptive scheduling of jobs with deadlines , 2000, APPROX.

[28]  Vijay Sivaraman,et al.  Statistical Analysis of Delay Bound Violations at an Earliest Deadline First (EDF) Scheduler , 1999, Perform. Evaluation.

[29]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[30]  Anja Feldmann,et al.  Competitive Analysis of Call Admission Algorithms that Allow Delay. , 1995 .