Integrating microsecond circuit switching into the data center
- 27 August 2013
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 43 (4), 447-458
- https://doi.org/10.1145/2534169.2486007
Abstract
Recent proposals have employed optical circuit switching (OCS) to reduce the cost of data center networks. However, the relatively slow switching times (10--100 ms) assumed by these approaches, and the accompanying latencies of their control planes, has limited its use to only the largest data center networks with highly aggregated and constrained workloads. As faster switch technologies become available, designing a control plane capable of supporting them becomes a key challenge. In this paper, we design and implement an OCS prototype capable of switching in 11.5 us, and we use this prototype to expose a set of challenges that arise when supporting switching at microsecond time scales. In response, we propose a microsecond-latency control plane based on a circuit scheduling approach we call Traffic Matrix Scheduling (TMS) that proactively communicates circuit assignments to communicating entities so that circuit bandwidth can be used efficiently.Keywords
This publication has 16 references indexed in Scilit:
- Aspen treesPublished by Association for Computing Machinery (ACM) ,2013
- Hunting mice with microsecond circuit switchesPublished by Association for Computing Machinery (ACM) ,2012
- Augmenting data center networks with multi-gigabit wireless linksPublished by Association for Computing Machinery (ACM) ,2011
- Perfect matchings in o( n log n ) time in regular bipartite graphsPublished by Association for Computing Machinery (ACM) ,2010
- A scalable, commodity data center network architecturePublished by Association for Computing Machinery (ACM) ,2008
- OpenFlowACM SIGCOMM Computer Communication Review, 2008
- Wavelength add-drop switching using tilting micromirrorsJournal of Lightwave Technology, 1999
- High-performance multi-queue buffers for VLSI communications switchesACM SIGARCH Computer Architecture News, 1988
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic MatricesThe Annals of Mathematical Statistics, 1964
- 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment ProblemPublished by Walter de Gruyter GmbH ,1953