A new connection rerouting algorithm for handoff control in wireless ATM networks is proposed. The proposed scheme, which we call adapting weight rerouting (AWR) algorithm, performs rerouting by choosing an optimal virtual path consisting of the network links with the optimal bandwidth available under the constraint of maximum allowable delay. The availability of network links is represented by the link weights and the optimal path is chosen based on those values. These weight values are maintained in a table, and the connection is performed by table look-up method. The proposed AWR algorithm is reasonably fast, adapts dynamically to the changing link states, and guarantees QoS by table look-up method. The proposed AWR algorithm is reasonable fast, adapts dynamically to the changing link states, and guarantees QoS by reducing the handoff blocking probability. The performance of the AWR scheme is analyzed by numerical simulation. The results indicate that the proposed scheme keeps the handoff blocking probability low.
展开▼
