Advertisement

Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow Routing

  • Siddhartha Sen
  • Sunghwan Ihm
  • Kay Ousterhout
  • Michael J. Freedman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)

Introduction

In the concurrent multi-commodity flow problem, we are given a capacitated network G = (V,E) of switches V connected by links E, and a set of commodities \({\cal K} = \{(s_i,t_i,d_i)\}\). The objective is to maximize the minimum fraction λ of any demand d i that is routed from source s i to target t i . This problem has been studied extensively by the theoretical computer science community in the sequential model (e.g., [4]) and in distributed models (e.g., [2,3]). Solutions in the networking systems community also fall into these models (e.g., [1,6,5]), yet none of them use the state-of-the-art algorithms above. Why the gap between theory and practice? This work seeks to answer and resolve this question. We argue that existing theoretical models are ill-suited for real networks (§2) and propose a new distributed model that better captures their requirements (§3). We have developed optimal algorithms in this model for data center networks (§4); making these algorithms practical requires a novel use of programmable hardware switches. A solution for general networks poses an intriguing open problem.

Keywords

Congestion Control Data Center Network Forwarding Table Router Model Capacitate Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., Vahdat, A.: Hedera: dynamic flow scheduling for data center networks. In: Proc. NSDI, pp. 281–296 (2010)Google Scholar
  2. 2.
    Awerbuch, B., Khandekar, R.: Distributed network monitoring and multicommodity flows: a primal-dual approach. In: Proc. PODC, pp. 284–291 (2007)Google Scholar
  3. 3.
    Awerbuch, B., Khandekar, R.: Greedy distributed optimization of multi-commodity flows. Distrib. Comput. 21(5), 317–329 (2009)CrossRefzbMATHGoogle Scholar
  4. 4.
    Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630–652 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Kandula, S., Katabi, D., Sinha, S., Berger, A.: Dynamic load balancing without packet reordering. SIGCOMM Comput. Commun. Rev. 37 (2007)Google Scholar
  6. 6.
    Wischik, D., Raiciu, C., Greenhalgh, A., Handley, M.: Design, implementation and evaluation of congestion control for multipath TCP. In: Proc. NSDI, pp. 99–112 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Siddhartha Sen
    • 1
  • Sunghwan Ihm
    • 1
  • Kay Ousterhout
    • 1
  • Michael J. Freedman
    • 1
  1. 1.Princeton UniversityUSA

Personalised recommendations