An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A high availability N hierarchical grid algorithm for replicated data
Information Processing Letters
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IEEE Transactions on Computers
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Design of U-Doc: A Research Vehicle for Hyper Document Retrieval on the Internet
BIWIT '97 Proceedings of the 3rd Basque International Workshop on Information Technology (BIWIT '97)
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
| Hi-index | 0.00 |
We present a simple and efficient self-stabilizing protocol for the network partitioning problem. Given a graph with k2 nodes, our decomposition scheme partitions the network into connected and disjoint partitions, with k nodes per partition. The proposed algorithm starts with a spanning tree of the graph, but uses some links which do not belong to the tree, if necessary. The protocol is self-stabilizing meaning that starting from an arbitrary state, it is guaranteed to reach a state where the network is correctly partitioned. The protocol stabilizes in 3(h + 1) rounds, where h is the height of the tree. We also propose solutions to the case where the network size is n ≤ k2. Hence our protocol works for dynamic systems in the sense that the protocol can adapt to changes of the network size. We discuss an important application of the proposed protocol.