Algorithms for storage allocation based on client preferences |
| |
Authors: | Tami Tamir Benny Vaksendiser |
| |
Institution: | 1.School of Computer Science,The Interdisciplinary Center,Herzliya,Israel |
| |
Abstract: | We consider a packing problem arising in storage management of Video on Demand (VoD) systems. The system consists of a set of video files (movies) and several servers (disks), each having a limited storage
capacity, C, and a limited bandwidth (load capacity), L. The goal in the storage allocation problem is to assign the video files to the servers and the bandwidth to the clients. The induced class-constrained packing problem was studied in the past assuming each client provides a single request for a single movie. This paper considers a
more general and realistic model—in which each client ranks all the movies in the system. Specifically, for each client j and movie i, it is known how much client j is willing to pay in order to watch movie i. The goal is to maximize the system’s profit. Alternatively, the client might provide a ranking of the movies and the goal
is to maximize the lexicographic profile of the solution. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|