Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding (original) (raw)

Abstract

Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages of size O(log n) on average in one cycle as compared to previous algorithms which need to process messages from every neighbor, resulting in O(n) work in a completely connected topology. Our algorithm also stabilizes faster than the previous approaches.

Chapter PDF

Similar content being viewed by others

References

  1. Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: Proc. of the 4th Int’l Workshop on Distributed Algorithms, pp. 15–28. Springer, Heidelberg (1991)
    Google Scholar
  2. Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithm. In: Proc. of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 400–410 (1993)
    Google Scholar
  3. Antonoiu, G., Srimani, P.: Distributed self-stabilizing algorithm for minimum spanning tree construction. In: European Conference on Parallel Processing, pp. 480–487 (1997)
    Google Scholar
  4. Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers 43(9), 1026–1038 (1994)
    Article MATH Google Scholar
  5. Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: IEEE Symposium on Foundations of Computer Science, pp. 268–277 (1991)
    Google Scholar
  6. Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Information Processing Letters 49(6), 297–301 (1994)
    Article MATH Google Scholar
  7. Deo, N., Micikevicius, P.: Prufer-like codes for labeled trees. Congressus Numerantium 151, 65–73 (2001)
    MATH MathSciNet Google Scholar
  8. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17, 643–644 (1974)
    Article MATH Google Scholar
  9. Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
    MATH Google Scholar
  10. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems. In: MCC Workshop on Self-Stabilizing Systems (1989)
    Google Scholar
  11. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. In: Proc. of the ninth annual ACM symposium on Principles of Distributed Computing, pp. 103–117. ACM Press, New York (1990)
    Chapter Google Scholar
  12. Dolev, S., Israeli, A., Moran, S.: Uniform self-stabilizing leader election. In: Proc. of the 5th Workshop on Distributed Algorithms, pp. 167–180 (1991)
    Google Scholar
  13. Gaertner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report, EPFL (October 2003)
    Google Scholar
  14. Garg, V.K., Agarwal, A.: Self-stabilizing spanning tree algorithm with a new design methodology. Technical report, University of Texas at Austin (2004), Available as http://maple.ece.utexas.edu/TechReports/2004/TR-PDS-2004-001.ps
  15. Huang, S., Chen, N.: A self stabilizing algorithm for constructing breadth first trees. Information Processing Letters 41, 109–117 (1992)
    Article MATH MathSciNet Google Scholar
  16. Johnen, C.: Memory efficient, self-stabilizing algorithm to construct bfs spanning trees. In: Proc. of the sixteenth annual ACM symposium on Principles of Distributed Computing, p. 288. ACM Press, New York (1997)
    Chapter Google Scholar
  17. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
    MATH Google Scholar
  18. Neville, E.H.: The codifying of tree-structure. Proceedings of Cambridge Philosophical Society 49, 381–385 (1953)
    Article MATH MathSciNet Google Scholar

Download references

Author information

Authors and Affiliations

  1. University of Texas at Austin, Austin, TX, 78712-1084
    Vijay K. Garg & Anurag Agarwal

Authors

  1. Vijay K. Garg
  2. Anurag Agarwal

Editor information

Editors and Affiliations

  1. Topic Chairs,
    José C. Cunha
  2. Faculdade de Ciências e Technologia CITI Centre, Quinta da Torre, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal
    Pedro D. Medeiros

Rights and permissions

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garg, V.K., Agarwal, A. (2005). Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468\_68

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us