Monotone Routing in Multirate Rearrangeable Clos Networks

Authors: Hu X-D.^{1, 2}; Jia X-H.³; Du D-Z.^{4, 5}; Hwang F.K.⁶

Source: Journal of Parallel and Distributed Computing, Volume 61, Number 9, September 2001 , pp. 1382-1388(7)

Buy & download fulltext article:

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.

Abstract:

In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. Copyright 2001 Academic Press.

Language: English

Document Type: Miscellaneous

Affiliations: 1: Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, 100080, China 2: Department of Computer Science, City University of Hong Kong, Hong Kong 3: Department of Computer Science, City University of Hong Kong, Hong Kong 4: Department of Computer Science, University of Minnesota, Minneapolis, Minnesota, 55455 5: Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, 100080, China 6: Department of Applied Mathematics, Chiao Tung University, Hsinchu, Taiwan