Make‐way: transporting latency‐sensitive flows nonblockingly in oversubscription data center networks. (17th November 2015)

• Record Type: Journal Article
• Authors: Deng, Gang; Gong, Zhenghu; Wang, Hong
• Other Names: Higuera‐Toledano M. Teresa guestEditor.; Brinkschulte Uwe guestEditor.; Rettberg Achim guestEditor.; Qiang Weizhong guestEditor.; Zheng Xianghan guestEditor.; Hsu Ching‐Hsien guestEditor.
• Is Part Of: Concurrency and computation. Volume 28:Number 14(2016)
• Page Start: 3803
• Page End: 3813
• Publication Date: 2015-11-17
• Subjects: data center networks -- TCP -- latency‐sensitive flow -- deadline -- ECN; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3721
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Many recent studies show that data center networks usually mix with a large amount of latency‐agnostic background flows and a large number of latency‐sensitive flows. The former, although contributing most of the traffic, is deadline‐agnostic, while the latter always confronts a soft‐real‐time constraint, namely deadline. Missing this deadline may cause performance impairment. For this reason, directly using the traditional TCP in data center networks, which is deadline‐agnostic, may suffer from performance and efficiency problems. Recently, many works improve on TCP to address this problem. But all of them focus on the latency‐sensitive flows themselves. Because latency‐sensitive flows, although large in number, only account for a small part of traffic, these methods cannot effectively ensure deadline for the latency‐sensitive flows. In this paper, we propose Make‐way, a new data center network transport protocol for satisfying the deadlines of latency‐sensitive flows. In Make‐way, just as what the name depicts, once a latency‐sensitive flow encounters congestion, the latency‐agnostic background flows will make way for it. Especially, Make‐way does not need any special hardware support of modification. For the latency‐agnostic flows in data center networks usually contribute the majority traffic, by doing so, the latency‐sensitive flows may be transported nonblockingly in data center networks and thus can meet their deadlines. Extensive simulation results show that Make‐way can meet the deadlines of latency‐sensitive flows with a probability of more than 97%. Copyright © 2015 John Wiley & Sons, Ltd.