Abstract
This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may start from arbitrary locations in arbitrary states. Self-stabilization requires (some of the) participating agents to keep moving forever, hinting at maximizing the number of agents that could be allowed to stop moving eventually.
This paper formalizes the self-stabilizing agent gossip problem, introduces the quiescence number (i.e., the maximum number of eventually stopping agents) of self-stabilizing solutions and investigates the quiescence number with respect to several assumptions related to agent anonymity, synchrony, link duplex capacity, and whiteboard capacity.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barriére, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory of Computing Systems 40(2), 143–162 (2007)
Beauquier, J., Herault, T., Schiller, E.: Easy stabilization with an agent. In: Proceedings of the 5th Workshop on Self-Stabilizing Systems (WSS), pp. 35–51 (2001)
Blin, L., Gradinariu Potop-Butucaru, M., Tixeuil, S.: On the self-stabilization of mobile robots in graphs. In: Proceedings of OPODIS, pp. 301–314 (2007)
Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Inf. 36(6), 447–462 (1999)
Dolev, S., Schiller, E., Welch, J.: Random walk for self-stabilizing group communication in ad-hoc networks. In: Proceedings of SRDS, pp. 70–79 (2002)
Ghosh, S.: Agents, distributed algorithms, and stabilization. In: Proceedings of International Computing and Combinatorics Conference (COCOON), pp. 242–251 (2000)
Herman, T., Masuzawa, T.: Self-stabilizing agent traversal. In: Proceedings of the 5th Workshop on Self-Stabilizing Systems (WSS), pp. 152–166 (2001)
Suzuki, T., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Move-optimal gossiping among mobile agents. Theoretical Computer Science 393(1–3), 90–101 (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masuzawa, T., Tixeuil, S. (2008). Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs. In: Shvartsman, A.A., Felber, P. (eds) Structural Information and Communication Complexity. SIROCCO 2008. Lecture Notes in Computer Science, vol 5058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69355-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-69355-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69326-0
Online ISBN: 978-3-540-69355-0
eBook Packages: Computer ScienceComputer Science (R0)