{"title":"具有Polya到达过程的排队系统研究","authors":"Seferin Mirtchev","doi":"10.1109/TELECOM50385.2020.9299550","DOIUrl":null,"url":null,"abstract":"The random processes in the telecommunications networks are intensively studied for many decades. In this paper for different teletraffic systems with peaked arrival flow described by the Polya distribution - multi-server queueing system with an infinite number of servers and single-server queue with infinite waiting position at constant service time and at general distributed service time are investigated. Results for the state probabilities and for the mean waiting time are presented, and new formulas for the busy period are derived.","PeriodicalId":300010,"journal":{"name":"2020 28th National Conference with International Participation (TELECOM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Investigation of Queueing Systems with a Polya Arrival Process\",\"authors\":\"Seferin Mirtchev\",\"doi\":\"10.1109/TELECOM50385.2020.9299550\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The random processes in the telecommunications networks are intensively studied for many decades. In this paper for different teletraffic systems with peaked arrival flow described by the Polya distribution - multi-server queueing system with an infinite number of servers and single-server queue with infinite waiting position at constant service time and at general distributed service time are investigated. Results for the state probabilities and for the mean waiting time are presented, and new formulas for the busy period are derived.\",\"PeriodicalId\":300010,\"journal\":{\"name\":\"2020 28th National Conference with International Participation (TELECOM)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 28th National Conference with International Participation (TELECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELECOM50385.2020.9299550\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 28th National Conference with International Participation (TELECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELECOM50385.2020.9299550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Investigation of Queueing Systems with a Polya Arrival Process
The random processes in the telecommunications networks are intensively studied for many decades. In this paper for different teletraffic systems with peaked arrival flow described by the Polya distribution - multi-server queueing system with an infinite number of servers and single-server queue with infinite waiting position at constant service time and at general distributed service time are investigated. Results for the state probabilities and for the mean waiting time are presented, and new formulas for the busy period are derived.