Error Tolerant Address Configuration for Data Center Networks with Malfunctioning Devices

Xingyu Ma, Chengchen Hu, Kai Chen, Che Zhang, Hongtao Zhang, K. Zheng, Yan Chen, Xianda Sun
{"title":"Error Tolerant Address Configuration for Data Center Networks with Malfunctioning Devices","authors":"Xingyu Ma, Chengchen Hu, Kai Chen, Che Zhang, Hongtao Zhang, K. Zheng, Yan Chen, Xianda Sun","doi":"10.1109/ICDCS.2012.27","DOIUrl":null,"url":null,"abstract":"Address auto-configuration is a key problem in data center networks, where servers and switches encode topology information into their addresses for routing. A recent work DAC [2] has been introduced to address this problem. Without malfunctions, DAC can auto-configure all the devices quickly. But in case of malfunctions, DAC requires significant human efforts to correct malfunctions and it can cause substantial operation delay of the whole data center. In this paper, we further optimize address auto-configuration process even in the presence of malfunctions. Instead of waiting for all the malfunctions to be corrected, we could first configure the devices that are not involved in malfunctions and let them work first. This idea can be translated to considerable practical benefits because in most cases malfunctions in data centers only account for a very small portion. To realize the idea, we conceptually remove the malfunctions from the physical data center topology graph and mathematically convert the address configuration problem into induced sub graph isomorphism problem, which is NP-complete. We then introduce an algorithm that can solve the induced sub graph isomorphism quickly by taking advantage of data center topology characteristics and induced sub graph properties. We extensively evaluate our design on representative data center structures with various malfunction scenarios. The evaluation results demonstrate that the proposed framework and algorithm are efficient and labor-free to deal with the mapping task in the presence of error devices.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"1 1","pages":"708-717"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 32nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2012.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Address auto-configuration is a key problem in data center networks, where servers and switches encode topology information into their addresses for routing. A recent work DAC [2] has been introduced to address this problem. Without malfunctions, DAC can auto-configure all the devices quickly. But in case of malfunctions, DAC requires significant human efforts to correct malfunctions and it can cause substantial operation delay of the whole data center. In this paper, we further optimize address auto-configuration process even in the presence of malfunctions. Instead of waiting for all the malfunctions to be corrected, we could first configure the devices that are not involved in malfunctions and let them work first. This idea can be translated to considerable practical benefits because in most cases malfunctions in data centers only account for a very small portion. To realize the idea, we conceptually remove the malfunctions from the physical data center topology graph and mathematically convert the address configuration problem into induced sub graph isomorphism problem, which is NP-complete. We then introduce an algorithm that can solve the induced sub graph isomorphism quickly by taking advantage of data center topology characteristics and induced sub graph properties. We extensively evaluate our design on representative data center structures with various malfunction scenarios. The evaluation results demonstrate that the proposed framework and algorithm are efficient and labor-free to deal with the mapping task in the presence of error devices.
故障设备数据中心网络的容错地址配置
地址自动配置是数据中心网络中的一个关键问题,在数据中心网络中,服务器和交换机将拓扑信息编码为其路由地址。最近的一项工作DAC[2]已经被引入来解决这个问题。DAC可以快速自动配置所有设备,不会出现故障。但是一旦发生故障,DAC需要大量的人力来纠正故障,并可能导致整个数据中心的运行延迟。在本文中,我们进一步优化了地址自动配置过程,即使存在故障。而不是等待所有的故障被纠正,我们可以首先配置不涉及故障的设备,并让它们首先工作。这个想法可以转化为相当大的实际好处,因为在大多数情况下,数据中心的故障只占很小的一部分。为了实现这一思想,我们在概念上从物理数据中心拓扑图中去除故障,并在数学上将地址配置问题转化为诱导子图同构问题,该问题是np完全的。然后,利用数据中心拓扑特性和诱导子图特性,提出了一种快速求解诱导子图同构的算法。我们在具有各种故障场景的代表性数据中心结构上广泛评估我们的设计。评估结果表明,所提出的框架和算法在处理存在误差设备的映射任务时是高效且无需人工的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信