Achievable Performance of Blind Policies in Heavy Traffic
Probability
2017-02-06 v3 Data Structures and Algorithms
Abstract
For a GI/GI/1 queue, we show that the average sojourn time under the (blind) Randomized Multilevel Feedback algorithm is no worse than that under the Shortest Remaining Processing Time algorithm times a logarithmic function of the system load. Moreover, it is verified that this bound is tight in heavy traffic, up to a constant multiplicative factor. We obtain this result by combining techniques from two disparate areas: competitive analysis and applied probability.
Keywords
Cite
@article{arxiv.1512.07771,
title = {Achievable Performance of Blind Policies in Heavy Traffic},
author = {Nikhil Bansal and Bart Kamphorst and Bert Zwart},
journal= {arXiv preprint arXiv:1512.07771},
year = {2017}
}