An Asynchronous Routing Algorithm for Clos Networks

Clos networks provide the theoretically optimal solution to build high-radix switches. This paper proposes a novel asynchronous routing algorithm for general asynchronous three-stage Clos networks. As the major sub-algorithm controlling the first two stages, the asynchronous dispatching algorithm ou...

Full description

Saved in:
Bibliographic Details
Published in:2010 10th International Conference on Application of Concurrency to System Design pp. 67 - 76
Main Authors: Wei Song, Edwards, Doug
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2010
Subjects:
Algorithm design and analysis
Dispatching
Heuristic algorithms
IP networks
Optical switches
Routing
Throughput
ISBN:1424472660, 9781424472666
ISSN:1550-4808
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Clos networks provide the theoretically optimal solution to build high-radix switches. This paper proposes a novel asynchronous routing algorithm for general asynchronous three-stage Clos networks. As the major sub-algorithm controlling the first two stages, the asynchronous dispatching algorithm outperforms the synchronous concurrent round-robin dispatching algorithm in behaviour level simulations. In a 32-port Clos network utilizing the asynchronous routing algorithm, paths are reserved in 6.2 ns and released in 3.9 ns.
ISBN:1424472660
9781424472666
ISSN:1550-4808
DOI:10.1109/ACSD.2010.12