A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Request-Aware Scheduling for Busy Internet Services
2006
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Internet traffic is bursty and network servers are often overloaded with surprising events or abnormal client request patterns. This paper studies scheduling algorithms for interactive network services that use multiple threads to handle incoming requests continuously and concurrently. Our investigation with applications from Ask Jeeves search shows that during overloaded situations, requests that require excessive computing resource can dramatically affect the overall system throughput and
doi:10.1109/infocom.2006.279
dblp:conf/infocom/ZhouZYC06
fatcat:rsztmyn4rfeg5gdcpmkaet7uby