Comparative Analysis of the Queueing Systems E2/M/1 and M/E2/1 with Shifted Distribution Laws

N. Bakhareva, V. Tarasov
{"title":"Comparative Analysis of the Queueing Systems E2/M/1 and M/E2/1 with Shifted Distribution Laws","authors":"N. Bakhareva, V. Tarasov","doi":"10.1109/PICST51311.2020.9468101","DOIUrl":null,"url":null,"abstract":"The objective of this work is to the output the solution in closed form for the average waiting time in a queue for queueing systems with shifted Erlangian and exponential input distributions and comparative analysis of their results with the results for conventional systems. As is known from queuing theory, the average waiting time for requirements in a queue is the main characteristic of a queuing system. To solve this problem, we used the classical method of spectral decomposition of the solution of Lindley integral equation, which allows one to obtain a solution for average the waiting time for systems under consideration in a closed form. The method of spectral decomposition of the solution of Lindley integral equation plays an important role in the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used. The introduction of the time shift parameter in the laws of input flow distribution and service time for the systems under consideration turns them into systems with a delay with a shorter waiting time. This is because the time shift operation reduces the coefficient of variation in the intervals between the receipts of the requirements and their service time, and as is known from queuing theory, the average wait time of requirements is related to these coefficients of variation by a quadratic dependence. The obtained results expand and supplement the well-known incomplete formula of the queuing theory for the average waiting time of requirements in the queue for G/G/1 systems.","PeriodicalId":123008,"journal":{"name":"2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICST51311.2020.9468101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The objective of this work is to the output the solution in closed form for the average waiting time in a queue for queueing systems with shifted Erlangian and exponential input distributions and comparative analysis of their results with the results for conventional systems. As is known from queuing theory, the average waiting time for requirements in a queue is the main characteristic of a queuing system. To solve this problem, we used the classical method of spectral decomposition of the solution of Lindley integral equation, which allows one to obtain a solution for average the waiting time for systems under consideration in a closed form. The method of spectral decomposition of the solution of Lindley integral equation plays an important role in the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used. The introduction of the time shift parameter in the laws of input flow distribution and service time for the systems under consideration turns them into systems with a delay with a shorter waiting time. This is because the time shift operation reduces the coefficient of variation in the intervals between the receipts of the requirements and their service time, and as is known from queuing theory, the average wait time of requirements is related to these coefficients of variation by a quadratic dependence. The obtained results expand and supplement the well-known incomplete formula of the queuing theory for the average waiting time of requirements in the queue for G/G/1 systems.
具有移位分布律的排队系统E2/M/1与M/E2/1的比较分析
这项工作的目的是输出具有移位的Erlangian和指数输入分布的排队系统的平均等待时间的封闭解,并将其结果与传统系统的结果进行比较分析。从排队理论可知,排队中需求的平均等待时间是排队系统的主要特征。为了解决这一问题,我们采用了经典的Lindley积分方程解的谱分解方法,该方法可以得到考虑系统在封闭形式下的平均等待时间的解。林德利积分方程解的谱分解方法在系统G/G/1理论中占有重要地位。对于所得结果的实际应用,采用了众所周知的概率论矩法。在所考虑的系统的输入流分布规律和服务时间规律中引入时移参数,使其成为具有较短等待时间的延迟系统。这是因为时移操作减少了需求接收与其服务时间之间间隔的变化系数,并且正如排队理论所知,需求的平均等待时间与这些变化系数以二次依赖关系相关。所得结果扩展和补充了G/G/1系统的排队中需求平均等待时间的排队理论的不完全公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信