TY - JOUR
T1 - Hierarchical network storage architecture for video-on-demand services
AU - Lin, Ying-Dar
AU - Lai, Horng Zhu
AU - Lai, Yuan Cheng
PY - 1996/10/13
Y1 - 1996/10/13
N2 - Recent advances in Cable TV networks and multimedia technologies open the possibilities for network/service/content providers to offer residential customers with video-on-demand services. However, the mass storage system in supporting such services demands proper organization and management. In this thesis we present a three-level hierarchical network storage architecture for the video-on-demand storage system. At the first-level (Local Service Center, LSC) a limited number of programs with high viewing probabilities are stored; while at the second-level (Local Central Service Center, LCSC) a few programs with second high viewing probabilities are stored. The third-level (Central Service Center, CSC) contains all programs provided in the system. Based on this architecture and the program viewing probability distribution function, we use a minimum-cost function to find out the numbers of programs stored in the two service centers (LSC and LCSC) and numbers of links among these three service centers. We also describe two program reallocation algorithms which swap programs between service centers according to the change in user request patterns.
AB - Recent advances in Cable TV networks and multimedia technologies open the possibilities for network/service/content providers to offer residential customers with video-on-demand services. However, the mass storage system in supporting such services demands proper organization and management. In this thesis we present a three-level hierarchical network storage architecture for the video-on-demand storage system. At the first-level (Local Service Center, LSC) a limited number of programs with high viewing probabilities are stored; while at the second-level (Local Central Service Center, LCSC) a few programs with second high viewing probabilities are stored. The third-level (Central Service Center, CSC) contains all programs provided in the system. Based on this architecture and the program viewing probability distribution function, we use a minimum-cost function to find out the numbers of programs stored in the two service centers (LSC and LCSC) and numbers of links among these three service centers. We also describe two program reallocation algorithms which swap programs between service centers according to the change in user request patterns.
UR - http://www.scopus.com/inward/record.url?scp=0030382850&partnerID=8YFLogxK
U2 - 10.1109/LCN.1996.558164
DO - 10.1109/LCN.1996.558164
M3 - Conference article
AN - SCOPUS:0030382850
SN - 0742-1303
SP - 355
EP - 364
JO - Conference on Local Computer Networks
JF - Conference on Local Computer Networks
M1 - 558164
T2 - Proceedings of the 1996 21st Conference on Local Computer Networks
Y2 - 13 October 1996 through 16 October 1996
ER -