TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Convex Optimization
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
Proceedings of the ACM SIGCOMM 2010 conference
Better never than late: meeting deadlines in datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
Less is more: trading a little bandwidth for ultra-low latency in the data center
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Deadline-aware datacenter tcp (D2TCP)
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Finishing flows quickly with preemptive scheduling
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Deconstructing datacenter packet transport
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
| Hi-index | 0.00 |
This paper presents MCP, a novel distributed and reactive transport protocol for data center networks (DCNs) to achieve minimal per-packet delay while providing guaranteed transmission rates to meet flow deadlines. To design MCP, we first formulate a stochastic packet delay minimization problem with constraints on deadline completion and network stability. By solving this problem, we derive an optimal congestion window update function which establishes the theoretical foundation for MCP. To be incrementally deployable with existing switch hardware, MCP leverages functionality available on commodity switch, i.e., ECN, to approximate the optimal window update function. Our preliminary results show that MCP holds great promise in terms of deadline miss rate and goodput.