Disjoint Paths Construction and Fault-Tolerant Routing in BCube of Data Center Networks

Fan, W; Xiao, F; Cai, H; Chen, X; Yu, S

Disjoint Paths Construction and Fault-Tolerant Routing in BCube of Data Center Networks

Fan, W Xiao, F Cai, H Chen, X Yu, S

Permalink

Publisher:: IEEE COMPUTER SOC
Publication Type:: Journal Article
Citation:: IEEE Transactions on Computers, 2023, 72, (9), pp. 2467-2481
Issue Date:: 2023-09-01

Closed Access

	Filename	Description	Size
	Disjoint_Paths_Construction_and_Fault-Tolerant_Routing_in_BCube_of_Data_Center_Networks.pdf	Published version	1.64 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Fan, W
dc.contributor.author	Xiao, F
dc.contributor.author	Cai, H
dc.contributor.author	Chen, X
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.date.accessioned	2024-03-12T01:03:49Z
dc.date.available	2024-03-12T01:03:49Z
dc.date.issued	2023-09-01
dc.identifier.citation	IEEE Transactions on Computers, 2023, 72, (9), pp. 2467-2481
dc.identifier.issn	0018-9340
dc.identifier.issn	1557-9956
dc.identifier.uri	http://hdl.handle.net/10453/176525
dc.description.abstract	BCube is a promising structure of data center network, as it can significantly improve the performance of typical applications. With the expansion of network scale and increasement of complexity, reliability and stability of networks have become more essential. In this paper, we study the fault-tolerant routings in BCube. First, we design a fault-tolerant routing algorithm based on node disjoint multi-paths. The proposed multi-path routing has stronger fault tolerance, since each path has no other common nodes except the source node and the destination node. Second, we investigate an effective fault-tolerant routing based on routing capabilities algorithm for BCube. The proposed algorithm has higher fault tolerance and success rate of finding feasible routes, since it does not limit the faults number. Third, we present an adaptive path finding algorithm for establishing virtual links between any two nodes in BCube, which can shorten the diameter of BCube. Extensive simulation results show that the proposed routing scheme outperforms the existing popular algorithms. Compared with the state-of-the-art fault-tolerant routing algorithms, the proposed algorithm has a 21.5% to 25.3% improvement on both throughput and packet arrival rate. Meanwhile, it reduces the average latency of 18.6% and the maximum latency of 23.7% in networks.
dc.language	English
dc.publisher	IEEE COMPUTER SOC
dc.relation.ispartof	IEEE Transactions on Computers
dc.relation.isbasedon	10.1109/TC.2023.3251849
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0803 Computer Software, 0805 Distributed Computing, 1006 Computer Hardware
dc.subject.classification	Computer Hardware & Architecture
dc.subject.classification	4009 Electronics, sensors and digital hardware
dc.subject.classification	4606 Distributed computing and systems software
dc.title	Disjoint Paths Construction and Fault-Tolerant Routing in BCube of Data Center Networks
dc.type	Journal Article
utslib.citation.volume	72
utslib.for	0803 Computer Software
utslib.for	0805 Distributed Computing
utslib.for	1006 Computer Hardware
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	University of Technology Sydney/Strength - CCSP - Centre for Cyber Security and Privacy
utslib.copyright.status	closed_access	*
dc.date.updated	2024-03-12T01:03:48Z
pubs.issue	9
pubs.publication-status	Published
pubs.volume	72
utslib.citation.issue	9

Abstract:

BCube is a promising structure of data center network, as it can significantly improve the performance of typical applications. With the expansion of network scale and increasement of complexity, reliability and stability of networks have become more essential. In this paper, we study the fault-tolerant routings in BCube. First, we design a fault-tolerant routing algorithm based on node disjoint multi-paths. The proposed multi-path routing has stronger fault tolerance, since each path has no other common nodes except the source node and the destination node. Second, we investigate an effective fault-tolerant routing based on routing capabilities algorithm for BCube. The proposed algorithm has higher fault tolerance and success rate of finding feasible routes, since it does not limit the faults number. Third, we present an adaptive path finding algorithm for establishing virtual links between any two nodes in BCube, which can shorten the diameter of BCube. Extensive simulation results show that the proposed routing scheme outperforms the existing popular algorithms. Compared with the state-of-the-art fault-tolerant routing algorithms, the proposed algorithm has a 21.5% to 25.3% improvement on both throughput and packet arrival rate. Meanwhile, it reduces the average latency of 18.6% and the maximum latency of 23.7% in networks.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/176525