ON FURTHER REDUCTION OF THE DIAMETER OF AN EXISTING INTEREST BASED PEER-TO-PEER NETWORK ARCHITECTURE

Author

• Nitesh Manikanta Potu, Southern Illinois University CarbondaleFollow

Date of Award

5-1-2026

Degree Name

Master of Science

Department

Computer Science

First Advisor

Gupta, Bidyut

Abstract

In this work, we have proposed a modified version of the existing Residue-class (RC) based peer-to peer (P2P) network architecture. The existing RC based architecture [10] has been considered because of its two main advantages viz. (1) all peers with the same interest (or possessing the same resource type) structurally form a group of diameter one, and (2) the group heads are connected in the form of a ring and the ring always remains connected even in the presence of any churn. The diameter of the ring with n group heads is n/2 and as n increases, the latency of the existing data look-up protocols increases as well. In this work our objective is to reduce this diameter substantially in order to reduce data look-up latency drastically. To achieve this, we have used a mathematical model using which we show that all group heads will be connected directly to each other; that is, instead of forming a ring structure of diameter n/2, it will be a network of diameter one only. Therefore, the diameter of the peer-to-peer network becomes only 3 instead of (n/2 + 2) as in [10]. This is the shortest diameter possible in such networks. It will definitely make any data look-up protocol highly efficient from the viewpoint of low latency.