Abstract: A distributed computing system comprises a primary server having a primary virtual shared memory and a back-up server having a back-up virtual shared memory. The primary server periodically provides a state table to the back-up server in order to synchronize the virtual shared memory and the back-up virtual shared memory. A plurality of client computer resources are coupled to the primary server and the back-up server through a network architecture. The client computer resources further comprise plural worker processes each adapted to independently perform an operation on a data object disposed within the primary virtual shared memory without a predetermined assignment between the worker process and the data object. Upon an unavailability of either the primary server or the back-up server, the worker process performs the operation on the corresponding data object disposed within the back-up virtual shared memory.

Abstract: A telecommunication network may be arranged in accord with the invention so that a change in provisioning data occurring at one element of the network is automatically supplied to the other elements of the network, thereby eliminating the need of having a network administration facility to communicate manually the change to the other network elements. For example, if a local central office switch is rehomed from a first toll switch to a second toll switch, then the first and second toll switches form messages respectively characterizing the rehome and then send the messages to each of the other network toll switches so that the other toll switches may update their respective routing and trunking data relating to the rehomed switch. The network is also arranged to implement a rule-based, end-to-end routing scheme which automatically selects a routing path from multiple candidates based on (a) class-of-service parameters and (b) availability of network capacity.

Abstract: An arrangement for routing calls from a source switch to a destination switch in a telecommunications network. If a direct trunk is available between the two switches, that trunk is used. Otherwise, the destination switch is queried to obtain availability data of trunks to that switch from intermediate switches of the network. This availability data is then compared with availability data of trunks from the source switch to the intermediate switches. A route is then selected using an intermediate switch having available trunks from the source switch and to the destination switch. If a route using lightly loaded trunk groups is available, that route is selected in preference to the use of a route using more heavily loaded trunk groups. Advantageously, routing is performed to dynamically optimize selection of a route based on the current state of the network.