有限可用群中状态-通道概率计算的卷积算法

M. Głąbowski, A. Kaliszan, M. Stasiak
{"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}
引用次数: 7

摘要

本文给出了有限可用群广义模型中占位分布和阻塞概率的近似计算方法。该方法的基础是一种新的有限可用群状态通道概率估计算法。该算法基于有限可用组中不可用资源分布的卷积运算,用于所提供流量类的调用。该算法具有计算复杂度低的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信