Yukai Tu, Xiuquan Qiao, Guoshun Nan, Junliang Chen, Shasha Li
{"title":"基于优先级的以内容为中心的Web服务器动态Web请求调度","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":"{\"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}","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}
A Priority-Based Dynamic Web Requests Scheduling for Web Servers over Content-Centric Networking
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.