Edge-disjoint spanning trees for the generalized butterfly networks and their applications

Authors:
Abderezak Touzene;Khaled Day;Burkhard Monien
Affiliations:
Department of Computer Science, Sultan Qaboos University, Oman;Department of Computer Science, Sultan Qaboos University, Oman;Department of Computer Science, Paderborn University, Fürstenallee 11, 33102 Paderborn, Germany
Venue:
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Year:
2005

Citing 16
Cited 2

Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Fault-tolerant gossiping on hypercube multicomputers

EDMCC2 Proceedings of the 2nd European conference on Distributed memory computing
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
Two edge-disjoint Hamiltonian cycles in the butterfly graph

Information Processing Letters
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Hamilton circuits in the directed wrapped Butterfly network

Discrete Applied Mathematics
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees

IEEE Transactions on Parallel and Distributed Systems
On edge-disjoint spanning trees in hypercubes

Information Processing Letters
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks

IEEE Transactions on Parallel and Distributed Systems
On edge-disjoint spanning trees with small depths

Information Processing Letters
Performance of multi-hop commmunications using logical topologies on optical torus networks

Journal of Parallel and Distributed Computing
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance

IEEE Transactions on Computers
Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance

Parallel Computing
Constructing Edge-Disjoint Spanning Trees in Product Networks

IEEE Transactions on Parallel and Distributed Systems
Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks

Journal of Systems Architecture: the EUROMICRO Journal
Randomized routing and wavelength requirements in wavelength-routed WDM multistage, hypercube, and de Bruijn networks

Journal of Parallel and Distributed Computing

Constructing edge-disjoint spanning trees in twisted cubes

Information Sciences: an International Journal
Completely independent spanning trees in torus networks

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized butterfly GBN(d,n) has recently gained some interest as a point-to-point interconnection network rather than the well known multi-stage butterfly networks. We construct edges-disjoint spanning trees (abbreviated EDSTs) for the GBN(d,n). Our construction is based on the decomposition of the GBN(d,n) into d^n vertex-disjoint cycles of length n. As an application, we propose an efficient broadcasting algorithm and its fault-tolerant version for the GBN(d,n). Our fault-tolerant broadcasting algorithm is optimal in terms of fault-tolerance, because it resists 2d-1 edge failures (2d is the degree of the GBN(d,n)). We also propose an efficient scattering algorithm and its fault-tolerant version which resists 2d-3 edge faults.