Analytically Simple and Computationally Efficient Results for the GIX/Geo/c Queues

IF 1 Q3 STATISTICS & PROBABILITY
M. Chaudhry, James J. Kim, A. Banik
{"title":"Analytically Simple and Computationally Efficient Results for the GIX/Geo/c Queues","authors":"M. Chaudhry, James J. Kim, A. Banik","doi":"10.1155/2019/6480139","DOIUrl":null,"url":null,"abstract":"A simple solution to determine the distributions of queue-lengths at different observation epochs for the model GIX/Geo/c is presented. In the past, various discrete-time queueing models, particularly the multiserver bulk-arrival queues, have been solved using complicated methods that lead to incomplete results. The purpose of this paper is to use the roots method to solve the model GIX/Geo/c that leads to a result that is analytically elegant and computationally efficient. This method works well even for the case when the inter-batch-arrival times follow heavy-tailed distributions. The roots of the underlying characteristic equation form the basis for all distributions of queue-lengths at different time epochs.","PeriodicalId":44760,"journal":{"name":"Journal of Probability and Statistics","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2019-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2019/6480139","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Probability and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2019/6480139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 5

Abstract

A simple solution to determine the distributions of queue-lengths at different observation epochs for the model GIX/Geo/c is presented. In the past, various discrete-time queueing models, particularly the multiserver bulk-arrival queues, have been solved using complicated methods that lead to incomplete results. The purpose of this paper is to use the roots method to solve the model GIX/Geo/c that leads to a result that is analytically elegant and computationally efficient. This method works well even for the case when the inter-batch-arrival times follow heavy-tailed distributions. The roots of the underlying characteristic equation form the basis for all distributions of queue-lengths at different time epochs.
GIX/Geo/c队列的简单解析和高效计算结果
给出了一种确定模型GIX/Geo/c在不同观测时段的排队长度分布的简单解。在过去,各种离散时间队列模型,特别是多服务器批量到达队列,一直使用复杂的方法来解决,导致结果不完整。本文的目的是使用根法求解模型GIX/Geo/c,从而得到解析优雅且计算效率高的结果。这种方法即使在批间到达时间遵循重尾分布的情况下也能很好地工作。底层特征方程的根构成了不同时间点上所有队列长度分布的基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Probability and Statistics
Journal of Probability and Statistics STATISTICS & PROBABILITY-
自引率
0.00%
发文量
14
审稿时长
18 weeks
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信