New Topology Management Algorithms for Unstructured P2P Networks
In this paper, the authors present new topology management algorithms used to self-organize the overlay of a peer-to-peer network. The algorithms are node selection, node removal, overload estimation and overtaking algorithms. The algorithms have been evaluated using a simple P2P scenario using the P2PRealm network simulator. Based on the simulation results, the algorithms produce an overlay which is stable and has a short average distance between nodes. Peer-To-Peer (P2P) technologies have received a lot of publicity lately mainly because of Kazaa and other P2P file sharing systems. Other resources, for example CPU time and storage space, can also be shared in a P2P network. Every peer, i.e. a node in the P2P network may provide resources to other nodes and consume the resources other nodes are providing.