Summary: | 碩士 === 國立交通大學 === 資訊科學學系 === 83 === In this thesis, we present an efficient ATM network routing
method based on the genetic algorithm. We use an expanding
hierarchical network routing topology which includes a set of
hierarchical centralized routing servers for handling of
traffic management, congestion control, and quality of services
for an ATM network. The ATM network is a broadband, high speed
network. It integrates various media into the same network.
Thus, low cell delay and high fault tolerance ability are
important for developing an ATM network routing algorithm to
suit the diverse payload, dissimilar customers, and
capriciously selectable multipoint connections. To meet these
diversiform requirements, we develop an efficient and fault
tolerant ATM network routing by the genetic algorithm. A
mathematical model has been developed as the fitness function
to characterize the behavior of an ATM network. Our genetic
algorithm optimizes several coefficients such as delay, and
quality of services simultaneously and stops the iteration loop
when an acceptable network topology is found. Consequently, the
derived network topology has short routing time. The main
contribution of this thesis is designing an efficient routing
algorithm for ATM network routing which is fault tolerant
requiring any redundant optical fiber links, reduce cell delay
time, and enhances bandwidth allocation. The network routing
the genetic algorithm is simulated by C to analyze the figures
merit using our approach. Simulation results show that our
routing algorithm has lower cell delay, better bandwidth and
reliability than other routing algorithm.
|