An efficient construction of node disjoint paths in OTIS networks

Authors:
Weidong Chen;Wenjun Xiao;Behrooz Parhami
Affiliations:
Department of Computer Science, South China University of Technology, Guangzhou, China and Department of Computer Science, South China Normal University, Guangzhou, China;Department of Computer Science, South China University of Technology, Guangzhou, China;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Year:
2007

Citing 16
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
Randomized Routing, Selection, and Sorting on the OTIS-Mesh

IEEE Transactions on Parallel and Distributed Systems
All-optical networks

Communications of the ACM
Image Processing on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Parallel and Distributed Systems
Scalable network architectures using the optical transpose interconnection system (OTIS)

Journal of Parallel and Distributed Computing
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Computers
Topological Properties of OTIS-Networks

IEEE Transactions on Parallel and Distributed Systems
Sorting on the OTIS-Mesh

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors

ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Optical transpose k-ary n-cube networks

Journal of Systems Architecture: the EUROMICRO Journal
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Polynomial interpolation and polynomial root finding on OTIS-mesh

Parallel Computing
Node-disjoint paths in hierarchical hypercube networks

Information Sciences: an International Journal
Constructing node-disjoint paths in enhanced pyramid networks

ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Robust multipath routing to exploit maximally disjoint paths for wireless ad hoc networks

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
WDM: North American deployment trends

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint paths in any OTIS network with a connected basis network is presented, which is independent of any construction of node disjoint paths in its basis network. This general construction is effective and efficient, which can obtain desirable node disjoint paths of length at most D+4 in O(Δ2+Δf(N1/2)) time if the basis network of size n has a shortest routing algorithm of time complexity O(f(n)), where D, Δ and N are, respectively, the diameter, the degree and the size of the OTIS network. Further, for OTIS networks with maximally fault tolerant basis networks, we give an improved version of a conventional construction of node disjoint paths by incorporating the above general construction. Finally, we show the effectiveness and efficiency of these constructions applied to OTIS-Hypercubes.