Full Text:   <1075>

CLC number: TP393.01

On-line Access: 


Revision Accepted: 2004-07-13

Crosschecked: 0000-00-00

Cited: 0

Clicked: 3425

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2005 Vol.6 No.6 P.555~559


Monotone routing in multirate rearrangeable logd(N,m,p) network

Author(s):  WANG Yang, HWANG Frank K.

Affiliation(s):  Department of Mathematics, Zhejiang University, Hangzhou 310027, China; more

Corresponding email(s):   wangyang_zju@yahoo.com.cn

Key Words:  Rearrangeable, Multirate, Monotone routing, logd(N, m, p)

WANG Yang, HWANG Frank K.. Monotone routing in multirate rearrangeable logd(N,m,p) network[J]. Journal of Zhejiang University Science A, 2005, 6(6): 555~559.

@article{title="Monotone routing in multirate rearrangeable logd(N,m,p) network",
author="WANG Yang, HWANG Frank K.",
journal="Journal of Zhejiang University Science A",
publisher="Zhejiang University Press & Springer",

%0 Journal Article
%T Monotone routing in multirate rearrangeable logd(N,m,p) network
%A WANG Yang
%A HWANG Frank K.
%J Journal of Zhejiang University SCIENCE A
%V 6
%N 6
%P 555~559
%@ 1673-565X
%D 2005
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2005.A0555

T1 - Monotone routing in multirate rearrangeable logd(N,m,p) network
A1 - WANG Yang
A1 - HWANG Frank K.
J0 - Journal of Zhejiang University Science A
VL - 6
IS - 6
SP - 555
EP - 559
%@ 1673-565X
Y1 - 2005
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2005.A0555

The construction of multirate rearrangeable network has long been an interesting problem. Of many results published, all were achieved on 3-stage Clos network. The monotone routing algorithm proposed by Hu et al.(2001) was also first applied to 3-stage Clos network. In this work, we adopt this algorithm and apply it to logd(N,m,p) networks. We first analyze the properties of logd(N,m,p) networks. Then we use monotone algorithm in logd(N,0,p) network. Furthermore we extend the result to construct multirate rearrangeable networks based on logd(N,m,p) network (1≤mn-1).

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article


[1] Chung, S.P., Ross, K.W., 1991. On nonblocking interconnecting networks. SIAM J Comput, 20(4):726-736.

[2] Clos, C., 1953. A study of non-blocking switching networks. Bell Syst Tech J, 32(1953):406-424.

[3] Du, D.Z., Gao, B., Hwang, F.K., Kim, J.H., 1999. On multirate rearrangeable Clos networks. SIAM J Comput, 28(2):467-471 (electronic).

[4] Hu, X.D., Jia, X.H., Du, D.Z, Hwang, F.K, 2001. Monotone routing in multirate rearrangeable Clos networks. J Parallel Distrib Comput, 61(9):1382-1388.

[5] Hwang, F.K., 1998. The Mathematical Theory of Nonblocking Switching Networks. World Scientific.

[6] Lea, C.T., 1991. Multi-log2N networks and their applications in high speed electronic and photonic switching systems. IEEE Trans Commun, 38(10):1740-1749.

[7] Lin, G.H., Du, D.Z., Hu, X.D., Xue, G., 1999. On rearrangeability of multirate Clos networks. SIAM J Comput, 28(4):1225-1231 (electronic).

[8] Melen, R., Turner, J.S., 1989. Nonblocking multirate networks. SIAM J Comput, 18(2):301-313.

[9] Ngo, H.Q., 2003. A new routing algorithm for multirate rearrangeable Clos networks. Theoretical Computer Science, 290(3):2157-2167.

[10] Ngo, H.Q., Vu, V.H., 2003. Multirate rearrangeable Clos networks and a general edge coloring problem on bipartite graphs. SIAM J Comput, 32(4):1040-1049.

[11] Shyy, D.J., Lea, C.T., 1991. log2(N, m, p) strictly nonblocking networks. IEEE Trans Commun, 39(10):1502-1510.

Open peer comments: Debate/Discuss/Question/Opinion


Please provide your name, email address and a comment

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - Journal of Zhejiang University-SCIENCE