具有两步阻塞概率保证的扭曲和折叠 Clos 网络设计模型

Haruto Taka;Takeru Inoue;Eiji Oki
{"title":"具有两步阻塞概率保证的扭曲和折叠 Clos 网络设计模型","authors":"Haruto Taka;Takeru Inoue;Eiji Oki","doi":"10.1109/LNET.2023.3322172","DOIUrl":null,"url":null,"abstract":"A data center network often employs a Clos-network structure due to scalability nature. A previous design model analyzed blocking probability to guarantee the quality of Clos network. However, the conditions to guarantee the blocking probability in these models are stringent, which shrinks the switching capacity. This letter proposes a model that relaxes network design constraints to maximize switching capacity while guaranteeing blocking probability in a two-step manner, where the proposed model divides intermediate switches into two groups. Numerical results show that the proposed model achieves a larger switching capacity than a conventional one-step model.","PeriodicalId":100628,"journal":{"name":"IEEE Networking Letters","volume":"6 1","pages":"60-64"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Twisted and Folded Clos-Network Design Model With Two-Step Blocking Probability Guarantee\",\"authors\":\"Haruto Taka;Takeru Inoue;Eiji Oki\",\"doi\":\"10.1109/LNET.2023.3322172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A data center network often employs a Clos-network structure due to scalability nature. A previous design model analyzed blocking probability to guarantee the quality of Clos network. However, the conditions to guarantee the blocking probability in these models are stringent, which shrinks the switching capacity. This letter proposes a model that relaxes network design constraints to maximize switching capacity while guaranteeing blocking probability in a two-step manner, where the proposed model divides intermediate switches into two groups. Numerical results show that the proposed model achieves a larger switching capacity than a conventional one-step model.\",\"PeriodicalId\":100628,\"journal\":{\"name\":\"IEEE Networking Letters\",\"volume\":\"6 1\",\"pages\":\"60-64\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-10-05\",\"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/10272624/\",\"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/10272624/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

出于可扩展性考虑,数据中心网络通常采用 Clos 网络结构。以往的设计模型通过分析阻塞概率来保证 Clos 网络的质量。然而,这些模型中保证阻塞概率的条件都很苛刻,从而降低了交换容量。本文提出了一种放宽网络设计约束的模型,在保证阻塞概率的同时,分两步实现交换容量最大化,其中提出的模型将中间交换机分为两组。数值结果表明,与传统的一步式模型相比,所提出的模型实现了更大的交换容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Twisted and Folded Clos-Network Design Model With Two-Step Blocking Probability Guarantee
A data center network often employs a Clos-network structure due to scalability nature. A previous design model analyzed blocking probability to guarantee the quality of Clos network. However, the conditions to guarantee the blocking probability in these models are stringent, which shrinks the switching capacity. This letter proposes a model that relaxes network design constraints to maximize switching capacity while guaranteeing blocking probability in a two-step manner, where the proposed model divides intermediate switches into two groups. Numerical results show that the proposed model achieves a larger switching capacity than a conventional one-step model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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