具有个体确定性重审率的M/M/1型队列

2016 Second International Symposium on Stochastic Models in Reliability Engineering, Life Science and Operations Management (SMRLO) Pub Date : 2016-02-15 DOI:10.1109/SMRLO.2016.111

Y. Shaki, M. Haviv, Uri Yechieli

{"title":"具有个体确定性重审率的M/M/1型队列","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":"{\"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}","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

摘要

考虑一个系统，其中客户根据速率为λ的泊松过程到达单服务器队列。服务时间是独立的，以速率μ为指数分布。在服务器繁忙时到达的客户被阻塞并进入轨道。每个轨道客户然后每T个单位的时间重新进入系统。如果他再次被阻挡，他将每T个单位的时间继续尝试一次。不允许犹豫。本文考虑具有确定性T的重审策略，并计算在轨客户的期望数量(不使用平衡方程)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 Second International Symposium on Stochastic Models in Reliability Engineering, Life Science and Operations Management (SMRLO)

自引率

0.00%

发文量