✦ LIBER ✦

Comment on "A new routing algorithm for a class of rearrangeable networks"

✍ Scribed by Marom, D.M.; Mendlovic, D.

Book ID: 119772703
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 38 KB
Volume: 46
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.600891

No coin nor oath required. For personal study only.

📜 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

A new decomposition algorithm for rearra

A new decomposition algorithm for rearrangeable Clos interconnection networks

✍ Hyun Yeop Lee; Hwang, F.K.; Carpinelli, J.D. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 760 KB

A Simple Algorithm for the Control of Re

A Simple Algorithm for the Control of Rearrangeable Switching Networks

✍ Jajszczyk, A. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 339 KB

Comments on "A Simple Algorithm for the

Comments on "A Simple Algorithm for the Control of Rearrangeable Switching Networks"

✍ Cardot, C. 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 93 KB

A new proximal decomposition algorithm f

A new proximal decomposition algorithm for routing in telecommunication networks

✍ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation

A new algorithm for routing in ad-hoc ne

A new algorithm for routing in ad-hoc network

✍ Zhang Jian; Kang Li-shan 📂 Article 📅 2003 🏛 Wuhan University 🌐 English ⚖ 772 KB