4.5 Article

Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks

期刊

IEEE TRANSACTIONS ON COMPUTERS
卷 71, 期 5, 页码 1194-1203

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TC.2021.3077587

关键词

Complete graph; completely independent spanning trees (CISTs); CIST-partition; data center networks; line graph

资金

  1. National Natural Science Foundation of China [U1905211, 61572337]
  2. Natural Science Foundation of the Jiangsu Higher Education Institutions of China [18KJA520009]
  3. China Postdoctoral Science Foundation [2015M581858]
  4. Jiangsu Planned Projects for Postdoctoral Research Funds [1501089B]
  5. Undergraduate Training Program for Innovation and Entrepreneurship, Soochow University [201910285025Z]
  6. Priority Academic ProgramDevelopment of JiangsuHigher Education Institutions

向作者/读者索取更多资源

This paper investigates the number of CISTs that can be constructed in the line graph of a complete graph and presents an algorithm for constructing the optimal number of CISTs. The findings have significant implications for assessing network robustness.
The past decade has seen growing importance being attached to the Completely Independent Spanning Trees (CISTs). The CISTs can facilitate many network functionalities, and the existence and construction schemes of CISTs in various networks can be an indicator of the network's robustness. In this paper, we establish the number of CISTs that can be constructed in the line graph of the complete graph K-n (denoted L(K-n), for n >= 4), and present an algorithm to construct the optimal (i.e., maximal) number of CISTs in L(K-n). The L(K-n) is a special class of SWCube [13], an architectural model proposed for data center networks. Our construction algorithm is also implemented to verify its validity.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据