An M/M/1-Type Queue with an Individual Deterministic Retrial Rate

Y. Shaki, M. Haviv, Uri Yechieli
{"title":"An M/M/1-Type Queue with an Individual Deterministic Retrial Rate","authors":"Y. Shaki, M. Haviv, Uri Yechieli","doi":"10.1109/SMRLO.2016.111","DOIUrl":null,"url":null,"abstract":"Consider a system where customers arrive to a single-server queue according to a Poisson process with rate λ. The service times are independent and exponential distributed with rate μ. A customer who arrives when the server is busy is blocked and goes to orbit. Each orbit customer then every T units of time to re-enter the system. If he is blocked again, he will keep trying every T units of time. Balking is not allowed. In this paper, we consider retrial policy with deterministic T and we calculate the expected number of customers in orbit (without using balance equations).","PeriodicalId":254910,"journal":{"name":"2016 Second International Symposium on Stochastic Models in Reliability Engineering, Life Science and Operations Management (SMRLO)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Second International Symposium on Stochastic Models in Reliability Engineering, Life Science and Operations Management (SMRLO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMRLO.2016.111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Consider a system where customers arrive to a single-server queue according to a Poisson process with rate λ. The service times are independent and exponential distributed with rate μ. A customer who arrives when the server is busy is blocked and goes to orbit. Each orbit customer then every T units of time to re-enter the system. If he is blocked again, he will keep trying every T units of time. Balking is not allowed. In this paper, we consider retrial policy with deterministic T and we calculate the expected number of customers in orbit (without using balance equations).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有个体确定性重审率的M/M/1型队列
考虑一个系统,其中客户根据速率为λ的泊松过程到达单服务器队列。服务时间是独立的,以速率μ为指数分布。在服务器繁忙时到达的客户被阻塞并进入轨道。每个轨道客户然后每T个单位的时间重新进入系统。如果他再次被阻挡,他将每T个单位的时间继续尝试一次。不允许犹豫。本文考虑具有确定性T的重审策略,并计算在轨客户的期望数量(不使用平衡方程)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Health - Promoting Nature of the Urban Space Stochastic Analysis of Systems Exposed to Very Unlikely Faults In Memory of Professor Igor Ushakov: In Memory of Our Colleague and Friend Holistic Approach to Passenger Terminal Risk Estimation Effective Bandwidth Estimation in Highly Reliable Regenerative Networks
×
引用
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