Li Chen
ABSTRACT
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.
- M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan, "Data center TCP (DCTCP)," in Proceedings of the ACM SIGCOMM 2010 conference, ser. SIGCOMM '10. New York, NY, USA: ACM, 2010, pp. 63--74. {Online}: http://doi.acm.org/10.1145/1851182.1851192. Google Scholar
Digital Library
- M. Alizadeh, A. Kabbani, T. Edsall, B. Prabhakar, A. Vahdat, and M. Yasuda, "Less is more: trading a little bandwidth for ultra-low latency in the data center," in Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation, ser. NSDI'12. Berkeley, CA, USA: USENIX Association, 2012, pp. 19--19. {Online}: http://dl.acm.org/citation.cfm?id=2228298.2228324. Google ScholarDigital Library
- M. Alizadeh, S. Yang, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker, "Deconstructing datacenter packet transport," in Proceedings of the 11th ACM Workshop on Hot Topics in Networks, ser. HotNets-XI. New York, NY, USA: ACM, 2012, pp. 133--138. {Online}: http://doi.acm.org/10.1145/2390231.2390254. Google ScholarDigital Library
- S. Boyd and L. Vandenberghe, Convex Optimization. New York, NY, USA: Cambridge University Press, 2004. Google ScholarDigital Library
- S. Floyd, "TCP and explicit congestion notification," ACM SIGCOMM Computer Communication Review, vol. 24, no. 5, pp. 8--23, 1994. Google ScholarDigital Library
- C.-Y. Hong, M. Caesar, and P. B. Godfrey, "Finishing flows quickly with preemptive scheduling," SIGCOMM Comput. Commun. Rev., vol. 42, no. 4, pp. 127--138, Aug. 2012. {Online}: http://doi.acm.org/10.1145/2377677.2377710. Google ScholarDigital Library
- L. Kleinrock, Theory, volume 1, Queueing systems. Wiley-interscience, 1975. Google ScholarDigital Library
- N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, "OpenFlow: enabling innovation in campus networks," ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 69--74, 2008. Google ScholarDigital Library
- M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time-varying wireless networks," Selected Areas in Communications, IEEE Journal on, vol. 23, no. 1, pp. 89--103, 2005. Google ScholarDigital Library
- B. Vamanan, J. Hasan, and T. Vijaykumar, "Deadline-aware datacenter tcp (D2TCP)," SIGCOMM Comput. Commun. Rev., vol. 42, no. 4, pp. 115--126, Aug. 2012. {Online}: http://doi.acm.org/10.1145/2377677.2377709. Google ScholarDigital Library
- C. Wilson, H. Ballani, T. Karagiannis, and A. Rowtron, "Better never than late: meeting deadlines in datacenter networks," in Proceedings of the ACM SIGCOMM 2011 conference, ser. SIGCOMM '11. New York, NY, USA: ACM, 2011, pp. 50--61. {Online}: http://doi.acm.org/10.1145/2018436.2018443. Google ScholarDigital Library
Index Terms
- Towards minimal-delay deadline-driven data center TCP
Recommendations
Deadline-aware datacenter tcp (D2TCP)
Special october issue SIGCOMM '12An important class of datacenter applications, called Online Data-Intensive (OLDI) applications, includes Web search, online retail, and advertisement. To achieve good user experience, OLDI applications operate under soft-real-time constraints (e.g., ...
Data center TCP (DCTCP)
SIGCOMM '10: Proceedings of the ACM SIGCOMM 2010 conferenceCloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today's state-of-the-art TCP protocol falls short. We present measurements of a ...
Analysis for TCP in data center networks
The unfairness caused by bandwidth sharing via TCP in data center networks is called TCP Outcast problem. Some researchers show that the throughput of a flow with small Round Trip Time (RTT) is less than that with large RTT which is completely contrary ...
Comments