International Business Machines Corporation

Jean Bidard

Claude R Galand

Olivier Maurel

Jean-Paul Chobert

Gerard Brun

Yves Ouvry

This method enables optimizing the time required for reestablishing connections between end users attached to a data communication network, which connections were disrupted due to a network failure. The network includes access nodes and transit nodes interconnected with network links/trunks (with no specific distinction being herein required between both designations of a communication line). The end users are attached to the network through access nodes and each said access node permanently stores an image of the current network trunk including the number N.sub.i of connections currently supported by said network trunk. Upon detection of a trunk failure, each access node supporting connections affected by said failure, is made aware of the total number (N.sub.i) of connections in each priority group affected by the failure, together with a network dependent parameter (TP) representing the elementary processing time required to reroute a single network connection. Then each access node may independently, start a first reconnection set-up procedure at a time Ri randomly selected between zero and (N.sub.i -n.sub.i) *TP, where n.sub.i is the number of connections supported by the access node in each priority group, and then space the required subsequent reconnections set-ups by a time equal to (T.sub.i -R.sub.i)/n.sub.i, with T.sub.i =N.sub.i *TP.

Growing community of inventors

Nice, France

Jean Bidard