Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Performance analysis of local caching replacement policies for internet video streaming services
KTH, School of Electrical Engineering (EES).
KTH, School of Electrical Engineering (EES).ORCID iD: 0000-0002-4876-0223
Show others and affiliations
2014 (English)In: 2014 22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, IEEE conference proceedings, 2014, 341-348 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this work, the performance of 5 representative caching replacement policies was investigated and compared for caching Internet video-on-demand (VoD) in local access networks. Two measured traces of end-user requests were used in the analyses for two typical VoD services: TV-on-demand and user generated content represented by YouTube. The studied policies range from simple least recently used (LRU) and least frequently used (LFU) algorithms to more advanced ones denoted as LFU-dynamic lifespan (LFU-DL), Adaptive replacement cache (ARC) and Greedy-dual size frequency (GDSF). Our results show that the ARC policy always outperforms the other policies due to its adaptive nature and its ability to track changes in the traffic patterns. On the other hand, the simple LRU policy can also achieve a caching performance which is comparable to that of the more advanced ARC policy especially for the TV-on-demand service when the potential caching gain is high. On the contrary, the simple LFU policy always shows the poorest performance. However, by applying a proper lifespan supplement under the LFU-DL policy, the caching performance can be effectively enhanced to the level achievable using ARC and LRU policies. Moreover, the GDSF policy does not outperform simple LRU or LFU-DL, especially for YouTube video clips when the potential caching gain is relatively low. The advantage of GDSF manifested in our analysis is, however, its outstanding cache space usage efficiency among the five studied caching algorithms.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2014. 341-348 p.
Keyword [en]
cache, caching algorithm, caching replacement policy, Local access network, TV-on-demand, Video-on-demand, YouTube, Algorithms, Client server computer systems, Internet, Video streaming, Local access networks, On demands, Replacement policy, Video on demand
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-174792DOI: 10.1109/SOFTCOM.2014.7039112Scopus ID: 2-s2.0-84949927182ISBN: 9789532900521 (print)OAI: oai:DiVA.org:kth-174792DiVA: diva2:878339
Conference
22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, 17 September 2014 through 19 September 2014
Note

QC 20151208

Available from: 2015-12-08 Created: 2015-10-07 Last updated: 2016-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Wu, JinlongDan, György
By organisation
School of Electrical Engineering (EES)
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf