| 摘要 |
<p>PROBLEM TO BE SOLVED: To minimize the cost of a virtual link, in the arrangement of a virtual network having a Cycle structure.SOLUTION: A virtual node list is read, a virtual network is made to low order and high order induction subgraphs, and then an induction subgraph H consisting of a plurality of virtual nodes, and an induction subgraph K including the induction subgraph are arranged and calculated by an existing method. When determining a set Y giving the minimum cost, out of the arrangement to the physical node of induction subgraph where the induction subgraph H is removed from the induction subgraph K, a set Z of arrangement to physical node of the induction subgraph H replaces the induction subgraph K to induction subgraph H.</p> |
