The concept of peer-to-peer (P2P) networking came to the fore as part of the movement that led to the freeing up of digital information although it gained considerable notoriety when it was hijacked for the purposes of illicit and illegal file sharing. However, it remains an important concept in distributing upload and download bandwidth among users with large files to distribute and P2p networking is used by many different tools with perfectly legitimate applications.
Writing in the International Journal of Reasoning-based Intelligent Systems, a team from India points out that for efficient use of a P2P network it is best if users that are a short hop from each other in terms of internet connectivity are clustered together. This can reduce the total burden on system resources and bandwidth by precluding the sending of packets of data across non-optimal transfer distances. The team of S. Vimal at the Sathyabama Institute of Science and Technology, in Chennai, and S.K. Srivatsa of MIT at Anna University also in Chennai, India, have shown how a clustered P2P network that utilizes a file-replication algorithm can boost efficiency still further.
The team describes their approach as a “nearness and interested cluster (NIC) super peer network. The interests and categorized “sub-interests” of peers are used to cluster them according to the most likely of digital commodities that they might be anticipated to share.
Vimal, S. and Srivatsa, S.K. (2019) ‘A file sharing system in peer-to-peer network by a nearness-sensible method’, Int. J. Reasoning-based Intelligent Systems, Vol. 11, No. 4, pp.293–299.