Window-Based Popularity Caching for IPTV On-Demand Services

Chiu, Hsuan-Chao; Chang, Chi-He; Tseng, Chao-Wei; Liu, Chi-Shi

doi:10.5402/2011/201314

Cited by 2 publications

(3 citation statements)

References 14 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5a, the results obtained through SIM-PRO simulations 6 are almost identical to the original results with a maximum difference of 2 % (for time = 58 min 7 ). This permits us to expect that the results produced by SIMPRO in functional mode are valid, although we are not able to validate the entire set of metrics measured by our simulator due to the unavailability of measurements performed with the same metrics by the CCVC authors.…”

Section: Validation Of the Performance Datasupporting

confidence: 58%

“…6 Thirty simulations were executed obtaining a confidence of at least 95 % to a confidence interval less than 1 % of the measurement value. 7 Equivalent to 3,480 rounds of service executed or 3,480 Mbits of video transmitted at 1Mbps (considering the transmission to the first client to become active in the system). 8 As a partial criterion, along with the size of sequences.…”

Section: Endnotesmentioning

confidence: 99%

“…Many caching algorithms use the history of the access pattern of the clients as a reference to try to predict which portions of the collection will be needed in the future [6][7][8][9][10][11]. Thus, the most accessed video objects should be stored in the cache in order to easily serve future requests.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A novel caching algorithm for VoD proxy implementation and its evaluation including a new set of metrics for efficiency analysis

2015

View full text Add to dashboard Cite

Background: Video on demand (VoD) is a fast-growing digital service that requires a substantial amount of hardware resources for its implementation. To reduce the costs of running this service, an alternative is to use proxies that cache the most important portions of the video collection in order to meet the demand for this content in place of the primary server of the VoD system. Methods: To improve the efficiency of the proxies, we proposed a novel caching algorithm that explores the positioning of the active clients to determine the density of clients inside a time window existing in front of each video chunk. The algorithm attributes a higher caching priority to the video chunks with greater aggregate density in the memory. To evaluate our approach, we compared it with others of similar nature using both traditional metrics like hit ratio, as well as physical metrics such as the use of processing resources. This complementary set of metrics is produced by our simulator that, as far as we know, is the first one of its kind to enable the evaluation of hardware consumption used to implement the VoD proxy. Results: Results show that the novel algorithm can achieve a higher hit ratio while requiring a little more effort from the hardware. Additionally, it was identified that the processor constitutes the major bottleneck to this application when demand increases. Conclusions: Among the recent emergence of caching strategies which consider the positioning of clients as criterion for caching, the strategy of prioritizing the chunks with greater density of previous clients showed to be a more efficient solution.

show abstract

Section: Validation Of the Performance Datasupporting

confidence: 58%