By Topic

Scheduling of storage and cache servers for replicated multimedia data

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
$31 $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

3 Author(s)
Park Kyeongho ; Dept. of Comput. Eng., Seoul Nat. Univ., South Korea ; Yanghee Choi ; Chong Sang Kim

Multimedia storage servers will play an important role in many forthcoming network-based multimedia services like video-on-demand (VoD). The load on the storage servers and the data transmission cost can be reduced by using additional cache servers which store the data requested by a user temporarily and provide data to other users located near the cache servers. It is required to minimize the sum of the storage cost and the transmission cost while satisfying users' timing requirements. We study a scheduling scheme for storage servers and cache servers to meet this requirement. Assuming that the locations of the data and the users' deadline requirements are known beforehand, we formulate the problem, devise a greedy heuristic algorithm for scheduling servers statically and analyze its complexity, and, by limiting the backtracking distance and restricting the search area using a constant-size search window, the scheduling time can be greatly reduced with little increase in the total cost

Published in:

High Performance Computing on the Information Superhighway, 1997. HPC Asia '97

Date of Conference:

28 Apr-2 May 1997