The distributed k-server problem-a competitive distributed translator for k-server algorithms

Yair Bartal, Adi Rosen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

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.

Original languageAmerican English
Title of host publicationProceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PublisherIEEE Computer Society
Pages344-353
Number of pages10
ISBN (Electronic)0818629002
DOIs
StatePublished - 1992
Externally publishedYes
Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: 24 Oct 199227 Oct 1992

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume1992-October
ISSN (Print)0272-5428

Conference

Conference33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Country/TerritoryUnited States
CityPittsburgh
Period24/10/9227/10/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Fingerprint

Dive into the research topics of 'The distributed k-server problem-a competitive distributed translator for k-server algorithms'. Together they form a unique fingerprint.

Cite this