 Research
 Open Access
 Published:
Fast methods for designing circulant network topology with high connectivity and survivability
Journal of Cloud Computing volume 5, Article number: 5 (2016)
Abstract
This paper proposes two fast methods to design network topologies with high connectivity and survivability based on circulant graph theory. The first method, namely, the Combination Method (CM), investigates the average distances of circulant graphs with different combinations of chordal jumps, and tries to locate the optimal one among them. For this purpose, empirical formulas are proposed to describe the fluctuation features of average distances on curved surfaces. Furthermore, an enhanced Local Search Method (LSM) is proposed to find the local minimum points in troughs of the surfaces. The second method, namely, the Spider Web Method (SWM), is based on a bionic concept deriving from observation of the spider web, which is a classical example of network connectivity and survivability in natural world. The relation between CM and SWM in certain situations is also discussed. Finally, the connectivity and survivability of the topologies designed by CM and SWM are verified via simulated experiments involving vertex destruction.
Introduction
Topology design plays an important role in network planning. Various topologies have been studied and analyzed for different networks [1–3]. A circulant graph outperforms other topologies owing to its low message delay, high connectivity, and strong survivability [4–8]. Therefore, it has been widely employed in many technical fields such as telecommunication networks, computer networks, parallel processing systems, and social networks [9–12].
The connectivity and survivability of circulant graph networks can be evaluated by several metrics, such as average distance and connectivity ratio [2, 12–15]. The average distance is preferred as the prime optimization objective for it effectively represents network connectivity. In general, the smaller the average distance is, the shorter the delay is. Although network with complete graph topology has the minimum average distance of 1, the demand of a huge number of nodes and link resources usually render it impractical in projects. Therefore, the performance of circulant graphs with limited resources is a major focus of network planning. Lower bounds and heuristic algorithms locating the minimum average distance of a circulant graph have been proposed [2, 6, 15]. Furthermore, the average distance of a recursive circulant graph, i.e., a special type of circulant graph, has also been investigated [16]. However, the optimal jump sequence of a circulant graph can be determined only when its degree is 4.
In this paper, we propose two fast methods to construct network topology with small average distance and high connectivity ratio based on circulant graph theory and bionics. Furthermore, we verify the effectiveness of the proposed methods by simulated experiments.
The remainder of this paper is organized as follows: In section Definitions of chordal ring, average distance and connectivity ratio, the concepts of circulant graphs and evaluation metrics are introduced. In section The Combination Method for topology design, we propose a Combination Method (CM) that develops formulas and algorithms to construct a circulant graph with a relatively minimum average distance, based on the features and characteristics of the average distance fluctuation curves. A Local Search Method (LSM) is also developed to optimize the search for the jump sequence with the minimum average distance. In section The Spider Web Method for topology design, we propose a more intuitive design method, namely, the Spider Web Method (SWM). This method is typically effective when the degree of each node is 4. In section Survivability experiments, survivavility experiments are implemented to verify the survivability of topologies designed by CM and SWM. Different nodes and links are destroyed enumerately, and the worst connectivity ratios of the networks are recorded and compared. Finally, research results in this paper are summarized and concluded.
Definitions of chordal ring, average distance and connectivity ratio
Circulant graph and chordal ring
A circulant graph is a special case of a Cayley graph. Suppose that G(V, E) (V = {v _{1}, v _{2}, …,v _{ m }}, E = {e _{1}, e _{2}, …, e _{ n }}) is a graph with m vertices and n edges. The circulant graph can be defined as follows [2, 13]:

Definition 1: G(V, E) is a simple graph with m vertices and n edges. There are integers w _{1}, w _{2}, …, w _{ j } (w _{1} < w _{2} < … < w _{ j } < (m + 1)/2) that represent a jump sequence. Two vertices v_{ k } and v_{ l } of V are connected if and only if (k + w _{ i }) mod m = l, or (k – w _{ i }) mod m = l. This graph is defined as a circulant graph. A circulant graph with j jumps is usually denoted by CG(m; w _{1}, w _{2}, …, w _{ j }) or CG(m; W) with jump sequence W = {w _{1}, w _{2}, …, w _{ j }}, and W = j.

