Current trends in cloud computing suggest that both large, public clouds and small, private
clouds will proliferate in the near future. Operational requirements, such as high bandwidth,
dependability and smooth manageability, are similar for both types of clouds and
their underlying data center architecture. Such requirements can be satisfied with utilizing
fully distributed, low-overhead mechanisms at the algorithm level, and an efficient layer 2
implementation at the practical level. On the other hand, owners of evolving private data
centers are in dire need of an incrementally upgradeable architecture which supports a
small roll-out and continuous expansion in small quanta. In order to satisfy both requirements,
we propose Poincaré, a data center architecture inspired by hyperbolic tessellations,
which utilizes low-overhead, greedy routing. On one hand, Poincaré scales to support large
data centers with low diameter, high bisection bandwidth, inherent multipath and multicast
capabilities, and efficient error recovery. On the other hand, Poincaré supports incremental
plug & play upgradability with regard to both servers and switches. We evaluate
Poincaré using analysis, extensive simulations and a prototype implementation.
Márton Csernai a,⇑, András Gulyás a,b, Attila K}orösi a,b, Balázs Sonkoly a,c,d, Gergely Biczók e
a Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, 1117 Budapest, Hungary
b Hungarian Academy of Science (MTA), Information System Research Group Széchenyi István tér 9., 1051 Budapest, Hungary
c MTA-BME Future Internet Research Group Széchenyi István tér 9., 1051 Budapest, Hungary
d Inter-University Centre for Telecommunications and Informatics, Kassai út 26., 4028 Debrecen, Hungary
e Dept. of Telematics, Norwegian University of Science and Technology, N-7491 Trondheim, Norway