Finishing flows quickly with preemptive scheduling

SIGCOMM'12 - Proceedings of the ACM SIGCOMM 2012 Conference Applications, Technologies, Architectures, and Protocols for Computer Communication

Volumn , Issue , 2012, Pages 127-138

  Hong, Chi Yao ^a   Caesar, Matthew ^a   Godfrey, P Brighten ^a  

^a UIUC   (United States)

Author keywords

data center; deadline; flow scheduling

Indexed keywords

CENTRALIZED SCHEDULING; CONGESTION CONTROL PROTOCOLS; DATA CENTERS; DEADLINE; FAIR SHARING; FLOW INFORMATIONS; FLOW-LEVEL SIMULATION; LOW LATENCY; PATH DIVERSITY; PERFORMANCE GAIN; PRE-EMPTIVE SCHEDULING; SCHEDULING DISCIPLINE;

COMMUNICATION; COMPUTER ARCHITECTURE; SCHEDULING; TRANSMISSION CONTROL PROTOCOL;

NETWORK ARCHITECTURE;

EID: 84866516958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2342356.2342389     Document Type: Conference Paper

References (23)

1. Bro network security monitor. http://www.bro-ids.org.
2. M. Al-Fares, A. Loukissas, and A. Vahdat. A scalable, commodity data center network architecture. In SIGCOMM, 2008.
3. M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Data center TCP (DCTCP). In SIGCOMM, 2010.
4. N. Bansal and M. Harchol-Balter. Analysis of SRPT scheduling: Investigating unfairness. In SIGMETRICS, 2001.
5. N. Bansal and M. Harchol-Balter. End-to-end statistical delay service under GPS and EDF scheduling: A comparison study. In INFOCOM, 2001.
6. T. Benson, A. Akella, and D. A. Maltz. Network traffic characteristics of data centers in the wild. In IMC, 2010.
7. J. Brutlag. Speed matters for Google web search, 2009.
8. A. R. Curtis, J. C. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, and S. Banerjee. DevoFlow: Scaling flow management for high-performance networks. In SIGCOMM, 2011.
9. N. Dukkipati, Y. Ganjali, and R. Zhang-Shen. Typical versus worst case design in networking. In HotNets, 2005.
10. N. Dukkipati and N. McKeown. Why flow-completion time is the right metric for congestion control. SIGCOMM Comput. Commun. Rev., 2006.
11. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
12. A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta. VL2: A scalable and flexible data center network. In SIGCOMM, 2009.
13. C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu. BCube: A high performance, server-centric network architecture for modular data centers. In SIGCOMM, 2009.
14. C.-Y. Hong, M. Caesar, and P. B. Godfrey. Finishing flows quickly with preemptive scheduling. Technical report. http://arxiv.org/abs/1206.2057, 2012.
15. D. Katabi, M. Handley, and C. Rohrs. Congestion control for high bandwidth-delay product networks. In SIGCOMM, 2002.
16. M. L. Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, 2nd edition, 2002.
17. C. Raiciu, S. Barre, C. Pluntke, A. Greenhalgh, D. Wischik, and M. Handley. Improving datacenter performance and robustness with multipath TCP. In SIGCOMM, 2011.
18. A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey. Jellyfish: Networking data centers randomly. In NSDI, 2012.
19. V. Vasudevan, A. Phanishayee, H. Shah, E. Krevat, D. G. Andersen, G. R. Ganger, G. A. Gibson, and B. Mueller. Safe and effective fine-grained TCP retransmissions for datacenter communication. In SIGCOMM, 2009.
20. C. Wilson, H. Ballani, T. Karagiannis, and A. Rowstron. Better never than late: Meeting deadlines in datacenter networks. In SIGCOMM, 2011.
21. D. Wischik, C. Raiciu, A. Greenhalgh, and M. Handley. Design, implementation and evaluation of congestion control for multipath TCP. In NSDI, 2011.
22. H. Wu, Z. Feng, C. Guo, and Y. Zhang. ICTCP: Incast congestion control for TCP in data center networks. In CoNEXT, 2010.
23. D. Zats, T. Das, and R. H. Katz. DeTail: Reducing the flow completion time tail in datacenter networks. Technical report, Oct 2011.