You are not logged in.
Openly accessible

A flexible receiver-driven cache replacement scheme for continuous media objects in best-effort networks

Lau, W. H. O., Kumar, M. and Venkatesh, S. 2001, A flexible receiver-driven cache replacement scheme for continuous media objects in best-effort networks, in HICSS-34 2001 : Proceedings of the Hawaii International Conference on System Sciences, IEEE, Washington, D. C., pp. 1-10, doi: 10.1109/HICSS.2001.927218.

Attached Files
Name Description MIMEType Size Downloads
venkatesh-aflexible-2001.pdf Published version application/pdf 431.99KB 59

Title A flexible receiver-driven cache replacement scheme for continuous media objects in best-effort networks
Author(s) Lau, W. H. O.
Kumar, M.
Venkatesh, S.ORCID iD for Venkatesh, S. orcid.org/0000-0001-8675-6631
Conference name Hawaii International Conference on System Sciences (34th : 2001 : Maui, Hawaii)
Conference location Maui, Hawaii
Conference dates 3-6 Jan. 2001
Title of proceedings HICSS-34 2001 : Proceedings of the Hawaii International Conference on System Sciences
Editor(s) [Unknown]
Publication date 2001
Conference series Hawaii International Conference on System Sciences
Start page 1
End page 10
Total pages 10
Publisher IEEE
Place of publication Washington, D. C.
Keyword(s) caching
continuous media
Summary In this paper, we investigate the potential of caching to improve quality of reception (QoR) in the context of continuous media applications over best-effort networks. Specifically, we investigate the influence of parameters such as loss rate, jitter, delay and area in determining a proxy's cache contents. We propose the use of a flexible cost function in caching algorithms and develop a framework for benchmarking continuous media caching algorithms. The cost function incorporates parameters in which, an administrator and or a client can tune to influence a proxy's cache. Traditional caching systems typically base decisions around static schemes that do not take into account the interest of their receiver pool. Based on the flexible cost function, an improvised Greedy Dual (GD) algorithm called GD-multi has been developed for layered multiresolution multimedia streams. The effectiveness of the proposed scheme is evaluated by simulation-based performance studies. Performance of several caching schemes are evaluated and compared with those of the proposed scheme. Our empirical results indicate GD-multi performs well despite employing a generalized caching policy.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 0769509819
ISSN 1060-3425
Language eng
DOI 10.1109/HICSS.2001.927218
Field of Research 089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1.1 Full written paper - refereed
Copyright notice ©2001, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30044529

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 3 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 232 Abstract Views, 59 File Downloads  -  Detailed Statistics
Created: Fri, 20 Apr 2012, 11:29:53 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.