Overview of Structured Peer-to-Peer Overlay Algorithms

Dhara, Krishna Kishore; Guo, Yang; Kolberg, Mario

doi:10.1007/978-0-387-09751-0_9

Cited by 17 publications

(19 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In opportunistic maintenance, a node attaches routing table data to a response lookup message. The receiver then updates its routing table with this information -adding new node entries and removing node entries which are considered dead [9]. This kind of maintenance saves a bandwidth as it reduces the need for dedicated messages to update routing table entries.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Performance analysis of structured peer-to-peer overlays for mobile networks

Chowdhury

Furness²,

Kolberg

2016

International Journal of Parallel, Emergent and Distributed Sys

Self Cite

View full text Add to dashboard Cite

Distributed Hash Table (DHT) based Peer-to-Peer (P2P) overlays have been widely researched and deployed in many applications such as file sharing, IP telephony, content distribution and media streaming applications. However, their deployment has largely been restricted to fixed, wired networks. This is due to the fact that supporting P2P overlays on wireless networks such as the public mobile data network is more challenging due to constraints in terms of data transmissions on cellular networks, limited battery power of the handsets and increased levels of node churn. However, the proliferation of smartphones makes the use of P2P applications on mobile handsets very desirable.In this paper, we have analysed and evaluated the performance and efficiency of five popular DHT based structured P2P overlays (Chord, Pastry, Kademlia, Broose and EpiChord) under conditions as commonly experienced in public mobile data networks. Our results show that the conditions in mobile networks, including a high churn rate and the relatively low bandwidth availability is best matched by Kademlia and EpiChord. These overlays exhibit a high lookup success ratio and low hop count while consuming a moderate amount of bandwidth. These characteristics make these two overlays suitable candidates for use in mobile networks.

show abstract

Section: Discussionmentioning

confidence: 99%

“…A large number of multi-hop structured Peer-to-Peer (P2P) algorithms have been proposed [9]. These algorithms are characterized by O(log N) hop count.…”

Section: Related Workmentioning

confidence: 99%

Performance analysis of structured peer-to-peer overlays for mobile networks

Chowdhury

Furness²,

Kolberg

2016

International Journal of Parallel, Emergent and Distributed Sys

Self Cite

View full text Add to dashboard Cite

show abstract

“…The template of these components is specified in Figure 2 by the Vehicle specification. Its state is captured by knowledge (a set of attributes -lines [7][8][9][10][11][12][13][14] and operational functionality by processes (lines [15][16][17][18][19][20]. Every component features a number of roles, i.e., sets of knowledge fields (lines [1][2][3][4]6), which provide contract between the component and ensembles.…”

Section: Background: Deecomentioning

confidence: 99%

“…The idea of communication groups relates to Distributed Hash- Tables (DHT) which introduce key-space partitioning [8], [9] and overlay networks [10]. The former assign a range of keys to particular network nodes that take the responsibility for storing the actual value corresponding to a key.…”

Section: Related Workmentioning

confidence: 99%

Employing Domain Knowledge for Optimizing Component Communication

Kit

Plášil

Matěna

et al. 2015

Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering

View full text Add to dashboard Cite

The emerging area of (smart) Cyber Physical Systems (sCPS) triggers demand for new methods of design, development, and deployment of architecturally dynamic distributed systems. Current approaches (e.g. Component-Based Software Engineering and Agent-Based Development) become insufficient since they fail in addressing challenges specific to sCPS such as mobility, heterogeneous and unreliable deployment infrastructure, and architectural dynamicity. The strong dependence on the underlying communication infrastructure, often combining ad-hoc established links typical for wireless connectivity with more reliable connections of infrastructural networks, requires a novel method to optimize system deployment. In this paper we propose such a method based on the domain knowledge elicited from design level specification. As a proof of concept, we have provided an extension to the DEECo (Dependable Emergent Ensembles of Components) model and validated it on a scenario from the domain of Vehicular Area Networks.

show abstract

“…Distributed Hash Tables (DHTs) [2] supported Peer-to-Peer (P2P) applications are an ideal substrate for building large scale distributed systems because they are selforganizing, adaptable and scalable and offer efficient routing between nodes within a bounded number of hops. EpiChord [1] is a DHT lookup algorithm which demonstrates that node state restrictions can be relaxed which were imposed by the majority of other DHT algorithms by using a reactive routing state maintenance strategy.…”

Section: Introductionmentioning

confidence: 99%

An Evaluation of EpiChord in OverSim

Furness

Chowdhury

Kolberg

2014

Lecture Notes in Electrical Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. EpiChord is a Distributed Hash Table (DHT) algorithm which supports data storage/retrieval in large scale distributed systems. It removes the typical O(logn)-state-per-node restriction imposed by the majority of other DHT topologies by employing a reactive routing state maintenance strategy that amortizes network maintenance costs into lookup queries. Under ideal condition, EpiChord's lookup performance can approach O(1) hops -with maintenance costs comparable to traditional multi-hop DHTs. This paper presents an implementation of EpiChord in OverSim, and validates the performance of our model against the performance reported in the original EpiChord paper. We also present some adjustments to the algorithm to remove a discrepancy and then compare our modified results with the original ones. Finally, we present additional results showing the EpiChord algorithm is stable over time and performs well for larger networks.

show abstract

Overview of Structured Peer-to-Peer Overlay Algorithms

Cited by 17 publications

References 34 publications

Performance analysis of structured peer-to-peer overlays for mobile networks

Performance analysis of structured peer-to-peer overlays for mobile networks

Employing Domain Knowledge for Optimizing Component Communication

An Evaluation of EpiChord in OverSim

Contact Info

Product

Resources

About