A contention-free unicast-based multicast algorithm is developed for wormhole-routed star graph interconnection networks. Since the size of the buffers in the wormhole routing controller is much smaller than the size of the message, only destination nodes of multicast should receive message and stor
Performance comparison of routing algorithms in wormhole-switched networks
β Scribed by A. Shahrabi
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 511 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present a new analytical approach for the performance evaluation of deterministic wormhole routing in k-ary n-cubes. Our methodology achieves closed formulas for average time values through the analysis of network Β―ows. The comparison with simulation models demonstrates that our methodology gives
Routing efficiency in wireless communication networks depends critically on the propagation of location information into the network. We propose new dynamic traffic and state-dependent routing algorithms which are suitable for the demands of future wireless personal communications networks.
discover The Benefits Of Applying Algorithms To Solve Scientific, Engineering, And Practical Problems Providing A Combination Of Theory, Algorithms, And Simulations, Handbook Of Applied Algorithms Presents An All-encompassing Treatment Of Applying Algorithms And Discrete Mathematics To Practi