Skip to main content
Log in

Self-stabilizing group communication in directed networks

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

This paper presents the first self-stabilizing group membership service, multicast service, and resource allocation service for directed networks. The first group communication algorithm is based on a token circulation over a virtual ring. The second algorithm is based on construction of distributed spanning trees. In addition, a technique is presented that emulates, in a self-stabilizing fashion, any undirected communication network over strongly connected directed networks, is presented. A resource allocation asynchronous algorithm for strongly connected directed networks is presented.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Afek, Y., Bremler, A. (1998) Self-stabilizing unidirectional network algorithms by power-supply. Chicago Journal of Theoretical Computer Science 1998(3): 1- 48

    MATH  Google Scholar 

  2. Alstein, D., Hoepman, J.H., Olivier, B.E., van der Put, P.I.A. (1994) Self-stabilizing mutual exclusion on directed graphs. In: Computing Science in the Netherlands (Utrecht, 1994), Stichting Mathematisch Centrum, Amsterdam, pp. 42-53

  3. Awerbuch, B. (1985) Complexity of network synchronization. JACM 32(4): 804-823

    Article  MATH  Google Scholar 

  4. Brukman, O., Dolev, S., Kolodner, H. (2003) Self-stabilizing autonomic recoverer for eventual byzantine software. IEEE International Conference on Software-Science, Technology & Engineering, (SwSTE03). Herzelia, pp. 20-29. Also in: Workshop on Adaptive Distributed Systems (WADiS03), Sorrento, Italy

    Google Scholar 

  5. Bang-Jensen, J., Gutin, G. (2000) Digraphs: theory, algorithms and applications. Springer Monographs in Mathematics, Springer, London

  6. Beauquier, J., Gradinariu, M., Johnen, C., Durand-Lose, J. (2002) Token based self-stabilizing uniform algorithms. Journal of Parallel and Distributed Computing (JPDC) 62(5): 899-921

    Article  Google Scholar 

  7. Beauquier, J., Kutten, S., Tixeuil, S. (1999) Self-stabilization in Eulerian networks with cut-through constraints. Technical Report 1200, Laboratoire de Recherche en Informatique, January

  8. Cobb, J.A., Gouda, M.G. (2001) Stabilization of routing in directed networks. Proc. 5th Workshop on Self-Stabilization Systems, LNCS 2194, pp. 51-66

  9. Cristian, F., Schmuck, F. (1995) Agreeing on processor group membership in asynchronous distributed systems. Technical Report CSE95-428, Department of Computer Science, University of California San Diego

  10. Choy, M., Singh, A.K. (1995) Efficient fault tolerant algorithms for distributed resource allocation. ACM Transactions on Programming Languages and Systems 17(4): 535-559

    Article  Google Scholar 

  11. Dijkstra, E.W. (1971) Hierarchical ordering of sequential processes. Acta Informatica 1: 115-138

    MATH  Google Scholar 

  12. Dijkstra, E.W. (1974) Self-stabilizing systems in spite of distributed control. Communication of the ACM 17: 643-644

    Article  MATH  Google Scholar 

  13. Dolev, S. (1997) Self-stabilizing routing and related protocols. Journal of Parallel and Distributed Computing 42: 122-127

    Article  Google Scholar 

  14. Dolev, S. (2000) Self-stabilization. MIT Press, Cambridge, MA

  15. Dolev, S., Herman, T. (1997) Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science 1997(4): 1-40

    MATH  Google Scholar 

  16. Dolev, S., Haviv, Y. (2003) Self-stabilizing soft error resilient microprocessor. Supplemental Volume of the 2003 International Conference on Dependable Systems and Networks, IEEE Computer Society, (DSN 2003), pp. B-18, B-19. Also presented at: IBM’s Compiler and Architecture Seminar, IBM Haifa Labs, November 2002

    Google Scholar 

  17. Dolev, S., Kat, R., (2002) Self-stabilizing distributed file systems. International Workshop on Self-Repairing and Self-Configurable Distributed Systems, (RCDS 2002), pp. 384-389. Also presented at: IBM’s Storage Systems Technology Workshop, IBM Haifa Labs, November 2002

    Google Scholar 

  18. S. Dolev, Israeli, A., Moran, S. (1997) Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 4, pp. 424-440

  19. Dolev, S., Schiller, E. (2001) Communication adaptive self-stabilizing group membership service. 5th Workshop on Self-Stabilizing Systems, LNCS 2194, pp. 82-97, October. Also in: Technical Report #00-02 Department of Computer Science Ben-Gurion University, Beer-Sheva, Israel, 2000

    Google Scholar 

  20. Dolev, S., Schiller, E. (2003) Self-stabilizing group communication in directed networks. Technical Report #10-03 Department of Computer Science Ben-Gurion University, Beer-Sheva, Israel

  21. Dolev, S., Schiller, E., Welch, J.L. (2002) Random walk for self-stabilizing group communication in ad-hoc networks. 21st Symposium on Reliable Distributed Systems, IEEE Computer Society Press, pp. 70-79

  22. Delaet, S., Tixeuil, S. (2002) Tolerating transient and intermittent failures. Journal of Parallel and Distributed Computing 62(5): 961-981

    Article  MATH  Google Scholar 

  23. Dolev, S., Welch, J.L. (1997) Crash resilient communication in dynamic networks. IEEE Transactions on Computers, 46(1): 12-26

    Google Scholar 

  24. Dolev, S., Yagel, R. (2003) Toward self-stabilizing operating systems. IEEE International Conference on Software-Science, Technology & Engineering, Industrial Track, Doctoral Symposium, Posters, (SwSTE03), Herzelia, November

  25. Fox, A., Patterson, D. (2003) Self-repairing computers. Scientific American, May 12

  26. IBM (2001) Autonomic computing. http://www.research.ibm.com/autonomic

  27. Kaiser, G., Parekh, J., Gross, P., Valetto, G. (2003) Kinesthetics eXtreme: An external infrastructure for monitoring distributed legacy systems. In: 5th Annual International Active Middleware Workshop, June, pp. 22-30

  28. Lynch, N.A. (1980) Fast allocation of nearby resources in a distributed system. Proc. 12th ACM Symposium on Theory of Computing, pp. 70-81

  29. Patterson, D., Brown, A., Broadwell, P., Candea, G., Chen, M., Cutler, J., Enriquez, P., Fox, A., Kiciman, E., Merzbacher, M., Oppenheimer, D., Sastry, N., Tetzlaff, W., Traupman, J., Treuhaft, N. (2002) Recovery Oriented Computing(ROC): Motivation, definition, techniques and case studies. UC Berkeley Computer Science Technical Report UCB/CSD-02-1175, Berkeley, CA, March

  30. Sussman, J., Marzullo, K. (1998) The bancomat problem: An example of resource allocation in a partitionable asynchronous system. Theoretical Computer Science 291(1): 103-131

    Article  MATH  Google Scholar 

  31. Tanenbaum, A.S. (1996) Computer networks, 3rd edn. Prentice Hall

  32. Tchunte, M. (1981) Sur l’auto-stabilisation dans un reseau d’ordinateurs. RAIRO Informatique Theoretique 15: 47-66

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shlomi Dolev.

Additional information

Received: 23 July 2003, Published online: 29 June 2004

Partially supported by NSF Award CCR-0098305, IBM faculty award, STRIMM consortium, and Israel ministry of defense.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dolev, S., Schiller, E. Self-stabilizing group communication in directed networks. Acta Informatica 40, 609–636 (2004). https://doi.org/10.1007/s00236-004-0143-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-004-0143-1

Keywords:

Navigation