Parallel routing algorithms in Benes-Clos networks

IEEE Transactions on Communications

Volumn 50, Issue 11, 2002, Pages 1841-1847

  Lee, Tony T ^a   Liew, Soung Y ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Benes; Boolean equations; Clos; Omega and reverse omega networks; Packet switching; Parallel algorithms; Route assignments

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; PACKET SWITCHING; SWITCHING CIRCUITS;

ROUTE ASSIGNMENT ALGORITHMS;

TELECOMMUNICATION NETWORKS;

EID: 0036864606     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2002.805258     Document Type: Article

References (15)

1. D. Nassimi and S. Sahni, "Parallel algorithms to set up the Benes permutation network," IEEE Trans. Comput., vol. C-31, pp. 148-154, Feb. 1982.
2. D.M. Koppelman and A.Y. Oruc, "A self-routing permutation network," J. Parallel Distrib. Comput., pp. 140-151, 1990.
3. D.C. Opferman and N.T. Tsao-Wu, "On a class of rearrangeable switching networks Part I: Control algorithm," Bell Syst. Tech. J., pp. 1579-1600, May-June 1971.
4. C. Clos, "A study of nonblocking switching networks," Bell Syst. Tech. J., pp. 406-424, Mar. 1953.
5. V.E. Benes, "On rearrangeable three-stage connecting networks," Bell Syst. Tech. J., pp. 1481-1492, Sept. 1962.
6. T.T. Lee and P.T. To, "Non-blocking routing properties of Clos networks," in DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society, 1998, vol. 42, pp. 181-195.
7. -1 network," in Proc. Nat. Computer Conf., 1985, pp. 167-174.
8. D. Nassimi and S. Sahni, "A self-routing Benes network, and parallel permutation algorithms," IEEE Trans. Comput., vol. C-30, pp. 157-161, May 1981.
9. B.G. Douglass and A.Y. Oruc, "On self-routing in Clos connection networks," IEEE Trans. Commun., vol. 41, pp. 121-124, Jan. 1993.
10. C.S. Raghevandra and R.V. Boppana, "On self-routing in Benes and shuffle-exchange networks," IEEE Trans. Comput., vol. 40, pp. 1057-1064, Sept. 1991.
11. C.Y. Lee and A.Y. Oruc, "A fast parallel algorithm for routing unicast assignments in Benes networks," IEEE Trans. Parallel Distrib. Syst., vol. 6, pp. 329-333, Mar. 1995.
12. J.H. Reif, Synthesis of Parallel Algorithms. San Mateo, CA: Morgan Kaufmann, 1993.
13. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, "High speed switch scheduling for local area networks," ACM Trans. Comput. Syst., pp. 319-352, Nov. 1993.
14. N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE Trans. Commun., vol. 47, pp. 1260-1267, Aug. 1999.
15. K.Y. Lee, "On the rearrangeability of (2 log N - 1) stage permutation networks," IEEE Trans. Comput., vol. C-34, pp. 412-425, May 1985.