參考文獻 |
Bibliography
[1] M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable,commodity data center network architecture,” ACM SIGCOMM, vol. 38, 2008.
[2] L. Tripathy, D. Tripathy, and C. Tripathy, “Fault tolerance in interconnection
network-a survey,” Applied Sciences, Engineering and Technology, 2015.
[3] J. Kim, W. J. Dally, B. Towles1, and A. K. Gupta, “Microarchitecture of a high-radix
router.” In Proc. of the International Symposium on Computer Architecture (ISCA),
2005.
[4] W. J. Dally, “Performance analysis of k-ary n-cube interconnection networks,” IEEE
Transactions on Computers, vol. 39, 1990.
[5] D. Abts, A. Bataine, S. Scott, G. Faanes, J. Schwarzmeier, E. Lundberg, T. Johnson,
M. Bye, and G. Schwoerer, “The cray blackwidow: A highly scalable vector multiprocessor,” In Proceedings of the International Conference for High Performance
Computing, Networking, Storage, and Analysis., 2007.
[6] S. Scott, D. Abts, J. Kim, and W. J. Dally, “The blackwidow high-radix clos network,” In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, 2006.
[7] M. Besta and T. Hoefler, “Slim fly: A cost effective low-diameter network topology,”
ACM SIGCOMM, pp. 345–359, 2014.
[8] R. Barriuso and A. Knies, “108-port infiniband fdr switchx switch platform hardware
user manual,” 2014.
[9] J. H. Ahn, N. Binkert, A. Davis, M. McLaren, and R. S. Schreiber, “Hyperx: Topology, routing, and packaging of efficient large-scale networks,” Proceedings of the
Conference on High Performance Computing Networking, Storage and Analysis,
2009.
[10] A. Singla, C. Y. Hong, L. Popa, and P. B. Godfrey, “Jellyfish: Networking data
centers randomly,” In Proc. of the 9th USENIX conference on Networked Systems
Design and Implementation, pp. 597–598, 2012.
[11] S. A. Jyothi, A. Singla, P. B. Godfrey, and A. Kolla, “Measuring throughput of data
center network topologies,” Special Interest Group for the computer systems performance evaluation community, pp. 597–598, 2014.
[12] A. Valadarsky, G. Shahaf, M. Dinitz, and M. Schapira, “Xpander: Towards optimalperformance datacenters,” International Conference on emerging Networking Experiments and Technologies., 2016.
[13] N. G. D. Bruijn, “A combinatorial problem,” Technical Report, 1946.
[14] W. J. Dally, “Performance analysis of k-ary n-cube interconnection networks,” IEEE
Transactions on Computers, pp. 775–785, 1990.
[15] A. Agarwal, “Limits on interconnection network performance,” IEEE Trans. Parallel Distribution System, pp. 398–412, 1991.
[16] S. A. Ghozati and H. C. Wasserman, “The k-ary n-cube network: modeling, topological properties and routing strategies,” IEEE Computers & Electrical Engineering,
vol. 25, pp. 155–168, 1999.
[17] J. Kim, W. J. Dally, and D. Abts, “Flattened butterfly : A cost-efficient topology for
high-radix networks,” International Symposium on Computer Architecture, 2007.
[18] J. Kim, W. J. Dally, S. Scott, and D. Abts, “Technology-driven, highly-scalable dragonfly topology,” International Symposium on Computer Architecture, 2008.
[19] C. Clos, “A study of non-blocking switching networks,” The Bell System technical
Journal, 1953.
[20] L. N. Bhuyan and D. P. Agrawal, “Generalized hypercube and hyperbus structures
for a computer network,” IEEE Transactioin Computer, 1984.
[21] B. D. McKay, M. Miller, and J. Siran, “A note on large graphs of diameter two and
given maximum degree,” Journal of Combinatorial Theory Series B, 1998.
[22] M. Miller and J. Siran., “Moore graphs and beyond: A survey of the degree/diameter
problem,” Electronic Journal of Combinatorics, 2005.
[23] P. R. Hafner, “Geometric realisation of the graphs of mckay miller siran,” Journal of
Combinatorial Theory, 2004.
[24] Y. BILU and N. Linial, “Lifts, discrepancy and nearly optimal spectral gap,” Combinatorica, 2006.
[25] “Facebook data center,” 2014, https://code.fb.com/production-engineering/
introducing-data-center-fabric-the-next-generation-facebook-data-centernetwork/.
[26] W.D.Wallis, Magic Graphs. Birkhauser Basel, 2000.
[27] “Netbench,” 2017, http://merlin.fit.vutbr.cz/ant/netbench/index.html.
[28] R. Zhang-Shen, “Valiant load-balancing: Building networks that can support all traffic matrices,” Algorithms for Next Generation Networks, 2010.
[29] M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable, commodity data center network architecture.” ACM SIGCOMM, 2008.
[30] M. Alizadeh, S. Yang, M. Sharif, S. Katti, N. McKeown, and B. Prabhakar, “pfabric:
Minimal near-optimal datacenter transport,” ACM SIGCOMM, 2013.
[31] M. Alizadeh, A. Kabbani, T. Edsall, B. Prabhakar, A. Vahdat, and M. Yasuda, “Less
is more: Trading a little bandwidth for ultra-low latency in the data center,” USENIX
NSDI, 2012.
[32] D. Wischik, C. Raiciu, A. Greenhalgh, and M. Handley, “Design, implementation
and evaluation of congestion control for multipath tcp.” USENIX NSDI, 2011.
[33] J. Yen, “Finding the k shortest loopless paths in a network,” Management Science,
no. 45, 1971.
[34] S. Kandula, D. Katabi, S. Sinha, and A. Berger, “Flare: Responsive load balancing
without packet reordering.” Computer Communication Review, 2007.
[35] A. Greenberg, J. R. 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,” Communications of the ACM, 2009.
[36] T. Benson, A. Akella, and D. A. Maltz, “Network traffic characteristics of data centers in the wild,” ACM SIGCOMM, 2010.
[37] A. Roy, J. B. Hongyi Zeng, G. Porter, and A. C. Snoeren, “Inside the social network’s
(datacenter) network,” ACM SIGCOMM, 2015.
[38] M. Ghodbadi, R. Mahajan, A. Phanishayee, H. Rastegarfar, P.-A. Blanche, M. Glick,
D. Kilper, J. Kulkarni, G. Ranade, and N. Devanur, “Projector : Agile reconfigurable
datacenter interconnect,” ACM SIGCOMM, 2016. |