The Distributed Algorithms Platform is a software package based on LEDA for the implementation, simulation, and testing of distributed algorithms. The first phase of its development was accomplished in the frame of the EU IST Programme under contract number IST-1999-14186, project     (Work Package 2, deliverables D7, D17, D25).

• Introduction
• Status
• People
• Supporting Documentation
• Related Papers
• Download Current Version

If you want to get update information concerning this package please contact: 

Introduction

The Distributed Algorithms Platform (DAP) is a software platform aiming to support the implementation, simulation, and testing of distributed algorithms. Its focus is on implementing distributed algorithmic ideas developed for wired and mobile wireless network systems. It is implemented in C++ using LEDA. To transfer the full power of LEDA to distributed experiments and implementation of distributed algorithms, DAP is provided as a LEDA Extension Package.

The main strengths of DAP that distinguish it are:

• The user develops in a standard programming language (C++) and the programs can be easily and efficiently ported to a real distributed environment.
• A modular model is used, powerful enough to represent diverse distributed environments, yet simple enough to hide unecessary details.
• A user is able to control, monitor, and visualize the simulation of his/her algorithm through a Graphical User Interface (GUI).
• Many users can simultaneously monitor and visualize (through a lighter version of the GUI) the simulation of some algorithm from remote locations.
• The execution of the simulation can be distributed among several hosts (if required).
• Randomness can be introduced in all areas of the simulated distributed system.
• Scenarios can be defined for repetetive simulation of particular situations.

Status

The development of LEP-DAP has reached its final stage. All the three main components of the platform (the Engine, the DAP library and the GUI) are operational and have all the proposed functionality. Most importantly the DAP library interface is stable, so users may start coding their algorithms without any fear that they will have to modify them for a new version of LEP-DAP. In addition, the inter-module communication and environment specification format will remain stable, so it is safe to develop third-party extensions to the system. In this stage there is only a small number of implemented algorithms and we have not developed any "observers", but, as noted above, it is now easy to develop these extensions.

In a complex software package such as LEP-DAP there is always room for improvement. We plan to keep improving our platform by removing possible bugs and adding new functionality. Please check this page regularly for updates.

People

Patras

Ioannis Chatzigiannakis (ichatz@cti.gr)
Athanasios Kinalis (kinalis@ceid.upatras.gr)
Grigorios Prasinos (green@ceid.upatras.gr)
Athanassios Poulakidas (poulak@cti.gr)
Christos Zaroliagis (zaro@ceid.upatras.gr)

Supporting Documentation

• I. Chatzigiannakis, A. Kinalis, A. Poulakidas, G. Prasinos, and C. Zaroliagis
  "DAP: A generic platform for the simulation of distributed algorithms"
  in Proc. 37th Annual Simulation Symposium - ANSS 2004 (IEEE Computer Society Press, 2004), to appear.
  Also ALCOM-FT Technical Report TR-03-155, December 2003.
  
  
• I. Chatzigiannakis, A. Kinalis, A. Poulakidas, G. Prasinos, and C. Zaroliagis.
  Distributed Algorithms Platform Manual.
  
  

Related Papers

• P. Spirakis and C. Zaroliagis
  Distributed Algorithm Engineering
  Chapter 10, in Experimental Algorithmics - From Algorithm Design to Robust and Efficient Software
  Eds. R. Fleischer, B. Moret, and E. Meineche-Schmidt, Springer-Verlag, 2002, pp. 197-228.
  
  
• I. Chatzigiannakis, S. Nikoletseas, N. Paspalis, P. Spirakis, and C. Zaroliagis.
  An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks.
  In Algorithm Engineering - WAE 2001
  Lecture Notes in Computer Science 2141 (Springer-Verlag, 2001), pp. 159-171.
  Also ALCOM-FT Technical Report TR-01-119.
  
  
• I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis.
  An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks.
  In Proc. IPDPS Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing (PDC '01), 2001.
  Also ALCOM-FT Technical Report TR-01-62.
  
  
• I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis.
  Analysis and Experimental Evaluation of an Innovative Routing Protocol for Ad-hoc Mobile Networks.
  In Algorithm Engineering - WAE 2000
  Lecture Notes in Computer Science 1982 (Springer-Verlag, 2000), pp. 99-110.
  Also ALCOM-FT Technical Report TR-01-61.