The problem of constructing independent spanning trees (ISTs) dates back to as early as the
late 1980s. Given a network G of a certain topology, the question is whether we can, as well …

A set of spanning trees in a graph are called completely independent spanning trees (CISTs
for short) if the paths joining every pair of vertices and in any two trees have neither vertex …

A set of spanning trees T 1; T 2;...; Tk in a network G are Completely Independent Spanning
Trees (CISTs) if for any two nodes u and v in V (G), the paths between u and v in any two …

The capability of the data center network largely decides the performance of cloud
computing. However, the number of servers in the data center network becomes …

Given two regular graphs G and H such that the vertex degree of G is equal to the number of
vertices in H, the compound graph G (H) is constructed by replacing each vertex of G by a …

Dense Gaussian networks (DGNs) are suitable topology candidates for network-on-chip
(NoC) architectures because they provide favorable network properties such as symmetry …

Abstract Kwong et al.(2011) proposed a reactive routing scheme using the multi-paths
technique for integrating two mechanisms of route discovery and route maintenance in intra …

The protection routing uses the multi-paths technique for integrating route discovery and
route maintenance mechanisms in a network, and thus it can tolerate the failure of one …

A set of k (≥ 2) spanning trees in the underlying graph of a network topology is called
completely independent spanning trees,(CISTs for short), if they are pairwise edge-disjoint …

The k-dimensional data center network with n port switches, denoted by D k, n, has been
proposed as a structure of the server-centric network and it was required to have a high …