Complexity of network synchronization
Journal of the ACM (JACM)
Probabilistic analysis of a network resource allocation algorithm
Information and Control
Parallel (&Dgr;+1)-coloring of constant-degree graphs
Information Processing Letters
Fault tolerant distributed majority commitment
Journal of Algorithms
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
The power of multimedia: combining point-to point and multi-access networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Labeling Schemes for Dynamic Tree Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Labeling schemes for weighted dynamic trees
Information and Computation
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Brief announcement: new bounds for the controller problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Labeling schemes for weighted dynamic trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Efficient threshold detection in a distributed environment: extended abstract
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Tight lower bounds for the online labeling problem
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Controller and estimator for dynamic networks
Information and Computation
On randomized online labeling with polynomially many labels
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
This paper introduces a new distributed data object called Resource Controller that provides an abstraction for managing the consumption of a global resource in a distributed system. Examples of resources that may be managed by such an object include; number of messages sent, number of nodes participating in the protocol, and total CPU time consumed.The Resource Controller object is accessed through a procedure that can be invoked at any node in the network. Before consuming a unit of resource at some node, the controlled algorithm should invoke the procedure at this node, requesting a permit or a rejection.The key characteristics of the Resource Controller object are the constraints that it imposes on the global resource consumption. An (M, W)-Controller guarantees that the total number of permits granted is at most M; it also ensures that, if a request is rejected, then at least M—W permits are eventually granted, even if no more requests are made after the rejected one.In this paper, we describe several message and space-efficient implementations of the Resource Controller object. In particular, we present an (M, W)-Controller whose message complexity is O(n log2n log(M/(W + 1)) where n is the total number of nodes. This is in contrast to the O(nM) message complexity of a fully centralized controller which maintains a global counter of the number of granted permits at some distinguished node and relays all the requests to the node.