This definition does not guarantee that a circulant graph is connected. For example, CG(8; 1, 2) is a connected circulant graph, but CG(8; 2, 4) is not connected. Boesch and Tindell [5] found that a circulant graph is connected if and only if the greatest common divisor gcd(m, w _{1}, w _{2}, …,w _{ j }) is equal to 1. Such a graph is always known as a connected circulant graph. Furthermore, it has been proved that every connected circulant graph has a Hamiltonian cycle [17]. In particular, a complete graph can always be considered as a combination of all CG(m; w _{ i }) (1 ≤ i ≤ ⌊m/2⌋), which are considered as basic parts, as shown in Fig. 1.

In addition, the chordal ring network is introduced. There are two definitions for a chordal ring [13].

Definition 2: If a circulant graph CG(m, W) has w _{1} equal to 1, it is known as a chordal ring. The edges with w _{ i } ≠ w _{1} (2 ≤ i ≤ j) are denoted by chords of length w _{ i }.

Definition 3: G(V, E) is a simple graph with m vertices and n edges. Vertices v _{1}, v _{2}, …,v _{ m } in V are connected in sequence into a Hamiltonian cycle. There are integers w _{1}, w _{2}, …, w _{ j } (w _{1} < w _{2} < … < w _{ j } < (m + 1)/2). Two vertices v _{ k } and v _{ l } of V are connected if and only if k and l are odd numbers, and (k + w _{ i }) mod m = l. This graph is defined as a chordal ring. A circulant graph with j chords is usually denoted by CR(m, w _{1}, w _{2}, …, w _{ j }) or CR(m, W).

In this work, we consider the former definition of a chordal ring, i.e., Definition 2. From this definition, it can be deduced that a chordal ring is a special case of a connected circulant graph.
Average distance
The average distance \( \overline{D} \) is defined as the average length of the shortest paths between any two nodes in the network [2]. It is illustrated on the basis of bidirected graphs, which are essentially undirected graphs with edges represented by bidirected arrows instead of full lines [18]. \( \overline{D} \) can be expressed as
D _{ ij } is the shortest path distance between vertices v _{ i } and v _{ j }. In general, the shortest path distance can be expressed as
In the definition of D _{ ij }, x _{ ij } denotes whether there is an edge e _{ ij } from v _{ i } to v _{ j } on the path from v _{ s } to v _{ t }, and c _{ ij } denotes the cost of edge e _{ ij }. They can be expressed as follows:
According to the isomorphism of a circulant graph, \( \overline{D} \) can be simplified as [19–23]
A typical lower bound for the average distance is the Moore bound [2]. However, the Moore bound is attainable only for some special topologies [2, 6].
A circulant graph with a jump relatively prime with m is isomorphic to a chordal ring. Therefore, its average distance is equal to that of the corresponding chordal ring. In most cases, the optimal distance of a chordal ring is equal to that of a circulant with the same m. The smallest m that does not fit this rule is 450, according to the exhaustive research of Fiol [24, 25].
According to the definition of a circulant graph, there are C(⌊m/2⌋ , j) circulant graphs with different W for certain m and j. Correspondingly, the number of chordal rings for the same m and j is C(⌊m/2⌋ − 1, j − 1), which is j/⌊m/2⌋ the number of circulants on the same scale.
Connectivity ratio
Connectivity ratio is defined as the ratio of the number of reachable node pairs to the total number of node pairs in the network, and it can be calculated as\( C=\frac{{\displaystyle {\sum}_{i\in V}{\displaystyle {\sum}_{j\in V,j\ne i}{l}_{ij}}}}{m\left(m1\right)}, \) subject to
The maximum network connectivity ratio for a network with q node failures can be expressed as
Assuming that the probability of q node failures is p _{q}, we propose the probability weighted connectivity, calculated as \( \overline{C}={\displaystyle {\sum}_{q=1}^m{p}_q{C}_q} \)
\( \overline{C} \) is more suitable for measuring network survivability in the event of a disaster that may take a heavy toll.
The Combination Method for topology design
Average distance of chordal ring
In this section, the average distance of a chordal ring is calculated in an enumerated manner, and some characteristics are deduced. The number of edges in a chordal ring CR(m, W) is given by
The average distance of chordal rings for j = 1 and 2 has already been investigated; however, the average distance of more general chordal rings is still being studied. All these chordal rings are discussed stepwise:

