|発明の名称||NETWORK DESIGN METHOD AND PROGRAM|
PROBLEM TO BE SOLVED: To allow such network design as the number of links to be installed is minimized under the condition which satisfies upper limit in constraint for a degree of node and a diameter of topology, relating to a NW design method in which communication can be continued by utilizing an alternate path even in the case of failure.
SOLUTION: Such entire area tree as meets with a degree (the number of links to be connected to node) constraint is constituted. Then, a graph in which a diameter is suppressed by adding a side to the entire area tree is outputted, and lastly, the side is added so as to suppress an increase rate in a path length. With this configuration, such network can be designed as to minimize the number of links to be installed under the condition in which the upper limit of constraint in the degree of node and the diameter of topology is met, if followings are taken as inputs: a position set capable of installing a link; an upper limit of constraint in the degree of node; an upper limit of constraint in the diameter of topology; and a constraint condition value of the maximum value in increase rate of path length in case of single link failure.
- 関西学院大学 研究推進社会連携機構
- URL: https://www.kwansei.ac.jp/kenkyu/
- Address: 〒669-1337 兵庫県三田市学園２丁目１番地
- TEL: 079-565-9052
- FAX: 079-565-7910