Skip to main content

Scalable, optimal flow routing in datacenters via local link balancing

Author(s): Sen, S; Shue, D; Ihm, S; Freedman, Michael J

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1wt2m
Abstract: 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 recent proposals like centralized scheduling or end-host multi-pathing give suboptimal throughput, and they suffer from poor scalability and other limitations. We present a simple, switch-local algorithm called LocalFlow that is optimal (under standard assumptions), scalable, and practical. Although LocalFlow may split an individual flow (this is necessary for optimality), it does so infrequently by considering the aggregate flow per destination and allowing slack in distributing this flow. We use an optimization decomposition to prove Local-Flow's optimality when combined with unmodified end hosts' TCP. Splitting flows presents several new technical challenges that must be overcome in order to interact efficiently with TCP and work on emerging standards for programmable, commodity switches. Since LocalFlow acts independently on each switch, it is highly scalable, adapts quickly to dynamic workloads, and admits flexible deployment strategies. We present detailed packet-level simulations comparing LocalFlow to a variety of alternative schemes, on real datacenter workloads.
Publication Date: 9-Dec-2013
Electronic Publication Date: 2013
Citation: Sen, S, Shue, D, Ihm, S, Freedman, MJ. (2013). Scalable, optimal flow routing in datacenters via local link balancing. 151 - 162. doi:10.1145/2535372.2535397
DOI: doi:10.1145/2535372.2535397
Pages: 151 - 162
Type of Material: Conference Article
Journal/Proceeding Title: 9th ACM International Conference on Emerging Networking Experiments and Technologies
Version: Final published version. This is an open access article.



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.