Aemon: Information-agnostic Mix-flow Scheduling in Data Center Networks

Data center networks carry a mix of flows, some with deadlines and some without. Existing mix-flow transport designs assume prior knowledge of flow sizes, which may not hold in practice. Without such information, mix-flow scheduling becomes particularly challenging due to (1) the lack of precise rate control of deadline flows with minimal impact on non-deadline flows; (2) difficulty in assigning priority to both two types of flows. We present Aemon, an information-agnostic mix-flow transport. Aemon relies on a new congestion control mechanism based on urgency---the ratio between the elapsed transmission time and the remaining time to deadline---to strategically modulate the sending rate of deadline flows. In addition, Aemon uses a novel two-level priority scheduling policy to differentiate mix flows. As time goes, a deadline flow's priority level increases as its urgency rises, and a non-deadline flow's priority level decreases as it sends more bytes similar to PIAS to approximate Shortest-Job-First policy. While in the same priority level, non-deadline flows take precedence to avoid possible starvation caused by aggressive deadline flows. Extensive simulations on ns-2 show that Aemon outperforms existing information-agnostic schemes and is only slightly worse than state-of-the-art Karuna.

[1]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[2]  Christo Wilson,et al.  Better never than late , 2011, SIGCOMM 2011.

[3]  Ion Stoica,et al.  Efficient Coflow Scheduling Without Prior Knowledge , 2015, SIGCOMM.

[4]  Wei Bai,et al.  Information-Agnostic Flow Scheduling for Commodity Data Centers , 2015, NSDI.

[5]  Albert G. Greenberg,et al.  Data center TCP (DCTCP) , 2010, SIGCOMM '10.

[6]  Robert C. Daley,et al.  An experimental time-sharing system , 1962, AIEE-IRE '62 (Spring).

[7]  Alex X. Liu,et al.  Friends, not Foes – Synthesizing Existing Transport Strategies for Data Center Networks , 2014 .

[8]  Guillaume Urvoy-Keller,et al.  Performance analysis of LAS-based scheduling disciplines in a packet switched network , 2004, SIGMETRICS '04/Performance '04.

[9]  Ali Munir,et al.  Minimizing flow completion times in data centers , 2013, 2013 Proceedings IEEE INFOCOM.

[10]  Nick McKeown,et al.  pFabric: minimal near-optimal datacenter transport , 2013, SIGCOMM.

[11]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[12]  Brighten Godfrey,et al.  Finishing flows quickly with preemptive scheduling , 2012, CCRV.

[13]  T. N. Vijaykumar,et al.  Deadline-aware datacenter tcp (D2TCP) , 2012, SIGCOMM '12.

[14]  Ramana Rao Kompella,et al.  On the impact of packet spraying in data center networks , 2013, 2013 Proceedings IEEE INFOCOM.

[15]  Kai Chen,et al.  Scheduling Mix-flows in Commodity Datacenters with Karuna , 2016, SIGCOMM.