- Bejan, A. and Sukumar Ghosh, Self-optimizing DHTs using request profiling,
Principles of Distributed Systems. 8th International Conference, OPODIS 2004. Revised Selected Papers (Lecture Notes in Computer Science Vol. 3544)
pp. 140 - 53 .
(last updated on 2007/04/06)
Various studies on request patterns in P2P networks have confirmed the existence of the interest-based clusters (Iamnitchi, et al., 2004) and (Iamnitchi et al., 2002). Some P2P networks that exhibit the small-world phenomenon contain clusters of peers that frequently communicate with one another (Milgram, 1967). The existence of interest-based clusters opens up the possibility of more efficient routing. In this paper we consider the problem of designing a self-optimizing overlay network and routing mechanisms to permit efficient location of resources by the periodic profiling of request patterns. Our self-optimization protocol uses selective replication of resources for restricting the sizes of the clusters, and proposes the deployment of inactive nodes for further reduction of the routing latency. The self-optimization protocol is demonstrated on the chord network (Stoica, et al., 2003). It leads to a routing latency that scales with the size of the clusters
distributed object management;peer-to-peer computing;self-adjusting systems;telecommunication network routing;