Optimal file placement in VOD system using genetic algorithm

被引：24

作者：

Tang, KS ^{[1
]}

Ko, KT ^{[1
]}

Chan, S ^{[1
]}

Wong, EWM ^{[1
]}

机构：

[1] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China

来源：

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS | 2001年 / 48卷 / 05期

关键词：

blocking probability; file placement; genetic algorithm; video on demand;

D O I：

10.1109/41.954552

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Advances in computing and networking are generating a significant demand for video-on-demand (VOD) applications. In this paper, the condition for minimum blocking probability of a VOD system is derived. The optimal load-sharing requirement in such a system is found so that the minimum blocking probability is achieved. A combination of genetic algorithm and modified bin-packing algorithm is then developed for the multimedia file placement exercise. It is demonstrated that a specified blocking probability can be achieved while the capacity usage is minimized simultaneously.

引用

页码：891 / 897

页数：7

共 21 条

[11] Holland J., 1992, ADAPTATION NATURAL A
[12] Optimal video placement for hierarchical video-on-demand systems
Hwang, RH
Sun, YC
[J]. IEEE TRANSACTIONS ON BROADCASTING, 1998, 44 (04) : 392 - 401
[13] KARMARKAR N, 1982, P 23 ANN S FDN COMP, P312
[14] Little T. D. C., 1994, IEEE Multimedia, V1, P14, DOI 10.1109/MMUL.1994.318978
[15] LITTLE TDC, 1995, MULTIMEDIA SYSTEMS, V2, P280
[16] THE DESIGN OF A STORAGE SERVER FOR CONTINUOUS MEDIA
LOUGHER, P
SHEPHERD, D
[J]. COMPUTER JOURNAL, 1993, 36 (01) : 32 - 42
[17] Man K., 1999, Genetic Algorithms: Concepts and Designs, V1st ed.
[18] MICHALEWICZ Z, 1996, GENETIC ALGORITHMS P
[19] NETWORKING REQUIREMENTS FOR INTERACTIVE VIDEO ON DEMAND
NUSSBAUMER, JP
PATEL, BV
SCHAFFA, F
STERBENZ, JPG
[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (05) : 779 - 787
[20] Ouveysi I, 1998, GLOBECOM 98: IEEE GLOBECOM 1998 - CONFERENCE RECORD, VOLS 1-6, P658, DOI 10.1109/GLOCOM.1998.776823

← 1 2 3 →