A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing theory. The model addresses questions such as whether a server routing algorithm is stable, that is, whether it is such that the number of unserved requests in the system remains bounded at all times,doi:10.1016/j.tcs.2007.05.034 fatcat:vsg7niqlrnhtvlwk5333tsejce