Adaptive Algorithms for Efficient Content Management in Social Network Services
- 1 June 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 68-75
Abstract
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.Keywords
This publication has 20 references indexed in Scilit:
- Search result re-ranking by feedback control adjustment for time-sensitive query2009
- Social Information Processing in News AggregationIEEE Internet Computing, 2007
- Youtube traffic characterization2007
- Predictability of Web-Server Traffic Congestion2006
- Feedback Control Architecture and Design Methodology for Service Delay Guarantees in Web ServersIEEE Transactions on Parallel and Distributed Systems, 2006
- Replica Placement and Request Routing2005
- Web prefetching performance metrics: A surveyPerformance Evaluation, 2005
- Edgecomputing2004
- Application specific data replication for edge services2003
- Web caching and Zipf-like distributions: evidence and implications1999