Routing method and apparatus for optimising auto-tunnelling in a heterogeneous network
US7349427B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 21, 2002 |
| Grant date | Mar 25, 2008 |
| Priority date | — |
| Expiry date | Apr 1, 2025 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/52
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In the preferred embodiment, the invention provides a modified Shortest Path First routing algorithm for use in a heterogeneous network. The routing algorithm is modified to include predetermined heterogeneous characteristics of the network nodes and to take these characteristics into account when calculating the shortest paths. For example, information may be included in the algorithm which identifies heterogeneous network nodes as it calculates shortest paths. Once a node has been identified as heterogeneous, i.e., capable of supporting at least two protocol sets, this information is carried over into subsequent path entries created by the routing algorithm. The algorithm then uses the encapsulation capability identifier in the calculation of the shortest paths by including the cost of auto-tunneling between heterogeneous nodes to be taken into account when determining the short path.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.