Hierarchical channel router
β Scribed by Michael Burstein; Richard Pelavin
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 874 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-9260
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
In this paper, we present a multiple hierarchical image coding and transmission scheme in which both the fragile structure of the set partitioning in hierarchical trees (SPIHT) source coding and unequal bit error sensitivity in the coded bitstreams have been taken into account. Multiple subsampling