{"title":"Queue Length in a System with an Autoregressive Hyperexponential Incoming Flow at a Critical Load","authors":"","doi":"10.3103/s0278641923040118","DOIUrl":null,"url":null,"abstract":"<span> <h3>Abstract</h3> <p>A study is performed of a single-channel queuing system with two classes of priority requests, a relative priority discipline, a Poisson incoming flow with random intensity, and an infinite number of waiting places. The intensity is selected at the moment the countdown begins until the next request arrives, and the intensity does not change with a predetermined probability. The limit distribution of the number of requests of the lowest priority class at a critical system load is found.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"37 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Computational Mathematics and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s0278641923040118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A study is performed of a single-channel queuing system with two classes of priority requests, a relative priority discipline, a Poisson incoming flow with random intensity, and an infinite number of waiting places. The intensity is selected at the moment the countdown begins until the next request arrives, and the intensity does not change with a predetermined probability. The limit distribution of the number of requests of the lowest priority class at a critical system load is found.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
