{"title":"有限可用群中状态-通道概率计算的卷积算法","authors":"M. Głąbowski, A. Kaliszan, M. Stasiak","doi":"10.1109/AICT.2008.45","DOIUrl":null,"url":null,"abstract":"In this paper it is proposed an approximate method of calculations of occupancy distribution and blocking probability in a generalized model of a limited-availability group. The basis of the proposed method is a new algorithm of state-passage probabilities estimation in the limited-availability group. The algorithm is based on the convolution operation of distributions of unavailable resources in the limited-availability group for calls of offered traffic classes. The proposed algorithm is characterized by low order of computational complexity.","PeriodicalId":105735,"journal":{"name":"2008 Fourth Advanced International Conference on Telecommunications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Convolution Algorithm for State-Passage Probabilities Calculation in Limited-Availability Group\",\"authors\":\"M. Głąbowski, A. Kaliszan, M. Stasiak\",\"doi\":\"10.1109/AICT.2008.45\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper it is proposed an approximate method of calculations of occupancy distribution and blocking probability in a generalized model of a limited-availability group. The basis of the proposed method is a new algorithm of state-passage probabilities estimation in the limited-availability group. The algorithm is based on the convolution operation of distributions of unavailable resources in the limited-availability group for calls of offered traffic classes. The proposed algorithm is characterized by low order of computational complexity.\",\"PeriodicalId\":105735,\"journal\":{\"name\":\"2008 Fourth Advanced International Conference on Telecommunications\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth Advanced International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICT.2008.45\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth Advanced International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT.2008.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Convolution Algorithm for State-Passage Probabilities Calculation in Limited-Availability Group
In this paper it is proposed an approximate method of calculations of occupancy distribution and blocking probability in a generalized model of a limited-availability group. The basis of the proposed method is a new algorithm of state-passage probabilities estimation in the limited-availability group. The algorithm is based on the convolution operation of distributions of unavailable resources in the limited-availability group for calls of offered traffic classes. The proposed algorithm is characterized by low order of computational complexity.