Abstract
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.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 8 |
Number of pages | 1 |
ISBN (Electronic) | 0769519261, 9780769519265 |
DOIs | |
State | Published - 2003 |
Externally published | Yes |
Event | International Parallel and Distributed Processing Symposium, IPDPS 2003 - Nice, France Duration: Apr 22 2003 → Apr 26 2003 |
Publication series
Name | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 |
---|
Other
Other | International Parallel and Distributed Processing Symposium, IPDPS 2003 |
---|---|
Country/Territory | France |
City | Nice |
Period | 04/22/03 → 04/26/03 |
Bibliographical note
Publisher Copyright:© 2003 IEEE.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics
- Software