Analysis of a Single Server Retrial Queueing System with Finite Capacity, F-Policy, Balking, Reneging and Server Maintenance

R. Jeyachandhiran, P. Rajendran
{"title":"Analysis of a Single Server Retrial Queueing System with Finite Capacity, F-Policy, Balking, Reneging and Server Maintenance","authors":"R. Jeyachandhiran, P. Rajendran","doi":"10.37256/cm.5120243745","DOIUrl":null,"url":null,"abstract":"In this paper, we determine a single server retrial queuing system with finite capacity, F-policy, balking, reneging and server maintenance. The arriving customer when notices the server becomes free, then they get service immediately. In case server becomes busy, the customers are move to either orbit or may balk the system. In the orbit, after some random time the customer repeats their attempts for service. The customers are waiting in the orbit for longer time become impatient and leaves the orbit without getting service. Once the number of customers in the orbit reaches its full capacity then the arrival of customer is not allowed to enter into the orbit. The new customer is allowed into the orbit when the F-policy level is reached. If no more customer in the orbit, server will move to the vacation. By using recursive technique, the steady state distributions are obtained and we have developed various performance measures.","PeriodicalId":504505,"journal":{"name":"Contemporary Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Contemporary Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37256/cm.5120243745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we determine a single server retrial queuing system with finite capacity, F-policy, balking, reneging and server maintenance. The arriving customer when notices the server becomes free, then they get service immediately. In case server becomes busy, the customers are move to either orbit or may balk the system. In the orbit, after some random time the customer repeats their attempts for service. The customers are waiting in the orbit for longer time become impatient and leaves the orbit without getting service. Once the number of customers in the orbit reaches its full capacity then the arrival of customer is not allowed to enter into the orbit. The new customer is allowed into the orbit when the F-policy level is reached. If no more customer in the orbit, server will move to the vacation. By using recursive technique, the steady state distributions are obtained and we have developed various performance measures.
具有有限容量、F 政策、逡巡、背弃和服务器维护的单服务器重试队列系统分析
本文确定了一个具有有限容量、F 策略、逡巡、背弃和服务器维护的单服务器重试排队系统。当发现服务器空闲时,到达的客户会立即得到服务。如果服务器繁忙,客户会被转移到轨道或逡巡系统。在轨道上,经过一段时间后,客户会重复尝试服务。在轨道上等待时间较长的客户会变得不耐烦,并在没有得到服务的情况下离开轨道。一旦轨道中的客户数量达到饱和,就不允许新客户进入轨道。当达到 F 政策水平时,新客户将被允许进入轨道。如果轨道上不再有客户,服务器将转入休假状态。通过使用递归技术,我们获得了稳态分布,并制定了各种性能指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信