Ghent University Academic Bibliography

Advanced

Performance analysis of a caching algorithm for a catch-up television service

Zlatka Avramova UGent, Danny De Vleeschauwer UGent, Sabine Wittevrongel UGent and Herwig Bruneel UGent (2011) MULTIMEDIA SYSTEMS. 17(1). p.5-18
abstract
The catch-up TV (CUTV) service allows users to watch video content that was previously broadcast live on TV channels and later placed on an on-line video store. Upon a request from a user to watch a recently missed episode of his/her favourite TV series, the content is streamed from the video server to the customer's receiver device. This requires that an individual flow is set up for the duration of the video, and since it is hard to impossible to employ multicast streaming for this purpose (as users seldomly issue a request for the same episode at the same time), these flows are unicast. In this paper, we demonstrate that with the growing popularity of the CUTV service, the number of simultaneously running unicast flows on the aggregation parts of the network threaten to lead to an unwieldy increase in required bandwidth. Anticipating this problem and trying to alleviate it, the network operators deploy caches in strategic places in the network. We investigate the performance of such a caching strategy and the impact of its size and the cache update logic. We first analyse and model the evolution of video popularity over time based on traces we collected during 10 months. Through simulations we compare the performance of the traditional least-recently used and least-frequently used caching algorithms to our own algorithm. We also compare their performance with a "perfect" caching algorithm, which knows and hence does not have to estimate the video request rates. In the experimental data, we see that the video parameters from the popularity evolution law can be clustered. Therefore, we investigate theoretical models that can capture these clusters and we study the impact of clustering on the caching performance. Finally, some considerations on the optimal cache placement are presented.
Please use this url to cite or link to this publication:
author
organization
year
type
journalArticle (proceedingsPaper)
publication status
published
subject
keyword
On-demand services, IPTV, Caching, Catch-up TV, NETWORK, ARCHITECTURES
journal title
MULTIMEDIA SYSTEMS
Multimedia Syst.
volume
17
issue
1
pages
5 - 18
Web of Science type
Proceedings Paper
Web of Science id
000286940600002
JCR category
COMPUTER SCIENCE, THEORY & METHODS
JCR impact factor
0.729 (2011)
JCR rank
48/99 (2011)
JCR quartile
2 (2011)
ISSN
0942-4962
DOI
10.1007/s00530-010-0201-1
language
English
UGent publication?
yes
classification
A1
copyright statement
I have transferred the copyright for this publication to the publisher
id
1578721
handle
http://hdl.handle.net/1854/LU-1578721
date created
2011-06-24 16:46:12
date last changed
2016-12-19 15:41:56
@article{1578721,
  abstract     = {The catch-up TV (CUTV) service allows users to watch video content that was previously broadcast live on TV channels and later placed on an on-line video store. Upon a request from a user to watch a recently missed episode of his/her favourite TV series, the content is streamed from the video server to the customer's receiver device. This requires that an individual flow is set up for the duration of the video, and since it is hard to impossible to employ multicast streaming for this purpose (as users seldomly issue a request for the same episode at the same time), these flows are unicast. In this paper, we demonstrate that with the growing popularity of the CUTV service, the number of simultaneously running unicast flows on the aggregation parts of the network threaten to lead to an unwieldy increase in required bandwidth. Anticipating this problem and trying to alleviate it, the network operators deploy caches in strategic places in the network. We investigate the performance of such a caching strategy and the impact of its size and the cache update logic. We first analyse and model the evolution of video popularity over time based on traces we collected during 10 months. Through simulations we compare the performance of the traditional least-recently used and least-frequently used caching algorithms to our own algorithm. We also compare their performance with a {\textacutedbl}perfect{\textacutedbl} caching algorithm, which knows and hence does not have to estimate the video request rates. In the experimental data, we see that the video parameters from the popularity evolution law can be clustered. Therefore, we investigate theoretical models that can capture these clusters and we study the impact of clustering on the caching performance. Finally, some considerations on the optimal cache placement are presented.},
  author       = {Avramova, Zlatka and De Vleeschauwer, Danny and Wittevrongel, Sabine and Bruneel, Herwig},
  issn         = {0942-4962},
  journal      = {MULTIMEDIA SYSTEMS},
  keyword      = {On-demand services,IPTV,Caching,Catch-up TV,NETWORK,ARCHITECTURES},
  language     = {eng},
  number       = {1},
  pages        = {5--18},
  title        = {Performance analysis of a caching algorithm for a catch-up television service},
  url          = {http://dx.doi.org/10.1007/s00530-010-0201-1},
  volume       = {17},
  year         = {2011},
}

Chicago
Avramova, Zlatka, Danny De Vleeschauwer, Sabine Wittevrongel, and Herwig Bruneel. 2011. “Performance Analysis of a Caching Algorithm for a Catch-up Television Service.” Multimedia Systems 17 (1): 5–18.
APA
Avramova, Z., De Vleeschauwer, D., Wittevrongel, S., & Bruneel, H. (2011). Performance analysis of a caching algorithm for a catch-up television service. MULTIMEDIA SYSTEMS, 17(1), 5–18.
Vancouver
1.
Avramova Z, De Vleeschauwer D, Wittevrongel S, Bruneel H. Performance analysis of a caching algorithm for a catch-up television service. MULTIMEDIA SYSTEMS. 2011;17(1):5–18.
MLA
Avramova, Zlatka, Danny De Vleeschauwer, Sabine Wittevrongel, et al. “Performance Analysis of a Caching Algorithm for a Catch-up Television Service.” MULTIMEDIA SYSTEMS 17.1 (2011): 5–18. Print.