Parallel construction of multiple independent spanning trees on highly scalable datacenter networks

DOI10.1016/J.AMC.2021.126617OpenAlexW3198562460MaRDI QIDQ2246461

Sheng-Lung Peng, Jou-Ming Chang, Jinn-Shyong Yang, Xiao-Yan Li

Publication date: 16 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126617

zbMATH Keywords

parallel algorithmsindependent spanning treesfault-tolerant broadcastingsecure message distributiondatacenter networks

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (3)

The disjoint path cover in the data center network HSDC with prescribed vertices in each path ⋮ Edge-independent spanning trees in folded crossed cubes ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks

Uses Software

• DPillar

Cites Work

• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Constructing dual-CISTs of DCell data center networks
• Optimum Communication Spanning Trees
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Constructing Node-Independent Spanning Trees in Augmented Cubes
• Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers
• Finding Four Independent Trees

This page was built for publication: Parallel construction of multiple independent spanning trees on highly scalable datacenter networks