To improve the performance of data-intensive applications, existing datacenter schedulers
optimize either the placement of tasks or the scheduling of network flows. The task scheduler …

Nowadays, diverse cloud services generate a mix of deadline and non-deadline data flows
that constitute the mix-flow environment in data center networks. Deadline flows are mainly …

In the era of cloud computing, network services are deployed on geographically distributed
cloud platforms, which results in a large amount of inter-datacenter traffic. Multi-tier pricing …

Many applications like geo-replication need to deliver multiple copies of data from a single
datacenter to multiple datacenters, which has benefits of improving fault tolerance …

As datacenter network bandwidth keeps growing, proactive transport becomes attractive,
where bandwidth is proactively allocated as “credits” to senders who then can send …

Most of today's data center applications are sensitive to latency. In this paper, a Deadline-
aware bandwidth Sharing mechanism by Allocating switch Buffer (DSAB) is proposed to …

Many recent works utilize scheduling to minimize the Flow Completion Time (FCT) in Data
Center Networks (DCN), like PIAS using Shortest Job First (SJF) scheduling and pFabric …

Existing data center transport protocols are usually based on the Processor Sharing (PS)
policy and/or the Shortest Remaining Processing Time (SRPT) policy. PS divides link …

There are various transport protocols developed to mitigate the congestion caused by burst
traffic and thousands of concurrent flows in data center networks (DCNs). These protocols …

Many existing works are focused on minimizing the Flow Completion Time (FCT) for data
center networks. For example, D-SRTF performs shortest remaining time first (SRTF) …