| 摘要 |
<p>PROBLEM TO BE SOLVED: To implement traffic flow allocation with a little computational complexity so as to minimize scheduling cost of packet transfer between slices by promoting share of a packet transfer queue between the slices and sharing a link band with the share of the packet transfer queue within such a range that packet transfer quality in each slice of an SDN is not influenced.SOLUTION: A traffic flow route calculation section 30 includes a link cost setting part 30a and successively calculates such a traffic flow route as to minimize increase in a scheduling cost expectation of packet transfer between slices regarding all traffic flows. The link cost setting part 30a sets cost of each link to an increment of the inter-slice scheduling cost expectation on the assumption that a route calculation target traffic flow passes a cost setting target link. The successively calculated traffic flow route is outputted as a traffic flow allocation result that minimizes the scheduling cost of the packet transfer.</p> |
