|
Project Information
|
This project is a java implementation of a modified version of T-Man that aims to construct a topology which connects peers in such a way that they have the lowest average path-length to a specified source node. To achieve this, the topology must keep the higher bandwidth nodes closer to the source (i.e. hop-counts to the source are inversely proportional to the node's bandwidth). This is implemented in a distributed fashion without the aid of a central entity. We utilize the Kompics component model to implement our simulator. The calculated simulation outputs are the convergence rate per cycle, node bandwidth distribution, amongst others. Our goal is to create a system that scales well, and converges in a relatively low number of cycles.
|