Impact of Ethernet Multipath Routing on Data Center Network Consolidations

With the advent of network virtualization, data center networking is reaching a high level of management complexity. Indeed, interconnection networks in data center networks (DCN) are no longer just based on flat over-provisioned pipes, but are increasingly facing traffic engineering (TE) issues that commonly characterize long-haul provider networks. TE objectives, however, are opposite to energy efficiency (EE) objectives commonly chased by virtual machine (VM) consolidations. Moreover, the specific topologies of DCNs and the systematic use of multipath forwarding make the joint TE and VM consolidation optimization complex. The contribution of this paper is twofold. First, we propose a repeated matching heuristic for the DCN optimization problem with multipath capabilities, which also scales well for large topologies without discarding both TE and EE objectives. Second, we assess the impact of multipath forwarding on TE and EE goals. Extensive simulations show us that multipath forwarding is beneficial only when EE is not the primary goal in network-aware VM consolidations, and that it can be counterproductive when instead the EE is the primary goal of such optimizations.

[1]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[2]  Raouf Boutaba,et al.  Cloud computing: state-of-the-art and research challenges , 2010, Journal of Internet Services and Applications.

[3]  Vasileios Pappas,et al.  Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Meng Wang,et al.  Consolidating virtual machines with dynamic bandwidth demand in data centers , 2011, 2011 Proceedings IEEE INFOCOM.

[5]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[6]  A. Reinert,et al.  Design Optimization of the Petaweb Architecture , 2009, IEEE/ACM Transactions on Networking.

[7]  Joseph D. Touch,et al.  Transparent interconnection of lots of links (TRILL): problem and applicability statement , 2022 .

[8]  Mikael Rönnqvist,et al.  A repeated matching heuristic for the single-source capacitated facility location problem , 1999, Eur. J. Oper. Res..

[9]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[10]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[11]  Lisandro Zambenedetti Granville,et al.  On tackling virtual data center embedding problem , 2013, 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013).

[12]  Di Yuan,et al.  An exact algorithm for the capacitated facility location problems with single sourcing , 1999, Eur. J. Oper. Res..

[13]  M. Engquist A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .

[14]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[15]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[16]  Antonio Corradi,et al.  A Stable Network-Aware VM Placement for Cloud Systems , 2012, 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012).

[17]  Deng Pan,et al.  Joint Host-Network Optimization for Energy-Efficient Data Center Networking , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[18]  Alessandra Flammini,et al.  Multipath redundancy for industrial networks using IEEE 802.1aq Shortest Path Bridging , 2014, 2014 10th IEEE Workshop on Factory Communication Systems (WFCS 2014).

[19]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.