|
|
|
| Monotone routing in multirate rearrangeable logd(N,m,p) network |
| WANG Yang, HWANG Frank K. |
| Department of Mathematics, Zhejiang University, Hangzhou 310027, China; Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan, China |
|
|
|
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 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£m£n-1).
|
|
|
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
