Construction of vertex-disjoint paths in alternating group networks

Journal of Supercomputing

Volumn 54, Issue 2, 2010, Pages 206-228

  Zhou, Shuming ^a   Xiao, Wenjun ^b   Parhami, Behrooz ^c  

^a FUJIAN NORMAL UNIVERSITY   (China)

^b SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^c NONE

Author keywords

Alternating group graphs; Fault tolerant routing; Node disjoint paths; Parallel paths; Robustness; Wide diameter

Indexed keywords

ALTERNATING GROUP GRAPH; FAULT TOLERANT ROUTING; NODE-DISJOINT PATHS; PARALLEL PATH; ROBUSTNESS; WIDE DIAMETER;

OPTIMIZATION;

NETWORK ARCHITECTURE;

EID: 78149471113     PISSN: 09208542     EISSN: 15730484     Source Type: Journal    
DOI: 10.1007/s11227-009-0304-7     Document Type: Article

References (27)

1. SB Akers B Krishnamurthy 1989 A group-theoretic model for symmetric interconnection networks IEEE Trans Comput 38 4 555 566 0678.94026 10.1109/12.21148 984680
2. Akers SB, Harel D, Krishnamurthy B (1987) The star graph, an attractive alternative to the n-cube. In: Proc. int'l conf parallel processing, 1987, pp 393-400
3. LN Bhuyan DP Agrawal 1984 Generalized hypercube and hyperbus structures for a computer network IEEE Trans Comput 33 323 333 0528.68002 10.1109/TC.1984.1676437
4. B Chen WJ Xiao B Parhami 2006 Internode distance and optimal routing in a class of alternating group networks IEEE Trans Comput 12 12 1645 1648 10.1109/TC.2006.199 2518254
5. K Day AE Al-Ayyoub 1997 Fault diameter of k-ary n-cube networks IEEE Trans Parallel Distrib Syst 8 9 903 907 10.1109/71.615436
6. K Day A Tripathi 1994 A comparative study of topological properties of hypercubes and star graphs IEEE Trans Parallel Distrib Syst 5 1 31 38 10.1109/71.262586 1262227
7. Du DZ, Hsu DF (1996) Combinatorial network theory. Kluwer Academic, Dordrecht
8. DR Duh GH Chen DF Hsu 1996 Combinatorial properties of generalized hypercube graphs Inf Process Lett 57 141 145 1374698
9. E Flandrin H Li 1994 Mengerian properties, Hamiltonicity, and claw-free graphs Networks 4 177 183 10.1002/net.3230240305 1281349
10. JS Fu GH Chen DR Duh 2002 Vertex-disjoint paths and related problems on hierarchical networks Networks 40 10 142 154 1064.68012 10.1002/net.10040 1928676 (Pubitemid 37218337)
11. QP Gu S Peng 1997 Vertex to set disjoint paths problem in star graph Inf Process Lett 62 4 201 207 10.1016/S0020-0190(97)00059-8 1453459
12. AK Gupta WJ Dally 2006 Topology optimization of interconnection networks IEEE Comput Archit Lett 5 1 10 13 10.1109/L-CA.2006.10 (Pubitemid 46438056)
13. H Haddadi G Iannaccone A Moore R Mortier M Rio 2008 A survey on network topology: inference, modelling and generation IEEE Commun Surv 10 2 48 69 10.1109/COMST.2008.4564479
14. DF Hsu 1994 On container width and length in graphs, groups, and networks IEICE Trans Fundam E77-A 668 680
15. Y Ishiyami 1996 The wide-diameter of the n-dimensional toroidal mesh networks Networks 27 257 266 10.1002/(SICI)1097-0037(199607)27:4<257::AID- NET1>3.0.CO;2-F 1397924 (Pubitemid 126091455)
16. JS Jwo S Lakshmivarahan SK Dhall 1993 A new class of interconnection networks based on the alternating groups Networks 23 315 326 0774.90031 10.1002/net.3230230414 1232323
17. S Lakshmivarahan JS Jwo SK Dhall 1993 Symmetry in interconnection networks based on Cayley graphs of permutations-a survey Parallel Comput 19 361 407 0777.05064 10.1016/0167-8191(93)90054-O 1216119 (Pubitemid 23686249)
18. SC Liaw GJ Chang 1998 Generalized diameters and Rabin numbers of networks J Comb Optim 2 4 371 384 10.1023/A:1009728720073 1669299
19. T-C Lin D-R Duh 2008 Constructing vertex-disjoint paths in (n,k)-star graphs Inf Sci 178 788 801 1128.68077 10.1016/j.ins.2007.09.014 2384804 (Pubitemid 350050977)
20. KJ Liszka JK Antonio HJ Siegel 1997 Problems with comparing interconnection networks: is an alligator better than an armadillo? IEEE Concurr 5 4 18 28
21. EK Lua J Crowcroft M Pias R Sharma S Lim 2005 A survey and comparison of peer-to-peer overlay network schemes IEEE Commun Surv 7 2 72 93 10.1109/COMST.2005.1610546
22. JD Owens WJ Dally R Ho DN Jayasimha SW Keckler L-S Peh 2007 Research challenges for on-chip interconnection networks IEEE Micro 27 5 96 108 10.1109/MM.2007.4378787 (Pubitemid 350218391)
23. Parhami B (1999) Introduction to parallel processing: algorithms and architectures. Plenum Press, New York
24. Y Suzuki K Kaneko 2006 An algorithm for disjoint paths in bubble-sort graphs Syst Comput Jpn 37 12 27 32 10.1002/scj.20518 (Pubitemid 44600726)
25. Xu J (2001) Topological structure and analysis of interconnection networks. Kluwer Academic, Dordrecht
26. J Xu 2004 Wide Diameters of Cartesian product graphs and digraphs J Comb Optim 8 171 181 1056.05048 10.1023/B:JOCO.0000031418.45051.8b 2071376
27. J Youhu 1998 A class of Cayley networks based on the alternating groups Adv Math (Chin) 4 361 362