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

INTRODUCTION Switching networks have been widely used in telecommunication, data communication, satellitecommunication, optical fiber network, etc. It was firstproposed to meet the need to interconnect pairs oftelephone users. When a telephone user wants to callanother one, a request is generated. In order to satisfy all the requests, people first try to fully connect the callers (inputs) and receivers (outputs) who want to communicate. Later Clos (1953) showed that through some clever …

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

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).