Oblivious Routing in Fat-Tree Based System Area Networks With Uncertain Traffic Demands

We study oblivious routing in fat-tree-based system area networks with deterministic routing under the assumption that the traffic demand is uncertain. The performance of a routing algorithm under uncertain traffic demands is characterized by the oblivious performance ratio that bounds the relative performance of the routing algorithm with respect to the optimal algorithm for any given traffic demand. We consider both single-path routing, where only one path is used to carry the traffic between each source-destination pair, and multipath routing, where multiple paths are allowed. For single-path routing, we derive lower bounds of the oblivious performance ratio for different fat-trees and develop routing schemes that achieve the optimal oblivious performance ratios for commonly used topologies. Our evaluation results indicate that the proposed oblivious routing schemes not only provide the optimal worst-case performance guarantees but also outperform existing schemes in average cases. For multipath routing, we show that it is possible to obtain an optimal scheme for all traffic demands (an oblivious performance ratio of 1). These results quantitatively demonstrate the performance difference between single-path routing and multipath routing in fat-trees.

[1]  Antonio Robles,et al.  Effective strategy to compute forwarding tables for infiniBand networks , 2001, International Conference on Parallel Processing, 2001..

[2]  Aurelio Bermúdez,et al.  Fast routing computation on InfiniBand networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[3]  Charles E. Leiserson,et al.  Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..

[4]  Christos Kaklamanis,et al.  Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.

[5]  José Duato,et al.  Use of provisional routes to speed-up change assimilation in InfiniBand networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[6]  Edith Cohen,et al.  Coping with network failures: routing strategies for optimal demand oblivious restoration , 2004, SIGMETRICS '04/Performance '04.

[7]  Mohammad Taghi Hajiaghayi,et al.  Oblivious routing in directed graphs with random demands , 2005, STOC '05.

[8]  Mohammad Taghi Hajiaghayi,et al.  Oblivious routing on node-capacitated and directed graphs , 2005, SODA '05.

[9]  Pedro López,et al.  Deterministic versus Adaptive Routing in Fat-Trees , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[10]  José Duato,et al.  Deadlock-Free Routing in InfiniBand through Destination Renaming , 2001 .

[11]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[12]  Antonio Robles,et al.  Supporting fully adaptive routing in InfiniBand networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[13]  Mohammad Taghi Hajiaghayi,et al.  New lower bounds for oblivious routing in undirected graphs , 2006, SODA '06.

[14]  Antonio Robles,et al.  Effective methodology for deadlock-free minimal routing in InfiniBand networks , 2002, Proceedings International Conference on Parallel Processing.

[15]  Marcin Bienkowski,et al.  A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.

[16]  Satish Rao,et al.  A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.

[17]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[18]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[19]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[20]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[21]  Yeh-Ching Chung,et al.  A multiple LID routing scheme for fat-tree-based InfiniBand networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[22]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[23]  P.M. Melliar-Smith,et al.  Recursively scalable fat-trees as interconnection networks , 1994, Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications.

[24]  Yin Zhang,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM 2006.

[25]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..