Context
Distributed ComputingTask Description
The task is to create an overlay network for the lookup of data /containers in the Internet. The idea is to search by using some heuristic algorithm like algorithms based on Ant Colony Optimization. In this scenario it is assumed that the search space is the set (subset of the set) of names, the environment is static (concerning the number of nodes, we assume the finite number of nodes), but dynamic (concerning the connection between nodes), the role of a "neighbour" in the Ant Algorithm has the next lookup container and a "distance" between nodes can be interpreted either as some constant C or the assigned value according to the fact how much the node is bussy. The proposed algorithms that can be applied are MIN-MAX AntSystem and AntNet. These algorithms are going to be applied in a hybrid forms i.e. combined with Local Search algorithm (in order to achieve the best possible solution that is time consuming as less as possible). The work includes implementation of the Peer-to-Peer Overlay structure and benchmarking.
Requirements
- Java programming basics.
Student
Open Topic
Supervisor
A.o. Univ.-Prof. Dr. Dipl.-Ing. eva Kühn (please contact eva Kühn)
Related Projects in the Network
None
