Internally Vertex-Disjoint Paths in Crossed Cube-Connected Ring Networks

Xin Yu; Gao Cai Wang; Yan Yu

doi:10.4028/www.scientific.net/AMM.321-324.2715

Paper Titles

Willingness-Based Access Control for Mobile Terminals
p.2693

Operating System Choice of the ISCS Server in Urban Rail Transit
p.2698

Some Cryptographic Properties of Rotation Symmetric Boolean Functions
p.2704

Real-Time Fault-Tolerant Ethernet Technology - TTEthernet and its Feature
p.2711

Internally Vertex-Disjoint Paths in Crossed Cube-Connected Ring Networks
p.2715

Study on the Mobile Information Service in the University Library
p.2721

A P2P Reputation Incentive Mechanism based on Artificial Fish-Swarm Model
p.2725

Research and Design P2PSIP Internet Phone Systems Based on the Advanced Kademlia Algorithm
p.2732

Study on the Shielding Effectiveness of a Metallic Rectangular Enclosure with Four Square Apertures having Different Position Arrays
p.2737

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 321-324Internally Vertex-Disjoint Paths in Crossed...

Internally Vertex-Disjoint Paths in Crossed Cube-Connected Ring Networks

Abstract:

Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to extend the scale of crossed cube networks. As a kind of hierarchical ring interconnection networks, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. Hence, it is a good topology for interconnection networks. In this paper, we prove that there exist n internally vertex-disjoint paths between any two vertexes in CRN, and analyze the lengths of the paths.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 321-324)

Pages:

2715-2720

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.321-324.2715

Citation:

Cite this paper

Online since:

June 2013

Authors:

Xin Yu, Gao Cai Wang, Yan Yu

Keywords:

Crossed Cube, Crossed Cube-Connected Ring Networks, Vertex-Disjoint Paths

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] K. Efe. The crossed cube architecture for parallel computing. IEEE Trans on Parallel and distributed Systems, 3(5) (1992) 513-524.

DOI: 10.1109/71.159036

Google Scholar

[2] X. Yu, M. Wu, and G. J. Wang. A novel shorest path routing algorithm in the crossed cube. Chinese Journal of Computers, 30(4) (2007) 615-621.

Google Scholar

[3] W. T. Huang, Y. C. Chuang, J. M. Tan, and et al. . On the fault tolerant hamiltonicity of faulty crossed cubes, IEICE Trans. Fundamentals E85-A (6) (2002) 1359–1370.

Google Scholar

[4] M. C. Yang, T. K. Li, J. M. Tan, and et al.. Fault-tolerant cycle-embedding of crossed cubes, Information Processing Letters, 88 , (2003) 149–154.

DOI: 10.1016/j.ipl.2003.08.007

Google Scholar

[5] P. Kulasinghe and S. Bettayeb. Embedding binary trees into crossed cubes. IEEE Trans on Computers, 44(7) ( 1995) 923-929.

DOI: 10.1109/12.392850

Google Scholar

[6] C. P. Chang, T. Y. Sung. Edge Congestion and Topological Properties of Crossed Cubes. IEEE Trans on Parallel and distributed Systems, 11(1) (2000) 64-80.

DOI: 10.1109/71.824643

Google Scholar

[7] F. A. Li, Z. Y. Liu, and X. Z. Qiao. "A hierarchical network HRN and its routing algorithms". Chinese Journal of Computers, 25(12) (2002) 1397-1404.

Google Scholar