Skip to main content
SpringerLink
Log in

An Effective Characterization of Computability in Anonymous Networks

  • Conference paper
  • First Online:
Distributed Computing (DISC 2001)

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

Included in the following conference series:

Abstract

We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).

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. Dana Angluin. Local and global properties in networks of processors. In Proc. 12th Symposium on the Theory of Computing, pages 82–93, 1980.

    Google Scholar 

  2. Nechama Allenberg-Navony, Alon Itai, and Shlomo Moran. Average and randomized complexity of distributed problems. SIAM Journal on Computing, 25(6):1254–1267, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  3. Hagit Attiya, Marc Snir, and Manfred K. Warmuth. Computing on an anonymous ring. J. Assoc. Comput. Mach., 35(4):845–875, 1988.

    MATH  MathSciNet  Google Scholar 

  4. Paolo Boldi, Bruno Codenotti, Peter Gemmell, Shella Shammah, Janos Simon, and Sebastiano Vigna. Symmetry breaking in anonymous networks: Characterizations. In Proc. 4th Israeli Symposium on Theory of Computing and Systems, pages 16–26. IEEE Press, 1996.

    Google Scholar 

  5. Paolo Boldi and Sebastiano Vigna. Fibrations of graphs. Discrete Math. To appear.

    Google Scholar 

  6. Paolo Boldi and Sebastiano Vigna. Computing vector functions on anonymous networks. In Danny Krizanc and Peter Widmayer, editors, SIROCCO’ 97. Proc. 4th International Colloquium on Structural Information and Communication Complexity, volume 1 of Proceedings in Informatics, pages 201–214. Carleton Scientific, 1997. An extended abstract appeared also as a Brief Announcement in Proc. PODC’ 97, ACM Press.

    Google Scholar 

  7. Paolo Boldi and Sebastiano Vigna. Self-stabilizing universal algorithms. In Sukumar Ghosh and Ted Herman, editors, Self-Stabilizing Systems (Proc. of the 3rd Workshop on Self-Stabilizing Systems, Santa Barbara, California, 1997), volume 7 of International Informatics Series, pages 141–156. Carleton University Press, 1997.

    Google Scholar 

  8. Paolo Boldi and Sebastiano Vigna. Computing anonymously with arbitrary knowledge. In Proc. 18th ACMSymposium on Principles of Distributed Computing, pages 181–188. ACM Press, 1999.

    Google Scholar 

  9. Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, and Andrzej Pelc. Anonymous wireless rings. Theoret. Comput. Sci., 145:95–109, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. Ralph E. Johnson and Fred B. Schneider. Symmetry and similarity in distributed systems. In Proc. 4th conference on Principles of Distributed Computing, pages 13–22, 1985.

    Google Scholar 

  11. Nancy Norris. Computing functions on partially wireless networks. In Lefteris M. Kirousis and Evangelos Kranakis, editors, Structure, Information and Communication Complexity. Proc. 2nd Colloquium SIROCCO’ 95, volume 2 of International Informatics Series, pages 53–64. Carleton University Press, 1996.

    Google Scholar 

  12. Moni Naor and Larry Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6):1259–1277, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  13. Sandeep K. Shukla, Daniel J. Rosenkrantz, and S.S. Ravi. Observations on selfstabilizing graph algorithms for anonymous networks. InProceedings of the Second Workshop on Self-Stabilizing Systems, pages 7.1–7.15, LasVegas, 1995. University of Nevada.

    Google Scholar 

  14. Masafumi Yamashita and Tiko Kameda. Computing on anonymous networks: Part I—characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems, 7(1):69–89, 1996.

    Article  Google Scholar 

  15. Masafumi Yamashita and Tiko Kameda. Erratum to computing functions on asynchronous anonymous networks. Theory of Computing Systems (formerly Math. Systems Theory), 31(1), 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy

    Paolo Boldi & Sebastiano Vigna

Authors
  1. Paolo Boldi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastiano Vigna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, 77843-3112, USA

    Jennifer Welch

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boldi, P., Vigna, S. (2001). An Effective Characterization of Computability in Anonymous Networks. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45414-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42605-9

  • Online ISBN: 978-3-540-45414-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation