设计可保证可接受阻塞概率的扭曲和折叠-Clos 网络

Haruto Taka;Takeru Inoue;Eiji Oki
{"title":"设计可保证可接受阻塞概率的扭曲和折叠-Clos 网络","authors":"Haruto Taka;Takeru Inoue;Eiji Oki","doi":"10.1109/LNET.2023.3267122","DOIUrl":null,"url":null,"abstract":"A Clos network is well known as a switching network structure that can achieve a strict-sense non-blocking condition. However, the non-blocking condition is too restrictive to increase the switching capacity of Clos network under the constraint of the limited number of switches. This letter proposes a Clos network design model that guarantees an admissible blocking probability to increase the switching capacity. The proposed design model achieves a larger switching capacity in a practical time than the conventional design model that satisfies the strict-sense non-blocking condition, while guaranteeing an admissible blocking probability.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"5 4","pages":"265-269"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Design of Twisted and Folded-Clos Network With Guaranteeing Admissible Blocking Probability\",\"authors\":\"Haruto Taka;Takeru Inoue;Eiji Oki\",\"doi\":\"10.1109/LNET.2023.3267122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Clos network is well known as a switching network structure that can achieve a strict-sense non-blocking condition. However, the non-blocking condition is too restrictive to increase the switching capacity of Clos network under the constraint of the limited number of switches. This letter proposes a Clos network design model that guarantees an admissible blocking probability to increase the switching capacity. The proposed design model achieves a larger switching capacity in a practical time than the conventional design model that satisfies the strict-sense non-blocking condition, while guaranteeing an admissible blocking probability.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"5 4\",\"pages\":\"265-269\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Networking Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10102674/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Networking Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10102674/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

众所周知,Clos 网络是一种可以实现严格意义上的无阻塞条件的交换网络结构。然而,在交换机数量有限的约束下,无阻塞条件对提高 Clos 网络的交换容量限制太多。本文提出了一种 Clos 网络设计模型,它能保证可接受的阻塞概率,从而提高交换容量。与满足严格意义上的无阻塞条件的传统设计模型相比,所提出的设计模型在保证可容许阻塞概率的同时,在实际时间内实现了更大的交换容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Design of Twisted and Folded-Clos Network With Guaranteeing Admissible Blocking Probability
A Clos network is well known as a switching network structure that can achieve a strict-sense non-blocking condition. However, the non-blocking condition is too restrictive to increase the switching capacity of Clos network under the constraint of the limited number of switches. This letter proposes a Clos network design model that guarantees an admissible blocking probability to increase the switching capacity. The proposed design model achieves a larger switching capacity in a practical time than the conventional design model that satisfies the strict-sense non-blocking condition, while guaranteeing an admissible blocking probability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Table of Contents IEEE Networking Letters Author Guidelines IEEE COMMUNICATIONS SOCIETY IEEE Communications Society Optimal Classifier for an ML-Assisted Resource Allocation in Wireless Communications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1