Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Web server support for tiered services
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
We consider alternative service policies in a web server with impatient users. User-perceived performance is modeled as an exponentially decaying function of the user's waiting time, reflecting the probability that the user aborts the download before the page is completely received. The web server is modeled as a single server queue, with Poisson arrivals and exponentially distributed file lengths. The server objective is to maximize average revenue per unit time, where each user is assumed to pay a reward proportional to the perceived performance. When file lengths are i.i.d., we prove that the optimal service policy is greedy, namely that the server should choose the job with the highest potential reward. However, when file lengths are independently drawn from a set of exponential distributions, we show the optimal policy need not be greedy; in fact, processor sharing policies sometimes outperform the best greedy policy in this case.