A popularity-based query scheme in P2P networks using adaptive gossip sampling

Sharifi, Leila; Khorsandi, Siavash

doi:10.1007/s12083-012-0135-9

Cited by 9 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“… also proposed a structured hierarchical P2P model, taking advantage of both hierarchy and structured models. Innovatively, the latest work developed a popularity‐based hierarchical overlay, which combines interest‐based and topology‐aware links instead of commonly used random or DHT‐invoked connections. The interested reader for hierarchical structured P2P network is referred to Korzun and Gortuv for further information.…”

Section: Related Workmentioning

confidence: 99%

Optimal layer division for low latency in DHT‐based hierarchical P2P network

Zhang

Fang

et al. 2016

Int J Network Mgmt

View full text Add to dashboard Cite

SUMMARYHierarchical architecture can significantly reduce the workload overheads and facilitate effective search in peer-to-peer (P2P) network by dividing the peers into two layers: a supernode layer and an ordinary node layer. System scalability is therefore improved, which is critical to the deployment of P2P applications, particularly for the P2P-based Voice over Internet Protocol systems. However, the lack of appropriate size ratio of the supernode layer to the ordinary node layer makes the system search performance far from being optimal. To address the problem, the goal of this paper is to find the optimal layer ratio, such that lookup latency is minimized, subject to the capacity constraint of supernodes. With this particular objective, this paper first formulates a search delay model for the distributed hash table (DHT)-based layered P2P architecture, taking account of two main sources of latency: DHT routing and queuing delay at the supernode. Then the optimal ratio between supernodes and ordinary nodes is found with the analytical model. Simulation and numerical results show that the obtained solution can improve the performance of a two-layer P2P system in terms of lookup latency.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimal layer division for low latency in DHT‐based hierarchical P2P network

Zhang

Fang

et al. 2016

Int J Network Mgmt

View full text Add to dashboard Cite

show abstract

“…The routing process of Gossip-based search [9] (GS) algorithm is shown in Fig.1: source peer communicates with one or a few neighbors to forward a query request randomly as probability Pij in matrix P (S). These neighbors forward this request to their neighbors as source peer.…”

Section: Gossip-based Search Algorithm Routing Processmentioning

confidence: 99%