✦ LIBER ✦

A New Routing Algorithm for the Shuffle-Exchange Permutation Network

✍ Scribed by Baoxing Chen; Wenjun Xiao; Ni Du

Book ID: 107346985
Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2006
Tongue: English
Weight: 168 KB
Volume: 19
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-006-0586-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Routing algorithm for the Rotation-Excha

Routing algorithm for the Rotation-Exchange network

✍ Baoxing Chen; Wenjun Xiao 📂 Article 📅 2005 🏛 SP Science Press 🌐 English ⚖ 314 KB

A new policy to solve routing conflicts

A new policy to solve routing conflicts in shuffle-exchange networks

✍ FangBin Ge; Min Zhao; Tao Zhang; JianXin Wang 📂 Article 📅 2011 🏛 Science in China Press (SCP) 🌐 English ⚖ 281 KB

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

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 mathematical abstraction of the rearra

A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks

✍ F.K. Hwang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 187 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