Distributed multipath routing for data center networks based on stochastic traffic modeling

Modern data center networks often adopt multipath topologies for greater bisection bandwidth and better fault tolerance. However, traditional distributed routing algorithms make routing decisions based on only packet destinations, and cannot readily utilize the multipath feature. In this paper, we study distributed multipath routing for data center networks. First, to capture the time varying and non-deterministic nature of data center network traffic, we present a stochastic traffic model based on the log normal distribution. Then, we formulate the stochastic load-balanced multipath routing problem, and prove that it is NP hard for typical data center network topologies, including the fat tree, VL2, DCell, and BCube. Next, we propose our distributed multipath routing algorithm, which balances traffic among multiple links by minimizing the probability of each link to face congestion. Finally, we implement the proposed algorithm in the NS2 simulator, and provide simulation results to demonstrate the effectiveness of our design.

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

[2]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.

[3]  Amin Vahdat,et al.  Hedera: Dynamic Flow Scheduling for Data Center Networks , 2010, NSDI.

[4]  Songwu Lu,et al.  Characterizing flows in large wireless data networks , 2004, MobiCom '04.

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

[6]  Ming Zhang,et al.  Understanding data center traffic characteristics , 2010, CCRV.

[7]  Kranthimanoj Nagothu,et al.  Prediction of cloud data center networks loads using stochastic and neural models , 2011, 2011 6th International Conference on System of Systems Engineering.

[8]  Sujata Banerjee,et al.  ElasticTree: Saving Energy in Data Center Networks , 2010, NSDI.

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

[10]  Rodney Van Meter,et al.  MARA: Maximum Alternative Routing Algorithm , 2009, IEEE INFOCOM 2009.

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

[12]  Chase Cotton,et al.  Packet-level traffic measurements from the Sprint IP backbone , 2003, IEEE Netw..

[13]  Kevin R. Fall,et al.  The NS Manual (Formerly NS Notes and Documentation , 2002 .

[14]  Athanasios V. Vasilakos,et al.  Survey on routing in data centers: insights and future directions , 2011, IEEE Network.

[15]  Albert G. Greenberg,et al.  Data center TCP (DCTCP) , 2010, SIGCOMM '10.

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

[17]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[18]  L. Fenton.  The Sum of Log-Normal Probability Distributions in Scatter Transmission Systems , 1960 .

[19]  Peter Reichl,et al.  Towards low-complexity Internet traffic engineering: The Adaptive Multi-Path algorithm , 2008, Comput. Networks.