Skip to main content

Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction

  • Conference paper
Principles of Distributed Systems (OPODIS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5923))

Included in the following conference series:

Abstract

Most of self-stabilizing protocols require every pair of neighboring processes to communicate with each other repeatedly and forever even after converging to legitimate configurations. Such permanent communication impairs efficiency, but is necessary in nature of self-stabilization. So it is challenging to minimize the number of process pairs communicating after convergence. In this paper, we investigate possibility of communication-efficient self-stabilization for spanning-tree construction, which allows only O(n) pairs of neighboring processes to communicate repeatedly after convergence.

This work is supported in part by MEXT: Global COE Program and JSPS: Grant-in-Aid for Scientific Research ((B)19300017, (C)21500012, (C)21500013).

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

Access this chapter

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. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable leader election. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 108–122. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing omega with weak reliability and synchrony assumptions. In: Proc. of the 22nd PODC, pp. 306–314 (2003)

    Google Scholar 

  3. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: Proc. of the 23rd PODC, pp. 328–337 (2004)

    Google Scholar 

  4. Biely, M., Widder, J.: Optimal message-driven implementations of omega with mute processes. ACM TAAS 4, 4:1–4:22 (2009)

    Google Scholar 

  5. Delporte-Gallet, C., Devismes, S., Fauconnier, H.: Robust stabilizing leader election. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol. 4838, pp. 219–233. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Devismes, S., Masuzawa, T., Tixeuil, S.: Communication efficiency in self-stabilizing silent protocols. In: Proc. of the 29th ICDCS, pp. 474–481 (2009)

    Google Scholar 

  7. Larrea, M., Fernandez, A., Arevalo, S.: Optimal implementation of the weakest failure detector for solving consensus. In: Proc. of the 19th SRDS, pp. 52–59 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Masuzawa, T., Izumi, T., Katayama, Y., Wada, K. (2009). Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds) Principles of Distributed Systems. OPODIS 2009. Lecture Notes in Computer Science, vol 5923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10877-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10877-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10876-1

  • Online ISBN: 978-3-642-10877-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics