Optimal Content Distribution on Clustered Streaming Media System Consisting of Homogeneous Configuration

Wei Xing; Yang Jiang; Xi Hong-sheng

doi:10.3724/SP.J.1146.2008.01267

Volume 31 Issue 9

Dec. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2009 > 31(9): 2232-2236

Wei Xing, Yang Jiang, Xi Hong-sheng. Optimal Content Distribution on Clustered Streaming Media System Consisting of Homogeneous Configuration[J]. Journal of Electronics & Information Technology, 2009, 31(9): 2232-2236. doi: 10.3724/SP.J.1146.2008.01267

Citation:

Wei Xing, Yang Jiang, Xi Hong-sheng. Optimal Content Distribution on Clustered Streaming Media System Consisting of Homogeneous Configuration[J]. Journal of Electronics & Information Technology, 2009, 31(9): 2232-2236. doi: 10.3724/SP.J.1146.2008.01267

Citation:

PDF( 338 KB)

Optimal Content Distribution on Clustered Streaming Media System Consisting of Homogeneous Configuration

doi: 10.3724/SP.J.1146.2008.01267

Received Date: 2008-10-06
Rev Recd Date: 2009-04-06
Publish Date: 2009-09-19

Abstract

Abstract

The optimizing problem of content distribution which minimizes the blocking probability and storage consumption on clustered streaming media system is discussed, in the case of knowing every programs unchanged popularity. Firstly, the queuing theory is adopted to analysis the relationship between the servers access probability and the optimizing goal. The ideal access probability of every server can be obtained by some numerical methods, under the circumstance of minimal blocking probability. Content distribution determining each servers access probability, has been proved to be NP-Hard. The whole content distribution process consists of two strategies, i.e. duplicate swapping and peer duplicates access probability adjusting. All the heuristic arithmetic is designed to perform the content distribution in order to minimize the distance between the result of optimization and the ideal one, minimize the storage consumption and reduce the blocking probability. Finally, the correctness of system modeling and the efficiency of proposed arithmetic are verified by numerical analysis and discrete event simulation.

FullText(HTML)

References(1)

References

Dakshayini M, Guruprasad H S, and Masheshappa H D, et al..Load balancing in distributed VoD using Local Proxy ServerGroup(LPSG). IEEE International Conference onComputational Intelligence and Multimedia Application,Sivakasi, Tamil Nadu, 13-15 Dec. 2007, 4: 162-168.[2]Zhang Ming-long and Feng Bo-qin. A novel migrationalgorithm based-on states-balancing in a distributedmultimedia services system. International Conference onMultimedia and Ubiquitous Engineering, Busan, 24-26 April2008: 336-341.[3]Leung Yiu-wing and Hou Yuen-tan. Assignment of movies toheterogeneous video servers[J].IEEE Transactions on Systems,Man, and Cybernetics-Part A.2005, 35(5):665-681[4]Jun Guo, Wong E W M, and Chan S, et al.. Combination loadbalancing for video-on-demand system[J].IEEE Transactionson Circuits and Systems for Video Technology.2008, 18(7):937-948[5]Serpanos D N, Georgiadis L, and Bouloutas T. MMPacking:A load and storage balancing algorithm for distributedmultimedia servers[J].IEEE Transactions on Circuits andSystems for Video Technology.1998, 8(1):13-17[6]Zhao Yin-qing and Kuo C C J. Scheduling design fordistributed video-on-demand servers. IEEE InternationalSymposium on Circuits and System, Kobe, Japan, 2005, 2:1545-1548.[7]Zhao Yin-qing and Kuo C C J. Design issues on requestmigration for video-on-demand services. Proceedings of the2004 International Symposium on Circuits and Systems,23-26 May 2004, 2: 49-52.[8]Tang Kit-sang, Ko King-tim, and Chan Sammy, et al..Optimal file placement in VOD system using geneticalgorithm[J].IEEE Transactions on Industrial Electronics.2001,48(5):891-897[9]Zhou Xiao-bo and Xu Cheng-zhong. Optimal videoreplication and placement on a cluster of video-on-demandservers. IEEE International Conference on ParallelProceeding, Vancouver Canada, 18-21 Aug. 2002: 547-555.[10]Gross D and Harris C M. Fundamentals of Queueing Theory.New York, Wiley, 1985: 294-304.

Relative Articles

Supplements(0)

Cited By

Proportional views