rect:一种新型的以服务器为中心的高可用性数据中心网络

Zhenhua Li, Yuanyuan Yang
{"title":"rect:一种新型的以服务器为中心的高可用性数据中心网络","authors":"Zhenhua Li, Yuanyuan Yang","doi":"10.1109/ICPP.2016.12","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel server-centric network for data centers, called RRect. Compared to existing server-centric networks, RRect has a linear diameter to the network order and abundant parallel paths with near-equal lengths, so that traffic in RRect enjoys a short and predictable communication latency. We present an efficient routing algorithm to find paths between any pair of servers in RRect. A complete addressing scheme and recursive RRect construction procedure are also provided in this paper. Meanwhile, to meet today's stringent high availability requirement, unlike existing server-centric network structures, RRect can be configured into redundancy and failover scheme, in which the backup server can fully take the place of the corresponding malfunctioning server without losing topological advantages, such as multiple near-equal parallel paths. Our comprehensive simulations show that RRect gives a better average path lengths and a more balanced path distribution among all pairs of servers. Meanwhile, RRect can maintain the same performance on many critical metrics as BCube, including short diameter and excellent aggregate throughput. All these features make RRect a very empirical structure for enterprise dater center network products.","PeriodicalId":409991,"journal":{"name":"2016 45th International Conference on Parallel Processing (ICPP)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"RRect: A Novel Server-centric Data Center Network with High Availability\",\"authors\":\"Zhenhua Li, Yuanyuan Yang\",\"doi\":\"10.1109/ICPP.2016.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel server-centric network for data centers, called RRect. Compared to existing server-centric networks, RRect has a linear diameter to the network order and abundant parallel paths with near-equal lengths, so that traffic in RRect enjoys a short and predictable communication latency. We present an efficient routing algorithm to find paths between any pair of servers in RRect. A complete addressing scheme and recursive RRect construction procedure are also provided in this paper. Meanwhile, to meet today's stringent high availability requirement, unlike existing server-centric network structures, RRect can be configured into redundancy and failover scheme, in which the backup server can fully take the place of the corresponding malfunctioning server without losing topological advantages, such as multiple near-equal parallel paths. Our comprehensive simulations show that RRect gives a better average path lengths and a more balanced path distribution among all pairs of servers. Meanwhile, RRect can maintain the same performance on many critical metrics as BCube, including short diameter and excellent aggregate throughput. All these features make RRect a very empirical structure for enterprise dater center network products.\",\"PeriodicalId\":409991,\"journal\":{\"name\":\"2016 45th International Conference on Parallel Processing (ICPP)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 45th International Conference on Parallel Processing (ICPP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.2016.12\",\"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 45th International Conference on Parallel Processing (ICPP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.2016.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们为数据中心提出了一种新的以服务器为中心的网络,称为rect。与现有的以服务器为中心的网络相比,RRect具有与网络顺序线性的直径和大量长度接近相等的并行路径,因此RRect中的流量具有短且可预测的通信延迟。我们提出了一种有效的路由算法来查找任意一对服务器之间的路径。本文还给出了完整的寻址方案和递归的矩形构造过程。同时,为了满足当今严格的高可用性要求,与现有的以服务器为中心的网络结构不同,RRect可以配置成冗余和故障转移方案,在这种方案中,备份服务器可以完全代替相应的故障服务器,而不会失去拓扑优势,例如多条接近相等的并行路径。我们的综合模拟表明,RRect在所有对服务器之间提供了更好的平均路径长度和更平衡的路径分布。同时,RRect可以在许多关键指标上保持与BCube相同的性能,包括短直径和出色的总吞吐量。所有这些特点使rect成为企业数据中心网络产品的一个非常经验的结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RRect: A Novel Server-centric Data Center Network with High Availability
In this paper, we propose a novel server-centric network for data centers, called RRect. Compared to existing server-centric networks, RRect has a linear diameter to the network order and abundant parallel paths with near-equal lengths, so that traffic in RRect enjoys a short and predictable communication latency. We present an efficient routing algorithm to find paths between any pair of servers in RRect. A complete addressing scheme and recursive RRect construction procedure are also provided in this paper. Meanwhile, to meet today's stringent high availability requirement, unlike existing server-centric network structures, RRect can be configured into redundancy and failover scheme, in which the backup server can fully take the place of the corresponding malfunctioning server without losing topological advantages, such as multiple near-equal parallel paths. Our comprehensive simulations show that RRect gives a better average path lengths and a more balanced path distribution among all pairs of servers. Meanwhile, RRect can maintain the same performance on many critical metrics as BCube, including short diameter and excellent aggregate throughput. All these features make RRect a very empirical structure for enterprise dater center network products.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Parallel k-Means++ for Multiple Shared-Memory Architectures RCHC: A Holistic Runtime System for Concurrent Heterogeneous Computing Partial Flattening: A Compilation Technique for Irregular Nested Parallelism on GPGPUs Improving RAID Performance Using an Endurable SSD Cache PARVMEC: An Efficient, Scalable Implementation of the Variational Moments Equilibrium Code
×
引用
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