Media mapping in video-on-demand server networks is a new combinatorial optimization problem. The network of video servers can be implemented on the top of a closely connected network of workstations or on a wide area network of servers. This paper addresses the media mapping problem, taking the user access patterns, overall storage capacity and communication bandwidth limitations of the server network into account. A number of methods based on local search algorithms for the solution of the mapping problem are proposed and verified by use of a set of benchmark problems. The simulations show that these heuristic solutions can achieve nearly optimal solutions in a short computational time.
[1]Dowdy, L.W., Foster, D.V. Comparative models of the file assignment problem. Computing Surveys, 1982,14(2):34~56.
[2]Anderson, D.P., Osawa, Y., Govindan, R. A file system for continuous media. ACM Transactions on Computer Systems, 1992,10(4):311~337.
[3]Dan, A., Kienzle, M., Sitaram, D. Dynamic policy of segment replication for load-balancing in video-on-demand servers. ACM Multimedia Systems, 1996,4(3):112~121.
[4]Zhou Xiao-bo, Reinhard Lueling, Xie Li. Heuristic solutions for a mapping problem in a TV-anytime server network, parallel and distributed processing. In: Rolim, J. ed. Proceedings of IPDPS 2000 Workshops, Vol 1800. Lecture Notes in Computer Science, Berlin: Springer-Verlag, 2000. 210~217.
[5]Gomez, F.C., Lueling, R. A parallel continuous media server for internet environments. In: Peter, S. ed. Proceedings of the International Conferences on High-Performance Computing and Networking (HPCN Europe'98), Vol 1401. Lecture Notes in Computer Science, Berlin: Springer-Verlag, 1998. 78~86.
[6]Venkatasubramanian, N., Ramanathan, S. Load management in distributed video servers. In: Simon, S. ed. Proceedings of the International Conference on Distributed Computing Systems (ICDCS). Baltimore, MD: IEEE Computer Society, 1997. 31~39.
[7]Diekmann, R., Lueling, R., Monien, B. Combing helpful sets and parallel simulated annealing for the graph-partitioning problem. Parallel Algorithms and Applications, 1996,8(1):61~84.