Authentication in stealth distributed hash tables

MacQuire, Andrew; Brampton, Andrew; Idris, Azlina; Race, Nicholas; Mathy, Laurent

doi:10.1016/j.sysarc.2008.01.004

Cited by 3 publications

(1 citation statement)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such control would, in turn, allow the service provider to repel some of the major common security issues present in peerto-peer networks, such as sniffing, man-in-the-middle, pollution and some denial-of-service attacks, while still benefiting from the scalability and resilience of these networks. We also discuss this topic further in [12].…”

Section: Applications Of Stealth Dhtmentioning

confidence: 99%

Stealth distributed hash table

Brampton

MacQuire

Idris

et al. 2006

Proceedings of the 2006 ACM CoNEXT Conference on - CoNEXT '06

Self Cite

View full text Add to dashboard Cite

Most Distributed Hash Tables (DHTs) simply consider interconnecting homogeneous nodes on the same overlay. However, realistically nodes on a network are heterogeneous in terms of their capabilities. Because of this, traditional DHTs have been shown to exhibit poor performance in a real-world environment. Additionally, we believe that it is this approach that contributes to a limited exploitation of peer-to-peer technologies. Previous work on super-peers in DHTs was proposed to address these performance issues, however the strategy used is often based on locally clustering peers around individual super-peers. This method of superpeering, however, compromises fundamental features such as load-balancing, resilience and routing efficiency, which traditional DHTs originally promised to offer. We propose a Stealth DHT which addresses the deficiencies of previous super-peer approaches by using the DHT algorithm itself to select the most appropriate super-peer for each message sent by peers. Through simulations and measurements, we show the fitness for purpose of our proposal.

show abstract

Section: Applications Of Stealth Dhtmentioning

confidence: 99%

Stealth distributed hash table

Brampton

MacQuire

Idris

et al. 2006

Proceedings of the 2006 ACM CoNEXT Conference on - CoNEXT '06

Self Cite

View full text Add to dashboard Cite

show abstract

A Promotion Mechanism for Scalable Stealth DHT

Idris

2010

2010 Fifth International Conference on Internet and Web Applications and Services

Self Cite

View full text Add to dashboard Cite

Most Distributed Hash Tables (DHTs) inherently assume interconnecting nodes with homogeneous capabilities. Realistically however, capabilities of nodes on a network widely vary, leading traditional DHTs to inevitably exhibit poor performance in real-world environments. Stealth DHT was previously proposed to address node heterogeneity by enabling a DHT to separate highly capable (super-peers or service) nodes from less capable (stealth) nodes. Stealth DHTs are considered robust and flexible due to the way they organize nodes on the network. However, it is difficult to overprovision the number of service nodes to support unexpected increase in user requests in the networks. Unlike traditional DHTs therefore, Stealth DHTs cannot guarantee network scalability. In this paper, we address this problem by proposing a simple promotion mechanism to extend Stealth DHT to use stealth nodes as back-up resources that it can use when the network is overloaded. We define promotion of stealth nodes as the act of enabling stealth nodes execute some or all of the operations of service nodes. Experiments results show that the proposed promotion mechanism can offload significant proportion of network load.

show abstract