The University of Southampton
University of Southampton Institutional Repository

A Fault-Tolerant Directory Service for Mobile Agents based on Forwarding Pointers

A Fault-Tolerant Directory Service for Mobile Agents based on Forwarding Pointers
A Fault-Tolerant Directory Service for Mobile Agents based on Forwarding Pointers
A reliable communication layer is an essential component of a mobile agent system. We present a new fault-tolerant directory service for mobile agents, which can be used to route messages reliably to them, even in the presence of failures of intermediary nodes between senders and receivers. The directory service, based on a technique of forwarding pointers, introduces some redundancy in order to ensure resilience to stopping failures of nodes containing forwarding pointers; in addition, it avoids cyclic routing of messages, and it supports a technique to collapse chains of pointers that allows direct communication between agents. We have formalised the algorithm and derived a fully mechanical proof of its correctness using the proof assistant Coq; we report on our experience of designing the algorithm and deriving its proof of correctness. The complete source code of the proof is made available from the WWW.
53-87
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8

Moreau, Luc (2006) A Fault-Tolerant Directory Service for Mobile Agents based on Forwarding Pointers. Scalable Computing: Practice and Experience, 7 (4), 53-87.

Record type: Article

Abstract

A reliable communication layer is an essential component of a mobile agent system. We present a new fault-tolerant directory service for mobile agents, which can be used to route messages reliably to them, even in the presence of failures of intermediary nodes between senders and receivers. The directory service, based on a technique of forwarding pointers, introduces some redundancy in order to ensure resilience to stopping failures of nodes containing forwarding pointers; in addition, it avoids cyclic routing of messages, and it supports a technique to collapse chains of pointers that allows direct communication between agents. We have formalised the algorithm and derived a fully mechanical proof of its correctness using the proof assistant Coq; we report on our experience of designing the algorithm and deriving its proof of correctness. The complete source code of the proof is made available from the WWW.

This record has no associated files available for download.

More information

Published date: 1 December 2006
Organisations: IAM

Identifiers

Local EPrints ID: 409398
URI: http://eprints.soton.ac.uk/id/eprint/409398
PURE UUID: 1a775cb9-2569-462e-b42a-603892d7536f
ORCID for Luc Moreau: ORCID iD orcid.org/0000-0002-3494-120X

Catalogue record

Date deposited: 28 May 2017 04:08
Last modified: 15 Mar 2024 12:41

Export record

Contributors

Author: Luc Moreau ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×