Advanced search
2 files | 5.09 MB Add to list

Cooperative announcement-based caching for video-on-demand streaming

Author
Organization
Abstract
Recently, video-on-demand (VoD) streaming services like Netflix and Hulu have gained a lot of popularity. This has led to a strong increase in bandwidth capacity requirements in the network. To reduce this network load, the design of appropriate caching strategies is of utmost importance. Based on the fact that, typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently, cache replacement strategies have been developed that take advantage of this temporal structure in the video. In this paper, two caching strategies are proposed that additionally take advantage of the phenomenon of binge watching, where users stream multiple consecutive episodes of the same series, reported by recent user behavior studies to become the everyday behavior. Taking into account this information allows us to predict future segment requests, even before the video playout has started. Two strategies are proposed, both with a different level of coordination between the caches in the network. Using a VoD request trace based on binge watching user characteristics, the presented algorithms have been thoroughly evaluated in multiple network topologies with different characteristics, showing their general applicability. It was shown that in a realistic scenario, the proposed election-based caching strategy can outperform the state-of-the-art by 20% in terms of cache hit ratio while using 4% less network bandwidth.
Keywords
INFORMATION-CENTRIC NETWORKING, IBCN, PROXY, ALGORITHMS, SYSTEMS, DESIGN, Cooperative caching, Multimedia streaming, Video-on-Demand, Binge watching

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.51 MB
  • 6630 i.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 3.58 MB

Citation

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

MLA
Claeys, Maxim et al. “Cooperative Announcement-based Caching for Video-on-demand Streaming.” IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 13.2 (2016): 308–321. Print.
APA
Claeys, Maxim, Bouten, N., De Vleeschauwer, D., Van Leekwijck, W., Latre, S., & De Turck, F. (2016). Cooperative announcement-based caching for video-on-demand streaming. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 13(2), 308–321.
Chicago author-date
Claeys, Maxim, Niels Bouten, Danny De Vleeschauwer, Werner Van Leekwijck, Steven Latre, and Filip De Turck. 2016. “Cooperative Announcement-based Caching for Video-on-demand Streaming.” Ieee Transactions on Network and Service Management 13 (2): 308–321.
Chicago author-date (all authors)
Claeys, Maxim, Niels Bouten, Danny De Vleeschauwer, Werner Van Leekwijck, Steven Latre, and Filip De Turck. 2016. “Cooperative Announcement-based Caching for Video-on-demand Streaming.” Ieee Transactions on Network and Service Management 13 (2): 308–321.
Vancouver
1.
Claeys M, Bouten N, De Vleeschauwer D, Van Leekwijck W, Latre S, De Turck F. Cooperative announcement-based caching for video-on-demand streaming. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT. 2016;13(2):308–21.
IEEE
[1]
M. Claeys, N. Bouten, D. De Vleeschauwer, W. Van Leekwijck, S. Latre, and F. De Turck, “Cooperative announcement-based caching for video-on-demand streaming,” IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, vol. 13, no. 2, pp. 308–321, 2016.
@article{8037860,
  abstract     = {Recently, video-on-demand (VoD) streaming services like Netflix and Hulu have gained a lot of popularity. This has led to a strong increase in bandwidth capacity requirements in the network. To reduce this network load, the design of appropriate caching strategies is of utmost importance. Based on the fact that, typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently, cache replacement strategies have been developed that take advantage of this temporal structure in the video. In this paper, two caching strategies are proposed that additionally take advantage of the phenomenon of binge watching, where users stream multiple consecutive episodes of the same series, reported by recent user behavior studies to become the everyday behavior. Taking into account this information allows us to predict future segment requests, even before the video playout has started. Two strategies are proposed, both with a different level of coordination between the caches in the network. Using a VoD request trace based on binge watching user characteristics, the presented algorithms have been thoroughly evaluated in multiple network topologies with different characteristics, showing their general applicability. It was shown that in a realistic scenario, the proposed election-based caching strategy can outperform the state-of-the-art by 20% in terms of cache hit ratio while using 4% less network bandwidth.},
  author       = {Claeys, Maxim and Bouten, Niels and De Vleeschauwer, Danny and Van Leekwijck, Werner and Latre, Steven and De Turck, Filip},
  issn         = {1932-4537},
  journal      = {IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT},
  keywords     = {INFORMATION-CENTRIC NETWORKING,IBCN,PROXY,ALGORITHMS,SYSTEMS,DESIGN,Cooperative caching,Multimedia streaming,Video-on-Demand,Binge watching},
  language     = {eng},
  number       = {2},
  pages        = {308--321},
  title        = {Cooperative announcement-based caching for video-on-demand streaming},
  url          = {http://dx.doi.org/10.1109/TNSM.2016.2546459},
  volume       = {13},
  year         = {2016},
}

Altmetric
View in Altmetric
Web of Science
Times cited: