Name
Abstract | ||
|---|---|---|
We present a simple and efficient self-stabilizing protocol for the network partitioning Problem. Given a graph with k
2 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 stabilizes in (3h + 1) Steps, where h is the height of the tree, and adapts to the dynamic configuration of the network.
|
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/978-3-540-46642-0_26 | HiPC |
Keywords | Field | DocType |
self-stabilizing network decomposition,spanning tree | Strength of a graph,Combinatorics,Tree (graph theory),Computer science,K-ary tree,Tree decomposition,Connected dominating set,Hypertree network,Spanning tree,Minimum spanning tree,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-66907-8 | 0 | 0.34 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fatima Belkouch | 1 | 17 | 3.16 |
| Marc Bui | 2 | 5 | 4.64 |
| Liming Chen | 3 | 2607 | 201.71 |
| Ajoy Kumar Datta | 4 | 317 | 40.76 |