A dynamic caching algorithm based on internal popularity distribution of streaming media

Jiang, Ying; Chou, Chun Tung; Yang, Zhen; Du, Xuehui; Wang, Tai

doi:10.1007/s00530-006-0045-x

Cited by 29 publications

(18 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, such techniques better map to the skewed internal popularity of multimedia content. Yu et al argue that selecting a suitable segment size is a complex problem and therefore propose an alternative solution that models the internal popularity of multimedia streams independent of segment size [8]. Certain IP-TV services have specific properties that can be exploited by caching strategies.…”

Section: Related Workmentioning

confidence: 99%

On the merits of popularity prediction in multimedia content caching

Famaey

Wauters

Turck

2011

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops

View full text Add to dashboard Cite

Abstract-In recent years, telecom operators have been moving away from traditional, broadcast-driven, television towards IPbased, interactive and on-demand services. Consequently, multicast is no longer a viable solution to limit the amount of traffic in the IP-TV network. In order to counter an explosion in generated traffic, caches can be strategically placed throughout the content delivery infrastructure. As the size of caches is usually limited to only a small fraction of the total size of all content items, it is important to accurately predict future content popularity. Classical caching strategies only take into account the past when deciding what content to cache. Recently, a trend towards novel strategies that actually try to predict future content popularity has arisen. In this paper, we ascertain the viability of using popularity prediction in realistic multimedia content caching scenarios. The use of popularity prediction is compared to classical strategies using trace files from an actual deployed Video on Demand service. Additionally, the synergy between several parameters, such as cache size and prediction window, is investigated.

show abstract

Section: Related Workmentioning

confidence: 99%

On the merits of popularity prediction in multimedia content caching

Famaey

Wauters

Turck

2011

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops

View full text Add to dashboard Cite

show abstract

“…Additionally, such techniques better map to the skewed internal popularity of multimedia content. Yu et al [8] argue that selecting a suitable segment size is a complex problem and therefore propose an alternative solution that models the internal popularity of multimedia streams independent of segment size. Kim and Das [9] further extended the work on segment-based caching, by way of an analytical model that exploits the temporal locality and popularity of content.…”

Section: Related Workmentioning

confidence: 99%

Towards a predictive cache replacement strategy for multimedia content

Famaey

Iterbeke

Wauters

et al. 2013

Journal of Network and Computer Applications

View full text Add to dashboard Cite

In recent years, telecom operators have been moving away from traditional broadcast-driven television, towards IP-based interactive and on-demand multimedia services. Consequently, multicast is no longer sufficient to limit the amount of generated traffic in the network. In order to prevent an explosive growth in traffic, caches can be strategically placed throughout the content delivery infrastructure. As the size of caches is usually limited to only a small fraction of the total size of all content items, it is important to accurately predict future content popularity. Traditional caching strategies only take into account the past when deciding what content to cache. Recently, a trend towards novel strategies that actually try to predict future content popularity has arisen. In this article, we ascertain the viability of using popularity prediction in realistic multimedia content caching scenarios. The proposed generic popularity prediction algorithm is capable of predicting future content popularity, independent of specific content and service characteristics. Additionally, a novel cache replacement strategy, which employs the popularity prediction algorithm when making its decisions, is introduced. A detailed evaluation, based on simulation results using trace files from an actual deployed Video on Demand service, was performed. The evaluation results are used to determine the merits of popularity-based caching compared to traditional strategies. Additionally, the synergy between several parameters, such as cache size and prediction window, is investigated. Results show that the proposed prediction-based caching strategy has the potential to significantly outperform state-of-the-art traditional strategies. Specifically, the evaluated Video on Demand scenario showed a performance increase of up to 20% in terms of cache hit rate.

show abstract

“…However, it has been shown in practice that multimedia content often has a high internal popularity skew [51]. For example, in many video-based multimedia services, the beginning of videos is often much more popular than the end.…”

Section: Segment-based Content Deliverymentioning

confidence: 99%

End-to-End Resource Management for Federated Delivery of Multimedia Services

et al. 2013

View full text Add to dashboard Cite

Recently, the Internet has become a popular platform for the delivery of multimedia content. Currently, multimedia services are either offered by Over-the-top (OTT) providers or by access ISPs over a managed IP network. As OTT providers offer their content across the best-effort Internet, they cannot offer any Quality of Service (QoS) guarantees to their users. On the other hand, users of managed multimedia services are limited to the relatively small selection of content offered by their own ISP. This article presents a framework that combines the advantages of both existing approaches, by dynamically setting up federations between the stakeholders involved in the content delivery process. Specifically, the framework provides an automated mechanism to set up end-to-end federations for QoSaware delivery of multimedia content across the Internet. QoS contracts are automatically negotiated between the content provider, its customers, and the intermediary network domains. Additionally, a federated resource reservation algorithm is presented, which allows the framework to identify the optimal set of stakeholders and resources to include within a federation. Its goal is to minimize delivery costs for the content provider, while satisfying customer QoS requirements. Moreover, the presented framework allows intermediary storage sites to be included in these federations, supporting on-the-fly deployment of content caches along the delivery paths. The algorithm was thoroughly evaluated in order to validate our approach and assess the merits of including intermediary storage sites. The results clearly show the benefits of our method, with delivery cost reductions of up to 80% in the evaluated scenario.

show abstract

A dynamic caching algorithm based on internal popularity distribution of streaming media

Cited by 29 publications

References 19 publications

On the merits of popularity prediction in multimedia content caching

On the merits of popularity prediction in multimedia content caching

Towards a predictive cache replacement strategy for multimedia content

End-to-End Resource Management for Federated Delivery of Multimedia Services

Contact Info

Product

Resources

About