The routing performance of logarithmic-hop structured P2P overlay

Khan, Saiful; Gani, Abdullah; Sreekandath, Mahesh

doi:10.1109/icos.2011.6079289

Cited by 8 publications

(10 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different DHT overlay protocols use different type of timeout mechanisms. In this paper, we are choosing a timeout mechanism of fixed number of seconds [8]. After the first timeout, ܰ െ ቀ …”

Section: Proposed Approach and Formulationmentioning

confidence: 99%

“…In [8], the routing efficiency comparison among Chord, Pastry and Kademlia is provided. Routing efficiency is calculated as the ratio of successfully routed messages to total number of messages sent.…”

Section: Related Workmentioning

confidence: 99%

“…The popular metrics used to compare the various structured DHT overlay networks are percentage of successful lookups [8] and average latency per successful lookup [9,10]. For any DHT application which does lookup retries both, average latency per successful lookup as well as percentage of successful lookups affects the performance of the DHT.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Latency and Routing Efficiency Based Metric for Performance Comparison of DHT Overlay Networks

Varyani

Nikhil

Shekhawat

2016

2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA)

View full text Add to dashboard Cite

The general method available for comparison between the Distributed Hash Table (DHT) based structured overlay networks are average latency per successful lookup and percentage of successful lookups. For a DHT based lookup service with lookup retries for failed lookups, both average latency per successful lookup as well as percentage of successful lookups are key to evaluate the performance. Although, average latency per successful lookup may be less for a DHT overlay protocol, failure of lookups at high churn rates may degrade the protocol's performance if its routing efficiency is less. On the other hand, just routing efficiency is not sufficient to measure the performance of a DHT since an overlay network having higher routing efficiency may not have a good performance due to high average latency per successful lookup. We have developed a metric for DHT comparison which incorporates both average latency per successful lookup and routing efficiency in scenarios where applications do lookup retries. We have also modeled three different timeout mechanisms while developing the performance metric. The paper also incorporates a model where the probability of failure of a lookup is increasing at every retry of lookups.

show abstract

Section: Proposed Approach and Formulationmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Latency and Routing Efficiency Based Metric for Performance Comparison of DHT Overlay Networks

Varyani

Nikhil

Shekhawat

2016

2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA)

View full text Add to dashboard Cite

show abstract

“…Therefore, Kademlia uses the XOR routing metric, which reduces these problems and also allows parallel lookup operations [9]. Kademlia's implementation variant Kad also uses more buckets than originally proposed for Kademlia, which further reduces the average number of necessary hops per lookup [10], [17], [18].…”

Section: State-of-the-artmentioning

confidence: 99%

Dynamic search tolerance at runtime for lookup determinism in the DHT-based P2P network Kad

Danielis

Skodzik

Altmann

et al. 2015

2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC)

View full text Add to dashboard Cite

For the realization of decentralized communication infrastructures, P2P technology offers an excellent technological foundation to complement or replace existing centralized structures, which take the client-server network model as a basis. In particular, the distributed hash table-based P2P network Kad impresses with high lookup performance, scalability, and resilience against failures and attacks. In addition to these advantages, the Kad protocol needs an extension in terms of its lookup to allow for lookup determinism in an a priori unknown Kad network. Therefore, this paper introduces a dynamic search tolerance, which adapts itself to any network configuration autonomously at runtime. The search tolerance is periodically calculated and all nodes are provided with the updated value. Thereby, the Kad protocol meets the demands for deterministic lookups, which enables dependable and efficient data retrieval, qualifying it as reliable basis of communication infrastructures in, e.g., real-time environments. Results show the high performance of the proposed algorithms for a Kad network with up to 50,000 nodes.

show abstract

“…However, most structured topologies are likely to be less resilient under network churn, which is caused by a very transient user population in P2P overlay. Some later topologies like Kademlia can provide better stability, but normally at the cost of introducing extra communications and increased lookup failure . Hierarchical structure, which uses DHT to organize the top‐level overlay, may better address the performance challenges such as scalability and resilience (when uptime is concerned in top‐level node selection), motivated by the fact that the nodes in the P2P network are not homogeneous.…”

Section: Introductionmentioning

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

The routing performance of logarithmic-hop structured P2P overlay

Cited by 8 publications

References 28 publications

Latency and Routing Efficiency Based Metric for Performance Comparison of DHT Overlay Networks

Latency and Routing Efficiency Based Metric for Performance Comparison of DHT Overlay Networks

Dynamic search tolerance at runtime for lookup determinism in the DHT-based P2P network Kad

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

Contact Info

Product

Resources

About