Architectures for Networking and Communications Systems (2013)
San Jose, CA, USA USA
Oct. 21, 2013 to Oct. 22, 2013
Amit Ruhela , IIT Delhi & C-DOT Delhi, India
Sipat Triukose , NICTA, Australia
Sebastien Ardon , NICTA, Australia
Amitabha Bagchi , IIT Delhi, India
Anirban Mahanti , NICTA, Australia
Aaditeshwar Seth , IIT Delhi, India
With Online Social Networking (OSN) services coming to prominence as a major platform for the popularization of Web content, recent research has focused on using information gleaned from these services to improve the performance of Content Distribution Networks (CDN). In this paper we find that contrary to popular belief, the simple cache replacement policy LRU outperforms methods based on OSN input. To establish this we propose an OSN-assisted caching strategy which we evaluate using a large Twitter dataset and through simulation. Our results show that vanilla LRU mostly outperforms the OSN-aided mechanisms. We study the reasons for this and find that if at any time there is a large enough percentage of highly popular content, which becomes popular within a short enough time span, CDN can do well by just following an LRU principle. While we do not claim generalizability to other workloads, or other caching architectures on the Internet, our results are important as they apply to the common use-case and show that simple algorithms do quite well.
Servers, Twitter, Event detection, Detectors, Internet, Australia, Online Social Network, Caching Algorithms, LRU, Events Detection
A. Mahanti, A. Bagchi, S. Ardon, S. Triukose, A. Ruhela and A. Seth, "The scope for Online Social Network aided caching in web CDNs," 2013 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), San Jose, CA, USA, 2013, pp. 37-45.