Abstract
The message system considered in the paper consists of a finite set of places, each of them capable to store a fixed number of messages. Places can be joined by links and then they are called neighbours. Messages are created and moved from neighbour to neighbour until reaching their destinations, and then disappear. The aim of this paper is to define a rule of message moving, which ensures responsiveness of the system, i.e. a rule that guarantees any message appearing in the system to eventually reach its destination. Such a rule, based on so-called “potential function” of messages, is found and its adequacy is proved.
Keywords
partially supported by grant KBN 7 T11C 006 20
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Ben-Aroya, T. Eilam and A. Schuster, Greedy Hot-Potato Routing on the Two-Dimensional Mesh, Distrib. Comp. 9 (1995) 3–19
J. Abello and S. Dolev, On the Computational Power of Self-Stabilizing Systems, TCS 182 (1997) 159–170
S. Ghosh, A. Gupta and S. Pemmaraju, A Self-Stabilizing Algorithm for the Maximum Flow Problem, Distrib. Comp. 10 (1997) 167–180
S.-T. Huang and L.-C. Wuu, Self-Stabilizing Token Circulation in Uniform Networks, Distrib. Comp. 10 (1997) 181–187
D. Wróblewski, Gravitational message passing as a sample distributed algorithm implemented on the PEGAZ agent platform, ICS PAS Reports 911 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mazurkiewicz, A., Wróblewski, D. (2002). Messages, Clocks, and Gravitation. In: Dunin-Keplicz, B., Nawarecki, E. (eds) From Theory to Practice in Multi-Agent Systems. CEEMAS 2001. Lecture Notes in Computer Science(), vol 2296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45941-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-45941-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43370-5
Online ISBN: 978-3-540-45941-5
eBook Packages: Springer Book Archive