Parallel Scheduling and Routing Algorithms for Large-scale High-speed Switching Systems
暂无分享,去创建一个
Tong Ye | Tony T. Lee | Lingkang Wang | Tong Ye | T. Lee | Lingkang Wang
[1] Hao Guan,et al. Randomized Δ-edge colouring via exchanges of complex colours , 2013, Int. J. Comput. Math..
[2] H. Jonathan Chao,et al. Matching algorithms for three-stage bufferless Clos network switches , 2003, IEEE Commun. Mag..
[3] Shan Zhong,et al. Scalable and topology adaptive intra-data center networking enabled by wavelength selective switching , 2014, OFC 2014.
[4] I Chih-Lin,et al. Performance analysis of a growable architecture for broad-band packet (ATM) switching , 1992, IEEE Trans. Commun..
[5] Eytan Modiano,et al. Logarithmic delay for N × N packet switches under the crossbar constraint , 2007, TNET.
[6] Frank K. Hwang,et al. A new decomposition algorithm for rearrangeable Clos interconnection networks , 1996, IEEE Trans. Commun..
[7] Tong Ye,et al. A Parallel Route Assignment Algorithm for Fault-Tolerant Clos Networks in OTN Switches , 2019, IEEE Transactions on Parallel and Distributed Systems.
[8] Charles Clos,et al. A study of non-blocking switching networks , 1953 .
[9] Agata Fronczak,et al. Average path length in random networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[10] David A. Maltz,et al. Network traffic characteristics of data centers in the wild , 2010, IMC '10.
[11] Nick McKeown,et al. The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.
[12] Andrea Bianco,et al. A framework for differential frame-based matching algorithms in input-queued switches , 2004, IEEE INFOCOM 2004.
[13] Zhi-Li Zhang,et al. A first look at inter-data center traffic characteristics via Yahoo! datasets , 2011, 2011 Proceedings IEEE INFOCOM.
[14] Weisheng Hu,et al. A Parallel Complex Coloring Algorithm for Scheduling of Input-Queued Switches , 2018, IEEE Transactions on Parallel and Distributed Systems.