{"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}
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