ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
NOX: towards an operating system for networks
ACM SIGCOMM Computer Communication Review
Floodless in seattle: a scalable ethernet architecture for large enterprises
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Dcell: a scalable and fault-tolerant network structure for data centers
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
VL2: a scalable and flexible data center network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
MDCube: a high performance network structure for modular data center interconnection
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces
INFOCOM'10 Proceedings of the 29th conference on Information communications
FPGA implementation of a Greedy algorithm for set covering
RTC'05 Proceedings of the 14th IEEE-NPSS conference on Real time
Scafida: a scale-free network inspired data center architecture
ACM SIGCOMM Computer Communication Review
LEGUP: using heterogeneity to reduce the cost of data center network upgrades
Proceedings of the 6th International COnference
A cost comparison of datacenter network architectures
Proceedings of the 6th International COnference
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Improving datacenter performance and robustness with multipath TCP
Proceedings of the ACM SIGCOMM 2011 conference
Understanding network failures in data centers: measurement, analysis, and implications
Proceedings of the ACM SIGCOMM 2011 conference
Jellyfish: networking data centers randomly
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Poincaré: A Hyperbolic Data Center Architecture
ICDCSW '12 Proceedings of the 2012 32nd International Conference on Distributed Computing Systems Workshops
Hi-index | 0.00 |
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 Poincare, a data center architecture inspired by hyperbolic tessellations, which utilizes low-overhead, greedy routing. On one hand, Poincare 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, Poincare supports incremental plug & play upgradability with regard to both servers and switches. We evaluate Poincare using analysis, extensive simulations and a prototype implementation.