Optimal network proxy caching for image-rich contents

Xuguang Yang; Kannan Ramchandran

doi:10.1117/12.373526

27 December 1999 Optimal network proxy caching for image-rich contents

Xuguang Yang, Kannan Ramchandran

Proceedings Volume 3969, Multimedia Computing and Networking 2000; (1999) https://doi.org/10.1117/12.373526
Event: Electronic Imaging, 2000, San Jose, CA, United States

Abstract

This paper addresses optimizing cache allocation in a distributed image database system over computer networks. We consider progressive image file formats, and `soft' caching strategies, in which each image is allocated a variable amount of cache memory, in an effort to minimize the expected image transmission delay time. A simple and efficient optimization algorithm is proposed, and is generalized to include multiple proxies in a network scenario. With optimality proven, our algorithms are surprisingly simple, and are based on sorting the images according to a special priority index. We also present an adaptive cache allocation/replacement strategy that can be incorporated into web browsers with little computational overhead. Simulation results are presented.

Citation Download Citation

Xuguang Yang and Kannan Ramchandran "Optimal network proxy caching for image-rich contents", Proc. SPIE 3969, Multimedia Computing and Networking 2000, (27 December 1999); https://doi.org/10.1117/12.373526

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available