๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new routing algorithm for multirate rearrangeable Clos networks

โœ Scribed by Hung Q. Ngo

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
142 KB
Volume
290
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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 QoS-based routing algorithm for PNNI A
A QoS-based routing algorithm for PNNI ATM networks
โœ Chen-Khong Tham; Jianning Mai; Lawrence WC Wong ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

Although the ATM Forum has proposed the Private NetworkยฑNetwork Interface (PNNI) speciยฎcation to facilitate routing in ATM networks, path selection or routing algorithms that guarantee users' multiple Quality of Service (QoS) requirements remain an open issue since the PNNI protocol only provides a

A linear-based trunk reservation routing
A linear-based trunk reservation routing algorithm for ATM networks
โœ Antonios F. Atlasis; Evangelos D. Baltatzis; George I. Stassinopoulos; Iakovos S ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 175 KB ๐Ÿ‘ 1 views

In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade-off between the use of the minimum-hop routes and the application of the