Identifying the set of resources that are expected to receive the majority of requests in the near future, namely hot set, is at the basis of most content management strategies of any Web-based service. Here we consider social network services that open interesting novel challenges for the hot set identification. Indeed, social connections among the users and variable user access patterns with continuous operations of resource upload/download determine a highly variable and dynamic context for the stored resources. We propose adaptive algorithms that combine predictive and social information, and dynamically adjust their parameters according to continuously changing workload characteristics. A large set of experimental results show that adaptive algorithms can achieve performance close to theoretical ideal algorithms and, even more important, they guarantee stable results for a wide range of workload scenarios.
Adaptive algorithms for efficient content management in social network services / Canali, Claudia; Colajanni, Michele; Lancellotti, Riccardo. - ELETTRONICO. - (2010), pp. N/A-N/A. (Intervento presentato al convegno 10th Int'l conference on computer and information technology (CIT-2010) tenutosi a Bradford UK nel 29 June - 1 July 2010) [10.1109/CIT.2010.55].