DocumentCode
3445581
Title
Latency model of a distributed hash table with big routing table
Author
Kato, Daishi
Author_Institution
Internet Syst. Res. Labs., NEC Corp., Japan
fYear
2004
fDate
25-27 Aug. 2004
Firstpage
274
Lastpage
275
Abstract
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.
Keywords
peer-to-peer computing; table lookup; telecommunication network routing; DHT latencies; distributed hash table; hop counts; latency model; multihop lookup function; peer-to-peer computing; routing table; Assembly; Delay; IP networks; Internet; Laboratories; National electric code; Network topology; Peer to peer computing; Routing; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Peer-to-Peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on
Print_ISBN
0-7695-2156-8
Type
conf
DOI
10.1109/PTP.2004.1334962
Filename
1334962
Link To Document