Data structures and network algorithms
Data structures and network algorithms
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 trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Sparser: a paradigm for running distributed algorithms
Journal of Algorithms
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Local management of a global resource in a communication network
Journal of the ACM (JACM)
Slide—the key to polynomial end-to-end communication
Journal of Algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Informative Labeling Schemes for Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Journal of Algorithms
Distributed approximate matching
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Labeling schemes for weighted dynamic trees
Information and Computation
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
Upper and lower bounds for routing schemes in dynamic networks
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
The distributed k-server problem-a competitive distributed translator for k-server algorithms
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
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
Labeling schemes for vertex connectivity
ACM Transactions on Algorithms (TALG)
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 |
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 requests granted can be controlled (bounded). An efficient Resource Controller was constructed in the paper by Afek et al., and it 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 never more than the message complexity of the more restricted controller. All the applications for the controller of Afek et al. can be used also with our controller. Moreover, with the same message complexity, our controller can handle these applications under the more general dynamic model mentioned above. In particular, the new controller can be transformed into an efficient size-estimation protocol, i.e., a protocol allowing all nodes to maintain a constant factor estimation of the number of nodes in the dynamically changing network. Informally, the resulting new size-estimation protocol uses O(log^2n) 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. An application of the size estimation of Afek et al. was to solve agreement in the case of initial faults (Fischer, Lynch, and Paterson) and leader election under initial faults (Bar-Yehuda and Kutten). Hence, the controllers in this paper can be useful for these applications too.