Combinatorial Properties of Circulant Networks

We have extended our work in [1] and this paper investigates combinatorial properties of circulant networks including best containers, wide diameter, fault diameter and Rabin number. These properties have received much attention recently in the study of interconnection networks. In addition to these parameters we introduce fault wide diameter and study this parameter for circulant networks.

[1]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[2]  D.Frank Hsu,et al.  On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .

[3]  M. Krishnamoorthy,et al.  Fault diameter of interconnection networks , 1987 .

[4]  Ding-Zhu Du,et al.  Fault Tolerance Properties of Pyramid Networks , 1999, IEEE Trans. Computers.

[5]  Gerard J. Chang,et al.  WIDE DIAMETERS OF BUTTERFLY NETWORKS , 1999 .

[6]  John H. Smith.  Preparation of Papers for the IAENG International Journal of Applied Mathematics , 2009 .

[7]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[8]  D. Frank Hsu,et al.  Fault-tolerant routing in circulant networks and cycle prefix networks , 1998 .

[9]  Ming T. Liu.  Distributed Loop Computer Networks , 1978, Adv. Comput..

[10]  D. Frank Hsu,et al.  Combinatorial Properties of Generalized Hypercube Graphs , 1996, Inf. Process. Lett..

[11]  Jhing-Fa Wang,et al.  Reliable circulant networks with minimum transmission delay , 1985 .

[12]  I. Rajasingh,et al.  Reliability Measures in Circulant Network , 2011 .

[13]  M. Karlin,et al.  New binary coding results by circulants , 1969, IEEE Trans. Inf. Theory.

[14]  藍珮珊,et al.  Wide diameters and Rabin numbers of generalized folded hypercube networks , 2005 .

[15]  R. Wilkov,et al.  Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..

[16]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

[17]  Agustin Arruabarrena,et al.  Optimal Distance Networks of Low Degree for Parallel Computers , 1991, IEEE Trans. Computers.

[18]  William Y. C. Chen,et al.  Restricted routing and wide diameter of the cycle prefix network , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[19]  Jun,et al.  Wide Diameter of Generalized Petersen Graphs , 2010 .

[20]  Gerard J. Chang,et al.  Rabin numbers of Butterfly networks , 1999, Discret. Math..

[21]  Kevin E. Jia,et al.  On Wide Diameter of Cayley Graphs , 2009, J. Interconnect. Networks.