Reducing maintenance overhead in DHT based peer-to-peer algorithms

DHT based peer-to-peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems do not 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. We discuss its effects on DHT routing performance and propose our solution to reduce this overhead.