Analysis of stationary queue-length distributions of the BMAP/R(a,b)/1 queue

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2020-07-02 DOI:10.1080/23799927.2020.1797883
S. K. Samanta, B. Bank
{"title":"Analysis of stationary queue-length distributions of the BMAP/R(a,b)/1 queue","authors":"S. K. Samanta, B. Bank","doi":"10.1080/23799927.2020.1797883","DOIUrl":null,"url":null,"abstract":"This paper investigates an infinite waiting space single-server queueing system in which customers arrive according to a batch Markovian arrival process. The server serves the customers in batches of maximum size ‘b’ with a minimum threshold value ‘a’. The service time of each batch follows R-type distribution, where R-type distribution represents a class of distributions whose Laplace-Stieltjes transform is rational or approximated rational function, which is independent of service batch size and the arrival process. We determine the queue-length distribution at departure epoch in terms of roots of the associated characteristic equation of the vector probability generating function. To show the strength and advantage of roots method, we also provide a comprehensive analysis of the queue-length distribution at departure epoch using the matrix-analytic method (MAM). To determine the queue-length distribution at random epoch, we obtain a relation between the queue-length distributions at departure and random epochs using the supplementary variable technique with remaining service time of a batch in service as the supplementary variable. We also derive the queue-length distributions at pre-arrival epoch of an arrived batch and post-arrival epoch of a random customer of an arrived batch. Some numerical results are demonstrated for different service-time distributions to show the key performance measures of the system.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2020.1797883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 5

Abstract

This paper investigates an infinite waiting space single-server queueing system in which customers arrive according to a batch Markovian arrival process. The server serves the customers in batches of maximum size ‘b’ with a minimum threshold value ‘a’. The service time of each batch follows R-type distribution, where R-type distribution represents a class of distributions whose Laplace-Stieltjes transform is rational or approximated rational function, which is independent of service batch size and the arrival process. We determine the queue-length distribution at departure epoch in terms of roots of the associated characteristic equation of the vector probability generating function. To show the strength and advantage of roots method, we also provide a comprehensive analysis of the queue-length distribution at departure epoch using the matrix-analytic method (MAM). To determine the queue-length distribution at random epoch, we obtain a relation between the queue-length distributions at departure and random epochs using the supplementary variable technique with remaining service time of a batch in service as the supplementary variable. We also derive the queue-length distributions at pre-arrival epoch of an arrived batch and post-arrival epoch of a random customer of an arrived batch. Some numerical results are demonstrated for different service-time distributions to show the key performance measures of the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
BMAP/R(a,b)/1队列平稳队列长度分布分析
本文研究了一类无限等待空间单服务器排队系统,该系统中顾客按批马尔可夫到达过程到达。服务器以最大大小为“b”的批为客户提供服务,最小阈值为“a”。每批服务时间服从r型分布,其中r型分布表示一类Laplace-Stieltjes变换为有理或近似有理函数的分布,与服务批大小和到达过程无关。我们用向量概率生成函数的相关特征方程的根来确定出发时刻的队列长度分布。为了显示根方法的优势和优势,我们还使用矩阵解析方法(MAM)对出发时刻的队列长度分布进行了全面的分析。为了确定随机时刻的队列长度分布,我们采用补充变量技术,以在役批的剩余服务时间为补充变量,得到了出发时刻队列长度分布与随机时刻队列长度分布之间的关系。我们还推导了到达批的随机顾客到达前和到达后的队列长度分布。针对不同的服务时间分布,给出了一些数值结果,以显示系统的关键性能指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Computer Mathematics: Computer Systems Theory
International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics
CiteScore
1.80
自引率
0.00%
发文量
11
期刊最新文献
On Hendecagonal Circular Ladder and its Metric Dimension Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Line Segment Arrangements Improved Approximate Dispersion Relation Analysis Using Deep Neural Network A key exchange protocol and a cryptosystem based on the generalized decomposition problem Real iterative algorithms for solving a complex matrix equation with two unknowns
×
引用
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