We consider a stochastic version of the k-server problem, analyzing the cost of the greedy algorithm on the circle. We fully characterize the distribution yielded by this process for k = 2. Next, we show new results for larger values of k. Then, we consider other variants of this process. Finally, we confirm the above results in simulations of the process.
Further Stochastic Analysis of the k-Server Problem on the Circle
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).