Distributed adaptive routing convergence to non-blocking DCN routing assignments

IEEE Journal on Selected Areas in Communications

Volumn 32, Issue 1, 2014, Pages 88-101

  Zahavi, Eitan ^a   Keslassy, Isaac ^a   Kolodny, Avinoam ^a  

^a NVIDIA   (United States)

Author keywords

Adaptive Routing; Big Data; Data Center Networks

Indexed keywords

ADAPTIVE ROUTING; BIG DATUM; DATA CENTER NETWORKS; DISTRIBUTED ADAPTIVE ROUTING ALGORITHMS; HARDWARE IMPLEMENTATIONS; LOAD BALANCING PROBLEM; MARKOV CHAIN MODELS; OUT-OF-ORDER PACKETS;

BANDWIDTH; COMPUTER SIMULATION; HARDWARE; SWITCHING NETWORKS;

NETWORK ROUTING;

EID: 84891609893     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2014.140109     Document Type: Article

References (37)

1. M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat, "Hedera: dynamic flow scheduling for data center networks," in Proc. 7th USENIX conference on Networked systems design and implementation, ser. NSDI'10. Berkeley, CA, USA: USENIX Association, 2010, pp. 1919.
2. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, "Dryad: distributed data-parallel programs from sequential building blocks," in Proc. 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007, ser. EuroSys '07. New York, NY, USA: ACM, 2007, pp. 5972.
3. T. White, Hadoop: The Definitive Guide. O'Reilly Media, Inc., Oct. 2010.
4. M. Chowdhury, M. Zaharia, J. Ma, M. I. Jordan, and I. Stoica, "Managing data transfers in computer clusters with orchestra," in Proc. ACM SIGCOMM 2011 conference, ser. SIGCOMM '11. New York, NY, USA: ACM, 2011, pp. 98109.
5. M. Raab and A. Steger, "Balls into bins a simple and tight analysis," Randomization and Approximation Techniques in Computer Science, pp. 159-170, 1998.
6. Y. Chen, R. Griffith, J. Liu, R. H. Katz, and A. D. Joseph, "Understanding TCP incast throughput collapse in datacenter networks," in Proc. 1st ACM workshop on Research on enterprise networking, ser. WREN '09. New York, NY, USA: ACM, 2009, pp. 7382.
7. J. C. Martnez, J. Flich, A. Robles, P. Lpez, and J. Duato, "Supporting fully adaptive routing in InfiniBand networks," in Proc. 17th International Symposium on Parallel and Distributed Processing, ser. IPDPS '03. Washington, DC, USA: IEEE Computer Society, 2003, pp. 44.1, ACM ID: 838493.
8. C. Minkenberg, M. Gusat, and G. Rodriguez, "Adaptive routing in data center bridges," in Proc. 2009 17th IEEE Symposium on High Performance Interconnects. Washington, DC, USA: IEEE Computer Society, 2009, pp. 3341, ACM ID: 1634466.
9. C. Gomez, F. Gilabert, M. Gomez, P. Lopez, and J. Duato, "Deterministic versus adaptive routing in fat-trees," in 2007 IEEE International Parallel and Distributed Processing Symposium, Long Beach, CA, USA, Mar. 2007, pp. 1-8.
10. M. Koibuchi, J. C. Martinez, J. Flich, A. Robles, P. Lopez, and J. Duato, "Enforcing in-order packet delivery in system area networks with adaptive routing," J. Parallel Distrib. Comput., vol. 65, no. 10, pp. 1223-1236, Oct. 2005. (Pubitemid 41240626)
11. W. Wu, P. Demar, and M. Crawford, "Sorting reordered packets with interrupt coalescing," Computer Networks, vol. 53, no. 15, pp. 2646-2662, Oct. 2009.
12. A. V. Gerbessiotis and L. G. Valiant, "Direct bulk-synchronous parallel algorithms," J. Parallel Distrib. Comput., vol. 22, no. 2, pp. 251267, Aug. 1994.
13. T. Hoefler, P. Kambadur, R. Graham, G. Shipman, and A. Lumsdaine, "A case for standard non-blocking collective operations," in Recent Advances in Parallel Virtual Machine and Message Passing Interface, ser. Lecture Notes in Computer Science, F. Cappello, T. Herault, and J. Dongarra, Eds. Springer Berlin / Heidelberg, 2007, vol. 4757, pp. 125-134.
14. T. Hoefler, T. Schneider, and A. Lumsdaine, "Multistage switches are not crossbars: Effects of static routing in high-performance networks," in 2008 IEEE International Conference on Cluster Computing. IEEE, Oct. 2008, pp. 116-125.
15. X. Yuan, "On nonblocking folded-clos networks in computer communication environments," in Parallel & Distributed Processing Symposium (IPDPS), 2011 IEEE International. IEEE, May 2011, pp. 188-196.
16. N. Jiang, J. Kim, and W. J. Dally, "Indirect adaptive routing on large scale interconnection networks," ACM SIGARCH Computer Architecture News, vol. 37, pp. 220231, Jun. 2009, ACM ID: 1555783.
17. J. Kim, W. J. Dally, and D. Abts, "Adaptive routing in high-radix clos network." ACM Press, 2006, pp. 92.
18. S. Scott, D. Abts, J. Kim, and W. J. Dally, "The BlackWidow highradix clos network," in Proc. 33rd annual international symposium on Computer Architecture, ser. ISCA '06. Washington, DC, USA: IEEE Computer Society, 2006, pp. 1628.
19. N. R. Adiga, M. A. Blumrich, D. Chen, P. Coteus, A. Gara, M. E. Giampapa, P. Heidelberger, S. Singh, B. D. Steinmacher-Burow, T. Takken, M. Tsao, and P. Vranas, "Blue Gene/L torus interconnection network," IBM J. Research and Development, vol. 49, no. 2.3, pp. 265-276, Mar. 2005. (Pubitemid 40718132)
20. G. BLOCH, D. CRUPNICOFF, M. KAGAN, I. BUKSPAN, I. RABENSTEIN, A. WEBMAN, and A. MARELLI, "High-performance adaptive routing," U.S. Patent, 2012, publication number: US 2011/0096668 A1 U.S. Classification: 370/237.
21. M. Gusat, D. Crisan, C. Minkenberg, and C. DeCusatis, "R3C2: reactive route and rate control for CEE," in High-Performance Interconnects, Symposium on. Los Alamitos, CA, USA: IEEE Computer Society, 2010, pp. 50-57.
22. E. J. Anderson and T. E. Anderson, "On the stability of adaptive routing in the presence of congestion control," in INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, vol. 2. IEEE, Apr. 2003, pp. 948-958 vol.2.
23. D. Gamarnik, "Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks," in Proc. thirty-first annual ACM symposium on Theory of computing, ser. STOC '99. New York, NY, USA: ACM, 1999, pp. 206214.
24. A. Smiljanic, "Rate and delay guarantees provided by clos packet switches with load balancing," IEEE/ACM Trans. Netw. (TON), vol. 16, no. 1, pp. 170-181, 2008. (Pubitemid 351386764)
25. A. Jajszczyk, "Nonblocking, repackable, and rearrangeable clos networks: fifty years of the theory evolution," IEEE Commun. Mag., vol. 41, no. 10, pp. 28-33, 2003.
26. V. E. Benes, Mathematical theory of connecting networks and telephone traffic. Academic press New York, 1965, vol. 332.
27. D. Z. Du, B. Gao, F. K. Hwang, and J. H. Kim, "On multirate rearrangeable clos networks," SIAM J. Comput., vol. 28, no. 2, pp. 463470, 1998.
28. S. Liew, M.-H. Ng, and C. Chan, "Blocking and nonblocking multirate clos switching networks," IEEE/ACM Trans. Netw., vol. 6, no. 3, pp. 307-318, 1998. (Pubitemid 128750049)
29. B. Douglass and A. Oruc, "On self-routing in clos connection networks," IEEE Trans. Comput., vol. 41, no. 1, pp. 121-124, 1993.
30. A. Youssef, "Randomized self-routing algorithms for clos networks," Computers & Electrical Engineering, vol. 19, no. 6, pp. 419-429, Nov. 1993.
31. E. Zahavi, "Fat-trees routing and node ordering providing contention free traffic for MPI global collectives," J. Parallel and Distributed Computing, no. Communication Arch for Scalable Systems, 2008, pending.
32. N. Finn, "802.1Qau-2010," Tech. Rep., 2010. [Online]. Available: http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5454061
33. S. Karlin and H. M. Taylor, An Introduction to Stochastic Modeling, Third Edition, 3rd ed. Academic Press, Feb. 1998.
34. A. Varga, "OMNET++," 2004. [Online]. Available: http://www.omnetpp.org/
35. "InfiniBand(TM) Simulation Macro Model Macro http://www.omnetpp.org/ omnetpp/doc details/2070-infiniband."
36. E. G. Gran, M. Eimot, S. A. Reinemo, T. Skeie, O. Lysne, L. P. Huse, and G. Shainer, "First experiences with congestion control in InfiniBand hardware," in 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS). IEEE, Apr. 2010, pp. 1-12.
37. E. G. Gran, E. Zahavi, S.-A. Reinemo, T. Skeie, G. Shainer, and O. Lysne, "On the relation between congestion control, switch arbitration and fairness." IEEE, May 2011, pp. 342-351.