A Probabilistic Model for Distributed Merging of Mobile Agents

We propose a probabilistic algorithm for mobile agents which roam around in the network following a random walk . We consider the following problem: when two or more agents meet at a node, they merge into a single agent. As the graph is connected, the agents meet in finite time. We are interested in the time it takes for all agents to merge. More precisely, we study a probabilistic model and we analyse the time complexity of a distributed algorithm for all the agents to merge into a single one.

Content

Author and article information

Contributors

Shehla Abbas

Mohamed Mosbah

Akka Zemmari

Conference

Publication date: July 2008

Publication date (Print): July 2008

Pages: 1-10

Affiliations

[0001]LaBRI, University of Bordeaux 1

351 cours de la Libération

33400 Talence-France

Article

DOI: 10.14236/ewic/VECOS2008.16

SO-VID: cf4103eb-3d2f-445f-abac-7752e98036e3

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008)

Conference acronym: VECoS

Conference number:

Conference location: Leeds, UK

Conference date: 2 - 3 July 2008

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Verification and Evaluation of Computer and Communication Systems

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/VECOS2008.16

Self URI (journal page): https://ewic.bcs.org/

Studying business & IT? Drive your professional career forwards with BCS books - for a 20% discount click here: shop.bcs.org

A Probabilistic Model for Distributed Merging of Mobile Agents

Abstract