Design of Efficient Broadcast Protocol for Pyramid Tree-based P2P Network Architecture
Indranil Roy, Nick Rahimi, Swathi Kaluvakuri, Koushik Maddali, Bidyut Gupta, Narayan Chandra Debnath · EPiC series in computing · 2021
In this paper, we have considered an existing non-DHT-based structured P2P network. It is known as pyramid tree. A node i in this tree represents a group (cluster) of peers that are interested in a particular resource of type i. It is not a conventional tree. In the present work, such a P2P architecture has been the choice because in a pyramid tree, search latency for its inter-group data lookup algorithm is bounded by the tree diameter and is independent of the total number of peers present in the system. In addition, any intra-group data look up communication needs only one overlay hop. In the present work, we have explored some important structural properties of the tree and incorporated them to design an efficient inter cluster broadcast protocol with complexity O(log n) for complete pyramid tree architecture, where n denotes the number of nodes in the tre