Centralized network control system

Patent metadata

Field	Value
Publication number	US-9954766-B2
Application number	US-201314092100-A
Country	US
Kind code	B2
Filing date	Nov 27, 2013
Priority date	Jan 16, 2013
Publication date	Apr 24, 2018
Grant date	Apr 24, 2018

Abstract

A centralized network control device for controlling a plurality of network devices in a centralized manner includes a processor configured to determine a load state of path calculation based on a predetermined threshold value when a path setting request is received, and perform, when a heavy load state of the path calculation is determined, setting control for a temporary path by using a path based on a path tree obtained by past path calculation execution.

First claim

What is claimed is:

1. A centralized network control device for controlling a plurality of network devices in a centralized manner, comprising a memory storing executable instructions; and a processor connected to the memory and configured to execute the instructions, execution of the instructions causing the processor to:
determine a processor load of path calculation by the processor to calculate a path tree information based on a predetermined threshold value and the processor load of path calculation by the processor when a path setting request is received;
perform, when a heavy load state of the path calculation by the processor is determined, setting control for a temporary path by using a path based on a path tree obtained by past path calculation execution; and
perform, when the load state of the path calculation by the processor changes from the heavy load state to the light load state, the setting control for a change in the path from the temporarily set path to the path based on the shortest path tree obtained by the path calculation execution in response to the path setting request.

2. The centralized network control device according to claim 1 , wherein the processor is further configured to perform, when a light load state of the path calculation is determined, the setting control for the path based on a shortest path tree obtained by path calculation execution in response to the path setting request.

3. The centralized network control device according to claim 2 , wherein the path tree obtained by the past path calculation execution includes the shortest path tree and a shortest path tree candidate that are obtained by the path calculation execution in response to the path setting request and saved.

4. The centralized network control device according to claim 3 , wherein the processor is further configured to select, in the heavy load state of the path calculation, the path tree obtained by the past path calculation execution from among the shortest path tree and the shortest path tree candidate that are saved.

5. The centralized network control device according to claim 1 , wherein the processor is further configured to repeat the setting control for a change in the path while the load state of the path calculation keeps changing from the heavy load state to the light load state.

6. The centralized network control device according to claim 1 , wherein a Dijkstra's algorithm is used in the path calculation execution in order to calculate the shortest path tree having a single starting point in which a transmission source node given along with the path setting request is set as a root of the path tree.

7. The centralized network control device according to claim 1 , wherein the path setting request includes identification information on a transmission source node and identification information on a destination node.

8. The centralized network control device according to claim 1 , wherein the centralized network control device is an OpenFlow controller and in accordance with an OpenFlow protocol, distributes a flow table in which a forwarding rule for a packet is described to a plurality of OpenFlow switches serving as the plurality of network devices to control the plurality of OpenFlow switches in a centralized manner.

9. The centralized network control device according to claim 8 , wherein the flow table includes identification information on a transmission source node, identification information on a destination node, an input port number of each of the plurality of OpenFlow switches, and an output port number of each of the plurality of OpenFlow switches.

10. The centralized network control device according to claim 1 , wherein the path tree information is calculated based on one of a time period required to finish the path calculation, a queue length stored as the path setting request and a processor activity ratio by which the processor is used for the path calculation.

11. A centralized network control method executed by a processor for controlling a plurality of network devices in a centralized manner, comprising:
determining a processor load of path calculation by the processor to calculate a path tree information based on a predetermined threshold value and the processor load of path calculation by the processor when a path setting request is received;
performing, when a heavy load state of the path calculation by the processor is determined, setting control for a temporary path by using a path based on a path tree obtained by past path calculation execution; and
performing, when the load state of the path calculation by the processor changes from the heavy load state to the light load state, the setting control for a change in the path from the temporarily set path to the path based on the shortest path tree obtained by the path calculation execution in response to the path setting request.

12. The centralized network control method according to claim 11 , further comprising performing, when a light load state of the path calculation is determined, the setting control for the path based on a shortest path tree obtained by path calculation execution in response to the path setting request.

13. The centralized network control method according to claim 12 , wherein the path tree obtained by the past path calculation execution includes the shortest path tree and a shortest path tree candidate that are obtained by the path calculation execution in response to the path setting request and saved.

14. The centralized network control method according to claim 13 , further comprising selecting, in the heavy load state of the path calculation, the path tree obtained by the past path calculation execution from among the shortest path tree and the shortest path tree candidate that are saved.

15. A non-transitory readable medium recorded with a program that causes a processor for controlling a plurality of network devices in a centralized manner to execute processing comprising:
determining a processor load of path calculation by the processor to calculate a path tree information based on a predetermined threshold value and the processor load of path calculation by the processor when a path setting request is received;
performing, when a heavy load state of the path calculation by the processor is determined, setting control for a temporary path by using a path based on a path tree obtained by past path calculation execution; and
performing, when the load state of the path calculation by the processor changes from the heavy load state to the light load state, the setting control for a change in the path from the temporarily set path to the path based on the shortest path tree obtained by the path calculation execution in response to the path setting request.

16. The non-transitory readable medium according to claim 15 , further comprising performing, when a light load state of the path calculation is determined, the setting control for the path based on a shortest path tree obtained by path calculation execution in response to the path setting request.

17. The non-transitory readable medium according to claim 16 , wherein the path tree obtained by the past path calculation execution includes the shortest path tree and a shortest path tree candidate that are obtained by the path calculation execution in response to the path setting request and saved.

18. The non-transitory readable medium according to claim 17 , further comprising selecting, in the heavy load state of the path calculation, the path tree obtained by the past path calculation execution from

Assignees

• Fujitsu Ltd

Inventors

• Shimizu Sho

Classifications

• H04L45/302

  Route determination based on requested QoS · CPC title

• H04L45/122 Primary

  by minimising distances, e.g. by selecting a route with minimum of number of hops · CPC title

• H04L45/48

  Routing tree calculation · CPC title

• H04L47/127

  by using congestion prediction · CPC title