Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/41.954552 | IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS |
Keywords | Field | DocType |
blocking probability, file placement, genetic algorithm, video on demand | Computer science,Bin packing problem,Genetic algorithm,Distributed computing | Journal |
Volume | Issue | ISSN |
48 | 5 | 0278-0046 |
Citations | PageRank | References |
19 | 1.03 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. S. Tang | 1 | 1288 | 127.58 |
| King-Tim Ko | 2 | 333 | 28.73 |
| Sammy Chan | 3 | 419 | 22.86 |
| E. W. M. Wong | 4 | 41 | 3.15 |