计算机应用与软件2024，Vol.41Issue(1)：261-268,290,9.DOI:10.3969/j.issn.1000-386x.2024.01.038
递归型数据中心网络上g-额外连通度及容错单播算法研究
g-EXTRA CONNECTIVITY AND FAULT-TOLERANT UNICAST ALGORITHM OF RECURSIVE DATA CENTER NETWORKS
摘要
Abstract
The research of data center network is a hot spot that has emerged in recent years.Compared with the traditional tree data center network,the recursive data center network has better fault tolerance and scalability.The k-dimensional recursive complete graph network deployed on the n-port switch can be expressed as Xk,n.σ represents the number of edges connecting any vertex in the graph with other sub graphs of the same dimension.In practical situations,the extra connectivity of the network can measure the network's fault tolerance more accurately than traditional connectivity.This paper proves that when k≥3,n≥3,σ ∈ { 1,n-1 } and 0 ≤ g ≤ 2,the extra connectivity of Xk n is(g+1)(kσ-1)+n,which is close to g+1 times of its connectivity.Furthermore,we propose a fault-tolerant unicast algorithm based on this case.In this paper,it is proved that the time complexity of the algorithm and the maximal length of the path constructed by the algorithm between any two nodes in the worst case.Through simulation experiments,it is proved that the algorithm is superior to the breadth-first search and depth-first search algorithms in execution efficiency,and the algorithm has good fault tolerance performance.关键词
递归型数据中心网络/容错性/额外连通度/容错单播算法/算法分析Key words
Recursive data center network/Fault tolerance/Extra connectivity/Fault-tolerant unicast algorithm/Algorithm analysis分类
信息技术与安全科学引用本文复制引用
伊雯雯,王喜,张书奎..递归型数据中心网络上g-额外连通度及容错单播算法研究[J].计算机应用与软件,2024,41(1):261-268,290,9.基金项目
国家自然科学基金项目(61702351) （61702351）
江苏省高校自然科学基金项目(17KJB520036) （17KJB520036）
江苏高校"青蓝工程"资助项目. （）
