loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Conference on Peer-to-Peer Computing (P2P'04)
Z?rich, Switzerland
August 25-August 27
ISBN: 0-7695-2156-8
ASCII Text
x 
 
Daishi Kato, "Latency Model of a Distributed Hash Table with Big Routing Table," Peer-to-Peer Computing, IEEE International Conference on, pp. 274-275, Fourth International Conference on Peer-to-Peer Computing (P2P'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/PTP.2004.1334962,
author = {Daishi Kato},
title = {Latency Model of a Distributed Hash Table with Big Routing Table},
journal ={Peer-to-Peer Computing, IEEE International Conference on},
volume = {0},
year = {2004},
isbn = {0-7695-2156-8},
pages = {274-275},
doi = {http://doi.ieeecomputersociety.org/10.1109/PTP.2004.1334962},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Peer-to-Peer Computing, IEEE International Conference on
TI - Latency Model of a Distributed Hash Table with Big Routing Table
SN - 0-7695-2156-8
SP274
EP275
A1 - Daishi Kato,
PY - 2004
KW - null
VL - 0
JA - Peer-to-Peer Computing, IEEE International Conference on
ER -
 
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.