分布式Web系统的自主准入控制策略

N. Bartolini, G. Bongiovanni, S. Silvestri
{"title":"分布式Web系统的自主准入控制策略","authors":"N. Bartolini, G. Bongiovanni, S. Silvestri","doi":"10.1109/MASCOTS.2007.8","DOIUrl":null,"url":null,"abstract":"This paper tackles the problem of autonomic admission control for web clusters. The main contribution of this work is the proposal of a new session admission algorithm that self-configures a dynamic constraint on the rate of incoming new sessions to guarantee the respect of Service Level Agreements (SLA). Unlike other approaches, our policy does not need any prior information on the incoming traffic, nor any assumption on the probability distribution of request inter-arrival or service time. Furthermore, it does not require any manual configuration or parameter tuning. We performed extensive simulations under a range of operating conditions and compared our algorithm to other previously proposed approaches. The simulations show that our policy rapidly adapts to the given traffic profile and improves service throughput while respecting the response time constraints imposed by the SLAs. It also improves service quality by reducing the oscillations of response time and number of active clients common to other policies.","PeriodicalId":335632,"journal":{"name":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Autonomic Admission Control Policy for Distributed Web Systems\",\"authors\":\"N. Bartolini, G. Bongiovanni, S. Silvestri\",\"doi\":\"10.1109/MASCOTS.2007.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper tackles the problem of autonomic admission control for web clusters. The main contribution of this work is the proposal of a new session admission algorithm that self-configures a dynamic constraint on the rate of incoming new sessions to guarantee the respect of Service Level Agreements (SLA). Unlike other approaches, our policy does not need any prior information on the incoming traffic, nor any assumption on the probability distribution of request inter-arrival or service time. Furthermore, it does not require any manual configuration or parameter tuning. We performed extensive simulations under a range of operating conditions and compared our algorithm to other previously proposed approaches. The simulations show that our policy rapidly adapts to the given traffic profile and improves service throughput while respecting the response time constraints imposed by the SLAs. It also improves service quality by reducing the oscillations of response time and number of active clients common to other policies.\",\"PeriodicalId\":335632,\"journal\":{\"name\":\"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOTS.2007.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOTS.2007.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了网络集群的自动接纳控制问题。这项工作的主要贡献是提出了一种新的会话接纳算法,该算法自配置对传入新会话速率的动态约束,以保证对服务水平协议(SLA)的尊重。与其他方法不同,我们的策略不需要任何关于传入流量的先验信息,也不需要任何关于请求到达间隔或服务时间的概率分布的假设。此外,它不需要任何手动配置或参数调优。我们在一系列操作条件下进行了广泛的模拟,并将我们的算法与其他先前提出的方法进行了比较。仿真结果表明,我们的策略可以快速适应给定的流量配置,并在尊重sla施加的响应时间限制的同时提高服务吞吐量。它还通过减少响应时间的波动和其他策略常见的活动客户机数量来提高服务质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Autonomic Admission Control Policy for Distributed Web Systems
This paper tackles the problem of autonomic admission control for web clusters. The main contribution of this work is the proposal of a new session admission algorithm that self-configures a dynamic constraint on the rate of incoming new sessions to guarantee the respect of Service Level Agreements (SLA). Unlike other approaches, our policy does not need any prior information on the incoming traffic, nor any assumption on the probability distribution of request inter-arrival or service time. Furthermore, it does not require any manual configuration or parameter tuning. We performed extensive simulations under a range of operating conditions and compared our algorithm to other previously proposed approaches. The simulations show that our policy rapidly adapts to the given traffic profile and improves service throughput while respecting the response time constraints imposed by the SLAs. It also improves service quality by reducing the oscillations of response time and number of active clients common to other policies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信