c-Through
Authors:
Open Access
- 16 August 2010
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 40 (4) , 327-338
Abstract
Data-intensive applications that operate on large volumes of data have motivated a fresh look at the design of data center networks. The first wave of proposals focused on designing pure packet-switched networks that provide full bisection bandwidth. However, these proposals significantly increase network complexity in terms of the number of links and switches required and the restricted rules to wire them up. On the other hand, optical circuit switching technology holds a very large bandwidth advantage over packet switching technology. This fact motivates us to explore how optical circuit switching technology could benefit a data center network. In particular, we propose a hybrid packet and circuit switched data center network architecture (or HyPaC for short) which augments the traditional hierarchy of packet switches with a high speed, low complexity, rack-to-rack optical circuit-switched network to supply high bandwidth to applications. We discuss the fundamental requirements of this hybrid architecture and their design options. To demonstrate the potential benefits of the hybrid architecture, we have built a prototype system called c-Through. c-Through represents a design point where the responsibility for traffic demand estimation and traffic demultiplexing resides in end hosts, making it compatible with existing packet switches. Our emulation experiments show that the hybrid architecture can provide large benefits to unmodified popular data center applications at a modest scale. Furthermore, our experimental experience provides useful insights on the applicability of the hybrid architecture across a range of deployment scenarios.Keywords
This publication has 21 references indexed in Scilit:
- BCube2009
- A scalable, commodity data center network architecture2008
- Dynamo2007
- On Count-to-Infinity Induced Forwarding Loops Ethernet Networks2006
- On the Feasibility of Optical Circuit Switching for High Performance Computing Systems2005
- Viking: a multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks2005
- Stability issues in OSPF routing2001
- The iSLIP scheduling algorithm for input-queued switchesIEEE/ACM Transactions on Networking, 1999
- Efficient algorithms for finding maximum matching in graphsACM Computing Surveys, 1986
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965