SDN-based multi-class QoS-guaranteed inter-data center traffic management

When allocating network bandwidth to multiple classes of applications in inter-data center communication, coordination always yields a better utilization of the backbone network. Yet, it often comes at a prohibitively heavy computational and communication cost, making it thus far not a practically viable approach. SDN helped in bridging the communication cost gap by enabling centralized control, and SDN has been recently applied in such inter-DC traffic management. However, the computational cost is still an issue as the efficient and fast response of the centralized traffic engineering algorithm has become crucial to the practicality of such SDN-based approach. In this paper, we present MCTEQ, a utility-optimization-based joint-bandwidth allocation for inter-DC communication with multiple traffic classes, that handles priorities between traffic classes in a soft manner and explicitly considers the delay requirement of Interactive flows. MCTEQ being NP-hard, we apply approximation techniques to lean on the mature and efficient LP solver and obtain fast and accurate approximations. We demonstrate via experiments with Google's inter-DC backbone topology that MCTEQ achieves about 160 Gbps higher network utilization than the existing SWAN solution, yet runs 2.5 times faster. In particular, MCTEQ guarantees that the allocated bandwidth for Interactive flows strictly meets their end-to-end delay requirements.

[1]  ERNEST L. HALL,et al.  Generation of Products and Quotients Using Approximate Binary Logarithms for Digital Filtering Applications , 1970, IEEE Transactions on Computers.

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[3]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[4]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.

[5]  R. Braatz,et al.  A tutorial on linear and bilinear matrix inequalities , 2000 .

[6]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[7]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.

[8]  Wei Sun,et al.  End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms , 2005, IEEE/ACM Transactions on Networking.

[9]  Ness B. Shroff,et al.  Utility maximization for communication networks with multipath routing , 2006, IEEE Transactions on Automatic Control.

[10]  Dritan Nace,et al.  Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial , 2008, IEEE Communications Surveys & Tutorials.

[11]  Xin Wu,et al.  zUpdate: updating data center networks with zero loss , 2013, SIGCOMM.

[12]  Ratul Mahajan,et al.  On consistent updates in software defined networks , 2013, HotNets.

[13]  Srikanth Kandula,et al.  Achieving high utilization with software-driven WAN , 2013, SIGCOMM.

[14]  J. Rexford,et al.  Scalable Multi-Class Traffic Management in Data Center Backbone Networks , 2013, IEEE Journal on Selected Areas in Communications.

[15]  David Walker,et al.  Incremental consistent updates , 2013, HotSDN '13.

[16]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.