Network design apparatus, network design method, and storage medium storing network design program

A network design method comprising:

• based on network topology information indicating a connection relationship between a plurality of nodes in a network in which the plurality of nodes are connected to each other by a link and demand information indicating a demand including a starting point node, an ending point node, a route, and the number of the demands,
• calculating a total value of the number of the demands terminating at the respective nodes and the number of the demands passing through the respective nodes;
• calculating a degree of the node indicating the number of other nodes connected by the link;
• creating an order list in which the plurality of nodes are arranged in a manner that the node having a higher degree of the node is placed at a higher rank, the node having a higher total value is placed at the higher rank in a case where the nodes have a same degree of the node, and the node having no terminating demand is placed at a lower rank;
• sorting the nodes passing through between the starting point node and the ending point node except for the starting point node and the ending point node in accordance with the order list in the respective demands;
• taking out a certain number of nodes from the sorted nodes from the higher rank and generating combination candidates of transmission paths in which the starting point node, the ending point node, and the certain number of nodes are set as terminal points with regard to the respective demands;
• and
• determining a combination of the transmission paths that accommodate the demand from the combination candidates of the transmission paths.

A computer-readable recording medium having stored therein a network design program for causing a computer to execute a process based on network topology information indicating a connection relationship between a plurality of nodes in a network in which the plurality of nodes are connected to each other by a link and demand information indicating a demand including a starting point node, an ending point node, a route, and the number of the demands, the process comprising:

• calculating a total value of the number of the demands terminating at the respective nodes and the number of the demands passing through the respective nodes;
• calculating a degree of the node indicating the number of other nodes connected by the link;
• creating an order list in which the plurality of nodes are arranged in a manner that the node having a higher degree of the node is placed at a higher rank, the node having a higher total value is placed at the higher rank in a case where the nodes have a same degree of the node, and the node having no terminating demand is placed at a lower rank;
• sorting the nodes passing through between the starting point node and the ending point node except for the starting point node and the ending point node in accordance with the order list in the respective demands;
• taking out a certain number of nodes from the sorted nodes from the higher rank and generating combination candidates of transmission paths in which the starting point node, the ending point node, and the certain number of nodes are set as terminal points with regard to the respective demands;
• and
• determining a combination of the transmission paths that accommodate the demand from the combination candidates of the transmission paths.