Skip to main content
SpringerLink
Log in

An efficient fault-containing self-stabilizing algorithm for the shortest path problem

  • Original Article
  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

Shortest path finding has a variety of applications in transportation and communication. In this paper, we propose a fault-containing self-stabilizing algorithm for the shortest path problem in a distributed system. The improvement made by the proposed algorithm in stabilization times for single-fault situations can demonstrate the desirability of an efficient fault-containing self-stabilizing algorithm. For single-fault situations, the worst-case stabilization time of the proposed algorithm is O(Δ), where Δ is the maximum node degree in the system, and the contamination number of the proposed algorithm is 1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Azar, Y., Kutten, S., Shamir, B.P.: Distributed error confinement. In: Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing, pp. 33–42 (2003)

  2. Arora, A., Zhang, H.: LSRP: Local stabilization in shortest path routing. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 139–148 (2003)

  3. Beauquier, J., Herault, T.: Fault-local stabilization: the shortest path tree. In: Proceedings of the 21th IEEE Symposium on Reliable Distributed Systems, pp. 62–69 (2002)

  4. Chandrasekar, S., Srimani, P.K.: A self-stabilizing algorithm for all-pairs shortest path tree problem. Parallel Algorithm Appl. 4(1/2), 125–137 (1994)

    Google Scholar 

  5. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Comm. ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  6. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control (EWD391). Reprinted in: Selected Writing on Computing: A Personal Perspective, pp. 41–46. Springer, New York Berlin Heidelberg (1982)

    Google Scholar 

  7. Dijkstra, E.W.: A belated proof of self-stabilization. Distributed Comput. 1(1), 5–6 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Comput. 7(1), 3–16 (1993)

    Article  Google Scholar 

  9. Ghosh, S., Gupta, A.: An exercise in fault-containment: self-stabilizing leader election. Inf. Process. Lett. 59, 281–288 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ghosh, S., Gupta, A., Herman, T.: Fault-containing self-stabilizing distributed protocols. Technical Report 00-01, Department of Computer Science, University of Iowa (2000)

  11. Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 45–54 (1996)

  12. Ghosh, S., Gupta, A., Pemmaraju, S.V.: A fault-containing self-stabilizing spanning tree algorithm. J. Comput. Inf. 2(1), 322–338 (1996)

    Google Scholar 

  13. Ghosh, S., Gupta, A., Pemmaraju, S.V.: Fault-containing network protocols. In: Proceedings of the 1997 ACM symposium on Applied Computing, pp. 431–437 (1997)

  14. Gupta, A.: Fault-containment in self-stabilizing distributed systems. Ph.D. thesis, University of Iowa (1997)

  15. Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming the distributed demon. Comput. Math. Appl. 50, 671–681 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity. J. Comput. Syst. Sci. 71, 70–85 (2005)

    Article  MATH  Google Scholar 

  17. Huang, T.C.: An efficient fault-containing self-stabilizing algorithm for the shortest path problem. National Computer Symposium (NCS), Taiwan (2005)

  18. Huang, S.T., Chen, N.S.: A self-stabilizing algorithm for constructing breadth-first trees. Inf. Process. Lett. 41, 107–117 (1992)

    MathSciNet  Google Scholar 

  19. Huang, T.C., Lin, J.C.: A self-stabilizing algorithm for the shortest path problem in a distributed system. Comput. Math. Appl. 43, 103–109 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  20. Huang, T.C., Lin, J.C., Mou, J.N.: Self-stabilizing algorithms for the shortest path problem in a distributed system. In: Proceedings of the ISCA 17th International Conference on the Parallel and Distributed Computing Systems, pp. 270–277 (2004)

  21. Lin, J.C., Huang, T.C.: An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set. IEEE Trans. Parallel Distributed Syst. 14(8), 742–754 (2003)

    Article  Google Scholar 

  22. Shukla, S., Rosenkrantz, D.J., Ravi, S.S.: Observations on self-stabilizing graph algorithms on anonymous networks. In: Proceedings of the Second Workshop on Self-Stabilizing Systems, pp. 7.1–7.15 (1995)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Yuan-Ze University, 135 Yuan-Tung Road, Chung-Li, Tao-Yuan, 320, Taiwan

    Tetz C. Huang

Authors
  1. Tetz C. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tetz C. Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, T.C. An efficient fault-containing self-stabilizing algorithm for the shortest path problem. Distrib. Comput. 19, 149–161 (2006). https://doi.org/10.1007/s00446-006-0001-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-006-0001-1

Keywords

Search

Navigation