Skip to main content
SpringerLink
Log in

Self-Stabilizing Group Communication in Directed Networks (Extended Abstract)

  • Conference paper
  • First Online:
Self-Stabilizing Systems (SSS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2704))

Included in the following conference series:

Abstract

Self-stabilizing group membership service, multicast service, and resource allocation service in directed network are presented. 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 that emulates, in a self-stabilizing fashion, any undirected communication network over strongly connected directed network, is presented.

Partially supported by NSF Award CCR-0098305, IBM faculty award, STRIMM consortium, and Israel ministry of defense. An extended version can be found in [12].

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Afek and A. Bremler, “Self-Stabilizing Unidirectional Network Algorithms by Power-Supply,” Chicago Journal of Theoretical Computer Science, Vol. 1998, No. 3, December 1998. 62

    Google Scholar 

  2. D. Alstein, J. H. Hoepman, B. E. Olivier, P. I. A. van der Put, “Self-Stabilizing Mutual Exclusion on Directed Graphs,” In Computing Science in the Netherlands (Utrecht, 1994), Stichting Mathematisch Centrum, Amsterdam, 1994, pp. 42–53. 62, 68

    Google Scholar 

  3. J. Bang-Jensen and G. Gutin, “Digraphs: Theory, Algorithms and Applications,” Springer Monographs in Mathematics, Springer-Verlag, London, 2000. 68

    Google Scholar 

  4. J. Beauquier, M. Gradinariu, C. Johnen, J. Durand-Lose, “Token Based Self-Stabilizing uniform Algorithms,” Journal of Parallel and Distributed Computing (JPDC), 62(5):899–921, May 2002. 62

    Article  MATH  Google Scholar 

  5. J. A. Cobb and M. G. Gouda, “Stabilization of Routing in Directed Networks,” Proc. 5th Workshop on Self-Stabilization Systems, pp. 51–66. 62

    Google Scholar 

  6. F. Cristian and F. Schmuck, “Agreeing on Processor Group Membership in Asynchronous Distributed Systems,” Technical Report CSE95-428, Department of Computer Science, University of California San Diego, 1995. 65, 67

    Google Scholar 

  7. S. Dolev, “Self-Stabilizing Routing and Related Protocols,” Journal of Parallel and Distributed Computing, 42:122–127, May 1997. 66

    Article  Google Scholar 

  8. S. Dolev, Self-Stabilization, MIT Press, 2000. 62, 66, 67, 71, 74, 75

    Google Scholar 

  9. E. W. Dijkstra, “Self-stabilizing systems in spite of distributed control,” Communication of the ACM, 17:643–644, 1974. 62, 66, 67, 69

    Article  MATH  Google Scholar 

  10. S. Dolev and T. Herman, Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 1997. 66

    Google Scholar 

  11. S. Dolev and E. Schiller, “Communication Adaptive Self-stabilizing Group Membership Service,” 5th Workshop on Self-Stabilizing Systems, October, 2001. Also, Technical Report #00-02 Department of Computer Science Ben-Gurion University, Beer-Sheva, Israel, 2000. 62, 64, 65, 69, 72, 73

    Google Scholar 

  12. S. Dolev and E. Schiller, “Self-Stabilizing Group Communication in Directed Networks,” Technical Report #10-03 Department of Computer Science Ben-Gurion University, Beer-Sheva, Israel, 2003. 61

    Google Scholar 

  13. S. Dolev, E. Schiller, and J. L. Welch, “Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks,” 21st Symposium on Reliable Distributed Systems, IEEE Computer Society Press, pp. 70–79, 2002. 62, 64, 65, 69, 71

    Google Scholar 

  14. S. Delaet and S. Tixeuil, “Tolerating transient and intermittent failures,” Journal of Parallel and Distributed Computing, 62(5):961–981, 2002. 62, 66

    Article  MATH  Google Scholar 

  15. A. S. Tanenbaum, Computer Networks, Prentice Hall, 1996. 69

    Google Scholar 

  16. M. Tchunte, “Sur l’auto-stabilisation dans un reseau d’ordinateurs,” RAIRO Informatique Theoretique, 15:47–66, 1981. 62

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev, Israel

    Shlomi Dolev & Elad Schiller

Authors
  1. Shlomi Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elad Schiller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Electrical Engineering and Computer Science, National Central University, Chung-Li, 32054, Taiwan

    Shing-Tsaan Huang

  2. Dept. of Computer Science, University of Iowa, Iowa City, IA, 52242, USA

    Ted Herman

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dolev, S., Schiller, E. (2003). Self-Stabilizing Group Communication in Directed Networks (Extended Abstract). In: Huang, ST., Herman, T. (eds) Self-Stabilizing Systems. SSS 2003. Lecture Notes in Computer Science, vol 2704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45032-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45032-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40453-8

  • Online ISBN: 978-3-540-45032-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation