Scalable, optimal flow routing in datacenters via local link balancing

S Sen, D Shue, S Ihm, MJ Freedman - … of the ninth ACM conference on …, 2013 - dl.acm.org
Datacenter networks should support high network utilization. Yet today's routing is typically
load agnostic, so large flows can starve other flows if routed through overutilized links. Even …

Flowbender: Flow-level adaptive routing for improved latency and throughput in datacenter networks

A Kabbani, B Vamanan, J Hasan… - Proceedings of the 10th …, 2014 - dl.acm.org
Datacenter networks provide high path diversity for traffic between machines. Load
balancing traffic across these paths is important for both, latency-and throughput-sensitive …

[PDF][PDF] Topology switching for data center networks

KC Webb, AC Snoeren, K Yocum - … on Hot Topics in Management of …, 2011 - usenix.org
Emerging data-center network designs seek to provide physical topologies with high
bandwidth, large bisection capacities, and many alternative data paths. Yet, existing …

Presto: Edge-based load balancing for fast datacenter networks

K He, E Rozner, K Agarwal, W Felter, J Carter… - ACM SIGCOMM …, 2015 - dl.acm.org
Datacenter networks deal with a variety of workloads, ranging from latency-sensitive small
flows to bandwidth-hungry large flows. Load balancing schemes based on flow hashing, eg …

[PDF][PDF] Hedera: dynamic flow scheduling for data center networks.

M Al-Fares, S Radhakrishnan, B Raghavan, N Huang… - Nsdi, 2010 - usenix.org
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands
of machines. However, because of limited port densities in even the highest-end switches …

Data center networking with multipath TCP

C Raiciu, C Pluntke, S Barre, A Greenhalgh… - Proceedings of the 9th …, 2010 - dl.acm.org
Recently new data center topologies have been proposed that offer higher aggregate
bandwidth and location independence by creating multiple paths in the core of the network …

pFabric: Minimal near-optimal datacenter transport

M Alizadeh, S Yang, M Sharif, S Katti… - ACM SIGCOMM …, 2013 - dl.acm.org
In this paper we present pFabric, a minimalistic datacenter transport design that provides
near theoretically optimal flow completion times even at the 99th percentile for short flows …

Difs: Distributed flow scheduling for adaptive routing in hierarchical data center networks

W Cui, C Qian - Proceedings of the tenth ACM/IEEE symposium on …, 2014 - dl.acm.org
Data center networks leverage multiple parallel paths connecting end host pairs to offer high
bisection bandwidth for cluster computing applications. However, state of the art routing …

Deconstructing datacenter packet transport

M Alizadeh, S Yang, S Katti, N McKeown… - Proceedings of the 11th …, 2012 - dl.acm.org
We present, pFabric, a minimalistic datacenter fabric design that provides near-optimal
performance in terms of completion time for high-priority flows and overall network …

Luopan: Sampling-based load balancing in data center networks

P Wang, G Trimponias, H Xu… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Data center networks demand high-performance, robust, and practical data plane load
balancing protocols. Despite progress, existing work falls short of meeting these …