①
If j = 1, n is equal to m (m ≥ 3) and the chordal ring is a Hamiltonian cycle. The average distance of the Hamiltonian cycle can be deduced from the following proposition:

Proposition 1: G(V, E) is a Hamiltonian cycle, V = m (m ≥ 3), E = n (n = m). If m is odd, its average distance is (m + 1)/4; if m is even, its average distance is (1/4)[1/(m − 1) + m + 1].


②
If j = 2, the average distance of the chordal rings can be expressed as a function \( \overline{D}=f\left(m,{w}_1,{w}_2\right) \) with w _{1} = 1. However, this function becomes too complex to be expressed analytically. We draw a curve that connects discrete average distance points that vary with w _{2}, as shown in Fig. 2. This figure shows 3 features of the average distance that varies with w _{2}jump:
First, there are several local minimum values scattered in the troughs among several local peak values. The values of the local minimum average distances do not differ significantly and are very close to the values of the global minimum points among them. All of them contribute to the flat envelope at the bottom of the curve.
Second, there are local maximum average distance points near (2/k)w _{max}, [4/(2k + 1)]w _{max} (k ≥ 2), where w _{ max } = ⌊m/2⌋. The values of the peaks are approximately linearly proportional to their positions when k is small. Specifically, the average distance is nearly \( \left(2/k\right){\overline{D}}_{\max } \) at points w _{2} = (2/k)w _{max}. Further, \( {\overline{D}}_{\max } \) is the average distance when w _{2} = w _{max}. However, if k is large, the peaks cannot be resolved and is no longer linearly proportional to its position. The peaks can clearly be observed along the red and green lines in Fig. 2.
The tendency of the optimal average distances varying with m is presented in Fig. 3. Although it has been proved that the average distance does not increase monotonically with m [24], it approximately has a relation with m. From Fig. 3, the global minimum average distance in our topology with n = 2 m is nearly proportional to \( \sqrt[2]{m} \). The relation between \( {\overline{D}}_{\min } \) and m can be represented approximately as
$$ {\overline{D}}_{\min}\approx 0.47\left(\sqrt[2]{m}\sqrt[2]{5}\right)+1 $$(9) 
③
If 2 < j ≤ ⌊m/2⌋, the average distance of the chordal ring can be expressed as a function as follows:
$$ \begin{array}{c}\hfill \hfill \\ {}\hfill \overline{D}=f\left(m,{w}_1,\dots \kern0.2em ,{w}_i,\dots \kern0.2em ,{w}_j\right)\kern1.1em \hfill \\ {}\hfill \hfill \end{array}\left(\begin{array}{c}\hfill {w}_1=1\hfill \\ {}\hfill 2<{w}_i\le \left\lfloor \frac{m}{2}\right\rfloor, 2\le i\le j\hfill \\ {}\hfill {w}_i<{w}_k,i<k\le j\hfill \end{array}\right) $$(10)There are C(⌊m/2⌋ − 1, j − 1) choices for W = {w _{1}, w _{2}, …,w _{ j }}. Figure 4 shows an example of \( \overline{D} \) varying with w _{2} and w _{3} (w _{1} = 1). Even though the curved surface is rough, the envelope of the local minimum points is on a relatively flat surface. In Fig. 11, several peak sequences can be found radiating with increasing peak values from positions where w _{2} and w _{3} are small. They are local maximum points at (w _{2}, w _{3}), with w _{3} near (2/k)w _{max} or [4/(2k + 1)]w _{max} and w _{2} near (2/s)w _{3} or [4/(2s + 1)]w _{3} (k ≥ 2, s ≥ 2).
Empirical formulas of the minimum average distance values are also studied by a curve fitting method. The shortest average distance varying with j and m can be approximately expressed as
$$ {\overline{D}}_{\min}\left(j,m\right)\approx \left\{\begin{array}{c}\hfill \begin{array}{cc}\hfill \frac{j}{4}\left[0.94+\frac{4j5}{m}\right]\kern0.22em \left[{m}^{\frac{1}{j}}{\left(2j+1\right)}^{\frac{1}{j}}\right]+1\hfill & \hfill 2\le j<\left\lfloor \frac{m}{2}\right\rfloor \hfill \end{array}\hfill \\ {}1\begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\begin{array}{cc}\hfill \begin{array}{cc}\hfill \hfill & \hfill \hfill \end{array}\hfill & \hfill j\ge \left\lfloor \frac{m}{2}\right\rfloor \hfill \end{array}\hfill \end{array}\right. $$(11)To verify the effectiveness of the formula, we compare the real \( {\overline{D}}_{\min } \) selected in enumerated manner according to the definition of average distance, with that calculated using formula (11). The result is presented in Fig. 5. According to the empirical formula described above, \( {\overline{D}}_{\min } \) is approximately proportional to j m ^{1/j}.
The Combination Method
The idea of Combination Method is to select the optimal combination of chordal jumps by avoiding the peaks on the curved surface of the average distance. The formula for different number of jumps (j) is proposed as follows.

①
If j = 2, the average distance curve has a rough surface which does not vary monotonous with w _{2} and is hard for choosing the optimal w _{2}jump. However, if the peak positions can be avoided, some local minimum points are still locatable. In this work, two peak avoidance methods are developed:
The first method is Global Peak Avoidance (GPA). As shown by the pink marker in Fig. 6, there is a relatively slow varying region that has very small average distance values. Although the values may not be the global minimum points, they are very close to the optimal ones. We can quantitatively locate w _{2}jump in this region as
$$ {w}_2=\left\lfloor \sqrt[2]{m}\right\rfloor $$(12)For example, for m = 289, w _{2} = 17, and the corresponding \( {\overline{D}}_{sel} = 8.5 \). This is very close to the minimum average distance of 8.0278.
The second method is Local Peak Avoidance (LPA). This method derives from the motivation to select jump sequence W in the trough between peaks near the positions of (2/k)w _{max}, [4/(2k + 1)]w _{max}.
$$ {w}_2=\left\lfloor \left(2/k\right){w}_{\max}\pm \beta \right\rfloor, \kern1em \beta =\sqrt[2]{\left[\frac{2}{k}\frac{2}{k+1}\right]m} $$(13)$$ {w}_2=\left\lfloor \left[4/\left(2k+1\right)\right]{w}_{\max}\pm \gamma \right\rfloor, \kern1em \gamma =\sqrt[2]{\left[\frac{4}{2k+1}\frac{2}{k+1}\right]\left(\frac{m}{2}\right)} $$(14)The former w _{2} is termed as TypeI jump, whereas the latter is termed as TypeII jump.
A simulation is implemented to verify these formulas. The chordal ring with m = 289 is still considered as an instance. For TypeI jump, select k = {2, 3, 4, 5, 6}, and calculate w _{2} that complies with the TypeI jump formula (13). After the removal of w _{2} from the range of (1, w _{max}), the results are obtained as shown in Fig. 6 (a). Similarly, for the TypeII jump, select k = {2, 3, 4, 5}, and calculate w _{2} that complies with the TypeII jump formula (14). The results are shown in Fig. 6 (b). The mean value of the average distance of the TypeI jump location \( {\overline{D}}_{sel TypeI} \) is 8.3927, and that of the TypeII jump location \( {\overline{D}}_{sel TypeII} \) is 8.3733. They are also very close to the optimal average distance of 8.0278.

②
If j = 3, troughs with relatively small values on the average distance surface can also be found. Similarly, this can be accomplished by avoiding local peaks. We select two types of W = (1, w _{2}, …, w _{i}, …, w _{ j }) (2 ≤ i < j). For the TypeI jump sequence,
$$ {w}_j=\left\lfloor \left(2/{k}_j\right){w}_{\max}\pm {\beta}_j\right\rfloor, \kern1em {\beta}_j=\sqrt[2]{\left[\frac{2}{k_j}\frac{2}{k_j+1}\right]m} $$(15)$$ {w}_i=\left\lfloor \left(2/{k}_i\right){w}_{i+1}\pm {\beta}_i\right\rfloor, \kern1em {\beta}_i=\sqrt[2]{\left[\frac{2}{k_i}\frac{2}{k_i+1}\right]\left(2{w}_{i+1}\right)} $$(16)For the TypeII jump sequence,
$$ {w}_j=\left\lfloor \left[4/\left(2{k}_j+1\right)\right]{w}_{\max}\pm {\gamma}_j\right\rfloor, \kern0.5em {\gamma}_j=\sqrt[2]{\left[\frac{4}{2{k}_j+1}\frac{2}{k_j+1}\right]\left(\frac{m}{2}\right)} $$(17)$$ {w}_i=\left\lfloor \left[4/\left(2{k}_i+1\right)\right]{w}_{i+1}\pm {\gamma}_i\right\rfloor, \kern0.5em {\gamma}_i=\sqrt[2]{\left[\frac{4}{2{k}_i+1}\frac{2}{k_i+1}\right]{w}_{i+1}} $$(18)When m = 125 and j = 3, the average distances of the selected W according to the above formulas, are listed in Table 1. From the experiments, the mean values of the average distances selected by the TypeI and TypeII peak avoidance methods are 3.6252 and 3.8170, respectively. They are very close to the optimal average distance of 3.3226.
The Local Search Method for further optimization
In this section, Adaptive algorithm is devloped to minimize the average distance, based on the conclusions made above.
In general, An adaptive algorithm is divided into two steps: configuration of the initial parameters and iteration of the objective function. In this context, the parameter is the jump sequence W = {w _{1}, w _{2}, …, w _{ j }} with a fixed number of vertices m and j jumps. The objective function is the average distance \( \overline{D}=f\left(m,{w}_1,\dots \kern0.2em ,\kern0.1em {w}_i,\kern0.1em \dots \kern0.2em ,\kern0.1em {w}_j\right) \) in equation (12). The algorithm is described as follows.

①
Initial value for iteration
The initial W can be configured by the peak avoidance method mentioned above. Using these methods, W with a relatively small average distance can be achieved.
The initial step for iteration can be configured as \( \alpha \).

②
Optimization by local search method
A local search method is an algorithm that searches for the local minimum average distance of a chordal ring. The details of the algorithm are presented in Table 2.
This local search process starts from different initial W in parallel; all these local optimal results are compared, and the minimum one which is closest to the global optimal point is chosen. The chordal ring with m = 289 and j = 2 is considered as an instance. w _{2} = 79 is an initial jump according to the peak avoidance method. After one iteration of the local search algorithm, w _{2} = 80, and the corresponding \( {\overline{D}}_{center}=8.0278 \), which is equal to the global optimal average distance.
The Spider Web Method for topology design
The spider web method is proposed based on the bionic phenomenon of robust nets weaved by spiders.
Design method description
For a graph with m = k ^{2} (k ≥ 3), where the degree of each vertex is 4, we can construct our robust topology as follows:

①
Divide m vertices into k groups with each group containing k vertices. The groups are numbered from 1 to k. The vertices in group i (1 ≤ i ≤ k) are denoted by V _{ i } = (v _{ k+i }, v _{2k+i }, ……,v _{ jk+i },……, v _{(k1)k+i }) (0 ≤ j ≤ k1).

②
Connect the vertices in each group into a ring.

③
For every j, connect vertices v _{ jk+i } in all groups from V _{1} to V _{k} into a line.

④
For every j, connect vertices v _{ jk+k } and v _{[(j+1)%k]·k+1} with an edge.
An example of this structural behavior of spider web topologies with 9 and 16 vertices is shown in Fig. 7.
There are three types of edges in this figure. The edges in red are generated in step 2 to construct rings; thus, they are termed as hoop directional edges. The edges in blue are generated in step 3 to construct lines; thus, they are termed as radial directional edges. The edges in black are generated in step 4 to connect two vertices on neighboring radial directional lines and rings with the largest difference in group indices; they are termed as bevel edges. Because these topologies are very similar to a spider web when the number of nodes is large, we refer to them as standard spider web topologies.
In addition, an obvious conclusion is that the average distance of a standard spider web topology where the number of vertices is m = k ^{2} is given by \( \overline{D}=k/2=\sqrt[2]{m}/2 \).
Proof:
We assume that k is even. A path length is a combination of three parts: hoop subpath, radial subpath, and bevel subpath. First, the distance from vertex v _{1} to the other vertices is considered. For vertices with smaller indices on a radial directional line, the shortest path can go along the cycle first, and then, move up along the radial direction line to the destination vertex, as shown by the red path in Fig. 8. For vertices with larger indices on a radial directional line, the shortest path can go along the cycle first, and then move along a bevel edge and down the radial direction line to the destination vertex, as shown by the blue path in Fig. 8.
The sum of the shortest paths from v _{1} to other vertices can be written as
Because every vertex in the spider web is equally important, the average distance can be written as
Similarly, when k is odd, we can come to the same conclusion.
Therefore, the average distance of a standard spider web is \( \sqrt[2]{m}/2 \).
Extension of spider web topologies
Spider web topologies can be extended in a very intuitive manner. There are two main directions for the extension of spider web topologies: hoop directional extension and radial directional extension.
For hoop directional extension, one vertex is added to each vertex group and is connected into the corresponding ring between the vertices with the maximum and minimum indices in the group. Then, the new vertices are connected into a radial directional line. Finally, bevel edges are added before and after the new radial directional line. A topology extended from 12 vertices to 16 vertices is shown as an example in Fig. 9.
For radial directional extension, s vertices are added to the graph, and they are connected into a new ring. Each radial directional line is extended to connect a vertex on the new ring. The bevel edges start from the new vertex and extend to the vertex with the minimum index on the neighboring radial directional line. A topology extended from 12 vertices to 15 vertices is shown as an example in Fig. 10.
By these extension methods, spider web topologies can be conveniently transformed without complex reconstruction.
Relation with the combination method
The standard spider web topology is identical to the combination method with m = k ^{2} (k ≥ 3) and w = k. Their connection matrices have the same eigenvalues. This relation can be seen intuitively in Fig. 11. In conclusion, the spider web topology is a special case of the topology constructed using the combination method, but it is more intuitive.
Survivability experiments
To evaluate the survivability of topologies, we design an survivability experiment. It is implemented by the targeted nodes attack. For a topology with m nodes and n links, we destroy k out of m nodes in an enumerated manner. Then, we select the worst case of the connectivity ratio among all the attack results as the metric for comparison with other topologies.
For topologies with different design methods, the worstcase connectivity ratio is used to verify the effectiveness of the combination method. Figures 12 and 13 show comparisons of these topologies.
From Fig. 12, we can see that a topology designed using the combination method performs better than a topology designed using an integer linear programming (ILP) model with the equal degree and node connection constraints. From Fig. 13, we can see that the combination method is slightly better than the hypercube when k is large.
For all topologies constructed using the combination method with the same m and n, the worstcase connectivity ratio is used to verify the effectiveness of w selection.
Figure 14 (a) shows the connectivity ratio of a designed topology with m = 18 nodes. The connectivity ratio decreases more slowly when w = 4. In particular, when 5 nodes fail, the connectivity ratio is nearly 0.3, which is much higher than that for other w. Figure 14 (b) shows the variation of \( {\overline{C}}_{num} \) with w for different m. In this simulation, p _{q} is set to 1/m. All these curves have higher points at w = 4 or 5. This verifies the selection of \( {w}_{sel}=\left\lfloor \sqrt[2]{m}\right\rfloor \) in formula (12).
Conclusion
We proposed two quick methods to construct topologies with small average distance and high connectivity: CM and SWM. CM can be divided into two special methods according to different empirical formulas, namely, the Global Peak Avoidance method and the Local Peak Avoidance method. Further, CM can be enhanced by a local search method. SWM is essentially a special case of CM; it is a more intuitive and expandable approach. Experimental results showed that the topologies designed by CM and SWM perform well in terms of network connectivity and survivability.
References
 1.
Dégila JR, Sanso B (2004) A survey of topologies and performance measures for largescale networks[J]. Commun Surv Tutorials, IEEE 6(4):18–31
 2.
Kotsis G (1992) Interconnection topologies and routing for parallel processing systems[M]. ACPCAustrian Center for Parallel Computation
 3.
Nemhauser GL, Kan AR, Todd M (1989) Handbooks in operations research and management science[J]. Optimization 1:1–78
 4.
Van Doorn EA (1986) Connectivity of circulant digraphs[J]. J Graph Theory 10(1):9–14
 5.
Boesch F, Tindell R (1984) Circulants and their connectivities[J]. J Graph Theory 8(4):487–499
 6.
Boesch FT, Wang JF (1985) Reliable circulant networks with minimum transmission delay[J]. Circuits Syst, IEEE Trans 32(12):1286–1291
 7.
Li Q, Li Q (1998) Reliability analysis of circulant graphs[J]. Networks 31(2):61–65
 8.
Penso LD, Rautenbach D, Szwarcfiter JL (2011) Connectivity and diameter in distance graphs[J]. Networks 57(4):310–315
 9.
Banerjee S, Jain V, Shah S (1999) Regular multihop logical topologies for lightwave networks[J]. Commun Surv, IEEE 2(1):2–18
 10.
Mohan Reddy E, Reddy E (1996) A dynamically reconfigurable WDM LAN based on reconfigurable circulant graph[C]//Military Communications Conference, 1996. MILCOM’96, Conference Proceedings, IEEE. IEEE 1996(3):786–790
 11.
Arden BW, Lee H (1981) Analysis of chordal ring network[J]. Comp, IEEE Trans 100(4):291–295
 12.
Marklof J, Strömbergsson A (2013) Diameters of random circulant graphs[J]. Combinatorica 33(4):429–466
 13.
Bujnowski S, Dubalski B, Zabłudowski A (2003) Analysis of chordal rings[J]. Mathematical Techniques and Problems in Telecommunications. Centro International de Matematica, Tomar, pp 257–279
 14.
Morillo P, Comellas F, Fiol M A. The optimization of chordal ring networks[J]. Commun Technol 1987: 295299
 15.
Toueg S, Steiglitz K (1979) The design of smalldiameter networks by local search[J]. IEEE Trans Comput 7:537–542
 16.
Park J H, Chwa K Y. Recursive circulant: A new topology for multicomputer networks[C]//Parallel Architectures, Algorithms and Networks, 1994.(ISPAN), International Symposium on. IEEE, 1994: 7380
 17.
Chen CC, Quimpo NF (1981) On strongly hamiltonian abelian group graphs[M]//Combinatorial mathematics VIII. Springer, Berlin Heidelberg, pp 23–34
 18.
Lupparelli M, Marchetti GM, Bergsma WP (2009) Parameterizations and Fitting of Bi‐directed Graph Models to Categorical Data[J]. Scand J Stat 36(3):559–576
 19.
Ádám A (1967) Research problem 210[J]. J Combin Theory 2(393):217
 20.
Alspach B, Parsons TD (1979) Isomorphism of circulant graphs and digraphs[J]. Discret Math 25(2):97–108
 21.
Muzychuk M (1997) On Ádám’s conjecture for circulant graphs[J]. Discret Math 176(1):285–298
 22.
Xu MY (1998) Automorphism groups and isomorphisms of Cayley digraphs[J]. Discret Math 182(1):309–319
 23.
Dobson E (2008) On isomorphisms of circulant digraphs of bounded degree[J]. Discret Math 308(24):6047–6055
 24.
Bermond JC, Comellas F, Hsu DF (1995) Distributed loop computernetworks: a survey[J]. J Parallel Distrib Comput 24(1):2–10
 25.
Fiol MA, Yebra JLA, Alegre I et al (1987) Discrete optimization problem in local networks and data alignment[J]. IEEE Trans Comput 6:702–713
Acknowledgement
The author thanks Professor Xiaoping Zheng and Dr. Qingshan Li in Tsinghua University who carefully revised this paper for grammar and spelling. The author also thanks Mrs. Cuilan Du in CNCERT who provides facility for this study.
Author information
Additional information
Competing interests
The author declared that they have no competing interests.
Authors’ contributions
Author LR proposed the idea of this paper, carefully designed two methods and the experiments. Author LR also drafted and revised the manuscript. The author read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Lu, R. Fast methods for designing circulant network topology with high connectivity and survivability. J Cloud Comp 5, 5 (2016) doi:10.1186/s136770160056x
Received
Accepted
Published
DOI
Keywords
 Network
 Topology design
 Circulant graph
 Average distance
 Local search method