The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2013 vol.24)
pp: 1139-1148
Fung Po Tso , University of Glasgow, Glasgow
Dimitrios P. Pezaros , University of Glasgow, Glasgow
ABSTRACT
Equal cost multiple path (ECMP) forwarding is the most prevalent multipath routing used in data center (DC) networks today. However, it fails to exploit increased path diversity that can be provided by traffic engineering techniques through the assignment of nonuniform link weights to optimize network resource usage. To this extent, constructing a routing algorithm that provides path diversity over nonuniform link weights (i.e., unequal cost links), simplicity in path discovery and optimality in minimizing maximum link utilization (MLU) is nontrivial. In this paper, we have implemented and evaluated the Penalizing Exponential Flow-spliTing (PEFT) algorithm in a cloud DC environment based on two dominant topologies, canonical and fat tree. In addition, we have proposed a new cloud DC topology which, with only a marginal modification of the current canonical tree DC architecture, can further reduce MLU and increase overall network capacity utilization through PEFT routing.
INDEX TERMS
Routing, Optimization, Network topology, Topology, Servers, Mathematical model, Protocols, cloud computing, Data center routing, data center topology, multipath routing, traffic engineering, load balancing
CITATION
Fung Po Tso, Dimitrios P. Pezaros, "Improving Data Center Network Utilization Using Near-Optimal Traffic Engineering", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 6, pp. 1139-1148, June 2013, doi:10.1109/TPDS.2012.343
REFERENCES
[1] IBM ILOG CPLEX Optimizer, www.ibm.com/software/ integration/optimization cplex-optimizer/, 2013.
[2] Interior Point OPTimizer (Ipopt), https://projects.coin-or.orgIpopt, 2013.
[3] A Modeling Language for Math. Programming (AMPL), http:/www.ampl.com/, 2013.
[4] ns-3, http:/www.nsnam.org/, 2013.
[5] M. Al-Fares, A. Loukissas, and A. Vahdat, "A Scalable Commodity Data Center Network Architecture," Proc. ACM SIGCOMM, 2008.
[6] M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat, "Hedera: Dynamic Flow Scheduling for Data Center Networks," Proc. Seventh USENIX Symp. Networked Systems Design and Implementation (NSDI '10), 2010.
[7] G. Antichi and A.W. Moore, "Monitoring System," http://netfpga.org/foswiki/bin/view/NetFPGA/ OneGigMonitoring System, 2013.
[8] T. Benson, A. Akella, and D. Maltz, "Network Traffic Characteristics of Data Centers in the Wild," Proc. Internet Measurement Conf. (IMC), 2010.
[9] T. Benson, A. Anand, A. Akella, and M. Zhang, "MicroTE: Fine Grained Traffic Engineering for Data Centers," Proc. ACM CoNEXT, 2011.
[10] Cisco Systems, "Data Center: Load Balancing Data Center Services Solutions Reference Network Design," Mar. 2004.
[11] A. Curtis, J. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, and B.S, "Devoflow: Scaling Flow Management for High-Performance Networks," Proc. ACM SIGCOMM, 2011.
[12] A. Elwalid, C. Jin, S. Low, and I. Widjaja, "MATE: MPLS Adaptive Traffic Engineering," Proc. IEEE INFOCOM, 2001.
[13] B. Fortz and M. Thorup, "Increasing Internet Capacity using Local Search," Computational Optimization and Applications, vol. 29, no. 1, pp. 13-48, 2004.
[14] P. Gill, N. Jain, and N. Nagappan, "Understanding Network Failures in Data Centers: Measurement, Analysis, and Implications," Proc. ACM SIGCOMM, 2011.
[15] O. Google. http://www.opennetsummit.org/talks/ONS2012 hoelzle-tue-openflow.pdf, 2013.
[16] A. Greenberg, J. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D.A. Maltz, P. Patel, and S. Sengupta, "VL2: A Scalable and Flexible Data Center Network," Proc. ACM SIGCOMM, 2009.
[17] I.M.T.W. Group, http://datatracker.ietf.org/wgmptcp/, 2013.
[18] C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Lu, "A Scalable and Fault-Tolerant Network Structure for Data Centers," Proc. ACM SIGCOMM, 2008.
[19] U. Hoelzle and L.A. Barroso, The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines. Morgan and Claypool Publishers, 2009.
[20] C. Hopps, "Analysis of an Equal-Cost Multi-Path Algorithm," RFC 2992, IETF, 2000.
[21] S. Kandula, D. Katabi, B. Davie, and A. Charny, "Walking the Tightrope: Responsive Yet Stable Traffic Engineering," Proc. ACM SIGCOMM, 2005.
[22] S. Kandula, S. Sengupta, A. Greenberg, P. Patel, and R. Chaiken, "The Nature of Datacenter Traffic: Measurements & Analysis," Proc. Internet Measurement Conf. (IMC), 2009.
[23] J. Mudigonda, P. Yalagandula, M. Al-Fares, and J.C. Mogul, "SPAIN: COTS Data-Center Ethernet for Multipathing Over Arbitrary Topologies," Proc. Seventh USENIX Conf. Networked Systems Design and Implementation (NSDI '10), 2010.
[24] NetFPGA, http:/www.netfpga.org/, 2013.
[25] L. Popal, C. Raiciu, I. Stoica, and D. Rosenblum, "Reducing Congestion Effects in Wireless Networks by Multipath Routing," Proc. IEEE Int'l Conf. Network Protocols (ICNP), 2006.
[26] C. Raiciu, S. Barre, C. Pluntke, A. Greenhalgh, D. Wischik, and M. Handley, "Improving Datacenter Performance and Robustness with Multipath TCP," Proc. ACM SIGCOMM, 2011.
[27] M. Schlansker, Y. Turner, J. Tourrilhes, and A. Karp, "Ensemble Routing for Datacenter Networks," Proc. ACM/IEEE Sixth Symp. Architectures for Networking and Comm. Systems (ANCS), 2010.
[28] F.P. Tso and D. Pezaros, "Online PEFT Implementation in C++," http://www.dcs.gla.ac.uk/posco/weightsolver/ htmlindex. html. 2013.
[29] T. Viet, Y. Deville, O. Bonaventure, and F.P, "Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers," Proc. 23rd Int'l Teletraffic Congress (ITC), 2011.
[30] H. Wang, H. Xie, L. Qiu, R. Yang, Y. Zhang, and A. Greenberg, "Cope: Traffic Engineering in Dynamic Networks," Proc. ACM SIGCOMM, 2006.
[31] Y. Wang, Z. Wang, and L. Zhang, "Internet Traffic Engineering without Full Mesh Overlaying," Proc. IEEE INFOCOM, 2001.
[32] Wikipedia, http://en.wikipedia.org/wikiHessian_matrix , 2013.
[33] Wikipedia, http://en.wikipedia.org/wikiJacobian_matrix_and_ determinant , 2013.
[34] D. Xu, M. Chiang, and J. Rexford, "Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering," IEEE/ACM Trans. Networking, vol. 19, no. 6 pp. 1717-1730, Apr. 2011.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool