Utilizing group prediction by users' interests to improve the performance of web proxy servers

Tsozen Yeh, Liang-fan Chang
{"title":"Utilizing group prediction by users' interests to improve the performance of web proxy servers","authors":"Tsozen Yeh, Liang-fan Chang","doi":"10.1109/APNOMS.2014.6996559","DOIUrl":null,"url":null,"abstract":"Companies and institutions often use Web proxy servers to service the multiple requests of the same Web pages (or Web objects) from users therein to save the network bandwidth and reduce the Internet latency. Web proxy servers usually are geographically close to their clients (users). If Web proxy serves have cached valid copies of requested Web objects, they can be directly delivered to users. Otherwise, users need to spend a long time on getting Web objects from their hosting Web servers. Both cases will require users to wait for their requests. This period of latency can be largely reduced if Web proxy servers could predict what Web objects users may need in the near future, and send those predicted Web objects to the client sites before their actual usage. Various predicting algorithms, such as those based on temporal locality and data mining, had been proposed to enable proxy servers to make prediction of what Web objects users may access. However, they often need to constantly update and maintain their models in realtime to make their schemes effective. As a result, for proxy servers servicing a large number of users, schemes demanding for complicated and realtime calculation will not be as useful as expected in practice. Based on Web sites and Web pages commonly visited by users, we proposed a new model with an offline learning algorithm to help Web proxy servers make prediction about upcoming requests of Web objects from users. Compared with the hit ratio achieved by the original environment without prediction, our model can improve the caching performance of users' Web browsers by up to 51.37%.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 16th Asia-Pacific Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2014.6996559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Companies and institutions often use Web proxy servers to service the multiple requests of the same Web pages (or Web objects) from users therein to save the network bandwidth and reduce the Internet latency. Web proxy servers usually are geographically close to their clients (users). If Web proxy serves have cached valid copies of requested Web objects, they can be directly delivered to users. Otherwise, users need to spend a long time on getting Web objects from their hosting Web servers. Both cases will require users to wait for their requests. This period of latency can be largely reduced if Web proxy servers could predict what Web objects users may need in the near future, and send those predicted Web objects to the client sites before their actual usage. Various predicting algorithms, such as those based on temporal locality and data mining, had been proposed to enable proxy servers to make prediction of what Web objects users may access. However, they often need to constantly update and maintain their models in realtime to make their schemes effective. As a result, for proxy servers servicing a large number of users, schemes demanding for complicated and realtime calculation will not be as useful as expected in practice. Based on Web sites and Web pages commonly visited by users, we proposed a new model with an offline learning algorithm to help Web proxy servers make prediction about upcoming requests of Web objects from users. Compared with the hit ratio achieved by the original environment without prediction, our model can improve the caching performance of users' Web browsers by up to 51.37%.
利用用户兴趣分组预测提高web代理服务器性能
公司和机构经常使用Web代理服务器来服务用户对同一Web页面(或Web对象)的多个请求,以节省网络带宽和减少Internet延迟。Web代理服务器通常在地理位置上靠近其客户端(用户)。如果Web代理服务缓存了请求的Web对象的有效副本,它们就可以直接传递给用户。否则,用户需要花费很长时间从其托管Web服务器获取Web对象。这两种情况都需要用户等待他们的请求。如果Web代理服务器能够预测用户在不久的将来可能需要哪些Web对象,并在实际使用之前将这些预测的Web对象发送到客户端站点,则可以大大减少这段时间的延迟。已经提出了各种预测算法,例如基于时间局部性和数据挖掘的预测算法,以使代理服务器能够预测用户可能访问的Web对象。然而,他们经常需要不断地实时更新和维护他们的模型,以使他们的方案有效。因此,对于服务于大量用户的代理服务器,需要复杂和实时计算的方案在实践中并不像预期的那样有用。基于用户经常访问的网站和网页,提出了一种基于离线学习算法的新模型,帮助Web代理服务器预测用户对Web对象的即将请求。与没有预测的原始环境相比,我们的模型可以将用户Web浏览器的缓存性能提高51.37%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信