Self transforming to power law topology for overlay networks

Designing the architecture of future network requires the understanding of how a topological structure influences the performance of a network. The study of the topology known as complex network theory has revealed the omnipresence of power law topology in many real networks. This power law topology is known to provide high efficiency in data exchange among individual nodes as well as robustness against random failures on them. For this reason, this topological structure has been adopted in several algorithms for the construction of an overlay network in the context of peer-to-peer (P2P) networks. All of them are based on a growing mechanism that requires continuous joining process of nodes. In this paper we propose a non-growing algorithm to construct a power law topology for overlay networks which have important implications for the evolution of the Internet to the next generation networks. The implementation of the algorithm is fully distributed that does not require a centrally dedicated server, thus, make them more secure against a single point failure of the system. Moreover, we demonstrate how the rewired topology takes advantage of its topological structure by analyzing its basic topological properties as well as robustness and efficiency.