Performance Analysis of Stealth DHT with Mobile Nodes

MacQuire, Andrew; Brampton, Andrew; Rai, Idris; Mathy, Laurent

doi:10.1109/percomw.2006.109

Cited by 8 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to reduce overhead on mobile nodes with limited resources, the Mobile Stealth DHT architecture proposed in [12] distinguishes between mobile and static nodes. Static nodes are preferred for data storage and routing, while mobile nodes only have to manage the traffic generated by their own requests.…”

Section: Architecturementioning

confidence: 99%

A Survey on Security in Mobile Peer-to-Peer Architectures—Overlay-Based vs. Underlay-Based Approaches

2010

View full text Add to dashboard Cite

Mobile Ad hoc networks (MANET) and Peer-to-Peer (P2P) networks share central characteristics such as their distributed and decentralized nature. Combining both networking paradigms results in a Mobile Peer-to-Peer (MP2P) system that operates independently from a preexisting infrastructure. Securing MP2P networks in terms of availability and robustness as basic demands in envisioned application scenarios like first responder operations is a challenging task. In this article, we present a survey of selected threats and of state of the art countermeasures for MANETs and P2P networks. Further, we discuss the efficiency of MANET and P2P security mechanisms when applied in MP2P networks.

show abstract

Section: Architecturementioning

confidence: 99%

A Survey on Security in Mobile Peer-to-Peer Architectures—Overlay-Based vs. Underlay-Based Approaches

2010

View full text Add to dashboard Cite

show abstract

“…Additional benefit of Stealth DHT is that the lack of announcement messages cuts the overhead of joining stealth nodes significantly. Security enhancement mechanisms for Stealth DHT are proposed in [4], performance of stealth DHT in mobile networks is analyzed in [11], and performance models of DHT routing protocol are derived in [12].…”

Section: Related Workmentioning

confidence: 99%

A Promotion Mechanism for Scalable Stealth DHT

Idris

2010

2010 Fifth International Conference on Internet and Web Applications and Services

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

“…It is also important that such nodes be able to join the network quickly and efficiently, otherwise the time taken connecting to the network may dominate their lifespan. A Stealth DHT therefore provides an ideal solution by supporting mobile nodes as stealth nodes as discuss in [13].…”

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

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

Performance Analysis of Stealth DHT with Mobile Nodes

Abstract: Abstract

Cited by 8 publications

References 6 publications

A Survey on Security in Mobile Peer-to-Peer Architectures—Overlay-Based vs. Underlay-Based Approaches

A Survey on Security in Mobile Peer-to-Peer Architectures—Overlay-Based vs. Underlay-Based Approaches

A Promotion Mechanism for Scalable Stealth DHT

Stealth distributed hash table

Contact Info

Product

Resources

About