Scheduling of Storage and Cache Servers for Replicated Multimedia Data

  • Authors:
  • Park; Kyeongho;Yanghee Choi;Chong Sang Kim

  • Affiliations:
  • -;-;-;-

  • Venue:
  • HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multimedia storage servers will play important roles in many forthcoming network-based multimedia services like VoD. The load over storage servers and transmission cost of data can be reduced by using additional cache servers which store data requested by a user temporarily and provide them to the other users located near the cache servers. It is required to minimize the sum of storage cost and transmission cost while satisfying users' timing requirements. We studied a scheduling scheme for storage servers and cache servers to meet this requirements. Assuming that the locations of data and users' requirements for deadline are known beforehand, we formulated the problem, devised a greedy heuristic algorithm scheduling servers statically, and analyzed its complexity. And by limiting backtracking distance and restricting search area using a contant-sized search window, the scheduling time can be decreased greatly with a little increase of total cost.