Probabilistic analysis of a network resource allocation algorithm
Information and Control
Detecting global termination conditions in the face of uncertainty
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Optimal fault-tolerant distributed construction of a spanning forest
Information Processing Letters
Fault tolerant distributed majority commitment
Journal of Algorithms
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Competitive algorithms for distributed data management
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Local management of a global resource in a communication network
Journal of the ACM (JACM)
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Labeling Schemes for Dynamic Tree Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Labeling Schemes for Flow and Connectivity
SIAM Journal on Computing
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual 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
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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 vertex connectivity
ACM Transactions on Algorithms (TALG)
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
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
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
On randomized online labeling with polynomially many labels
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
Afek, Awerbuch, Plotkin, and Saks identified an important fundamental problem inherent to distributed networks, which they called the Resource Controller problem. Consider, first, the problem in which one node (called the "root") is required to estimate the number of events that occurred all over the network. This counting problem can be viewed as a useful variant of the heavily studied and used task of topology update (that deals with collecting all remote information). The Resource Controller problem generalizes the counting problem: such remote events are considered as requests, and the counting node, i.e., the "root", also issues permits for the requests. That way, the number of request granted can be controlled (bounded). An efficient Resource Controller was constructed in the paper by Afek et al., which can operate on a dynamic network assuming that the network is spanned by a tree that may only grow, and only by allowing leaves to join the tree. In contrast, the Resource Controller presented here can operate under a more general dynamic model, allowing the spanning tree of the network to undergo both insertions and deletions of both leaves and internal nodes. Despite the more dynamic network model we allow, the message complexity of our controller is always at most the message complexity of the more restricted controller. All the applications for the controller of Afek et al. apply also for our controller. Moreover, with the same message complexity, our controller can handle these applications under the more general dynamic model mentioned above. In particular, under the more general dynamic model, the new controller can be transformed into an efficient size-estimation protocol, i.e., a protocol allowing the root to maintain a constant estimation of the number of nodes in the dynamically changing network. Informally, the resulted new size-estimation protocol uses O(log2 n) amortized message complexity per topological change (assuming that the number of changes in the network size is "not too small"), where n is the current number of nodes in the network. In addition, with the same message complexity (as that of the size-estimation protocol), the new controller can be used to solve the name-assignment problem by assigning and maintaining unique log n+O(1)-bit identifiers for the nodes of the dynamic network. The new size-estimation protocol can be used for other applications, not mentioned in the paper by Afek et al.. Specifically, it can be used to extend many existing labeling schemes supporting different queries (e.g routing, ancestry, etc.) so that these schemes can now operate correctly also under more general models. These extensions maintain the same asymptotic sizes of the corresponding labels (or routing tables) of the original schemes and incur only a relatively low extra additive cost to the message complexity of the corresponding original schemes.