Skip to main content
SpringerLink
Log in

Messages, Clocks, and Gravitation

  • Conference paper
  • First Online:
From Theory to Practice in Multi-Agent Systems (CEEMAS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2296))

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.

partially supported by grant KBN 7 T11C 006 20

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. I. Ben-Aroya, T. Eilam and A. Schuster, Greedy Hot-Potato Routing on the Two-Dimensional Mesh, Distrib. Comp. 9 (1995) 3–19

    Article  Google Scholar 

  2. J. Abello and S. Dolev, On the Computational Power of Self-Stabilizing Systems, TCS 182 (1997) 159–170

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Ghosh, A. Gupta and S. Pemmaraju, A Self-Stabilizing Algorithm for the Maximum Flow Problem, Distrib. Comp. 10 (1997) 167–180

    Article  Google Scholar 

  4. S.-T. Huang and L.-C. Wuu, Self-Stabilizing Token Circulation in Uniform Networks, Distrib. Comp. 10 (1997) 181–187

    Article  Google Scholar 

  5. D. Wróblewski, Gravitational message passing as a sample distributed algorithm implemented on the PEGAZ agent platform, ICS PAS Reports 911 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science of PAS, Ordona 21, 01-237, Warsaw

    Antoni Mazurkiewicz & Dobiesław Wróblewski

Authors
  1. Antoni Mazurkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dobiesław Wróblewski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warsaw, Poland

    Barbara Dunin-Keplicz

  2. Department of Computer Science, University of Mining and Metallurgy, al. Mickiewicza 30, 30-059, Krakow, Poland

    Edward Nawarecki

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation