Abstract
DHT routing algorithms have been studied from various aspects. The advantage of this kind of algorithms is that they can locate objects successfully in polylogarithmic overlay hops. Instead of getting testing results via network simulation, this paper describes experiences deploying Emergint, a DHT based peer-to-peer routing algorithm, in a real circumstance aiming to answer the question whether a DHT algorithm can get its theoretical performance in real-used systems. © Springer-Verlag 2004.
Cite
CITATION STYLE
Wang, C., Dai, Y., Han, H., & Li, X. (2004). Experiences Deploying Peer-to-Peer Network for a Distributed File System. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3251, 791–794. https://doi.org/10.1007/978-3-540-30208-7_106
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
