Please use this identifier to cite or link to this item:
|Title:||Design and performance evaluation of fail-over and recovery strategies for large-scale multimedia storage systems||Authors:||Zeng, Z.
|Issue Date:||2006||Citation:||Zeng, Z.,Veeravalli, B.,Srivastava, J. (2006). Design and performance evaluation of fail-over and recovery strategies for large-scale multimedia storage systems. Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers 1 : 9-14. ScholarBank@NUS Repository. https://doi.org/10.1109/ICON.2006.302604||Abstract:||Failure-over and recovery is a crucial issue for large-scale multimedia storage system (MSS). In the literature, there are two fail-over policies: active-standby fail-over and active-active fail-over. In this paper, we adopt an active-active policy and design two heuristic algorithms to determine the number and the placement of the object replicas among the multimedia servers. One is named as "Minimum Average Waiting Time" (MAWT) strategy, in which we will choose the server to store an object replica according to an optimal solution, and the other algorithm is named as "One of the Best Two Choices" (OBTC) strategy, in which we will randomly choose one out of the first two best choices according to an optimal solution. We analyze their performance in the cases when the system runs normally and when some failure occurs. Via rigorous simulations, we find that when the system is running normally(without failures), MAWT performs better than OBTC and when some server fails, OBTC performs much better than MAWT. ©2006 IEEE.||Source Title:||Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers||URI:||http://scholarbank.nus.edu.sg/handle/10635/69843||ISBN:||0780397460||DOI:||10.1109/ICON.2006.302604|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.