LOCAL MANAGEMENT OF A GLOBAL RESOURCE IN A COMMUNICATION NETWORK.

Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael Saks

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

Abstract

A primitive called the resource controller is introduced that abstracts the problem of controlling the total amount of resources consumed by a distributed algorithm. An efficient distributed algorithm to implement this abstraction is presented. The message complexity of the algorithm per participating node is polylogarithmic in the size of the network, compared to the linear cost per node of the naive algorithm. The implementation of the algorithm is simple and practical; the techniques used are based around a global quantity being managed in a distributed way. The resource controller can be used to construct efficient algorithms for a number of important problems, such as the problem of bounding the worst-case message complexity of a protocol and the problem of dynamically assigning unique names to nodes participating in a protocol.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages347-357
Number of pages11
ISBN (Print)0818608072, 9780818608070
DOIs
StatePublished - 1987
Externally publishedYes

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Fingerprint

Dive into the research topics of 'LOCAL MANAGEMENT OF A GLOBAL RESOURCE IN A COMMUNICATION NETWORK.'. Together they form a unique fingerprint.

Cite this