Route search apparatus

Abstract

A route search apparatus (1) searches for a route in a network (NW) that includes a plurality of nodes (V) that are connected by links (L), and is characterized in that the route search apparatus (1) obtains a cost to be set for the links (L) between the plurality of nodes (V) as an output of a function in which predetermined network use information about user usage is used as an input value, and, using the output link cost, searches for a shortest route by using Dijkstra's algorithm, in which shortest route the total cost of the links (L) on a route from a start point node to an end point node is minimal.

Claims

1. A pathfinding device that performs pathfinding in a network including multiple nodes connected by links, characterized in that it determines the cost to be set for the links between the multiple nodes as the output of a function that takes predetermined network usage information relating to user usage as input values, and uses the output link costs to search for the shortest path that minimizes the sum of the costs of the links on the path from the starting node to the ending node using Dijkstra's algorithm.

2. The pathfinding device according to claim 1, characterized in that the function is constrained to output the same link cost for the link once the input value is determined, regardless of the path from the starting node to the link.

3. The predetermined network usage information relating to user usage is the number of wavelength path requests indicating the number of wavelength paths requested by the user, the number of wavelengths currently in use on the target link, and the total number of wavelengths in the link, wherein the function determines the link cost according to the ratio of the number of wavelengths obtained by adding the number of wavelength path requests and the number of wavelengths in use to the total number of wavelengths in the link, and the link cost is set in a stepped manner according to the ratio of the number of wavelengths in use for each link to the total number of wavelengths in the link after receiving the number of wavelength path requests requested by the user. The pathfinding device according to claim 1 or 2.

4. The route search device according to claim 1 or 2, characterized in that the predetermined network usage information relating to user usage is a flag indicating whether or not the user considers latency important, or information indicating the user's priority, the input value of the function is the flag relating to latency, and if the flag is Yes, the function outputs a link cost of 1 and the shortest path found by Dijkstra's algorithm is the minimum hop path, and the input value of the function is information indicating the user's priority, and if the information indicating the user's priority is higher than a predetermined value, the function outputs the link cost of high-performance and high-quality links as lower than the link cost of low-performance and low-quality links compared to high-performance and high-quality links.

Images