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.

[1]  Kang G. Shin,et al.  Localized multicast routing , 1995, Proceedings of GLOBECOM '95.

[2]  Mario Marchese,et al.  A global control system for integrated admission control and routing in ATM networks , 1995, Proceedings of GLOBECOM '95.

[3]  B. Sengupta,et al.  A link based alternative routing scheme for network restoration under failure , 1995, Proceedings of GLOBECOM '95.

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[7]  S. Murthy,et al.  Dynamics of a loop-free path-finding algorithm , 1995, Proceedings of GLOBECOM '95.

[8]  Cengiz Alaettinoglu,et al.  A scalable virtual circuit routing scheme for ATM networks , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[9]  Raif O. Onvural,et al.  Asynchronous Transfer Mode Networks: Performance Issues, Second Edition , 1993 .