Cluster Computing and the Grid, IEEE International Symposium on (2009)
May 18, 2009 to May 21, 2009
P2P networks facilitate people belonging to a community to share resources of interest. However, discovering resources in a large scale P2P network poses a number of challenges. Although Distributed Hash Table (DHT) structured P2P networks have shown enhanced scalability in routing messages, they only support key based exact matches. This paper presents DIndex, a distributed indexing component that can be used in P2P networks in support of range queries. DIndex introduces the concept of search dimensions for partitioning a search space, and it organizes peer nodes in a three-layered structure. Experimental results show that, for aP2P network with N number of peers, the average number of hops per message is less than log(N).
P2P networks, resource discovery, distributed indexing, DHT, search dimension
M. Ponraj, M. Hentschel, M. Li and M. Qi, "Distributed Indexing for Resource Discovery in P2P Networks," Cluster Computing and the Grid, IEEE International Symposium on(CCGRID), Shanghai, China, 2009, pp. 550-555.