‘Competing’ channel router
✍ Scribed by C. Guoqing; Y. Yiqun
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 386 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A 'greedy' channel-router is presented. It is quick, simple and effective. It always succeeds, usually using no more than one track more than required by channel density. It may be forced in rare cases to make a few connections "off the end' of the channel, in order to succeed. It assumes that all p
This paper analyzes the impact of virtual channels on the performance of wormhole routing algorithms. We study wormhole routing on network in which each physical channel, i.e., communication link, can support up to B virtual channels. We show that it is possible to route any set of messages with L f