A Probabilistic Model for Distributed Merging of Mobile Agents - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

A Probabilistic Model for Distributed Merging of Mobile Agents

Résumé

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.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

hal-00345590 , version 1 (09-12-2008)

Identifiants

  • HAL Id : hal-00345590 , version 1

Citer

Shehla Abbas, Mohamed Mosbah, Akka Zemmari. A Probabilistic Model for Distributed Merging of Mobile Agents. Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008), 2008, Leeds, United Kingdom. pp.eWIC. ⟨hal-00345590⟩

Collections

CNRS
46 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More