loading...
Latency Model of a Distributed Hash Table with Big Routing Table
Z?rich, Switzerland August 25-August 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PTP.2004.1334962Fourth International Conference on Pe ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Daishi Kato, NEC Corporation
In peer-to-peer research, one of the most popular areas is Distributed Hash Table (DHT). Among many topics in the DHT area, this paper focuses on DHT latencies, which are mainly caused by its basic multi-hop lookup function. Some DHTs already have the capability of building big routing tables to reduce hop counts. However, none of them are explicitly trying to enlarge the routing table and lower the hop count. This paper provides a simple latency model of DHT and discusses how big routing tables help reduce latency.
Citation:
Daishi Kato, "Latency Model of a Distributed Hash Table with Big Routing Table," p2p, pp.274-275, Fourth International Conference on Peer-to-Peer Computing (P2P'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.