具有广义泊松输入流和恒定服务时间的Palm机器维修模型

Seferin Mirtchev
{"title":"具有广义泊松输入流和恒定服务时间的Palm机器维修模型","authors":"Seferin Mirtchev","doi":"10.1109/SOFTCOM.2006.329724","DOIUrl":null,"url":null,"abstract":"This model belongs to the class of queueing systems with feedback. It is M(g)/D/1/k/S queue with generalised Poisson arrival process, constant service time, single server, limited waiting positions and finite number of customers. We use the generalised input Poisson stream that can be peaked, regular or smooth. This model with quasi-random input stream and constant service time is a non-Markov process (renewal process). An algorithm for the calculation of the state probabilities, the time congestion probability, the average delay and the waiting time distributions are presented. It is shown that the variance of the input stream changes significantly the characteristics of this waiting system","PeriodicalId":292242,"journal":{"name":"2006 International Conference on Software in Telecommunications and Computer Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Palm's Machine-Repair Model with a Generalised Poisson Input Stream and Constant Service Time\",\"authors\":\"Seferin Mirtchev\",\"doi\":\"10.1109/SOFTCOM.2006.329724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This model belongs to the class of queueing systems with feedback. It is M(g)/D/1/k/S queue with generalised Poisson arrival process, constant service time, single server, limited waiting positions and finite number of customers. We use the generalised input Poisson stream that can be peaked, regular or smooth. This model with quasi-random input stream and constant service time is a non-Markov process (renewal process). An algorithm for the calculation of the state probabilities, the time congestion probability, the average delay and the waiting time distributions are presented. It is shown that the variance of the input stream changes significantly the characteristics of this waiting system\",\"PeriodicalId\":292242,\"journal\":{\"name\":\"2006 International Conference on Software in Telecommunications and Computer Networks\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Software in Telecommunications and Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOFTCOM.2006.329724\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Software in Telecommunications and Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOFTCOM.2006.329724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

该模型属于带反馈的排队系统。它是广义泊松到达过程、服务时间不变、单服务器、有限等待位置和有限顾客数量的M(g)/D/1/k/S队列。我们使用广义输入泊松流,它可以是峰值的、规则的或平滑的。该模型具有准随机输入流和恒定服务时间,是一个非马尔可夫过程(更新过程)。给出了一种计算状态概率、时间拥塞概率、平均延迟和等待时间分布的算法。结果表明,输入流的方差显著地改变了该等待系统的特性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Palm's Machine-Repair Model with a Generalised Poisson Input Stream and Constant Service Time
This model belongs to the class of queueing systems with feedback. It is M(g)/D/1/k/S queue with generalised Poisson arrival process, constant service time, single server, limited waiting positions and finite number of customers. We use the generalised input Poisson stream that can be peaked, regular or smooth. This model with quasi-random input stream and constant service time is a non-Markov process (renewal process). An algorithm for the calculation of the state probabilities, the time congestion probability, the average delay and the waiting time distributions are presented. It is shown that the variance of the input stream changes significantly the characteristics of this waiting system
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信