Hyper-DC:一种可重新排列的非阻塞数据中心网络拓扑

Wang Ren-qun, Peng Li
{"title":"Hyper-DC:一种可重新排列的非阻塞数据中心网络拓扑","authors":"Wang Ren-qun, Peng Li","doi":"10.1109/ICCSN.2016.7586593","DOIUrl":null,"url":null,"abstract":"In this paper it introduces a rearrangeable non-blocking topology of data center networks called Hyper-DC. Firstly, combining the merits of k-dilated k-bristled hypercube topology and k-ary hyper-mesh topology, this paper introduces the definition of Hyper-DC topology in the view of graph theory; Secondly, it analyzes properties of Hyper-DC topology especially proving rearrangeable non-blocking property by the mathematical induction, which benefits line speed transmission of flow and simplification of cache mechanism in data center networks; Thirdly, this paper realizes the optimal embedment of many other topologies into Hyper-DC, which benefits the realization of a large number of parallel algorithms and stimulations of many other topologies; Finally, it compares with several topologies which have rearrangeable non-blocking property in the aspects of properties of latency, link complexity, switch complexity and scalability.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hyper-DC: A rearrangeable non-blocking data center networks topology\",\"authors\":\"Wang Ren-qun, Peng Li\",\"doi\":\"10.1109/ICCSN.2016.7586593\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper it introduces a rearrangeable non-blocking topology of data center networks called Hyper-DC. Firstly, combining the merits of k-dilated k-bristled hypercube topology and k-ary hyper-mesh topology, this paper introduces the definition of Hyper-DC topology in the view of graph theory; Secondly, it analyzes properties of Hyper-DC topology especially proving rearrangeable non-blocking property by the mathematical induction, which benefits line speed transmission of flow and simplification of cache mechanism in data center networks; Thirdly, this paper realizes the optimal embedment of many other topologies into Hyper-DC, which benefits the realization of a large number of parallel algorithms and stimulations of many other topologies; Finally, it compares with several topologies which have rearrangeable non-blocking property in the aspects of properties of latency, link complexity, switch complexity and scalability.\",\"PeriodicalId\":158877,\"journal\":{\"name\":\"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)\",\"volume\":\"179 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN.2016.7586593\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2016.7586593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文介绍了一种称为Hyper-DC的数据中心网络可重新排列的非阻塞拓扑结构。首先,结合k-扩张k-刚毛超立方体拓扑和k-任意超网格拓扑的优点,从图论的角度引入了Hyper-DC拓扑的定义;其次,分析了Hyper-DC拓扑的特性,特别是用数学归纳法证明了Hyper-DC拓扑的可重排无阻塞特性,这有利于数据中心网络中数据流的线速度传输和简化缓存机制;第三,本文实现了许多其他拓扑的最优嵌入到Hyper-DC中,这有利于大量并行算法的实现和许多其他拓扑的仿真;最后,从时延、链路复杂度、交换机复杂度和可扩展性等方面对几种具有可重构无阻塞特性的拓扑进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hyper-DC: A rearrangeable non-blocking data center networks topology
In this paper it introduces a rearrangeable non-blocking topology of data center networks called Hyper-DC. Firstly, combining the merits of k-dilated k-bristled hypercube topology and k-ary hyper-mesh topology, this paper introduces the definition of Hyper-DC topology in the view of graph theory; Secondly, it analyzes properties of Hyper-DC topology especially proving rearrangeable non-blocking property by the mathematical induction, which benefits line speed transmission of flow and simplification of cache mechanism in data center networks; Thirdly, this paper realizes the optimal embedment of many other topologies into Hyper-DC, which benefits the realization of a large number of parallel algorithms and stimulations of many other topologies; Finally, it compares with several topologies which have rearrangeable non-blocking property in the aspects of properties of latency, link complexity, switch complexity and scalability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Detecting sports fatigue from speech by support vector machine Error beacon filtering algorithm based on K-means clustering for underwater Wireless Sensor Networks Transmit beamforming optimization for energy efficiency maximization in downlink distributed antenna systems Research of 3D face recognition algorithm based on deep learning stacked denoising autoencoder theory Improved propagator method for joint angle and Doppler estimation based on structured least squares
×
引用
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