Summary: | 碩士 === 國立交通大學 === 資訊工程系 === 87 === Dynamic routing is the technology for changing the path according to the current network status. This technology has been adopted for many years for telecommunication networks in those developed countries, and its flexibility is very helpful in improving QOS(quality-of- service) as well as enhancing the utilization of whole network resources. For The conventional FHR(Fixed hierarchical routing), the alternative path is set up in the stage of routing design, it is less adaptive for modern changeable and versatile telecommunication networks.
This research is to study the way of Real-Time dynamic routing, and to use the analytical results to build up a suitable network management tactics. First of all, we collects the data of trunk cost, the path capacity and path traffic, and builds up the function based on path information and network traffic capacity. Then, according to the network cost function and taking account the space allowed under abnormal network status , we construct an optimization model with the minimum network resource.
We introduce an efficient heuristic optimization method for solving the linear programming routing problems, our method greatly improve computational speed with minimal loss of accuracy.
From the simulation result, we demonstrate that our model is able to accommodate the Real-Time dynamic routing for telecommunication networks.
|