SIGN IN
SIGN UP
Stealth distributed hash table: unleashing the real potential of peer-to-peer
Full Text:
Pdf
Buy this Article
Authors:
Andrew Brampton
Lancaster University, Lancaster, UK
Andrew MacQuire
Lancaster University, Lancaster, UK
Idris A. Rai
Lancaster University, Lancaster, UK
Nicholas J. P. Race
Lancaster University, Lancaster, UK
Laurent Mathy
Lancaster University, Lancaster, UK
2005 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 6
· Downloads (cumulative): 273
· Citation Count: 2
Published in:
· Proceeding
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Pages 230 - 231
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-59593-197-X
doi>
10.1145/1095921.1095955
Tools and Resources
Buy this Article
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