Bandwidth allocation with preemption

Bandwidth allocation is a fundamental problem in the design of networks where bandwidth has to be reserved for connections in advance. The problem is intensified when the requested bandwidth exceeds the capacity and not all requests can be served. Furthermore, acceptance/rejection decisions regarding connections have to be made on-line, without knowledge of future requests. We show that the ability to preempt (i.e., abort) connections while in service in order to be able to schedule ``more valuable'''' connections substantially improves the overall throughput of some networks. We present bandwidth allocation strategies that use preemption and show that they achieve constant competiveness with respect to the throughput, given that any single call occupies only a constant fraction of the bandwidth. Our results should be contrasted with recent works showing that nonpreemptive strategies have at most logarithmic competitiveness.

[1]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[2]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[3]  Decao Mao,et al.  Worst Case Analysis for On-Line Scheduling in Real-Time Systems , 1991 .

[4]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5]  Dennis Shasha,et al.  D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

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

[7]  Moti Yung,et al.  Efficient on-line call control algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[8]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

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

[10]  Y. Mansour,et al.  Eecient On-line Call Control Algorithms , 1993 .

[11]  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.

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

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

[14]  Carsten Lund,et al.  IP over connection-oriented networks and distributional paging , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[15]  Dennis Shasha,et al.  MOCA: A Multiprocessor On-Line Competitive Algorithm for Real-Time System Scheduling , 1994, Theor. Comput. Sci..

[16]  David P. Williamson,et al.  Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..

[17]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[18]  Ulrich Faigle,et al.  Note on Scheduling Intervals on-line , 1995, Discret. Appl. Math..

[19]  Nachum Shacham.  Preemption-based admission control in multimedia multiparty communications , 1995, Proceedings of INFOCOM'95.

[20]  François Toutain,et al.  A general preemption-based admission policy using a smart market approach , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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