A dynamic self-healing routing strategy for ATM networks

A hop-by-hop decentralized routing strategy for the ATM technology is considered, in which the traffic generated by different services is divided into classes, depending upon performance requirements. At each node traversed, all the outlets are considered and the least loaded one is chosen to carry the call, if it is capable to respect the quality of service requirements. The maximum number of calls for each class that would be carried over a link is limited. To accept a new connection, a cost function composed of the current values of a “local” cost and an “aggregate” cost, which is passed along each path periodically, is to be minimized at each node. Simulation results are presented and compared with those of other strategies