Beruflich Dokumente
Kultur Dokumente
Dimitri Papadimitriou
Alcatel-Lucent Bell
Antwerpen, Belgium
Email: dimitri.papadimitriou@alcatel-lucent.com
I. I NTRODUCTION
The growing demand for cloud computing services is
leading to an increasing deployment of large-scale Data
Centers (DCs) as the underlying infrastructure to provide
those services. However, the exponential grown of such
DCs entails many challenges in terms of scalability, faulttolerance, energy efciency and performance [1]. Therefore,
the design of DCs architectures with high-efcient routing
schemes plays an important role to face some of those
challenges. Cayley Graphs (CGs), a kind of graphs that
represents an algebraic group, has been studied and proposed
to represent the underlying interconnection network of DCs
with many interesting properties [2].
In the last decade, the concept of algebraic groups with
Automatic Structure (AS) [3] has become interesting for
CGs. The main idea behind AS is to encode the global
structure of the graph into a Finite State Automaton (FSA).
The automaton constructs local models of the graph and
rules to put them together. This can be done by exploring
the homogeneity of CG to unwrap a local neighborhood
around the identity element and then to obtain the global
1545-0678/14 $31.00 2014 IEEE
DOI 10.1109/ICDCSW.2014.29
FOR
DATA C ENTERS
O ((| S | +
| B |) | |) and its time complexity is bounded by
O | |3 . Recently, we proposed in [6] a scheme that works
on any CG with nite group presentation. This scheme uses
the fact that nite groups are automatics and they can be
efciently presented by FSA. The resulting routing table for
algorithm is O(dg) and its time complexity is O(D2 ), where
dg is the degree of any node in the CG and D is the diameter
of the network, respectively. Although this scheme has very
compact routing tables, which is the degree of any node,
the space requirements for the FSA could be worst than the
traditional routing table of the previews works. The space
requirements of several structures to implement this scheme
are evaluated in this paper. A survey of how this scheme
works is presented in Section V.
64
65
66
Table I
M AIN PROPERTIES OF THE EVALUATED C AYLEY G RAPHS
Graph Family
Nodes
Degree
Diameter
H(n)
BF(n)
T P(n)
BS(n)
ST (n)
P(n)
2n
n 2n
n!
n!
n!
n!
n
4
n
3(n)/2
n1
n
2
n1
n1
n1
Table II
T HE VALUE OF n AND THE RESULTING NUMBER OF VERTICES FOR H(n),
BF(n), T P(n), BS(n), ST (n) AND P(n)
n
2
3(n 1)/2
17n/16 Diameter (5n + 5)/3
Cayley Graph
Instance
Number of Vertices
H(n)
1
2
3
4
5
6
6
9
10
12
16
18
64
512
1024
4096
65536
262144
BF(n)
1
2
3
4
5
6
4
6
7
9
12
14
64
384
896
4608
49152
229376
1
2
3
4
5
6
4
5
6
7
8
9
24
120
720
5040
40320
362880
VII. R ESULTS
Figure 1 shows the results of the space evaluation for different automatons and different graphs (families and sizes).
The H(n), BS(n) and T P(n) presented the best CR metric.
Their CR had an exponential decrease (tending to zero) in
67
Figure 1.
all the instances of such graphs. The only exception was the
SAS that had a CR over 1 in the rst instance of both BS(n)
and T P(n). On the other hand, BF(n), ST (n) and P(n) had
a slow decrease in the CR value. However, after the second
instance, the BF(n) and ST (n) obtained a CR less than 1.
In general, the P(n) had the worst behavior with CR over 1
in all combinations with the exception of WA+WD.
The automata combination with the best performance was
to use the WA for the labeling process together with the WD
for the forwarding process of the routing scheme. Figure
2 shows the CR of such combination for each family of
graphs, when the number of vertices increases. In almost all
the instances, this combination performs better in terms of
space requirements than the scheme used for comparison.
Note that the graphs BF(n) and ST (n) also obtained a fast
decreasing of the CR with this combination of automata.
This was expected because the process to nd a SAS uses an
initial WD to construct the GM. Since the second automaton
is more complex, which is consequence of SAS denition, it
will have more states than the rst one. This also happened
with the WA and the IA, where the rst one always was
smaller than the second one.
We also analyzed the best performance of H(n), BS(n)
and T P(n) in terms of space requirements with respect to the
other three families of graphs. By analyzing their respective
SAS (see [3], Lemma 2.3.2), we saw that this behavior was
due to the k-fellow-traveler property. Figure 3 shows the
value of k for all the instances of each family of graphs. For
H(n), BS(n) and T P(n) the value of k is a small constant for
all their instances. It means that their ERT always have an
entry, or equivalently a state in the FSA, for each vertex in
the ball of ratio karound the identity vertex. On the contrary,
the value of k for the graphs BF(n), ST (n) and P(n) is not a
Figure 2.
Figure 3.
68
VIII. C ONCLUSION
The structure of interconnection networks with underlying
CG impacts on the space requirements of a routing scheme
based on automata. We have shown that a CG with both low
and constant k-fellow traveler property, needs very small
routing tables. This was veried in the cases of the CG
families Hypercube, Bubble-Sort and Transposition graphs.
Other graph families such as Buttery, Star and Pancake
also have a small tables with respect to a general-purpose
algorithm for the same kind of graphs. However, in the latest
cases, the reduction of the routing table size only is effective
when the number of vertices is very large.
The evaluation of different FSAs to implement proposed
scheme [6] indicated that a SAS is not the best option to do
it. In fact, since nite groups have nite CRS, it is possible to
use some alternative structures based on automata to perform
the same task as SAS with less space requirements. Those
structures arise from the process of constructing a SAS for
the group that represents the CG. However, there are several
cases where constructing the SAS would be recommended.
For example, the WA can be used to compute the growth
function of a CG, which is a function that determines the
number of vertices at given distance from any vertex, or
to compute the k-fellow traveler property of the CG by
analyzing the individual multipliers of the AS. Future work
will entail in the design the new interconnection networks
with underlying CG for data-centers, with routing scheme
based on AS and very small routing tables. It implies that
these networks must enjoy both a low and constant value of
the k-fellow traveler property, while it keeps all the wellknown properties of CGs.
ACKNOWLEDGMENT
This research work is partially funded by the European
Commission (EULER project, FP7 258307), the Spanish
Government (RoGER project, TEC 2012-32336), the Generalitat of Catalonia (CSI project, SGR-1202), and the SUR of
the Generalitat of Catalonia and the European Social Fund
(PhD grant FI-DGR 2011).
R EFERENCES
[1] K. Bilal, S. U. R. Malik, O. Khalid, A. Hameed, E. Alvarez,
V. Wijaysekara, R. Irfan, S. Shrestha, D. Dwivedy, M. Ali,
U. S. Khan, A. Abbas, N. Jalil, and S. U. Khan, A taxonomy
and survey on green data center networks, Future Generation
Computer System, 2013.
[2] M.-C. Heydemann, Cayley graphs and interconnection networks, in Graph Symmetry, ser. NATO ASI Series, G. Hahn
and G. Sabidussi, Eds. Springer Netherlands, 1997, vol. 497,
pp. 167224.
[3] D. B. A. Epstein, M. S. Paterson, J. W. Cannon, D. F. Holt,
S. V. Levy, and W. P. Thurston, Word Processing in Groups.
Natick, MA, USA: A. K. Peters, Ltd., 1992.
[4] J. Cannon, The combinatorial structure of cocompact discrete hyperbolic groups, Geometriae Dedicata, vol. 16, no. 2,
pp. 123148, 1984.
69