Design of Very Efficient Lookup Algorithms for a Low Diameter Hierarchical Structured Peer-to-Peer Network

Gupta, Bidyut; Rahimi, Nick; Hexmoor, Henry; Rahimi, Shahram; Maddali, Koushik; Hu, Gongzhu

doi:10.1109/indin.2018.8471936

Cited by 6 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, a new hierarchical P2P network architecture has been introduced [25]. This is a fully hierarchical structured P2P system.…”

Section: Secured Lde-based Structure P2p Networkmentioning

confidence: 99%

Security Consideration in Peer-to-peer Networks with A Case Study Application

Rahimi¹

2020

IJNSA

Self Cite

View full text Add to dashboard Cite

Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies' solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.

show abstract

“…Recently, a new hierarchical P2P network architecture has been introduced [25]. This is a fully hierarchical structured P2P system.…”

Section: Secured Lde-based Structure P2p Networkmentioning

confidence: 99%

Security Consideration in Peer-to-peer Networks with A Case Study Application

Rahimi¹

2020

IJNSA

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this section, we start with a brief description of the CRT-based hierarchical structured P2P architecture [9]; note that we design our multicast protocols for this architecture. This section ends with a summary of our contribution in the present work.…”

Section: Preliminariesmentioning

confidence: 99%

“…This section ends with a summary of our contribution in the present work. This architecture is a two-level structured architecture for interest-based peer-to-peer system [9], [11], [15]. We use the following notations along with their interpretations while we define the architecture.…”

Section: Preliminariesmentioning

confidence: 99%

“…In the proposed model for interest-based P2P systems, it is assumed that no two peers with the same resource type Ri can have the same tuple; that is, two peers with the same resource type Ri must have tuples ˂Ri, V'˃ and ˂Ri, V"˃ such that V' ≠ V". However, this constraint can easily be relaxed [9]. We define the following.…”

Section: Two Level Architecturementioning

confidence: 99%

“…Authors in [9], [10], [11] have proposed a unique way of designing non-DHT based P2P network architecture. The architecture is an unrestricted ring of nodes (peers) in a sense that a node can be anywhere on the ring unlike in DHT-based ring, such as Chord [12].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On Designing Secured Communication Protocols along with Anonymity for CRT based Structured P2P Network Architecture

Maddali

Kaluvakuri

Rahimi

et al.

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

In this work, we have considered designing secured communication protocols for Chinese remainder theorem based structured p2p architecture. Such an architecture has been the choice because of the complexity in Inter or Intra group communications are just O(1) [16]. In this work, we have considered efficient way to make the already existing communication protocols [16] secured. We have extended these protocols further to include anonymity. We have considered security separately for multicasting inside a group and multicasting outside the group.

show abstract