A proposal of Web accesses method considering tolerable delay for each content

Kosuke Watanabe, S. Miyata
{"title":"A proposal of Web accesses method considering tolerable delay for each content","authors":"Kosuke Watanabe, S. Miyata","doi":"10.1145/3427477.3428186","DOIUrl":null,"url":null,"abstract":"When a user browses a web page, user can wait until web page is displayed. This time is called tolerable delay time. A conventional method to maximize the number of web accesses of web page is displayed within tolerable delay time has been proposed. In general some web pages can convert ordinary web pages (ordinary contents) that you usually use to simple web pages (simple contents) reduced contents such as images. By converting from an ordinary content to simple content, the number of web accesses satisfying the tolerable delay time may be increased. However, conventional method assumed that type of content is only the ordinary content. Moreover, tolerable delay time of each content was the fixed value. In this paper, we propose a method to maximize the number of web accesses by converting ordinary contents to simple contents when the waiting time for access does not satisfied tolerable delay time. In addition, we analyze the characteristic of our proposal method by changing tolerable delay time of content.","PeriodicalId":435827,"journal":{"name":"Adjunct Proceedings of the 2021 International Conference on Distributed Computing and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Adjunct Proceedings of the 2021 International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3427477.3428186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When a user browses a web page, user can wait until web page is displayed. This time is called tolerable delay time. A conventional method to maximize the number of web accesses of web page is displayed within tolerable delay time has been proposed. In general some web pages can convert ordinary web pages (ordinary contents) that you usually use to simple web pages (simple contents) reduced contents such as images. By converting from an ordinary content to simple content, the number of web accesses satisfying the tolerable delay time may be increased. However, conventional method assumed that type of content is only the ordinary content. Moreover, tolerable delay time of each content was the fixed value. In this paper, we propose a method to maximize the number of web accesses by converting ordinary contents to simple contents when the waiting time for access does not satisfied tolerable delay time. In addition, we analyze the characteristic of our proposal method by changing tolerable delay time of content.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种考虑各内容可容忍延迟的Web访问方法
当用户浏览网页时,用户可以等待网页显示。这个时间称为可容忍延迟时间。提出了一种在可容忍的延迟时间内使网页访问次数最大化的常规方法。一般有些网页可以将你平时使用的普通网页(普通内容)转换为简单的网页(简单内容),减少了图片等内容。通过将普通内容转换为简单内容,可以增加满足可容忍延迟时间的web访问次数。然而,传统方法假设的内容类型仅为普通内容。各内容的可容忍延迟时间为固定值。在本文中,我们提出了一种当访问等待时间不满足可容忍延迟时间时,通过将普通内容转换为简单内容来最大化web访问次数的方法。此外,我们还通过改变内容的可容忍延迟时间来分析我们的提议方法的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
P2IDF: A Privacy-Preserving based Intrusion Detection Framework for Software Defined Internet of Things-Fog (SDIoT-Fog) Data Analysis for Developing Blood Glucose Level Control System A proposal of Web accesses method considering tolerable delay for each content V2X Communication based Dynamic Topology Control in VANETs Byzantine fault-tolerant consensus over random graph processes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1