A Dynamically Adaptive Routing Method Based on Classifier Systems
碩士 === 國立交通大學 === 資訊科學系 === 89 === In recent years, the network develops rapidly, and more and more computers are connected with it. Hence, interconnection of networks became a very import technology. In order to make networks work properly, an effective routing protocol is needed. Because routers...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/12811171874990345891 |
| Summary: | 碩士 === 國立交通大學 === 資訊科學系 === 89 === In recent years, the network develops rapidly, and more and more computers are connected with it. Hence, interconnection of networks became a very import technology. In order to make networks work properly, an effective routing protocol is needed. Because routers run the routing protocol in a distributed way, a routing protocol has to be designed very carefully to work correctly.
The purpose of this thesis is to apply the evolutionary computation to the routing problem. We place a classifier system on each router. These classifier systems will be able to achieve the task of traditional routing protocols─establish the routing table─after training. In addition, they will adapt to the changing network environment and choose the best path accordingly. The final results of experiments showed the good performance of this system.
|
|---|