Patent ID: 6061626
Filing Date: 2000-05-09
Classification: G08G,H04L

Abstract:
A method of determining a route between two nodes of a network having a plurality of nodes connected by links, the method comprising the steps:dividing the nodes into a first set of high level nodes and high level links, and at least one further set of lower level nodes and lower level links;attaching each lower level node, via lower level links, to a defining point on one or more high level links in the first set of high level nodes;entering a start node and a finish node;determining whether the start node is in the at least one further set of lower level nodes, and, if said start node is in said at least one further set, computing a start distance from said start node, along said lower level link to the defining point on the high level link, and to each of the high level nodes at the ends of the high level link(s) to which said start node is attached;determining whether the finish node is in the at least one further set of lower level nodes, and, if said finish node is in said further set, computing a finish distance from said finish node, along said lower level link to the defining point on the high level link, and to each of the high level nodes at the ends of the high level link(s) to which said finish node is attached; andcomputing a computed route through the network from the start node to the finish node using said start and finish distances and the high level nodes and high level links of the first set.