12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Stealth distributed hash table: a robust and fl...
View graph of relations

« Back

Stealth distributed hash table: a robust and flexible super-peered DHT

Research output: Contribution in Book/Report/ProceedingsPaper

Published

Publication date12/2006
Host publicationProceedings of the 2006 ACM CoNEXT conference
PublisherACM
Number of pages0
ISBN (Print)1-59593-456-1
Original languageEnglish

Conference

Conference2nd Conference on Future Networking Technologies (CoNEXT'06)
CityLisbon, Portugal
Period1/01/00 → …

Conference

Conference2nd Conference on Future Networking Technologies (CoNEXT'06)
CityLisbon, Portugal
Period1/01/00 → …

Abstract

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.