Replacement policies for a proxy cache
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Mobile streaming media CDN enabled by dynamic SMIL
Proceedings of the 11th international conference on World Wide Web
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Choosing Replica Placement Heuristics for Wide-Area Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Supporting terminal mobility by means of self-adaptive communication object migration
Proceedings of the 3rd ACM international workshop on Wireless mobile applications and services on WLAN hotspots
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Understanding mobile app usage patterns using in-app advertisements
PAM'13 Proceedings of the 14th international conference on Passive and Active Measurement
Hi-index | 0.00 |
Mobile networks are becoming increasingly popular as means for distributing inform tion to large number of users. In comparison to wired networks, mobile networks distinguished by potentially much higher variability in demand due to user mobility. Most previous content techniques ssume static client demand distribution and, thus, may not perform well in mobile networks.This paper proposes and analyzes Mobile Dynamic Content Distribution Network model, which takes demand variations into account to decide whether to replicate content and whether to remove previously created replicas in order to minimize total network traffic. We develop two solutions to our model: an offline optimal, which provides an ideal lower-bound on the total traffic, and practical heuristic online algorithm, which uses demand forecasting to make replication decisions. We provide thorough evaluation of our solutions, comparing them against ACDN, the only previous dynamic content placement algorithm targeting bandwidth minimization that we are aware of. Our results show that our online algorithm significantly outperforms the ACDN one, reducing total network traffic by up to 85% in a number of experiments covering large system design space.