面向个性化多媒体业务的高速分布式网络文档缓存策略

B. Veeravalli
{"title":"面向个性化多媒体业务的高速分布式网络文档缓存策略","authors":"B. Veeravalli","doi":"10.1109/ICON.2000.875792","DOIUrl":null,"url":null,"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.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Document caching policies on high-speed distributed networks for personalized multimedia services\",\"authors\":\"B. Veeravalli\",\"doi\":\"10.1109/ICON.2000.875792\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":191244,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2000.875792\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875792","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

根据先前文献中介绍的多媒体信息缓存范例,我们提出了一个多项式时间最优缓存策略,该策略可以最小化用户请求多媒体文档以在高速城域网(MAN)中查看的所有服务请求的总货币成本。我们考虑这样一个场景:来自该网络上一个或多个远程站点的大量客户需要一个位于站点上的多媒体程序,以便在不同的时刻观看。这个分发请求节目的过程涉及到节目在交付给用户所需的观看时间之前的通信成本和缓存成本。我们将MANs配置为全连接拓扑,并表明所请求文档的单个副本足以以最佳方式为高速网络的所有用户请求提供服务。使用此策略,个人服务代理(psa)将决定何时、何地以及必须缓存所请求的程序以获得最佳解决方案的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Document caching policies on high-speed distributed networks for personalized multimedia services
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信