This paper studies a video storage problem that occurs in Video-on-Demand (VOD) networks and in other distributed database systems. Videos should be stored in order to respect various constraints, especially available storage and transmission capacities. We show there exists an algorithm to solve this combinatorial problem through a pricing mechanism and that it converges to a solution under some general conditions. Simulation results with up to 43-node networks and up to 300 videos show that the algorithm is fast.
|Number of pages||8|
|Journal||IEICE Transactions on Communications|
|Publication status||Published - 1995 Jul 1|
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering