{"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}
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.