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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 10th International Conference on Application of Concurrency to System Design s. 67 - 76
Hlavní autoři: Wei Song, Edwards, Doug
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2010
Témata:
Algorithm design and analysis
Dispatching
Heuristic algorithms
IP networks
Optical switches
Routing
Throughput
ISBN:1424472660, 9781424472666
ISSN:1550-4808
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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