Abstract: 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 log_d(N,m,p) networks. We first analyze the properties of log_d(N,m,p) networks. Then we use monotone algorithm in log_d(N,0,p) network. Furthermore we extend the result to construct multirate rearrangeable networks based on log_d(N,m,p) network (1≤m≤n-1).

Key words: Rearrangeable, Multirate, Monotone routing, log_d(N,m,p)

Please provide your name, email address and a comment

Your Name: Affili: E-Mail Address:

Comment (Please comment in English):


Verification Code(click to change a pic):