Text size
  • Small
  • Medium
  • Large
Contrast
  • Standard
  • Blue text on blue
  • High contrast (Yellow text on black)
  • Blue text on beige

    A Probabilistic Model for Distributed Merging of Mobile Agents

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

    Leeds, UK, 2 - 3 July 2008

    AUTHORS

    Shehla Abbas, Mohamed Mosbah and Akka Zemmari

    ABSTRACT

    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.

    PAPER FORMATS

    PDF filePDF Version of this Paper (118kb)