Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.jpdc.2010.06.008
DC FieldValue
dc.titleA novel server-side proxy caching strategy for large-scale multimedia applications
dc.contributor.authorZeng, Z.
dc.contributor.authorVeeravalli, B.
dc.contributor.authorLi, K.
dc.date.accessioned2014-06-16T09:33:20Z
dc.date.available2014-06-16T09:33:20Z
dc.date.issued2011-04
dc.identifier.citationZeng, Z., Veeravalli, B., Li, K. (2011-04). A novel server-side proxy caching strategy for large-scale multimedia applications. Journal of Parallel and Distributed Computing 71 (4) : 525-536. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jpdc.2010.06.008
dc.identifier.issn07437315
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/54648
dc.description.abstractNowadays, server-side Web caching becomes an important technique used to reduce the User Perceived Latency (UPL). In large-scale multimedia systems, there are many Web proxies, connected with a multimedia server, that can cache some most popular multimedia objects and respond to the requests for them. Multimedia objects have some particular characteristic, e.g., strict QoS requirements. Hence, even some efficient conventional caching strategies based on cache hit ratio, meant for non-multimedia objects, will confront some problems in dealing with the multimedia objects. If we consider additional resources of proxy besides cache space, say bandwidth, we can readily observe that high hit ratios may deteriorate the entire system performance. In this paper, we propose a novel placement model for networked multimedia systems, referred to as the HkT model, which considers the combined influence of arrival rate, size, and playback time to select the objects to be cached. Based on this model, we propose an innovative Web caching algorithm, named as the ART-Greedy algorithm, which can balance the load among the proxies and achieve a minimum Average Response Time (ART) of the requests. Our experimental results conclusively demonstrate that the ART-Greedy algorithm outperforms the most popular and commonly used LFU (Least Frequently Used) algorithm significantly, and can achieve a better performance than the byte-hit algorithm when the system utilization is medium and high. © 2010 Elsevier Inc. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.jpdc.2010.06.008
dc.sourceScopus
dc.subjectAverage response time
dc.subjectLayered encoded video
dc.subjectQuality of Service
dc.subjectQueueing theory
dc.subjectVideo-on-Demand
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1016/j.jpdc.2010.06.008
dc.description.sourcetitleJournal of Parallel and Distributed Computing
dc.description.volume71
dc.description.issue4
dc.description.page525-536
dc.description.codenJPDCE
dc.identifier.isiut000288354500001
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Sep 28, 2022

WEB OF SCIENCETM
Citations

4
checked on Sep 28, 2022

Page view(s)

185
checked on Sep 22, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.