Balancing Traffic in Meshes by Dynamic Channel Selection
碩士 === 淡江大學 === 電機工程學系 === 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 traff...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2002
|
Online Access: | http://ndltd.ncl.edu.tw/handle/80571184725969295761 |
id |
ndltd-TW-090TKU00442020 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-090TKU004420202016-06-24T04:14:57Z http://ndltd.ncl.edu.tw/handle/80571184725969295761 Balancing Traffic in Meshes by Dynamic Channel Selection 網狀結構中以動態通道選擇促進傳輸均衡之研究 Yue-Tsuen Jiang 蔣岳村 碩士 淡江大學 電機工程學系 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. Po-Jen Chuang 莊博任 2002 學位論文 ; thesis 94 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 淡江大學 === 電機工程學系 === 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.
|
author2 |
Po-Jen Chuang |
author_facet |
Po-Jen Chuang Yue-Tsuen Jiang 蔣岳村 |
author |
Yue-Tsuen Jiang 蔣岳村 |
spellingShingle |
Yue-Tsuen Jiang 蔣岳村 Balancing Traffic in Meshes by Dynamic Channel Selection |
author_sort |
Yue-Tsuen Jiang |
title |
Balancing Traffic in Meshes by Dynamic Channel Selection |
title_short |
Balancing Traffic in Meshes by Dynamic Channel Selection |
title_full |
Balancing Traffic in Meshes by Dynamic Channel Selection |
title_fullStr |
Balancing Traffic in Meshes by Dynamic Channel Selection |
title_full_unstemmed |
Balancing Traffic in Meshes by Dynamic Channel Selection |
title_sort |
balancing traffic in meshes by dynamic channel selection |
publishDate |
2002 |
url |
http://ndltd.ncl.edu.tw/handle/80571184725969295761 |
work_keys_str_mv |
AT yuetsuenjiang balancingtrafficinmeshesbydynamicchannelselection AT jiǎngyuècūn balancingtrafficinmeshesbydynamicchannelselection AT yuetsuenjiang wǎngzhuàngjiégòuzhōngyǐdòngtàitōngdàoxuǎnzécùjìnchuánshūjūnhéngzhīyánjiū AT jiǎngyuècūn wǎngzhuàngjiégòuzhōngyǐdòngtàitōngdàoxuǎnzécùjìnchuánshūjūnhéngzhīyánjiū |
_version_ |
1718321078728654848 |