ISDN环中的阻塞

G. Stamatelos, J. Hayes
{"title":"ISDN环中的阻塞","authors":"G. Stamatelos, J. Hayes","doi":"10.1109/PACRIM.1989.48321","DOIUrl":null,"url":null,"abstract":"Results are presented of an exact analysis of the blocking conditions in a N nodes ring accessed by different classes of traffic. Blocking of a call request occurs when the number of slots required for the message transmission is not available on one (or more) of the tandem links that it traverses. The complexity of the technique proposed for the computation of the q(.) function increases exponentially with the number of nodes in the system. An approximation, therefore, may be required for the analysis of larger systems. The validity of the present work is not limited by this observation.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Blocking in an ISDN ring\",\"authors\":\"G. Stamatelos, J. Hayes\",\"doi\":\"10.1109/PACRIM.1989.48321\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Results are presented of an exact analysis of the blocking conditions in a N nodes ring accessed by different classes of traffic. Blocking of a call request occurs when the number of slots required for the message transmission is not available on one (or more) of the tandem links that it traverses. The complexity of the technique proposed for the computation of the q(.) function increases exponentially with the number of nodes in the system. An approximation, therefore, may be required for the analysis of larger systems. The validity of the present work is not limited by this observation.<<ETX>>\",\"PeriodicalId\":256287,\"journal\":{\"name\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1989.48321\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1989.48321","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文给出了一种精确分析N节点环中不同类型流量访问阻塞条件的结果。当消息传输所需的槽数在它所遍历的一个(或多个)串联链路上不可用时,就会发生呼叫请求阻塞。所提出的计算q(.)函数的技术的复杂性随着系统中节点的数量呈指数增长。因此,在分析较大的系统时可能需要近似。本研究的有效性不受这一观察结果的限制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Blocking in an ISDN ring
Results are presented of an exact analysis of the blocking conditions in a N nodes ring accessed by different classes of traffic. Blocking of a call request occurs when the number of slots required for the message transmission is not available on one (or more) of the tandem links that it traverses. The complexity of the technique proposed for the computation of the q(.) function increases exponentially with the number of nodes in the system. An approximation, therefore, may be required for the analysis of larger systems. The validity of the present work is not limited by this observation.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信