Bottleneck-Aware Resource Allocation for Service Processes: A New Max-Min Approach

IF 0.8 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Web Services Research Pub Date : 2021-01-01 DOI:10.4018/IJWSR.2021070101
Shou-lu Hou, Wei Ni, Ming Wang, Xiulei Liu, Qiang Tong, Shiping Chen
{"title":"Bottleneck-Aware Resource Allocation for Service Processes: A New Max-Min Approach","authors":"Shou-lu Hou, Wei Ni, Ming Wang, Xiulei Liu, Qiang Tong, Shiping Chen","doi":"10.4018/IJWSR.2021070101","DOIUrl":null,"url":null,"abstract":"In 5G systems and beyond, traditional generic service models are no longer appropriate for highly customized and intelligent services. The process of reinventing service models involves allocating available resources, where the performance of service processes is determined by the activity node with the lowest service rate. This paper proposes a new bottleneck-aware resource allocation approach by formulating the resource allocation as a max-min problem. The approach can allocate resources proportional to the workload of each activity, which can guarantee that the service rates of activities within a process are equal or close-to-equal. Based on the business process simulator (i.e., BIMP) simulation results show that the approach is able to reduce the average cycle time and improve resource utilization, as compared to existing alternatives. The results also show that the approach can effectively mitigate the impact of bottleneck activity on the performance of service processes.","PeriodicalId":54936,"journal":{"name":"International Journal of Web Services Research","volume":"23 1","pages":"1-21"},"PeriodicalIF":0.8000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Services Research","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.4018/IJWSR.2021070101","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In 5G systems and beyond, traditional generic service models are no longer appropriate for highly customized and intelligent services. The process of reinventing service models involves allocating available resources, where the performance of service processes is determined by the activity node with the lowest service rate. This paper proposes a new bottleneck-aware resource allocation approach by formulating the resource allocation as a max-min problem. The approach can allocate resources proportional to the workload of each activity, which can guarantee that the service rates of activities within a process are equal or close-to-equal. Based on the business process simulator (i.e., BIMP) simulation results show that the approach is able to reduce the average cycle time and improve resource utilization, as compared to existing alternatives. The results also show that the approach can effectively mitigate the impact of bottleneck activity on the performance of service processes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
服务进程的瓶颈感知资源分配:一种新的Max-Min方法
在5G及以后的系统中,传统的通用业务模式不再适合高度定制化和智能化的业务。重塑服务模型的过程涉及到分配可用资源,其中服务流程的性能由具有最低服务率的活动节点决定。本文提出了一种新的感知瓶颈的资源分配方法,将资源分配表述为极大极小问题。该方法可以根据每个活动的工作负载分配资源,从而保证流程内活动的服务率相等或接近相等。基于业务流程模拟器(即BIMP)的仿真结果表明,与现有替代方案相比,该方法能够缩短平均周期时间并提高资源利用率。结果还表明,该方法可以有效地减轻瓶颈活动对服务流程性能的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Web Services Research
International Journal of Web Services Research 工程技术-计算机:软件工程
CiteScore
2.40
自引率
0.00%
发文量
19
审稿时长
>12 weeks
期刊介绍: The International Journal of Web Services Research (IJWSR) is the first refereed, international publication featuring the latest research findings and industry solutions involving all aspects of Web services technology. This journal covers advancements, standards, and practices of Web services, as well as identifies emerging research topics and defines the future of Web services on grid computing, multimedia, and communication. IJWSR provides an open, formal publication for high quality articles developed by theoreticians, educators, developers, researchers, and practitioners for those desiring to stay abreast of challenges in Web services technology.
期刊最新文献
A Quasi-Newton Matrix Factorization-Based Model for Recommendation A Service Recommendation Algorithm Based on Self-Attention Mechanism and DeepFM Secure Cloud Storage and Retrieval of Personal Health Data From Smart Wearable Devices With Privacy-Preserving Techniques User Interaction Within Online Innovation Communities Research on a New Reconstruction Technology and Evaluation Method for 3D Digital Core Pore Structure
×
引用
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