Please use this identifier to cite or link to this item:
|Title:||A novel distributed architecture of large-scale multimedia storage system using autonomous object-based storage devices|
|Authors:||Zeng, Z. |
|Keywords:||Average waiting time|
Multimedia storage system
Object-based storage device
|Source:||Zeng, Z., Veeravalli, B. (2009-04). A novel distributed architecture of large-scale multimedia storage system using autonomous object-based storage devices. Journal of Parallel and Distributed Computing 69 (4) : 349-359. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jpdc.2008.12.004|
|Abstract:||In a large-scale multimedia storage system (LMSS) where the user requests for different multimedia objects may have different demands, placement and replication of the objects is an important factor, as it may result in an imbalance in loading across the system. Since replica management and load balancing is a crucial issue in multimedia systems, normally this problem is handled by centralized servers, e.g., metadata servers (MDS) in distributed file systems. Each object-based storage device (OSD) responds to the requests coming from the centralized servers independently and has no communication with other OSDs among the system. In this paper, we design a novel distributed architecture of LMSS, in which the OSDs have some kind of intelligences and can cooperate to achieve a high performance. Such an OSD, named as autonomous object-based storage device (AOSD), can replicate the objects to and balance the requests among other AOSDs, and handle fail-over and recovery autonomously. In the proposed architecture, we move the request balancing from centralized MDS to AOSDs and make the system more scalable, flexible, and robust. Based on the proposed architecture, we propose two different object replication and load balancing algorithms, named as "Minimum Average Waiting Time" (MAWT) and "One of the Best Two Choices" (OBTC), respectively. We validate the performance of the algorithms via rigorous simulations with respect to several influencing factors. Our findings conclusively demonstrate that the proposed architecture minimizes the average waiting time and at the same time carries out load balancing across servers. © 2009 Elsevier Inc. All rights reserved.|
|Source Title:||Journal of Parallel and Distributed Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 25, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.