SIGN IN
SIGN UP
Stealth distributed hash table: a robust and flexible super-peered DHT
Full Text:
PDF
Buy this Article
Authors:
Andrew Brampton
Lancaster University
Andrew MacQuire
Lancaster University
Idris A. Rai
Lancaster University
Nicholas J. P. Race
Lancaster University
Laurent Mathy
Lancaster University
2006 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 17
· Downloads (cumulative): 170
· Citation Count: 2
Published in:
· Proceeding
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Article No. 19
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-456-1
doi>
10.1145/1368436.1368462
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
CoNEXT '13
Share:
|
Tags:
algorithms
distributed hash tables
distributed networks
distributed systems
experimentation
peer-to-peer
performance
stealth dht
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder