LDEPTH

A low diameter hierarchical P2P network architecture

Nick Rahimi, Koushik Sinha, Bidyut Gupta, Shahram Rahimi, Narayan C. Debnath

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we present a new approach to designing a scalable, hierarchical overlay P2P system which provides highly efficient data lookup operations as well fault tolerance. Instead of using a distributed hash table (DHT) based approach, we propose the use of Linear Diophantine Equation (LDE) as the mathematical basis to realize a hierarchical P2P architecture. LDE provides a significantly lighter weight mechanism to create and maintain the overlaid P2P structure as compared to DHT based schemes. To the best of our knowledge, ours is the first work that proposes the use of LDEs in designing P2P topologies. In our proposed hierarchical P2P architecture, the number of hops required to search for a resource is independent of the number of nodes/peers in the network n and is instead bounded by (1 + r/2), r being the number of distinct resource types. For most practical purposes, r is significantly smaller than n and hence our proposed architecture provides a highly efficient resource look-up procedure. We have also presented algorithms for handling of new resources and peers joining and leaving the P2P network and fault tolerance in the event of peers crashing or leaving.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages832-837
Number of pages6
ISBN (Electronic)9781509028702
DOIs
Publication statusPublished - 13 Jan 2017
Event14th IEEE International Conference on Industrial Informatics, INDIN 2016 - Poitiers, France
Duration: 19 Jul 201621 Jul 2016

Other

Other14th IEEE International Conference on Industrial Informatics, INDIN 2016
CountryFrance
CityPoitiers
Period19/7/1621/7/16

Fingerprint

Fault tolerance
Linear equations
Network architecture
Joining
Topology

Keywords

  • distributed hash table
  • hierarchical P2P
  • Linear diophantine equation
  • network diameter
  • P2P
  • Peer-to-peer network

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Rahimi, N., Sinha, K., Gupta, B., Rahimi, S., & Debnath, N. C. (2017). LDEPTH: A low diameter hierarchical P2P network architecture. In Proceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016 (pp. 832-837). [7819275] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INDIN.2016.7819275

LDEPTH : A low diameter hierarchical P2P network architecture. / Rahimi, Nick; Sinha, Koushik; Gupta, Bidyut; Rahimi, Shahram; Debnath, Narayan C.

Proceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 832-837 7819275.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rahimi, N, Sinha, K, Gupta, B, Rahimi, S & Debnath, NC 2017, LDEPTH: A low diameter hierarchical P2P network architecture. in Proceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016., 7819275, Institute of Electrical and Electronics Engineers Inc., pp. 832-837, 14th IEEE International Conference on Industrial Informatics, INDIN 2016, Poitiers, France, 19/7/16. https://doi.org/10.1109/INDIN.2016.7819275
Rahimi N, Sinha K, Gupta B, Rahimi S, Debnath NC. LDEPTH: A low diameter hierarchical P2P network architecture. In Proceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 832-837. 7819275 https://doi.org/10.1109/INDIN.2016.7819275
Rahimi, Nick ; Sinha, Koushik ; Gupta, Bidyut ; Rahimi, Shahram ; Debnath, Narayan C. / LDEPTH : A low diameter hierarchical P2P network architecture. Proceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 832-837
@inproceedings{cfe8070fecd94c7ca4df1b3a83a66547,
title = "LDEPTH: A low diameter hierarchical P2P network architecture",
abstract = "In this paper, we present a new approach to designing a scalable, hierarchical overlay P2P system which provides highly efficient data lookup operations as well fault tolerance. Instead of using a distributed hash table (DHT) based approach, we propose the use of Linear Diophantine Equation (LDE) as the mathematical basis to realize a hierarchical P2P architecture. LDE provides a significantly lighter weight mechanism to create and maintain the overlaid P2P structure as compared to DHT based schemes. To the best of our knowledge, ours is the first work that proposes the use of LDEs in designing P2P topologies. In our proposed hierarchical P2P architecture, the number of hops required to search for a resource is independent of the number of nodes/peers in the network n and is instead bounded by (1 + r/2), r being the number of distinct resource types. For most practical purposes, r is significantly smaller than n and hence our proposed architecture provides a highly efficient resource look-up procedure. We have also presented algorithms for handling of new resources and peers joining and leaving the P2P network and fault tolerance in the event of peers crashing or leaving.",
keywords = "distributed hash table, hierarchical P2P, Linear diophantine equation, network diameter, P2P, Peer-to-peer network",
author = "Nick Rahimi and Koushik Sinha and Bidyut Gupta and Shahram Rahimi and Debnath, {Narayan C.}",
year = "2017",
month = "1",
day = "13",
doi = "10.1109/INDIN.2016.7819275",
language = "English",
pages = "832--837",
booktitle = "Proceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - LDEPTH

T2 - A low diameter hierarchical P2P network architecture

AU - Rahimi, Nick

AU - Sinha, Koushik

AU - Gupta, Bidyut

AU - Rahimi, Shahram

AU - Debnath, Narayan C.

PY - 2017/1/13

Y1 - 2017/1/13

N2 - In this paper, we present a new approach to designing a scalable, hierarchical overlay P2P system which provides highly efficient data lookup operations as well fault tolerance. Instead of using a distributed hash table (DHT) based approach, we propose the use of Linear Diophantine Equation (LDE) as the mathematical basis to realize a hierarchical P2P architecture. LDE provides a significantly lighter weight mechanism to create and maintain the overlaid P2P structure as compared to DHT based schemes. To the best of our knowledge, ours is the first work that proposes the use of LDEs in designing P2P topologies. In our proposed hierarchical P2P architecture, the number of hops required to search for a resource is independent of the number of nodes/peers in the network n and is instead bounded by (1 + r/2), r being the number of distinct resource types. For most practical purposes, r is significantly smaller than n and hence our proposed architecture provides a highly efficient resource look-up procedure. We have also presented algorithms for handling of new resources and peers joining and leaving the P2P network and fault tolerance in the event of peers crashing or leaving.

AB - In this paper, we present a new approach to designing a scalable, hierarchical overlay P2P system which provides highly efficient data lookup operations as well fault tolerance. Instead of using a distributed hash table (DHT) based approach, we propose the use of Linear Diophantine Equation (LDE) as the mathematical basis to realize a hierarchical P2P architecture. LDE provides a significantly lighter weight mechanism to create and maintain the overlaid P2P structure as compared to DHT based schemes. To the best of our knowledge, ours is the first work that proposes the use of LDEs in designing P2P topologies. In our proposed hierarchical P2P architecture, the number of hops required to search for a resource is independent of the number of nodes/peers in the network n and is instead bounded by (1 + r/2), r being the number of distinct resource types. For most practical purposes, r is significantly smaller than n and hence our proposed architecture provides a highly efficient resource look-up procedure. We have also presented algorithms for handling of new resources and peers joining and leaving the P2P network and fault tolerance in the event of peers crashing or leaving.

KW - distributed hash table

KW - hierarchical P2P

KW - Linear diophantine equation

KW - network diameter

KW - P2P

KW - Peer-to-peer network

UR - http://www.scopus.com/inward/record.url?scp=85012885860&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85012885860&partnerID=8YFLogxK

U2 - 10.1109/INDIN.2016.7819275

DO - 10.1109/INDIN.2016.7819275

M3 - Conference contribution

SP - 832

EP - 837

BT - Proceedings - 2016 IEEE 14th International Conference on Industrial Informatics, INDIN 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -