Dobieslaw Wroblewski

Gravitational message passing as a sample distributed algorithm implementedon the PEGAZ agent platform

911

Abstract

This work aims at presenting a sample algorithm that is implemented on the PEGAZ Agent Platform, designed and developed by S. Ambroszkiewicz and T. Nowak. The algorithm provides all the agents and services with an uniform mechanism for sending messages along the shortest possible paths through the network. The network is represented here as a finite undirected graph. No copies of messages are created and every message is guaranteed to reach its destination, provided its addressee is accessible in the network. Additionally, the algorithm builds a map of the network graph and updates it every time the graph changes its connections or nodes. This is done in a self-stabilising manner.

Key words: distributed computing, message routing, graph recognition, mobile agents.