Numerical analysis of finite source Markov retrial system with non-reliable server, collision, and impatient customers

IF 0.3 Q4 MATHEMATICS Annales Mathematicae et Informaticae Pub Date : 2020-01-01 DOI:10.33039/ami.2020.07.008
A. Kuki, T. Bérczes, Á. Tóth, J. Sztrik
{"title":"Numerical analysis of finite source Markov retrial system with non-reliable server, collision, and impatient customers","authors":"A. Kuki, T. Bérczes, Á. Tóth, J. Sztrik","doi":"10.33039/ami.2020.07.008","DOIUrl":null,"url":null,"abstract":"A retrial queuing system with a single server is investigated in this paper. The server is subject to random breakdowns. The number of customers is finite and collision may take place. A collision occurs when a customer arrives to the busy server. In case of a collision both customers involved in the collision are sent back to the orbit. From the orbit the customers retry their requests after a random waiting time. The server can be down due to a failure. During the failed period the arriving customers are sent to the orbit, as well. The novelty of this analysis is the impatient behaviour of the customers. A customer waiting in the orbit may leave it after a random waiting time. The requests of these customers will not be served. All the random variables included in the model construction are assumed to be exponentially distributed and independent from each other. The impatient property makes the model more complex, so the derivation of a direct algorithmic solution (which was provided for the non-impatient case) is difficult. For numerical calculations the MOSEL-2 tool can be used. This tool solves the Kolmogorov system equations, and from the resulting steady-state probabilities various system characteristics and performance measures can be calculated, i.e. mean response time, mean waiting time in the orbit, utilization of the server, probability of the unserved impatient requests. Principally the effect of the impatient property is investigated in these results, which are presented graphically, as well.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae et Informaticae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33039/ami.2020.07.008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 6

Abstract

A retrial queuing system with a single server is investigated in this paper. The server is subject to random breakdowns. The number of customers is finite and collision may take place. A collision occurs when a customer arrives to the busy server. In case of a collision both customers involved in the collision are sent back to the orbit. From the orbit the customers retry their requests after a random waiting time. The server can be down due to a failure. During the failed period the arriving customers are sent to the orbit, as well. The novelty of this analysis is the impatient behaviour of the customers. A customer waiting in the orbit may leave it after a random waiting time. The requests of these customers will not be served. All the random variables included in the model construction are assumed to be exponentially distributed and independent from each other. The impatient property makes the model more complex, so the derivation of a direct algorithmic solution (which was provided for the non-impatient case) is difficult. For numerical calculations the MOSEL-2 tool can be used. This tool solves the Kolmogorov system equations, and from the resulting steady-state probabilities various system characteristics and performance measures can be calculated, i.e. mean response time, mean waiting time in the orbit, utilization of the server, probability of the unserved impatient requests. Principally the effect of the impatient property is investigated in these results, which are presented graphically, as well.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有不可靠服务器、碰撞和客户不耐烦的有限源马尔可夫再审系统的数值分析
研究了一种单服务器的重审排队系统。服务器随时可能发生故障。客户数量有限,可能会发生碰撞。当客户到达繁忙的服务器时发生冲突。一旦发生碰撞,参与碰撞的两名乘客都将被送回轨道。在轨道上,客户在随机等待一段时间后重试他们的请求。服务器可能由于故障而关闭。在失败期间,到达的客户也被送到轨道上。这种分析的新颖之处在于顾客的不耐烦行为。在轨道上等待的顾客可以在随机等待时间后离开。这些客户的请求将不会得到满足。模型构建中包含的所有随机变量都假定为指数分布且相互独立。非不耐烦的性质使模型更加复杂,因此很难推导出直接的算法解(针对非不耐烦的情况)。对于数值计算,可以使用MOSEL-2工具。该工具求解Kolmogorov系统方程,并从得到的稳态概率中计算出各种系统特性和性能度量,即平均响应时间、轨道平均等待时间、服务器利用率、未服务的不耐烦请求的概率。在这些结果中,主要研究了不耐烦性质的影响,并以图形形式给出了结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
0
期刊最新文献
Using irreducible polynomials for random number generation Solving Hungarian natural language processing tasks with multilingual generative models Stability condition of multiclass classical retrials: a revised regenerative proof Sensitivity analysis of a single server finite-source retrial queueing system with two-way communication and catastrophic breakdown using simulation On the generalized Fibonacci like sequences and matrices
×
引用
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