The authors consider the k-server problem in a distributed setting. Given a network of n processors, and k identical mobile servers, requests for service appear at the processors and a server must reach the request point. Besides modeling problems in computer networks where k identical mobile resources are shared by the processors of the network, this models a realistic situation where the transfer of information is costly and there is no central control that governs the behavior of servers that move around to satisfy requests for service. The problem is that of devising algorithms that minimize not only the travel of the server but also the communication cost incurred for the transmission of control messages. The main contribution is a general translator to transform any deterministic global-control competitive k-server algorithm into a distributed competitive one. As consequences they get poly(k)-competitive distributed algorithms for the line, trees and the ring.
|Title of host publication
|Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
|IEEE Computer Society
|Number of pages
|Published - 1992
|33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: 24 Oct 1992 → 27 Oct 1992
|Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
|33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
|24/10/92 → 27/10/92
Bibliographical notePublisher Copyright:
© 1992 IEEE.