Scheme for randomized selection of equal cost links during restoration
AssigneeAT&T Intellectual Property II, L.P.
InventorsBruce Gilbert Cortez, Sanja Durinovic-Johri, Pravin Kumar Johri, John Paggi, Simon S. Zelingher
Life of this patent
Estimating the term…
Abstract
The present invention relates generally to restoration of services in a network. More particularly, the invention encompasses a scheme for randomized selection of equal cost links during restoration in a communication network. The invention further includes multiple schemes for restoring services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.
Claims19
A method for choosing a path for a circuit to be established in a communication network having a plurality of switches and links, the method comprising:
- running an algorithm on a portion of the network to obtain the shortest path for the circuit, said portion of the network including only a selected one link from among of any multiple links between each switch pair that
- i) meet at least one quality-of-service requirement of the circuit, and
- ii) have an administrative weight equal to the minimum administrative weight of the links between said each switch pair,
- said selected one link having been selected probabilistically in accordance with a chosen rule,
- said shortest path comprising two or more links of said portion of the network.
A method for choosing a path for a circuit to be established in a communication network having a plurality of switches, links and circuits, comprising the steps of:
- (a) ignoring at least one link that does not meet quality of service requirements of at least one circuit,
- (b) ignoring at least one link with weight greater than X for each switch pair with a plurality of links, wherein X is a minimum weight of at least one link,
- (c) ignoring at least one link for each switch pair wherein said one link is chosen randomly from the remaining plurality of links, and
- (d) running an algorithm on the remaining network to obtain the shortest path for the shortest path for the circuit through the communication network.
A method for choosing a path for a circuit to be established in a communication network, said path including two or more nodes and a point-to-point communication link directly interconnecting each successive pair of nodes along said path, the method comprising
- identifying a plurality of paths through the network between a source node of said circuit and a destination node of said circuit, at least one of said paths comprising two or more links, and
- choosing a particular one of said paths as the path for said particular circuit,
- wherein two or more point-to-point communication links directly interconnect a particular successive pair of nodes along the chosen path,
- wherein said chosen path includes a selected one of said two or more point-to-point communication links, and
- wherein the selection of said selected link includes the application of a probabilistic rule to select said selected link from among said two or more point-to-point communication links directly interconnecting said particular successive pair of nodes along said chosen path.
The method of 13 wherein said quality-of-service requirement is a one of a) bandwidth required for said circuit, and b) a delay requirement for said circuit.
Dependencies are inferred from the claim text.