This is a student project made for "Distributed Systems" course of department of Informatics - Ionian University. The main purpose of the project is to implement Tarry's Traversal Algorithm, run it on various networks with random topologies and compare algorithm's complexity-theory (message passes) with the results of the simulations.
Tarry's algorithm is a random graph traversal algorithm defined in 1895. Algorithm's functionality is based on two rules:
- A node does not forward the token twice through the same channel and
- A node (not defined as initiator) forwards the token to his parent node* only if there isn't other available channel through which he hasn't sent.
The algorithm does 2*E (E = number of network edges) message forwards because the token is sent only once through each direction of each channel - network edge.
- Download and install OMNet++ (tested on 5.6.2 version)
- Run
git clone (git url of the repository)into a directory in order to download the project. - Open OMNeT++ IDE
- Go to
File > Open Project from File System...and define the project directory as the "Import source" - Open the "omnetpp.ini" file and run the simulation.