By Topic

Optimal cooperative content placement algorithms in hierarchical cache topologies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Konstantinos Poularakis ; Dept. of Comput. & Commun. Eng., Univ. of Thessaly, Volos, Greece ; Leandros Tassiulas

The tremendous growth in the use of the World Wide Web and the expansion of Video On Demand and IPTV services increase the bandwidth demands, enforcing the creation of congestion in Internet's links and the experience of big delays to the users. Replicating content at caches which are close to the users can improve the access time for them and reduce the network bandwidth usage as well. In this work, we focus on hierarchical cache topologies, as IPTV networks tend to have a mostly hierarchical tree structure, making the content placement problem in them a topic of major importance. The problem is NP-Complete in it's general form. In this paper, we make the simplifying assumption that the size of each object is equal to one. Under that assumption we show that certain instances of the content placement problem are of polynomial complexity, while we provide an algorithm for their solution. Besides, we extend the proposed algorithm to handle the general case of arbitrary object sizes. Simulation experiments for typical popularity distributions depict the performance distance between the optimal solution and some low complexity heuristic algorithms that are commonly applied nowadays.

Published in:

Information Sciences and Systems (CISS), 2012 46th Annual Conference on

Date of Conference:

21-23 March 2012