Study of cache placement for time-shifted TV cluster using genetic algorithm

Authors:
Juchao Zhuo;Jun Li;Gang Wu
Affiliations:
University of Science and Technology of China, Hefei, China;University of Science and Technology of China, Hefei, China;University of Science and Technology of China, Hefei, China
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 9
Cited 0

Genetic Algorithms: Concepts and Designs with Disk

Genetic Algorithms: Concepts and Designs with Disk
A Scalable Technique for VCR-Like Interactions in Video-on-Demand Applications

ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Analyzing client interactivity in streaming media

Proceedings of the 13th international conference on World Wide Web
Co-operative Proxy Caching Algorithms for Time-Shifted IPTV Services

EUROMICRO '06 Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications
Efficient algorithms of video replication and placement on a cluster of streaming servers

Journal of Network and Computer Applications
Dynamic cache reconfiguration strategies for cluster-based streaming proxy

Computer Communications
Performance Analysis of Resource Selection Schemes for a Large Scale Video-on-Demand System

IEEE Transactions on Multimedia
Piecewise Patching for Time-shifted TV Over HFC Networks

IEEE Transactions on Consumer Electronics
Adaptive systems for improved media streaming experience

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

The designing of a streaming media system, especially Time-shifted TV cluster faces an optimization cache problem of deciding how to cache channels to multiple servers so that the blocking probability is minimized subject to memory capacity constraints. In this paper, we investigate the crucial problem by evaluating the blocking performance for a feasible assignment. A popularity-based random placement (PRP) scheme together with the genetic algorithm (GA) is developed to find an optimal or approximate optimal solution of the problem. The experiment results reveal that our proposed algorithm is efficient on improving the performance of Time-shifted TV cluster in terms of minimizing blocking probability.