| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657013 | Journal of Algorithms | 2005 | 29 Pages |
Abstract
We analyze and compare different queue policies for this problem using the competitive analysis approach, where the benefit of the online policy is compared to the benefit of an optimal offline policy. We derive both upper and lower bounds for the policies we consider. We believe that competitive analysis gives important insight to the performance of these queuing policies.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
William A. Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén,