✦ LIBER ✦

On self-routing in Clos connection networks

✍ Scribed by Douglass, B.G.; Oruc, A.Y.

Book ID: 117860748
Publisher: IEEE
Year: 1993
Tongue: English
Weight: 537 KB
Volume: 41
Category: Article
ISSN: 0090-6778
DOI: 10.1109/26.212371

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Randomized self-routing algorithms for C

Randomized self-routing algorithms for Clos networks

✍ Abdou Youssef 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 747 KB

On evil-twin routing in Clos networks

✍ Zhen Chen; Zeng-Ji Liu; Zhi-Liang Qiu; Xiao-Ming Tao 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 142 KB

Monotone Routing in Multirate Rearrangea

Monotone Routing in Multirate Rearrangeable Clos Networks

✍ Xiao-Dong Hu; Xiao-Hua Jia; Ding-Zhu Du; Frank K. Hwang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 116 KB

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

Parallel routing algorithms in Benes-Clo

Parallel routing algorithms in Benes-Clos networks

✍ Lee, T.T.; Liew, S.Y. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 473 KB

The complexity of routing in Clos permut

The complexity of routing in Clos permutation networks

✍ Koppelman, D.M.; Oruc, A.Y. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 868 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