Name
Abstract | ||
|---|---|---|
DHT based Peer-to-Peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems donot adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms, it generates considerable network traffic and increases P2P system complexity, especially in a highly dynamic environment. In this paper, we discuss its effects on DHT routing performance and propose our solution to reduce this overhead. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/PTP.2003.1231533 | Peer-to-Peer Computing, 2003. |
Keywords | Field | DocType |
peer-to-peer algorithms,central facility,dht routing performance,dht algorithm popularity,maintenance overhead,p2p system,efficient routing performance,dht algorithm,dynamic environment,p2p system complexity,routing information maintenance overhead,considerable network traffic,computational complexity,distributed processing,p2p | Link-state routing protocol,Multipath routing,Dynamic Source Routing,Computer science,Policy-based routing,Static routing,Algorithm,Computer network,Destination-Sequenced Distance Vector routing,Distributed computing,Zone Routing Protocol,Routing protocol | Conference |
ISBN | Citations | PageRank |
0-7695-2023-5 | 10 | 1.00 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiyong Xu | 1 | 95 | 5.52 |
| Rui Min | 2 | 51 | 10.33 |
| Yiming Hu | 3 | 639 | 44.91 |