摘要
在数据中心网络(DCN)中,为了实现BCube拓扑与基于环的应用的对接,利用互连网络与组合数学的知识,研究了在BCube中嵌入环(ring)结构的问题,提出了基于最小异维环组和递归化的算法。该算法找到了BCube(n,k)(n为偶数且k≥1)(简记为B(even,k≥1))中的Hamilton圈,能保证嵌入图的膨胀率是1;而且在BCube中的switch发生故障时,相对其他环嵌入算法,嵌入的膨胀率较小。针对BCube(n,k)(n为奇数且k≥1)(简记为B(odd,k≥1)),也提出了可供参考的环化算法。
In DCN with BCube topology,it＇s hard to implement applications based on ring topology.So this paper researched the problem of embedding ring into BCube.Referring to the knowledge of interconnection network and combinatorial mathema-tics,proposed the method which was based on the SDRG and recursion to support the ring embedding algorithm.The algorithm could find a Hamilton cycle in BCube（n,k） where n was even and k≥1.The expansion of the embedded ring was 1.On the occasion that some servers or switches fail,the expansion of the embedded ring was relatively lower compared with the other ring embedding algorithms.Also proposed a certain ring embedding algorithm for BCube（n,k）,where n was odd and k≥1.
出处
《计算机应用研究》
CSCD
北大核心
2011年第6期2280-2285,共6页
Application Research of Computers
基金
国家"863"计划资助项目(2009AA012201)
关键词
数据中心网络
BCube拓扑
环化
图嵌入
最小异维环组
广义超立方体
data center networking（DCN）
BCube
ring embedding
graph embedding
smallest different-dimension ring group（SDRG）
generalized hypercube
