28th Annual Symposium on Foundations of Computer Science (sfcs 1987) (1987)
Oct. 12, 1987 to Oct. 14, 1987
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1987.38
We introduce a new primitive, the Resource Controller, which abstracts the problem of controlling the total amount of resources consumed by a distributed algorithm. We present an efficient distributed algorithm to implement this abstraction. The message complexity of our 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 our algorithm is simple and practical and the techniques used are interesting because a global quantity is 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.
B. Awerbuch, M. Saks, Y. Afek and S. A. Plotkin, "Local management of a global resource in a communication network," 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)(FOCS), vol. 00, no. , pp. 347-357, 1987.