Skip to main content
SpringerLink
Log in

Homonym Population Protocols

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

The population protocol model was introduced by Angluin et al. as a model of passively mobile anonymous finite-state agents. This model computes a predicate on the multiset of their inputs via interactions by pairs. The original population protocol model has been proved to compute only semilinear predicates and has been extended in various ways. In the community protocol model by Guerraoui and Ruppert, the n agents have unique identifiers but may only store a finite number of the identifiers they already heard about. The community protocol model is known to provide the power of a non-deterministic Turing machine with an O (n log n) space. We consider variants of the two above-mentioned models and we obtain a whole landscape that covers and extends already known results. Namely, by considering the case of homonyms, that is to say the case when several agents may share the same identifier, we provide a hierarchy that goes from the case of no identifier (population protocol model) to the case of unique identifiers (community protocol model). In particular, we obtain that any Turing Machine on space O (log O (1) n) can be simulated with log rn identifiers, for any r >  0. Our results also extend and revisit the hierarchy provided by Chatzigiannakis et al. on population protocols carrying Turing Machines on limited space, reducing the gap left by this work between per-agent space o (loglog n) (proved to be equivalent to population protocols) and Ω(log n) (proved to be equivalent to Turing machines): We prove that per-agent space Θ(loglog n) corresponds to symmetric predicates computable in polylogarithmic non-deterministic space.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. These classes are defined in Section 3.6.

  2. Formal definition will be given right before Example 1.

  3. In the community protocol model in [13], U is assumed to be arbitrary.

  4. Fixing any order for elements of X i .

  5. But of course that would not make sense to be solved using population protocols sinceagents in population protocols have no identifiers.

  6. Notice that the convention of [13] about inputs requires that the input must be distributed on agents ordered by identifiers.

References

  1. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279–304 (2007)

    Article  MATH  Google Scholar 

  2. Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S., Spirakis, P., Welsh, M. (eds.) Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina Del Rey, CA, USE, June/July, 2005, Proceedings, volume 3560 of Lecture Notes in Computer Science, pp. 63–74. Springer (2005)

  3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Twenty-Third ACM Symposium on Principles of Distributed Computing, pp. 290–299. ACM Press (2004)

  4. Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. ACM Transactions on Autonomous and Adaptive Systems (TAAS) 3(4), 13 (2008)

    Google Scholar 

  5. Arévalo, S., Anta, A.F., Imbs, D., Jiménez, E., Raynal, M.: Failure detectors in homonymous distributed systems (with an application to consensus). J. Parallel Distrib. Comput. 83, 83–95 (2015)

    Article  Google Scholar 

  6. Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Bulletin of the EATCS, vol. 93, pp. 106–125 (2007)

  7. Bournez, O., Cohen, J., Rabie, M.: Homonym population protocols. In: Springer (ed.) Networked Systems. Third International Conference, NETYS 2015, Agadir, Morocco, May 13–15, 2015, Revised Selected Papers, vol. 9466 of Lecture Notes in Computer Science (2015)

  8. Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46), 6469–6483 (2011). https://doi.org/10.1016/j.tcs.2011.07.001, http://www.sciencedirect.com/science/article/pii/S0304397511005895

    Article  MathSciNet  Google Scholar 

  9. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.-M., Ruppert, E., Tran-The, H.: Byzantine agreement with homonyms. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 21–30. ACM (2011)

  10. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: making population protocols fault-tolerant. In: Gibbons, P.B., Abdelzaher, T.F., Aspnes, J., Rao, R. (eds.) Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings, vol. 4026 of Lecture Notes in Computer Science, pp. 51–66. Springer (2006)

  11. Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Homonyms with forgeable identifiers. In: Structural Information and Communication Complexity, pp. 171–182 (2012)

  12. Di Luna, G.A., Baldoni, R., Bonomi, S., Chatzigiannakis, I.: Counting the number of homonyms in dynamic networks. In: Symposium on Self-Stabilizing Systems, pp. 311–325. Springer (2013)

  13. Guerraoui, R., Ruppert, E.: Names trump malice: tiny mobile agents can tolerate byzantine failures. In: Automata, Languages and Programming, pp. 484–495 (2009)

  14. Immerman, N.: Nondeterministic space is closed under complementation. In: Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual, pp. 112–115. IEEE (1988)

  15. Michail, O., Chatzigiannakis, I., Spirakis, P.G.: New models for population protocols. Synthesis Lectures on Distributed Computing Theory 2(1), 1–156 (2011)

    Article  MATH  Google Scholar 

  16. Schönhage, A.: Storage modification machines. SIAM J. Comput. 9(3), 490–508 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  17. Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata. Acta Inf. 26(3), 279–284 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIX, Ecole Polytechnique, 91128, Palaiseau Cedex, France

    Olivier Bournez

  2. Université de Paris-Sud, LRI, Bâtiment 425, 91405, Orsay Cedex, France

    Johanne Cohen

  3. LIP, ENS de Lyon, 69007, Lyon, France

    Mikaël Rabie

Authors
  1. Olivier Bournez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johanne Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mikaël Rabie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olivier Bournez.

Additional information

A preliminary version of this article had appeared in the proceedings of NETYS’2015 [7].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bournez, O., Cohen, J. & Rabie, M. Homonym Population Protocols. Theory Comput Syst 62, 1318–1346 (2018). https://doi.org/10.1007/s00224-017-9833-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-017-9833-2

Keywords

Search

Navigation