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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Fast distributed network decomposition and covers. Journal of Parallel and Distributed Computing 32(2), 105–114 (1996)
Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decom- position and locality in distributed computation. In: Proc. of the 30th IEEE Symposium on Foundations of Computer Science, pp. 364–369 (1990)
Awerbuch, B., Peleg, D.: Sparse partitions. In: Proc. of the 31th IEEE Symposium on Foundations of Computer Science, pp. 503–513 (1990)
Belkouch, F., Chen, L., Elfatni, A.: Routage sémantique basé sur les quorums. Calculateurs Parallèles, Numéro thématique: Routage dans les Réseaux ll, 87–101 (1999) ISBN-2-7462-0040-6
Bui, A., Datta, A.K., Petit, F., Villain, V.: State-optimal snap-stabilizing PIF in tree networks. In: Proc. of the Fourth Workshop on Self-Stabilizing Systems, pp. 78–85. IEEE Computer Society Press, Los Alamitos (1999)
Linial, N., Saks, M.: Decomposing graphs into region of small diameter. In: Proc. of the Second Annual ACM-SIAM, Sympsium on Discrete Algorithms, pp. 320–330 (1991)
Linial, N., Saks, M.: Low diameter graph decomposition. Combinatoria 13, 441–454 (1993)
Villain, V.: A new lower bound for self-stabilizing mutual exclusion algorithms. Technical Report RR98-08, LaRIA, University of Picardie Jules Verne 1998; Also, presented at Dagstuhl Workshop on Self-Stabilization, August 17-21, Germany (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belkouch, F., Bui, M., Chen, L., Datta, A.K. (1999). Self-Stabilizing Network Decompostion. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive