Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On admission control for profit maximization of networked service providers
WWW '03 Proceedings of the 12th international conference on World Wide Web
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
Resource allocation in bounded degree trees
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On-line simultaneous maximization of the size and the weight for degradable intervals schedules
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On-Line bicriteria interval scheduling
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
On-line scheduling of multi-core processor tasks with virtualization
Operations Research Letters
Efficient online scheduling for deadline-sensitive jobs: extended abstract
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
RCFT: A Termination Method for Simple PCN-Based Flow Control
Journal of Network and Systems Management
Hi-index | 0.00 |
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 overall requested bandwidth exceeds the capacity and not all requests can be served. Furthermore, acceptance/rejection decisions regarding connections have to be made online, without knowledge of future requests. We show that the ability to preempt (i.e., abort) connections while in service in order to schedule "more valuable" connections substantially improves the throughput of some networks. We present bandwidth allocation strategies that use preemption and show that they achieve constant competitiveness with respect to the throughput, given that any single call requests at most a constant fraction of the bandwidth. Our results should be contrasted with recent works showing that nonpreemptive strategies have at most inverse logarithmic competitiveness.