Open AccessA Minimum Spanning Tree-based Routing Technique of FAT Tree for Efficient Data Center Networking
Author(s) -
Прачи Гупта,
Vibhakar Pathak
Publication year - 2022
Publication title -
the philippine statistician (quezon city)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.101
H-Index - 2
ISSN - 2094-0343
DOI - 10.17762/msea.v71i1.44
Subject(s) - computer science , computer network , data center , shortest path problem , tree (set theory) , routing (electronic design automation) , minimum spanning tree , distributed computing , reliability (semiconductor) , bandwidth (computing) , the internet , spanning tree , algorithm , power (physics) , mathematics , theoretical computer science , graph , mathematical analysis , physics , quantum mechanics , combinatorics , world wide web
Data centers (DCs) have become the critical and irreplaceable infrastructure to drive this ever-growing trend because of the exponential expansion of Internet services. In general, DC has several data & storage nodes connected by a network that is specially built, called Data Center Network (DCN). DCN functions as a communications backbone also play a significant role in maximizing the operation of DC. However, the infrastructure and operations are very difficult in comparison with the conventional network compared with unique DCN specifications, including a wide range of applications, high power density, and high reliability. In this paper, the Bellmanford MST algorithm is used for FAT-tree-based routing. The main characteristic of the FAT Tree is that the links which are used for connecting nodes from different levels may have different bandwidth. The Bellmanford algorithm used here is the shortest path algorithm which provides a reliable and short path for the route nodes to travel which provides fewer time complexities in data center networking.