Data allocation and dynamic load balancing for distributed video storage server

Shiao-Li Tsao, Meng Chang Chen, Ming Tat Ko, Jan Ming Ho, Yueh Min Huang

Research output: Contribution to journalArticle

17 Scopus citations

Abstract

In this paper, a novel initial videos allocation scheme and a dynamic load balancing strategy are proposed for a distributed video storage server in order to increase the availability and reduce operation cost. The initial allocation scheme determines the allocation of video replicas on the servers to achieve static load balance and to obtain a configuration for efficient dynamic load adjustment. From the simulation results, the proposed load shifting algorithm can reduce up to 50% request fail rate if compared with the same initialization algorithm without load shifting. The proposed initial allocation with load shifting also reduces 25% to 60% request fail rate from the least load first initial allocation scheme with load shifting, 5% to 10% request fail rate and 5% to 25% the number of shifting steps from the DASD dancing method. Moreover, a prototype is implemented on Windows NT to examine the correctness and practicability of the proposed schemes.

Original languageEnglish
Pages (from-to)197-218
Number of pages22
JournalJournal of Visual Communication and Image Representation
Volume10
Issue number2
DOIs
StatePublished - 1 Jan 1999

Fingerprint Dive into the research topics of 'Data allocation and dynamic load balancing for distributed video storage server'. Together they form a unique fingerprint.

  • Cite this