A cooperative content delivery scheme for multimedia services in contents delivery networks
Proceedings of the 2nd international conference on Ubiquitous information management and communication
DADC '08 Proceedings of the 2008 international workshop on Data-aware distributed computing
CDNsim: A simulation tool for content distribution networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Cost analysis on IPTV hosting service for 3rd party providers
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Wide area placement of data replicas for fast and highly available data access
Proceedings of the fourth international workshop on Data-intensive distributed computing
Integrating caching techniques on a content distribution network
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Exploiting graph partitioning for hierarchical replica placement in WMNs
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
Content Distribution Networks (CDNs) are increasingly being used to disseminate data in today's Internet. The growing interest in CDNs is motivated by a common problem across disciplines: how does one reduce the load on the origin server and the traffic on the Internet, and ultimately improve response time to users? In this direction, crucial data management issues should be addressed. A very important issue is the optimal placement of the outsourced content to CDN's servers. Taking into account that this problem is NP complete, an heuristic method should be developed. All the approaches developed so far assume the existence of adequate popularity statistics. Such information though, is not always available, or it is extremely volatile, turning such methods problematic. This paper develops a network-adaptive, non-parameterized technique to place the outsourced content to CDN's servers, which requires no a-priori knowledge of request statistics. We place the outsourced objects to these servers with respect to the network latency that each object produces. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed technique can yield up to 25% reduction in user-perceived latency, compared with other heuristic schemes which have knowledge of the content popularity.