US 2003/0142808 A1 · Routing engine for telecommunications network

Abstract

A system for automated installation of a communication line using an optimal route between a source location and a destination location is disclosed. The system includes a routing engine providing an automated design process for rendering the optimal route. The routing engine utilizes a routing algorithm to select the optimal route from a graph of capacity links defining a plurality of possible routes between the source and destination locations. If, at any time during the design process, the optimal route or capacity links defining the optimal route are detected as unavailable for any reason, the routing engine re-initiates the design process and thereafter selects a new optimal route based upon a new capacity graph built without the previously unavailable capacity link. Once designed, the available optimal route is provided to a command and control engine, which, in turn, manages the installation of the communication line using the optimal route. The command and control engine manages the process for assigning the optimal route in the provisioning system.

Claims32

Dependent claims

An automated routing system for designing a route in a communications network through which a communication line may be installed between a source location and a destination location as specified in a service request for the communication line, the system comprising:

a find module identifying one or more possible capacity links within the communication network, each capacity link representing an ability to transport data over a predefined segment of the communication network between the source location and the destination location;
a build module constructing a capacity graph of the communication network depicting connectivity of each of the possible capacity links to an adjacent possible capacity link such that one or more possible routes are defined between a source node representing the source location and a destination node representing the destination location;
and
a select module applying a routing algorithm to the capacity graph to select an optimal route from the one or more possible routes based on a calculated cost factor for installation of the communication line into each of the possible routes within the computer network.

1 more element

A computer program product readable by a computing system and encoding a computer program of instructions for executing a computer process for designing a route in a communication network through which a communication line may be installed between a source location and a destination location as specified in a service request for the communication line, said computer process comprising:

identifying one or more possible capacity links within the communication network, wherein each capacity link represents an ability to transport data over a predefined segment of the communication network between the source location and the destination location;
building a capacity graph of the communication network depicting connectivity of each of the possible capacity links to an adjacent possible capacity link such that one or more possible routes are defined between a source node representing the source location and a destination node representing the destination location;
calculating a cost factor for each possible capacity link within the communication network;
and
selecting an optimal route from the possible routes based on the calculated cost factor for each possible link.

2 more elements

Dependencies are inferred from the claim text.

Routing engine for telecommunications network

Life of this patent

Routing engine for telecommunications network

Life of this patent

Abstract

Claims32