
Dynamic Routing and Wavelength Assignment in Optical WDM Networks
■
607
24.6.1.4 Summary
We summarize some complexity and overhead parameters estimation in Table 24.4.
24.6.2 HABR Algorithm
24.6.2.1 Computation Time
The computation time of a route for a connection request is very small because HABR is based on
alternate routing methods. The time complexity to select the k best routes from the P-route table
is O(kP). This is a local search on the source node based on the goodness value of each route. For
the above reasons, the setup delay of HABR is similar to FPLC with the same number of alternate
routes. It is notable from the previous section that