Advanced search
1 file | 997.02 KB Add to list

Performance of caching algorithms for IPTV on-demand services

Author
Organization
Abstract
Due to its native return channel and its ability to easily address each user individually an IPTV system is very well suited to offer on-demand services. Those services are becoming more popular as there is an undeniable trend that users want to watch the offered content when and where it suits them best. Because multicast can no longer be relied upon for such services, as was the case when offering linear-programming TV, this trend risks to increase the traffic unwieldy over some parts of the IPTV network unless caches are deployed in strategic places within it. Since caches are limited in size and the popularity of on-demand content is volatile (i.e., changing over time), it is not straightforward to decide which objects, to cache at which moment in time. This paper introduces and studies a caching algorithm that tracks the popularity of objects to make intelligent caching decisions. We will show that when its parameters are set equal or close to their optimal values this algorithm outperforms traditional algorithms as LRU (Least-Recently Used) and LFU (Least-Frequently Used). After a generic study of the algorithm fed by a user demand model that takes the volatility of the objects into account we will discuss two particular cases of an on-demand service, video-on-demand and catch-up TV, for each of which we give guidelines on how to dimension their associated caches.
Keywords
user modeling, internet protocol TV, interactive TV, Caching

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 997.02 KB

Citation

Please use this url to cite or link to this publication:

MLA
De Vleeschauwer, Danny, and Koenraad Laevens. “Performance of Caching Algorithms for IPTV On-Demand Services.” IEEE TRANSACTIONS ON BROADCASTING, vol. 55, no. 2, 2009, pp. 491–501, doi:10.1109/TBC.2009.2015983.
APA
De Vleeschauwer, D., & Laevens, K. (2009). Performance of caching algorithms for IPTV on-demand services. IEEE TRANSACTIONS ON BROADCASTING, 55(2), 491–501. https://doi.org/10.1109/TBC.2009.2015983
Chicago author-date
De Vleeschauwer, Danny, and Koenraad Laevens. 2009. “Performance of Caching Algorithms for IPTV On-Demand Services.” IEEE TRANSACTIONS ON BROADCASTING 55 (2): 491–501. https://doi.org/10.1109/TBC.2009.2015983.
Chicago author-date (all authors)
De Vleeschauwer, Danny, and Koenraad Laevens. 2009. “Performance of Caching Algorithms for IPTV On-Demand Services.” IEEE TRANSACTIONS ON BROADCASTING 55 (2): 491–501. doi:10.1109/TBC.2009.2015983.
Vancouver
1.
De Vleeschauwer D, Laevens K. Performance of caching algorithms for IPTV on-demand services. IEEE TRANSACTIONS ON BROADCASTING. 2009;55(2):491–501.
IEEE
[1]
D. De Vleeschauwer and K. Laevens, “Performance of caching algorithms for IPTV on-demand services,” IEEE TRANSACTIONS ON BROADCASTING, vol. 55, no. 2, pp. 491–501, 2009.
@article{1008048,
  abstract     = {{Due to its native return channel and its ability to easily address each user individually an IPTV system is very well suited to offer on-demand services. Those services are becoming more popular as there is an undeniable trend that users want to watch the offered content when and where it suits them best. Because multicast can no longer be relied upon for such services, as was the case when offering linear-programming TV, this trend risks to increase the traffic unwieldy over some parts of the IPTV network unless caches are deployed in strategic places within it. Since caches are limited in size and the popularity of on-demand content is volatile (i.e., changing over time), it is not straightforward to decide which objects, to cache at which moment in time. This paper introduces and studies a caching algorithm that tracks the popularity of objects to make intelligent caching decisions. We will show that when its parameters are set equal or close to their optimal values this algorithm outperforms traditional algorithms as LRU (Least-Recently Used) and LFU (Least-Frequently Used). After a generic study of the algorithm fed by a user demand model that takes the volatility of the objects into account we will discuss two particular cases of an on-demand service, video-on-demand and catch-up TV, for each of which we give guidelines on how to dimension their associated caches.}},
  author       = {{De Vleeschauwer, Danny and Laevens, Koenraad}},
  issn         = {{0018-9316}},
  journal      = {{IEEE TRANSACTIONS ON BROADCASTING}},
  keywords     = {{user modeling,internet protocol TV,interactive TV,Caching}},
  language     = {{eng}},
  number       = {{2}},
  pages        = {{491--501}},
  title        = {{Performance of caching algorithms for IPTV on-demand services}},
  url          = {{http://doi.org/10.1109/TBC.2009.2015983}},
  volume       = {{55}},
  year         = {{2009}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: