Download PDFOpen PDF in browser

Design of Efficient Broadcast Protocol for Pyramid Tree-based P2P Network Architecture

10 pagesPublished: June 9, 2021

Abstract

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

Keyphrases: Broadcast, Pyramid tree, Residue class, structured P2P network

In: Yan Shi, Gongzhu Hu, Takaaki Goto and Quan Yuan (editors). CAINE 2020. The 33rd International Conference on Computer Applications in Industry and Engineering, vol 75, pages 80--89

Links:
BibTeX entry
@inproceedings{CAINE2020:Design_of_Efficient_Broadcast,
  author    = {Indranil Roy and Nick Rahimi and Swathi Kaluvakuri and Koushik Maddali and Bidyut Gupta and Narayan Debnath},
  title     = {Design of Efficient Broadcast Protocol for Pyramid Tree-based P2P Network Architecture},
  booktitle = {CAINE 2020. The 33rd International Conference on Computer Applications  in Industry and Engineering},
  editor    = {Yan Shi and Gongzhu Hu and Takaaki Goto and Quan Yuan},
  series    = {EPiC Series in Computing},
  volume    = {75},
  pages     = {80--89},
  year      = {2021},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/kmjW},
  doi       = {10.29007/8ws1}}
Download PDFOpen PDF in browser