Please use this identifier to cite or link to this item:
Title: Document caching policies on high-speed distributed networks for personalized multimedia services
Authors: Veeravalli, B. 
Keywords: caching costs
communication costs
metropolitan area networks
Multimedia caching
steiner tree
Issue Date: 2000
Citation: Veeravalli, B. (2000). Document caching policies on high-speed distributed networks for personalized multimedia services. IEEE International Conference on Networks, ICON : 215-219. ScholarBank@NUS Repository.
Abstract: Following the previously introduced multimedia information caching paradigm in the literature, we present a polynomial time optimal caching strategy that minimizes the total monetary cost of all the service requests by the users requesting a multimedia document to view in a high-speed metropolitan area broadband network (MAN). We consider a scenario in which a large pool of customers from one or more number of remote sites on this network demand a multimedia program situated on a site for viewing at different time instants. This process of distribution of the requested program involves communication costs and caching costs of the program before it is delivered to the users at their desired viewing times. We configure the MANs as a fully-connected topology and show that a single copy of the requested document is sufficient to serve all the user requests in an optimal manner, for the case of high speed networks. Using this strategy, the personal service agents (PSAs) will decide when, where, and for how long the requested programs must be cached to obtain an optimal solution. © 2000 IEEE.
Source Title: IEEE International Conference on Networks, ICON
ISBN: 0769507778
ISSN: 15566463
DOI: 10.1109/ICON.2000.875792
Appears in Collections:Staff Publications

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


checked on Jan 15, 2019


checked on Jan 15, 2019

Page view(s)

checked on Dec 8, 2018

Google ScholarTM



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