To shorten time required for providing services and to speedily provide the services to a user by shortening a route computing time in comparison with conventional systems.
Metric shortest routes from a route start point to another node in a network are computed, and a metric shortest route is computed, among end points of given routes, with an end point with which no other end point is not present on the downstream side of the end point, or with which the other end point is present, as a basic point in the computed shortest route. The start point and the end point of the route are defined as vertices and if the metric shortest route between the corresponding vertices is computed, a virtual graph is created in which branches corresponding to the shortest route are present and a metric of each branch becomes a metric of the corresponding shortest route. In routes passing all the vertices on the virtual graph, a route to most reduce the metric of the entire route is computed, and the shortest route included in results of the computation is defined as a final result.
COPYRIGHT: (C)2005,JPO&NCIPI
Masayoshi Yasukawa
Yasuo Shiga
| JP9116573A |
Toshinao Shimodaira