Parallel and Distributed Processing Symposium, International (2003)
Apr. 22, 2003 to Apr. 26, 2003
Spiridon Bakiras , University of Hong Kong
Panos Kalnis , National University of Singapore
Thanasis Loukopoulos , Hong Kong University of Science and Technology
Wee Siong Ng , National University of Singapore
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, etc. The framework is based on the concept of neighborhood; each client keeps a list of the most beneficial sites according to past experience, which are visited first when the client searches for some particular content. Exploration methods continuously update the neighborhoods in order to follow changes in access patterns. Depending on the application, several variations of search and exploration processes are proposed. Experimental evaluation demonstrates the benefits of the framework in different scenarios.
Peer-to-Peer, Dynamic Reconfiguration, Content-sharing Networks
S. Bakiras, P. Kalnis, W. S. Ng and T. Loukopoulos, "A General Framework for Searching in Distributed Data Repositories," Parallel and Distributed Processing Symposium, International(IPDPS), Nice, France, 2003, pp. 34b.