Abstract
Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in which the goal is to minimize the cost of moving from one file configuration to another. The cost is incurred by file replications performed throughout the transition. The problem shows up also in production planning, preemptive scheduling with set-up costs, and dynamic placement of Web applications. We show that the reconfiguration problem is NP-hard already on very restricted instances. We then develop algorithms which achieve the optimal cost by using servers whose load capacities are increased by O(1), in particular, by factor 1 + δ for any small 0 < δ< 1 when the number of servers is fixed, and by factor of 2 + ε for arbitrary number of servers, for some ε ∈ [0,1). To the best of our knowledge, this fundamental optimization problem is studied here for the first time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chou, C.F., Golubchik, L., Lui, J.C.S.: A performance study of dynamic replication techniques in continuous media servers. In: IEEE MASCOTS (2000)
Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Euro. Journal of OR 123 (2000)
Dukes, J., Jones, J.: Using Dynamic Replication to Manage Service Availability in a Multimedia Server Cluster. In: Roca, V., Rousseau, F. (eds.) MIPS 2004. LNCS, vol. 3311, pp. 194–205. Springer, Heidelberg (2004)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved results for data migration and open shop scheduling. ACM Trans. on Algorithms 2(3) (2006)
Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proc. of SODA (2000)
Griwodz, C., Bar, M., Wolf, L.C.: Long-term movie popularity models in Video-on-demand Systems: Or the life of an On-demand movie. ACM Multimedia (1997)
Guo, X., Li, J., Yang, J., Wang, J.: The research on dynamic replication and placement of file using dual-threshold dynamic file migration algorithm. In: CSSE, vol. (3) (2008)
Karve, A., Kimbrel, T., Pacifici, G., Spreitzer, M., Steinder, M., Sviridenko, M., Tantawi, A.: Dynamic application placement for clustered web applications. In: WWW (2006)
Kashyap, S.: Algorithms for data placement, reconfiguration and monitoring in storage networks. Ph.D. Dissertation. CS Department, Univ. of Maryland (2007)
Kashyap, S., Khuller, S.: Algorithms for non-uniform size data placement on parallel disks. In: FST & TCS (2003)
Kashyap, S., Khuller, S., Wan, Y.-C., Golubchik, L.: Fast reconfiguration of data placement in parallel disks. In: ALENEX (2006)
Khuller, S., Kim, Y., Wan, Y.C.: Algorithms for Data Migration with Cloning. In: ACM Symposium on Principles of Database Systems (2003)
Kim, Y.: Data Migration to Minimize the Average Completion Time. In: Proc. of the 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 97–98 (2003)
Lie, P.W.K., Lui, J.C.S., Golubchik, L.: Threshold-based dynamic replication in large-scale video-on-demand systems. In: Proc. of the Eighth International Workshop on Research Issues in Database Engineering (RIDE), pp. 52–59 (1998)
Shachnai, H., Tamir, G., Tamir, T.: Minimal Cost Reconfiguration of Data Placement in Storage Area Network, http://www.cs.technion.ac.il/~hadas/PUB/reconf_jour.pdf
Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442–467 (2001)
Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. J. of Scheduling 4(6), 313–338 (2001)
Shachnai, H., Tamir, T.: Approximation Schemes for Generalized 2-dimensional Vector Packing with Application to Data Placement. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 165–177. Springer, Heidelberg (2003)
Shmoys, D., Tardos, E.: Scheduling unrelated machines with Costs. In: SODA (1993)
Wolf, J.L., Yu, P.S., Shachnai, H.: Disk load balancing for video-on-demand systems. ACM Multimedia Systems J. 5, 358–370 (1997)
Yu, H., Zheng, D., Zhao, B.Y., Zheng, W.: Understanding user behavior in large scale video-on-demand systems. In: ACM SIGOPS/EuroSys (2006)
Peyton Young, H.: Equity in theory and practice. Princeton University Press, Princeton (1995)
Zhou, X., Xu, C.Z.: Optimal video replication and placement on a cluster of video-on-demand servers. In: Int. Conference on Parallel Processing, ICPP (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shachnai, H., Tamir, G., Tamir, T. (2010). Minimal Cost Reconfiguration of Data Placement in Storage Area Network. In: Bampis, E., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2009. Lecture Notes in Computer Science, vol 5893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12450-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-12450-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12449-5
Online ISBN: 978-3-642-12450-1
eBook Packages: Computer ScienceComputer Science (R0)