不同监控机制下服务组合资源分配的监控

Pan He, Kaigui Wu, Junhao Wen, Jie Xu
{"title":"不同监控机制下服务组合资源分配的监控","authors":"Pan He, Kaigui Wu, Junhao Wen, Jie Xu","doi":"10.1109/CISIS.2011.45","DOIUrl":null,"url":null,"abstract":"As availability of web service has become a great concern in SOA, monitoring mechanism is often deployed to detect and recover failures for service composition. While monitoring mechanism could improve the availability to an extent, it may cost more resources and increase the response time perceived by end users. To decrease the overall usage of monitoring resources, this paper proposes to select some services bringing the highest availability improvement to the composition and allocate monitors on them while leaving others unmonitored. This paper first researched two common monitoring mechanisms in service composition and analyzed their different impact on the service composition QoS values. Then continuous-time Markov chain and discrete-time Markov chain were employed to build the availability model related to the monitoring rate or service pool size according to different kind of monitoring mechanisms. Based on these models, two algorithms were proposed, for two monitoring mechanisms respectively, to allocate monitors in the composition aiming at minimizing the overall number of monitors while making sure the composition availability could meet certain requirements. The monitor allocation algorithm could be used to get the overall number of monitors and those services to monitor in different scenarios. Empirical studies results showed that it was feasible to monitor only some services in the composition to meet certain availability requirement. Monitors allocation decreased the overall number of monitors in the service composition and also decreased the mean response time comparing with the scenario that all services were monitored.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Monitoring Resources Allocation for Service Composition Under Different Monitoring Mechanisms\",\"authors\":\"Pan He, Kaigui Wu, Junhao Wen, Jie Xu\",\"doi\":\"10.1109/CISIS.2011.45\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As availability of web service has become a great concern in SOA, monitoring mechanism is often deployed to detect and recover failures for service composition. While monitoring mechanism could improve the availability to an extent, it may cost more resources and increase the response time perceived by end users. To decrease the overall usage of monitoring resources, this paper proposes to select some services bringing the highest availability improvement to the composition and allocate monitors on them while leaving others unmonitored. This paper first researched two common monitoring mechanisms in service composition and analyzed their different impact on the service composition QoS values. Then continuous-time Markov chain and discrete-time Markov chain were employed to build the availability model related to the monitoring rate or service pool size according to different kind of monitoring mechanisms. Based on these models, two algorithms were proposed, for two monitoring mechanisms respectively, to allocate monitors in the composition aiming at minimizing the overall number of monitors while making sure the composition availability could meet certain requirements. The monitor allocation algorithm could be used to get the overall number of monitors and those services to monitor in different scenarios. Empirical studies results showed that it was feasible to monitor only some services in the composition to meet certain availability requirement. Monitors allocation decreased the overall number of monitors in the service composition and also decreased the mean response time comparing with the scenario that all services were monitored.\",\"PeriodicalId\":203206,\"journal\":{\"name\":\"2011 International Conference on Complex, Intelligent, and Software Intensive Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Complex, Intelligent, and Software Intensive Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISIS.2011.45\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISIS.2011.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

由于web服务的可用性已成为SOA中的一个重要关注点,因此经常部署监视机制来检测和恢复服务组合的故障。虽然监视机制可以在一定程度上提高可用性,但它可能会花费更多的资源,并增加最终用户感知到的响应时间。为了减少监视资源的总体使用,本文建议选择一些服务,为组合带来最大的可用性改进,并在它们上分配监视器,而不监视其他服务。本文首先研究了服务组合中两种常见的监控机制,并分析了它们对服务组合QoS值的不同影响。然后根据不同的监控机制,分别采用连续马尔可夫链和离散马尔可夫链建立与监控率或服务池大小相关的可用性模型。在这些模型的基础上,分别针对两种监控机制,提出了两种算法,在保证组合可用性满足一定要求的前提下,将监视器分配到组合中。监视器分配算法可用于在不同场景中获得监视器和要监视的服务的总数。实证研究结果表明,为了满足一定的可用性要求,仅对组合中的部分服务进行监控是可行的。监视器的分配减少了服务组合中监视器的总数,并且与监视所有服务的场景相比,还减少了平均响应时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Monitoring Resources Allocation for Service Composition Under Different Monitoring Mechanisms
As availability of web service has become a great concern in SOA, monitoring mechanism is often deployed to detect and recover failures for service composition. While monitoring mechanism could improve the availability to an extent, it may cost more resources and increase the response time perceived by end users. To decrease the overall usage of monitoring resources, this paper proposes to select some services bringing the highest availability improvement to the composition and allocate monitors on them while leaving others unmonitored. This paper first researched two common monitoring mechanisms in service composition and analyzed their different impact on the service composition QoS values. Then continuous-time Markov chain and discrete-time Markov chain were employed to build the availability model related to the monitoring rate or service pool size according to different kind of monitoring mechanisms. Based on these models, two algorithms were proposed, for two monitoring mechanisms respectively, to allocate monitors in the composition aiming at minimizing the overall number of monitors while making sure the composition availability could meet certain requirements. The monitor allocation algorithm could be used to get the overall number of monitors and those services to monitor in different scenarios. Empirical studies results showed that it was feasible to monitor only some services in the composition to meet certain availability requirement. Monitors allocation decreased the overall number of monitors in the service composition and also decreased the mean response time comparing with the scenario that all services were monitored.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信