| Summary: | 碩士 === 國立交通大學 === 資訊科學系 === 89 === As the rapid development of Internet, a growing number of
computers are connected to the global computer network. For
proper operation of the network, the routing protocols play an
important role. A good routing protocol ensures the network to
operate correctly and smoothly.But how well can a routing
protocol perform ? This is the problem we try to solve in this thesis.The solution will be very valuable both academically and
practically.
In this thesis, we propose a method that can obtain a good
average packet delay based on a modified shortest path routing.
This method first calculates several shortest routes for each
origin-destination pair in the network. Then in the course from
the origin node to the destination node, a packet is rerouted to the shortest route in every node according to the traffic
condition at that time so that it can adapt to the changing
traffic. Besides, because the rerouting is restricted to the
previously selected routes, no loop will be formed. According
to our experiment, this routing approach performs much better
than single shortest path routing, especially when the network
is under heavy load.
|
|---|
