Method for routing in loaded telecommunication networks
US6816585B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 16, 2001 |
| Grant date | Nov 9, 2004 |
| Priority date | — |
| Expiry date | Jan 11, 2023 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/302
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method for routing of incoming prioritized telecommunication traffic in a telecommunication network by applying an algorithm of finding optimal path to an augmented graph built for said telecommunication network. The telecommunication network is represented as a network graph comprising nodes (A, B, C, D, E) and real links (AB, BC, CD, ED, AE) bridging the nodes, while the augmented graph is a graph built on the basis of the network graph by adding to it virtual links (ABC1, . . . , EDC3). The augmented graph comprises nodes and edges, wherein the edges of the augmented graph are weighed to reflect priority of the telecommunication traffic presently taking place there-through. For placing a new call according to the method, a pathfinder optimization algorithm is applied to the augmented graph to determine an optimal pathfinder solution, having the minimal total weight, for routing the new call in the augmented graph. When the optimal pathfinder solution is determined, links in the network graph corresponding to the solution can be allocated for real routing, and the augmented graph can be updated to reflect changes in the network.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.