A Priority-Based Dynamic Web Requests Scheduling for Web Servers over Content-Centric Networking

Yukai Tu, Xiuquan Qiao, Guoshun Nan, Junliang Chen, Shasha Li
{"title":"A Priority-Based Dynamic Web Requests Scheduling for Web Servers over Content-Centric Networking","authors":"Yukai Tu, Xiuquan Qiao, Guoshun Nan, Junliang Chen, Shasha Li","doi":"10.1109/HotWeb.2015.15","DOIUrl":null,"url":null,"abstract":"Content-Centric Networking (CCN) facilitates the content distribution for static Web applications due to its in-network caching. However, when it comes to dynamic Web request, the original fair scheduling of Interest packets on the CCN Web server (i.e. without differentiating a new service request and the service requests being processed) increases the mean response time, resulting in a decrease of service performance. To address this problem, we present a Priority-based Dynamic Web Requests Scheduling (called PBDRS) for CCN Web server. We first increase the priority of the subsequent Interest packet requests belonging to dynamic Web requests being processed, based on the first-come-first-served strategy. Then, services with small-size response data are also scheduled to a higher priority, leveraging the shortest remaining processing time (SRPT) scheduling policy. To validate the proposed approach, we implemented the proposed PBDRS mechanism in our existing CCN Web server and conducted the performance evaluation experiments based on a real dataset crawled from three popular dynamic Web sites of China in a trace-driven way. Experimental results indicate that PBDRS outperforms existing fair scheduling approach of Interest packets in terms of the mean response time.","PeriodicalId":252318,"journal":{"name":"2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HotWeb.2015.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Content-Centric Networking (CCN) facilitates the content distribution for static Web applications due to its in-network caching. However, when it comes to dynamic Web request, the original fair scheduling of Interest packets on the CCN Web server (i.e. without differentiating a new service request and the service requests being processed) increases the mean response time, resulting in a decrease of service performance. To address this problem, we present a Priority-based Dynamic Web Requests Scheduling (called PBDRS) for CCN Web server. We first increase the priority of the subsequent Interest packet requests belonging to dynamic Web requests being processed, based on the first-come-first-served strategy. Then, services with small-size response data are also scheduled to a higher priority, leveraging the shortest remaining processing time (SRPT) scheduling policy. To validate the proposed approach, we implemented the proposed PBDRS mechanism in our existing CCN Web server and conducted the performance evaluation experiments based on a real dataset crawled from three popular dynamic Web sites of China in a trace-driven way. Experimental results indicate that PBDRS outperforms existing fair scheduling approach of Interest packets in terms of the mean response time.
基于优先级的以内容为中心的Web服务器动态Web请求调度
以内容为中心的网络(CCN)由于其网络内缓存,方便了静态Web应用程序的内容分发。然而,当涉及到动态Web请求时,CCN Web服务器上原有的兴趣包公平调度(即不区分新的服务请求和正在处理的服务请求)增加了平均响应时间,导致服务性能下降。为了解决这个问题,我们提出了一种基于优先级的动态Web请求调度(PBDRS)方法。我们首先根据先到先服务的策略,增加后续的兴趣包请求的优先级,这些请求属于正在处理的动态Web请求。然后,具有较小响应数据的服务也被调度到更高的优先级,利用最短剩余处理时间(SRPT)调度策略。为了验证所提出的方法,我们在现有的CCN Web服务器上实现了所提出的PBDRS机制,并基于从中国三个流行的动态网站抓取的真实数据集,以跟踪驱动的方式进行了性能评估实验。实验结果表明,PBDRS在平均响应时间方面优于现有的兴趣分组公平调度方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信