| Summary: | 碩士 === 淡江大學 === 電機工程學系 === 90 === Previous research on routing algorithms for two-dimensional meshes includes using adaptive routing approaches. An adaptive routing algorithm provides more feasible paths between source and destination nodes. But when traffic is heavy, uneven network traffic results. That is, traffic tends to concentrate in a certain area of the network, prompts early saturation of that area and hence degrades network performance. To balance channel utilization in a network in order to avoid congestion, we propose to use “dynamic channel selection”. In our method, some tag is added on each channel to properly indicate the conditions of current channel utilization and to set priorities for selecting channels accordingly. As a result, channels can be selected dynamically in message routing in accordance with channel utilization. That is, transmission can be distributed more evenly, ensuring reduced transmission latency and better performance for the network.
|
|---|
