The Clos Network as a Multirate Distributer with a Greedy Routing Algorithm

Authors

Ellen E. White, Washington University in St Louis

Document Type

Technical Report

Publication Date

1992

Filename

WUCS-92-13.pdf

Technical Report Number

WUCS-92-13

Abstract

Yang and Masson [14] have demonstrated that the Clos network is a nearly nonblocking distributer, with the proper choice of network parameters. The resulting network has better asymptotic crosspoint compleixty than other known constructions when the number of stages is fixed. In addition, the routing algorithm is efficient, taking time linear in the number of network inputs to route a new connection. We extend these results to the multirate environment in which each connection has an associated weight indicating the fraction of link bandwidth which it requires. Connections may share a link provided the sum of the weights does not exceed 1. The overall complexity of the network is better than other known multirate results when the number of stages is fixed.

Comments

Permanent URL: http://dx.doi.org/10.7936/K70K26VJ

Recommended Citation

White, Ellen E., "The Clos Network as a Multirate Distributer with a Greedy Routing Algorithm" Report Number: WUCS-92-13 (1992). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/524