A new routing algorithm for multirate rearrangeable Clos networks |
| |
Authors: | Hung Q Ngo |
| |
Affiliation: | Computer Science and Engineering Department NMVL, 201 Bell Hall, State University of New York at Buffalo, Amherst, NY 14260, USA |
| |
Abstract: | In this paper, we study the problem of finding routing algorithms on the multirate rearrangeable Clos networks which use as few number of middle-stage switches as possible. We propose a new routing algorithm called the “grouping algorithm”. This is a simple algorithm which uses fewer middle-stage switches than all known strategies, given that the number of input-stage switches and output-stage switches are relatively small compared to the size of input and output switches. In particular, the grouping algorithm implies that m = 2n+ (n?1)/2k is a sufficient number of middle-stage switches for the symmetric three-stage Clos network C(n,m,r) to be multirate rearrangeable, where k is any positive integer and r n/(2k?1). |
| |
Keywords: | Clos networks Routing algorithms Multirate networks Rearrangeable networks |
本文献已被 ScienceDirect 等数据库收录! |
|