On-Line Multicast Scheduling with Bounded Congestion in Fat-Tree Data Center Networks

10.1145/2018436.2018467

10.1145/1921168.1921187

10.1109/INFCOM.2012.6195470

10.1109/MCOM.2003.1235592

10.1109/12.83662

10.1109/12.707592

10.1109/TPDS.2003.1178877

10.1109/26.701325

10.1109/MCOM.2003.1235593

10.1145/1921168.1921188

10.1145/2018436.2018466

al-fares, 2010, Hedera: Dynamic Flow Scheduling for Data Center Networks

10.1002/j.1538-7305.1953.tb01433.x

10.1145/1402958.1402967

10.1145/1592568.1592576

tavakoli, 2009, Applying NOX to the Datacenter, HotNets

10.1145/1592568.1592577

10.1145/1879141.1879175

hopps, 2000, Analysis of an Equal-Cost Multi-Path Algorithm, RFC 2992 IETF

10.1145/945449.945450

dean, 2004, MapReduce: Simplified Data Processing on Large Clusters, Proc of the Symposium on Operating Systems Design and Implementation (OSDI)

10.1145/2018436.2018465

10.1109/INFCOM.2011.5935228

takahashi, 1980, An Approximate Solution for The Steiner Problem in Graphs, Mathematica Japonica, 24, 573

10.1109/ICNP.2011.6089061

10.1007/BF01196262

10.1007/BF00288961

duffield, 1999, A Flexible Model for Resource Management in Virtual Private Networks, ACM SIGCOMM, 10.1145/316194.316209

awerbuch, 1993, Throughput competitive online routing, 34th IEEE Symp on Foundations of Computer Science