✦ LIBER ✦

Monotone Routing in Multirate Rearrangeable Clos Networks

✍ Scribed by Xiao-Dong Hu; Xiao-Hua Jia; Ding-Zhu Du; Frank K. Hwang

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 116 KB
Volume: 61
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.2001.1755

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

A new routing algorithm for multirate re

A new routing algorithm for multirate rearrangeable Clos networks

✍ Hung Q. Ngo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Routing in asymmetrical multiconnection

Routing in asymmetrical multiconnection three-stage Clos networks

✍ Tham, Yiu Kwok 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

The asymmetrical multiconnection three-stage rearrangeable Clos network is considered, where, in general, many-to-many connections are allowed between input and output terminals. The problem of routing the connections over the switches is efficiently solved. The computational complexity is improved

Applications of matching and edge-colori

Applications of matching and edge-coloring algorithms to routing in clos networks

✍ John D. Carpinelli; A. Yavuz Oruc 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 702 KB