OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
c-Through: part-time optics in data centers
Proceedings of the ACM SIGCOMM 2010 conference
Helios: a hybrid electrical/optical switch architecture for modular data centers
Proceedings of the ACM SIGCOMM 2010 conference
Augmenting data center networks with multi-gigabit wireless links
Proceedings of the ACM SIGCOMM 2011 conference
Proceedings of the 2nd ACM Symposium on Cloud Computing
Practical TDMA for datacenter ethernet
Proceedings of the 7th ACM european conference on Computer Systems
OSA: an optical switching architecture for data center networks with unprecedented flexibility
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering
Computer Communications
Mirror mirror on the ceiling: flexible wireless links for data centers
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Integrating microsecond circuit switching into the data center
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
ACM SIGCOMM Computer Communication Review
Circuit switching under the radar with REACToR
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
Recently, there have been proposals for constructing hybrid data center networks combining electronic packet switching with either wireless or optical circuit switching, which are ideally suited for supporting bulk traffic. Previous work has relied on a technique called hotspot scheduling, in which the traffic matrix is measured, hotspots identified, and circuits established to automatically offload traffic from the packet-switched network. While this hybrid approach does reduce CAPEX and OPEX, it still relies on having a well-provisioned packet-switched network to carry the remaining traffic. In this paper, we describe a generalization of hotspot scheduling, called traffic matrix scheduling, where most or even all bulk traffic is routed over circuits. In other words, we don't just hunt elephants, we also hunt mice. Traffic matrix scheduling rapidly time-shares circuits across many destinations at microsecond time scales. The traffic matrix scheduling algorithm can route arbitrary traffic patterns and runs in polynomial time. We briefly describe a working implementation of traffic matrix scheduling using a custom-built data center optical circuit switch with a 2.8 microsecond switching time.