Oblivious routing schemes in extended generalized fat tree networks
Document typeConference report
PublisherIEEE Computational Intelligence Society
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
A family of oblivious routing schemes for fat trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S-mod-k and D-mod-k, are analyzed in detail. S-mod-k is the default routing algorithm given as an example in the first works formally describing fat tree networks. D-mod-k has been independently proposed and investigated by several authors, who conclude in their evaluations that it achieves better performance than a random or adaptive routing approach. First, we identify the reasons why these algorithms perform well. Using this insight we extend these algorithms, originally intended for full bisection networks, to slimmed networks. Based on the lessons learned we propose a new generalized family of algorithms that provides a better oblivious solution than the existing ones for this class of networks. Moreover, this family extends the previous work from k-ary n-trees to the more general class of extended generalized fat trees.
CitationRodríguez, G., Minkenberg, C., Beivide, R., Luijten, R., Labarta, J., Valero, M. Oblivious routing schemes in extended generalized fat tree networks. A: Workshop on High Performance Interconnects for Distributed Computing. "2009 IEEE International Conference on Cluster Computing and Workshops". New Orleans, Louisiana: IEEE Computational Intelligence Society, 2009, p. 1-8.