By Topic

Coordinated en-route transcoding caching for tree networks

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)
Keqiu Li ; Graduate Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan ; Hong Shen

As transcoding caching is attracting an increasing amount of attention, it is important and necessary to find methods to distribute multiple versions of the same media object in the Internet. In this paper, we first present a mathematical model for the problem of optimally determining the locations in which to place multiple versions of the same media object in tree networks such that the specified objective is achieved. This problem is formulated as an optimization problem. Second, we propose a low-cost dynamic programming-based solution for solving this problem, by which the optimal locations are obtained. Finally, we evaluate our model on different performance metrics through extensive simulation experiments and compare the results of our model with those of existing models that consider transcoding caching either on a path or at individual nodes only.

Published in:

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on

Date of Conference:

7-9 July 2004