Title: Latency model of a distributed hash table with big routing table
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.
Publication Year: 2004
Publication Date: 2004-11-08
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot