As real-time applications requiring dynamic group communication emerges, existing multicast routing algorithms must be improved to cater for high-speed routing decisions. Most of the reported efficient multicast routing algorithms for real-time applications construct a multicast tree using the Dijks
River routing in VLSI
β Scribed by Andranik Mirzaian
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 773 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Scaling aspects of river flow routing are studied by comparing two flow routing schemes, one designed for use in coupled general circulation models (GCMs) and operated at large spatial scales (βΌ350 km), and the other designed for use in typical hydrological applications at small spatial
Flow routing in a river network is one of the most important parts in the domain of water resources and hydrology. There are different characteristics in the different river networks. The mathematical models adopted to deal with the flow routing have their own advantages respectively. Thus a suitabl