A popularity-based content distribution optimizing algorithm of clustered streaming media system

Author

Xing, Wei ; Jiang, Yang ; Hongsheng, Xi

Author_Institution

Autom. Dept., Univ. of Sci. & Technol. of China, Hefei

fYear

2008

fDate

16-18 July 2008

Firstpage

349

Lastpage

353

Abstract

The paper investigates how to optimize the content distribution of streaming media which minimizes the blocking probability in the case of knowing every programpsilas popularity. We adopt queuing theory to Model the system and analysis the relationship between the serverpsilas access probability and blocking probability. The ideal access probability of every server can be obtained by many numerical methods. Content distribution which determines each serverpsilas access probability, is proved to be NP-hard. An improved heuristic arithmetic is designed to perform the content distribution, in order to minimize the distance between the result of optimization and the ideal one. Lastly the correctness of system modeling and the efficiency of proposed arithmetic are verified by numerical analysis and discrete event simulation.

Keywords

computational complexity; media streaming; minimisation; multimedia servers; pattern clustering; probability; queueing theory; NP-hard problem; blocking probability minimization; heuristic arithmetic; media streaming clustering system; numerical method; popularity-based content distribution optimizing algorithm; queuing theory; server access probability; Arithmetic; Automation; Clustering algorithms; Control systems; Design optimization; Electronic mail; Modeling; Paper technology; Queueing analysis; Streaming media; Blocking probability; Clustered streaming media system; Content distribution;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference, 2008. CCC 2008. 27th Chinese

Conference_Location

Kunming

Print_ISBN

978-7-900719-70-6

Electronic_ISBN

978-7-900719-70-6

Type

conf

DOI

10.1109/CHICC.2008.4605763

Filename

4605763