Performance of Generalized Hypercubes in Dynamic Peer-to-Peer Networks
share
Highly dynamic peer-to-peer networks are becoming very significant due to their wide range of applications. Although many structures were proposed to deploy peer-to-peer networks, hypercube structures could grasp the researchers' attention for study because of their desirable properties. A lot of studies have considered binary hypercubes for research. In this paper, we study more generalized topology of hypercubes, namely generalized hypercubes and measure their performance in dynamic networks where nodes can enter and leave the network at any time. Python code was developed to simulate the networks and visualize the results. In addition to being highly flexible and scalable, generalized hypercubes proved to have lower average path length and lower verge density than binary hypercubes.
READ FULL TEXT
