Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Coordinated en-route transcoding caching for tree networks
Author: Li, K.
Shen, H.
Citation: Proceedings of the Tenth International Conference on Parallel and Distributed Systems (ICPADS04), pp. 109
Publisher: IEEE
Publisher Place: Online
Issue Date: 2004
ISBN: 0769521525
Conference Name: International Conference on Parallel and Distributed Systems (10th : 2004 : Newport Beach, California)
Statement of
Keqiu Li, Hong Shen
Abstract: 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.
Keywords: Transcoding caching
tree network
dynamic programming
optimization problem
Description: ©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
DOI: 10.1109/ICPADS.2004.1316086
Appears in Collections:Aurora harvest
Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl_36953.pdf189.49 kBPublisher's PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.