Intra-data-center traffic engineering with ensemble routing
Authors:
- 1 April 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2148-2156
Abstract
Today's data centers are shared among multiple tenants running a wide range of applications. These applications require a network with a scalable and robust layer-2 network management solution that enables load-balancing and QoS provisioning. Ensemble routing was proposed to achieve management scalability and robustness by using Virtual Local Area Networks (VLANs) and operating on the granularity of flow ensembles, i.e. group of flows. The key challenge of intra-data-center traffic engineering with ensemble routing is the combinatorial optimization of VLAN assignment, i.e., optimally assigning flow ensembles to VLANs to achieve load balancing and low network costs. Based on the Markov approximation framework, we solve the VLAN assignment problem with a general objective function and arbitrary network topologies by designing approximation algorithms with close-to-optimal performance guarantees. We study several properties of our algorithms, including performance optimality, perturbation bound, convergence of algorithms and impacts of algorithmic parameter choices. Then we extend these results to variants of VLAN assignment problem, including interaction with TCP congestion and QoS considerations. We validate our analytical results by conducting extensive numerical experiments. The results show that our algorithms can be tuned to meet different temporal constraints, incorporate fine-grained traffic management, overcome traffic measurement limitations, and tolerate imprecise and incomplete traffic matrices.Keywords
This publication has 14 references indexed in Scilit:
- Optimal distributed P2P streaming under node degree bounds2010
- Markov Approximation for Combinatorial Network Optimization2010
- VL22009
- Route Optimization in IP Networks2008
- Floodless in seattle2008
- Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and RoutingIEEE Journal on Selected Areas in Communications, 2007
- Layering as Optimization Decomposition: A Mathematical Theory of Network ArchitecturesProceedings of the IEEE, 2007
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- Path coupling: A technique for proving rapid mixing in Markov chains2002
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991