Advertisement

Data Placement in Intermittently Available Environments

  • Yun Huang
  • Nalini Venkatasubramanian
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2552)

Abstract

In this paper, we address the problem of data placement in a grid based multimedia environment, where the resource providers, i.e. servers, are intermittently available. The goal is to optimize the system performance by admitting maximum number of users into the system while ensuring user Quality of Service (QoS). We define and formulate various placement strategies that determine the degree of replication necessary for video objects by using a cost-based optimization procedure based on predictions of expected requests under various time-map scenarios and QoS demands. We also devise methods for dereplication of videos based on changes in popularity and server usage patterns. Our performance results indicate the benefits obtained the judicious use of dynamic placement strategies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R.J. Allan. Survey of Computational Grid, Meta-computing and Network Information Tools, report, Parallel Application Software on High Performance Computers. (1999)Google Scholar
  2. 2.
    Y. Chen, R. H. Katz, J. Kubiatowicz, Dynamic Replica Placement for Scalable Content Delivery, 1st International Workshop on Peer-to-Peer Systems. (2002)Google Scholar
  3. 3.
    I. Baev and R. Rajaraman. Approximation algorithms for data placement in arbitrary networks. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), (2001)Google Scholar
  4. 4.
    C. Chou, L. Golubchik, and J.C.S. Lui, A Performance Study of Dynamic Replication Techniques in Continuous Media Servers, ACM (1999)Google Scholar
  5. 5.
    A. Dan, M Kienzle, D Sitaram, Dynamic Policy of Segment replication for load-balancing in video-on-demand servers. ACM Multimedia Systems, (1995)Google Scholar
  6. 6.
    A.L. Chervenak. Tertiary Storage: An Evaluation of New Applications, Ph.D. Thesis, University of California at Berkeley, December, (1994)Google Scholar
  7. 7.
    X. Wei, N. Venkatasubramanian, Predictive fault tolerant Placement in distributed video servers, ICME (2001)Google Scholar
  8. 8.
    N. Venkatasubramanian and S. Ramanathan, Effective Load Management for Scalable Video Servers, HP Laboratories Technical Report, (1996)Google Scholar
  9. 9.
    Y. Huang, N. Venkatasubramanian. QoS-based Resource Discovery in Intermittently Available Environments. 11th IEEE High Performance Distributed Computing, (2002)Google Scholar
  10. 10.
    M Chen, H. Hsiao, C. Li and P.S. Yu, Using Rotational Mirrored De-clustering for Replica Placement in a Disk-Array-Based Video Server, ACM Multimedia, (1995)Google Scholar
  11. 11.
    I. Foster, C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure, book, preface, (1998)Google Scholar
  12. 12.
    C. Krick, H. Räcke, M. Westermann Approximation Algorithms for Data Management in Networks. 13th ACM Symposium on Parallel Algorithms and Architectures. 237–246, (2001)Google Scholar
  13. 13.
    A. Dan and D. Sitaram. An online video placement policy based on bandwidth to space ration (bsr). In SIGMOD’ 95, pages 376–385, (1995)Google Scholar
  14. 14.
    A. Dan, D. Sitaram, P. Shahabuddin. Scheduling Policies for an On-Demand Video Server with Batching, 2th ACM Multimedia Conference and Exposition, (1994).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Yun Huang
    • 1
  • Nalini Venkatasubramanian
    • 1
  1. 1.Dept. of Information & Computer ScienceUniversity of California, IrvineIrvineUSA

Personalised recommendations