Skip to main content
SpringerLink
Log in

Amnesiac Flooding: Synchronous Stateless Information Dissemination

  • Conference paper
  • First Online:
SOFSEM 2021: Theory and Practice of Computer Science (SOFSEM 2021)

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

Abstract

A recently introduced stateless variant of network flooding for synchronous systems is called amnesiac flooding. Stateless protocols are advantageous in high volume applications, increasing performance by removing the load caused by retention of session information. In this paper we analyze the termination time of multi-source amnesiac flooding. We provide tight upper and lower bounds for the time complexity.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Archdeacon, D., et al.: Some remarks on domination. J. Graph Theor. 46(3), 207–210 (2004)

    Article  MathSciNet  Google Scholar 

  2. Awerbuch, B., Khandekar, R.: Stateless distributed gradient descent for positive linear programs. In: Proceedings \(40^{th}\) Symposium on Theory of Computing, pp. 691–700. ACM (2008)

    Google Scholar 

  3. Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10(3), 211–219 (1980)

    Article  MathSciNet  Google Scholar 

  4. Dolev, S., Kahil, R.M., Yagel, R.: Stateless stabilization bootstrap (Extended Abstract). In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 180–194. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11764-5_13

    Chapter  Google Scholar 

  5. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 128–137. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-52921-7_62

    Chapter  Google Scholar 

  6. Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10(1), 57–77 (1985)

    Article  MathSciNet  Google Scholar 

  7. Hussak, W., Trehan, A.: Brief announcement: on termination of a flooding process. In: Proceedings ACM Symposium on Principles of Distributed Computing, pp. 153–155 (2019)

    Google Scholar 

  8. Hussak, W., Trehan, A.: On the Termination of Flooding. In: Paul, C., Bläser, M. (eds.) 37\(^{th}\) Symposium on Theoretical Aspects of Computer Science (STACS), LIPIcs, vol. 154, pp. 17:1–17:13 (2020)

    Google Scholar 

  9. Meir, A., Moon, J.W.: Relations between packing and covering numbers of a tree. Pacific J. Math. 61(1), 225–233 (1975)

    Article  MathSciNet  Google Scholar 

  10. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Society for Industrial and Applied Mathematics, Philadelphia (2000)

    Book  Google Scholar 

  11. Turau, V.: Analysis of Amnesiac Flooding. CoRR abs/2002.10752 (2020). https://arxiv.org/abs/2002.10752

  12. Turau, V.: Stateless information dissemination algorithms. In: Richa, A.W., Scheideler, C. (eds.) SIROCCO 2020. LNCS, vol. 12156, pp. 183–199. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-54921-3_11

    Chapter  Google Scholar 

  13. Väisälä, J.: Gromov hyperbolic spaces. Expositiones Mathematicae 23(3), 187–231 (2005)

    Article  MathSciNet  Google Scholar 

  14. Zweig, K.A.: Network Analysis Literacy. LNSN. Springer, Vienna (2016). https://doi.org/10.1007/978-3-7091-0741-6

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Telematics, Hamburg University of Technology, 21073, Hamburg, Germany

    Volker Turau

Authors
  1. Volker Turau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Volker Turau .

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Tomáš Bureš

  2. University of Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Free University of Bozen-Bolzano, Bolzano, Italy

    Johann Gamper

  4. University of Genoa, Genoa, Italy

    Giovanna Guerrini

  5. University of Wroclaw, Wroclaw, Poland

    Tomasz Jurdziński

  6. Free University of Bozen-Bolzano, Bolzano, Italy

    Claus Pahl

  7. University Paris Dauphine, Paris, France

    Florian Sikora

  8. University of Liverpool, Liverpool, UK

    Prudence W.H. Wong

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Turau, V. (2021). Amnesiac Flooding: Synchronous Stateless Information Dissemination. In: Bureš, T., et al. SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Lecture Notes in Computer Science(), vol 12607. Springer, Cham. https://doi.org/10.1007/978-3-030-67731-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67731-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67730-5

  • Online ISBN: 978-3-030-67731-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation