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: The routing of calls of different classes of services as well as the administration thereof is enhanced by associating each such class of service with a number of parameters common to such services, such that each class of service, as well as a new class of service, may be readily identified by its respective parameter values. Accordingly, the routing and administration of calls of different classes of services may be handled in a systematic, straight forward manner so that basic network capabilities may be made available to various services using an administratively defined menu like structure. In addition, such class of service advantageously partitions network bandwidth allocation, call routing priority, voice/data transport, and traffic data registers into respective classes of services.

Abstract: The architecture of a communication network comprising a plurality of nodes interconnected by a transmission facility having a bandwidth divisible into channels of respective bandwidths, e.g., optical fiber, is enhanced by fully sharing the network bandwidth among the network nodes, such that each pair of nodes, on periodic basis, dynamically establishes respective direct links to each of the other network nodes, in which a direct link is formed from a group of channels obtained from the network bandwidth. The remaining bandwidth is then used to form a pool of bandwidth which is shared among the network nodes on a dynamic basis, such as, for example, establishing a communication path between a pair of nodes to route a call from one node to the other node of the pair of nodes.

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.

Abstract: A communications network is arranged so that an external switching office is connected to the network via multiple ingress/egress nodes such that an originating node which receives a call destined for the external office may route the call through the network to one of the ingress/egress nodes in accordance with a particular class (type) of routing specified in one of a number of routing treatments. Such routing treatments are associated with the external office and at least identify respective ones of the ingress/egress nodes connected to the external office.

Abstract: A nonhierarchial switching system employing a modified unified algorithm for developing link sizes for paths that connect switches in the system and routing sequences for the switches in the system, and further employing means for updating the routing sequences to minimize potential blocking in the network. In one embodiment, the modified unified algorithm develops improved link size determinations by taking advantage of traffic sensitive dynamic routing on the alternate paths available in the nonhierarchial switching system for connecting any switch to any other switch in the system. Updating of the routing sequences is achieved in that embodiment by evaluating the least loaded path for each potential connection of two switches in the system and, when appropriate, by installing the least loaded path as the second choice path in the routing sequence for that potential connection.

Abstract: In a network for routing traffic from an originating node to a terminating node, it is common to provide alternate routes in order to increase the number of route choices between the originating and terminating nodes. The Bell System toll network employs a hierarchical alternate routing arrangement wherein various nodes, or control switching points (CSPs), are rank ordered for defining a process of routing calls through the network, whereby some CSPs are prohibited from routing traffic through other CSPs. Hence, known hierarchical alternate routing arrangements tend to inhibit route choices, which tends toward longer, and hence more costly, routes. Such problems tend to arise from the limited capability of electromechanical switching equipment. But with the increasing use of electronic stored program controlled CSPs, they can be solved with our alternate routing method which allows route choices without regard to network hierarchy.