Placement solutions for multiple versions of a multimedia object

Abstract

Transcoding is an important technology which adapts the same multimedia object to diverse mobile appliances; thus, users' requests for a specified version of a multimedia object could be served by a more detailed version cached according to transcoding. Therefore, it is of particularly theoretical and practical necessity to determine the proper versions to be cached at a node such that the specified objective is achieved. In this paper, we address the problem of multimedia object placement. The performance objective is to minimize the total access cost by considering both transmission cost and transcoding cost. We present an optimal dynamic programming-based solution for this problem. The performance of the proposed solutions is evaluated with a set of carefully designed simulation experiments for various performance metrics over a wide range of system parameters. The simulation results show that our solution consistently and significantly

A Minimal Access Cost-Based Multimedia Object Replacement Algorithm

“…An overview of web caching algorithms can be found in [1,11]. However, most of these algorithms cannot be directly applied to solve the cache replacement problem for multimedia object caching since different versions of the same multimedia object cannot be simply viewed as different web objects, which has been shown in [6,8].…”