For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Fast Dynamic Algorithm for Storage Allocation in Telecommunication Networks
Yoshiaki TANAKA Olivier BERLAGE
IEICE TRANSACTIONS on Communications
Publication Date: 1995/07/25
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Service
auction algorithms, storage allocation, video-on-demand, optimization,
Full Text: PDF>>
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.