Cayley graph connected cycles: A new class of fixed-degree interconnection networks

2002 ◽  
Author(s):  
S.R. Ohring ◽  
F. Sarkar ◽  
S.K. Das ◽  
D.H. Hohndei
Keyword(s):  
Cayley Graph ◽  
Interconnection Networks ◽  
Fixed Degree ◽  
New Class

Designing a New Class of Fault Tolerant Multistage Interconnection Networks

2005 ◽  
Vol 06 (04) ◽  
pp. 361-382 ◽  
Author(s):  
K. V. Arya ◽  
R. K. Ghosh
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Multistage Interconnection Networks ◽  
Multistage Interconnection Network ◽  
New Class

This paper proposes a technique to modify a Multistage Interconnection Network (MIN) to augment it with fault tolerant capabilities. The augmented MIN is referred to as Enhanced MIN (E-MIN). The technique employed for construction of E-MIN is compared with the two known physical fault tolerance techniques, namely, extra staging and chaining. EMINs are found to be more generic than extra staged networks and less expensive than chained networks. The EMIN realizes all the permutations realizable by the original MIN. The routing strategies under faulty and fault free conditions are shown to be very simple in the case of E-MINs.

A new class of interconnection networks based on the alternating group

Networks ◽  
1993 ◽  
Vol 23 (4) ◽  
pp. 315-326 ◽  
Author(s):  
Jung-Sing Jwo ◽  
S. Lakshmivarahan ◽  
S. K. Dhall
Keyword(s):  
Interconnection Networks ◽  
Alternating Group ◽  
New Class

scholarly journals Some exact values for the diameter in Cayley graph Hl,p

2019 ◽  
Author(s):  
Caroline Patrão ◽  
Luis Kowada ◽  
Diane Castonguay ◽  
André Ribeiro ◽  
Celina Figueiredo
Keyword(s):  
Cayley Graph ◽  
Lower Bounds ◽  
Interconnection Networks ◽  
The Family ◽  
The Difference

The family of graphs H,p has been defined in the context of edge partitions. The established properties such as vertex transitivity and low diameter suggest this family as a good topology for the design of interconnection networks. The vertices of the graphH p are the tuples with values between 0 and p1, such that the sum of the values is a multiple of p, and there is an edge between two vertices, if the two corresponding tuples have two pairs of entries whose values differ by one unit. In order to work towards the diameter, the difference between an upper and a lower bounds is established to be at most and we present subfamilies of graphs H p such that, for several values of and p, the bounds are tight.

scholarly journals FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR

2008 ◽  
Vol 85 (2) ◽  
pp. 269-282 ◽  
Author(s):  
ALISON THOMSON ◽  
SANMING ZHOU
Keyword(s):  
Cayley Graph ◽  
Cyclic Group ◽  
Interconnection Networks ◽  
Frobenius Group ◽  
Optimal Routing ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Frobenius Kernel ◽  
Even Order

AbstractA first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that S=aH for some a∈K with 〈aH〉=K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as models for interconnection networks, it is thus highly desirable to characterize those which are Frobenius of the first kind. In this paper we first give such a characterization for connected 4-valent circulant graphs, and then describe optimal routing and gossiping schemes for those which are first kind Frobenius graphs. Examples of such graphs include the 4-valent circulant graph with a given diameter and maximum possible order.

Sign in / Sign up

Export Citation Format

Share Document