CN113504976B - Scheduling method, system, terminal equipment and storage medium for software-defined network architecture - Google Patents
Scheduling method, system, terminal equipment and storage medium for software-defined network architecture Download PDFInfo
- Publication number
- CN113504976B CN113504976B CN202110649104.5A CN202110649104A CN113504976B CN 113504976 B CN113504976 B CN 113504976B CN 202110649104 A CN202110649104 A CN 202110649104A CN 113504976 B CN113504976 B CN 113504976B
- Authority
- CN
- China
- Prior art keywords
- controller
- controllers
- alternative
- switch
- migrated
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure provides a software defined network architecture scheduling method, system, terminal device and computer readable storage medium, the method comprising: selecting a controller neighbor set related to switch migration for each controller in a network, wherein the controller neighbor set comprises a plurality of first alternative controllers; detecting whether overload condition occurs to each controller in the network or not at preset time intervals; if an overload condition of a certain controller is detected, selecting a switch to be migrated from all switches connected with the controller, and selecting a target controller of the switch to be migrated from a controller neighbor set of the controller. The embodiment of the disclosure adopts a local scheduling mode, and the overload condition of each controller in the network is detected, and the controllers generating the overload condition are locally scheduled, so that the load balance of the whole network is realized, the calculated amount and the calculated frequency are reduced, and the degradation of the network performance is avoided.
Description
Technical Field
The present disclosure relates to the field of software-defined networking, and more particularly, to a software-defined network architecture scheduling method, a software-defined network architecture scheduling system, a terminal device, and a computer-readable storage medium.
Background
SDN (Software Defined Network, software defined networking) is an emerging network architecture that separates network control functions from forwarding functions, implementing control programmability, that will be transferred from a network device to an external computing device from a control layer, such that the underlying infrastructure is transparent, abstract to applications and network services, and the network can be considered a logical or virtual entity. In practical application, as the scale of an SDN network is larger and larger, the calculation amount and calculation frequency of the existing load balancing algorithm based on the whole SDN architecture are gradually increased, and meanwhile, a large amount of global scheduling occurs, which is easy to cause the performance of the whole network to be reduced.
Disclosure of Invention
The present disclosure provides a software defined network architecture scheduling method, system, terminal device and computer readable storage medium, which perform local scheduling on an overloaded controller to implement load balancing of an SDN architecture, and avoid degradation of network performance at the same time, so as to at least solve the above technical problems.
According to an aspect of the embodiments of the present disclosure, there is provided a software defined network architecture scheduling method, including:
setting a controller neighbor set related to switch migration for each controller in a network, wherein the controller neighbor set comprises a plurality of first alternative controllers;
detecting whether overload condition occurs to each controller in the network or not at preset time intervals;
if an overload condition of a certain controller is detected, selecting a switch to be migrated from all switches connected with the controller, and selecting a target controller of the switch to be migrated from the plurality of first alternative controllers in a controller neighbor set of the controller, so that the controller migrates the switch to be migrated to the target controller.
In one embodiment, the detecting whether each controller in the network has an overload condition at each preset time interval includes:
and detecting whether the sum of the ratios of network request flows of all switches connected with each controller in the network and the link bearing capacity of the switches is larger than a first preset threshold value or not respectively at preset time intervals, and if so, judging that the controllers are overloaded.
In one embodiment, after detecting that an overload condition occurs in a certain controller and before selecting a switch to be migrated from all switches connected to the controller, the method further includes:
establishing a temporary scheduling group of the controller;
selecting all first alternative controllers which are not added to the temporary scheduling group of other controllers from the controller neighbor set of the controller as second alternative controllers;
calculating the sum of the ratio of the network request flow of all the switches connected with all the second alternative controllers to the link bearing capacity of the switches respectively;
selecting all second alternative controllers with the sum of the ratios larger than a second preset threshold value from all second alternative controllers as a third alternative controller; and adding all third alternative controllers into a temporary scheduling group of the controllers;
the selecting the target controller of the switch to be migrated from the controller neighbor set of the controller includes:
and selecting the target controller of the switch to be migrated from the temporary scheduling group of the controllers.
In one embodiment, the selecting a switch to be migrated from all switches connected to the controller, and selecting a target controller of the switch to be migrated from the several first alternative controllers in the controller neighbor set of the controller, includes:
calculating the profit functions between all the exchanges connected with the controller and the first alternative controllers respectively; the method comprises the steps of,
and selecting a switch to be migrated from all switches connected with the controller based on a benefit function between all switches connected with the controller and the first alternative controllers respectively, and selecting a target controller of the switch to be migrated from the first alternative controllers.
In one embodiment, the calculating the benefit function between each of all switches connected to the controller and the first plurality of alternative controllers includes:
after all switches connected with the controller are calculated to be respectively migrated to the plurality of first alternative controllers, the load condition of the controller and the load condition of each of the plurality of first alternative controllers are calculated; the method comprises the steps of,
and respectively calculating the profit functions between all the switches connected with the controller and the first alternative controllers based on the load conditions of the controllers and the load conditions of the first alternative controllers.
6. The method of claim 5, wherein the calculating the benefit function between each of all switches connected to the controller and the first plurality of alternative controllers is performed according to the following formula:
S jk ＝α*L a +β*L k +γ*D jk
wherein S is jk Representing a benefit function, L, between a j-th exchange connected to the controller a and a k-th first alternative controller a Representing the load condition of the controller a after the jth switch is migrated to the kth first alternative controller, L k Representing the load condition of the kth first alternative controller after the jth switch is migrated to the kth first alternative controller, D jk Representing the delay of the j-th switch migrating to the k-th first alternative controller, α, β, γ is the adjustment factor, and α+β+γ=1.
According to another aspect of the disclosed embodiments, there is provided a software defined network architecture scheduling system, comprising:
the selection module is configured to set a controller neighbor set related to switch migration for each controller in the network, wherein the controller neighbor set comprises a plurality of first alternative controllers;
the detection module is used for respectively detecting whether overload conditions occur to each controller in the network or not at preset time intervals;
the migration scheduling module is configured to select a switch to be migrated from all switches connected with the controller when the detection module detects that an overload condition occurs on a certain controller, and select a target controller of the switch to be migrated from the plurality of first alternative controllers in the controller neighbor set of the controller, so that the network controller migrates the switch to be migrated to the target controller.
In one embodiment, the detection module is specifically configured to detect, at intervals of a preset period of time, whether a sum of ratios of network request flows of all switches connected to each controller in the network to link load capacities of the switches is greater than a first preset threshold, and if yes, determine that an overload condition occurs in the controller.
According to yet another aspect of the embodiments of the present disclosure, there is provided a terminal device including a memory and a processor, wherein the memory stores a computer program, and the processor executes the software-defined network architecture scheduling method when the processor runs the computer program stored in the memory.
According to yet another aspect of the disclosed embodiments, a computer-readable storage medium is provided, on which a computer program is stored, which when executed by a processor, performs the software defined network architecture scheduling method.
The technical scheme provided by the embodiment of the disclosure can comprise the following beneficial effects:
embodiments of the present disclosure provide
Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be apparent from the description, or may be learned by practice of the disclosure. The objectives and other advantages of the disclosure will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the disclosed embodiments and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain, without limitation, the disclosed embodiments.
Fig. 1 is a flow chart of a software defined network architecture scheduling method according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a software defined network architecture;
FIG. 3 is a flowchart illustrating another method for scheduling a software-defined network architecture according to an embodiment of the present disclosure;
FIG. 4 is a flowchart of another method for scheduling a software defined network architecture according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a software defined network architecture scheduling system according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of a terminal device according to an embodiment of the present disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the following detailed description of the specific embodiments of the present disclosure will be given with reference to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating and illustrating the disclosure, are not intended to limit the disclosure.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and the above-described figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order; moreover, embodiments of the present disclosure and features of embodiments may be arbitrarily combined with each other without conflict.
Wherein the terminology used in the embodiments of the disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used in this disclosure and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
In the following description, suffixes such as "module", "component", or "unit" for representing elements are used only for facilitating the description of the present disclosure, and are not of specific significance per se. Thus, "module," "component," or "unit" may be used in combination.
In order to solve the above technical problems, please refer to fig. 1, fig. 1 is a flowchart of a software defined network architecture scheduling method according to an embodiment of the present disclosure, and the method includes steps S101-S103.
In step S101, a controller neighbor set related to switch migration is set for each controller in the network, where the controller neighbor set includes a number of first candidate controllers.
In an SDN network, a controller is usually connected to a plurality of switches, where a switch is a device that performs an information exchange function in a communication system, when the controller processes too much exchange data, an overload situation tends to occur, and in this embodiment, load balancing of the controller in the network is implemented by using a migration switch, specifically, by selecting, in advance, a neighbor set of the controller for migrating the connected switch for the controller in the network, where in an embodiment, a screening condition may be that at least one switch for a switch managed by another controller of the controller a is directly connected to a switch managed by the controller a, and then the controller is a neighbor of the controller a.
It can be understood that the SDN architecture adopts a centralized control plane and a distributed forwarding plane, where the two planes are separated from each other, and the control plane uses a control-forwarding communication interface to perform centralized control on network devices on the forwarding plane, and provides flexible programmable capability, and the network architecture with the above characteristics can be considered as a generalized SDN. In the SDN architecture, the control plane performs centralized control on the network device through the control-forwarding communication interface, where the traffic of the control signaling occurs between the controller and the network device, independent of the data traffic generated by the inter-terminal communication, and the network device generates the forwarding table by receiving the control signaling and determines the processing of the data traffic according to the forwarding table, so that the complex distributed network protocol is not required to perform data forwarding, as shown in fig. 2.
In step S102, detecting whether each controller in the network has an overload condition at intervals of a preset time period, if detecting that a certain controller has an overload condition, executing step S103, otherwise ending the flow, continuing the operation of the SDN according to the current architecture, waiting for the next preset time period to detect the overload condition of each controller,
the overload condition is that the load condition of the controller exceeds the maximum load that the controller can bear, wherein the load condition is that the ratio of the network requests of all the connected switches of the controller to the maximum load capacity of the links.
In one embodiment, in step S102, it is specifically detected whether the ratio of the network request traffic of all switches connected to each controller in the network to the link load capacity of the switches is greater than a first preset threshold value at preset time intervals, if yes, it is determined that an overload condition occurs in the controller.
It should be noted that, all switches connected to each controller refer to all switches directly connected to the controller, and those skilled in the art combine the prior art and the actual application to set a first preset threshold value and a subsequent second preset threshold value, where the values of the first preset threshold value and the second preset threshold value may be the same or different.
Specifically, the sum of the ratios of network request flows of all switches connected with each controller in the network to the link bearing capacity is detected respectively, and the sum is obtained according to the following formula:
wherein L is a Representing the load condition of the controller a, G represents the set of all switches directly connected to the controller a, f ia F for the network traffic size from the ith switch to the controller a ia Is the maximum bearer capability of the i-th switch to controller a link.
In this embodiment, when an overload condition L occurs in a certain controller a a When the number is more than X% (X is set according to the actual requirement of the service on the network performance, and can be initially set to 80), a certain or some switches connected with the controller a need to be migrated to other management domains, and the controller can be instructed to initiate a scheduling request to the controllers in the neighbor set.
In step S103, a switch to be migrated is selected from all switches connected to the controller, and a target controller of the switch to be migrated is selected from the several first alternative controllers in the controller neighbor set of the controller, so that the controller migrates the switch to be migrated to the target controller.
In this embodiment, the switch to be migrated and the target controller may be selected according to the load condition of the current controller and the load condition of each controller in the neighbor set, for example, the switch with the largest network request flow is selected to migrate to the controller with the smallest load condition. In some embodiments, in order to achieve optimization of load balancing in the network, the switches to be migrated and the target migrated controller are selected by calculating the benefit function after each switch of the controller is migrated, and specific processes are described in detail in the embodiments described later, and are not described herein.
In the prior art, the load balancing mode of the SDN network is mainly realized by uniformly scheduling according to the load condition of each controller in the whole SDN network range, and the management control relation between each controller and the switch is regulated again periodically, but the calculation amount and calculation frequency of the original load balancing algorithm based on the whole SDN architecture are gradually increased by the uniform scheduling mode, so that the performance of the whole network is easily reduced.
Compared with the prior art, the method and the device have the advantages that the local scheduling mode is adopted, the overload condition of the controllers in the network is detected, and the controllers generating the overload condition are subjected to local scheduling, so that the load balance of the whole network is realized, the calculated amount and the calculated frequency are reduced, and the reduction of the network performance is avoided.
Referring to fig. 3, fig. 3 is a schematic diagram of another software-defined network architecture scheduling method according to an embodiment of the present disclosure, where, based on the previous embodiment, steps S301 to S304 are further included by establishing a temporary scheduling group and performing preliminary screening on alternative controllers in a neighbor set of a controller to improve migration efficiency of the switch, while ensuring that a target controller has enough resources, specifically, after detecting whether an overload condition occurs in each controller in the network (step S102) at each preset time period, and before selecting a switch to be migrated from all switches connected to the controller (step S103), step S103 is further divided into step S103a.
In step 301, if an overload condition of a certain controller is detected, a temporary scheduling group of the controller is established.
In this embodiment, the temporary scheduling group is established when the overload condition occurs in the controller, and the temporary scheduling group of the controller can be released when the controller returns to normal, i.e., is not in the overload condition.
In step S302, selecting, from a set of controller neighbors of the controller, all first alternative controllers that are not currently joined to the temporary scheduling group of the other controllers as second alternative controllers;
in step S303, calculating the sum of the ratios of the network request flows of all switches connected to each of the second alternative controllers and the link carrying capacity thereof;
in step S304, selecting all second alternative controllers with the sum of the ratios greater than a second preset threshold value from all second alternative controllers as third alternative controllers; and adding all third alternative controllers into the temporary scheduling group of the controllers.
Specifically, in this embodiment, the load condition of each controller in the neighbor set of the controller a and whether it is in other temporary scheduling groups are counted sequentially, if the controller j satisfies the condition L j < y% (y is also set according to the actual demand of the service for network performance, but must meet the condition of y < x, initially settable to 60) and not in other schedule groups, then controller j will join the temporary schedule group of controller a.
In some embodiments, if all neighbor controllers do not meet the condition, the scope is expanded, the candidate controller is screened from the neighbor set of neighbor controllers, and so on, until more than or equal to one candidate controller appears.
The selecting a switch to be migrated from all switches connected with the controller, and selecting a target controller of the switch to be migrated from the first alternative controllers in the controller neighbor set of the controller (step S103), specifically:
step S103a, selecting a switch to be migrated from all switches connected to the controller, and selecting a target controller of the switch to be migrated from a temporary scheduling group of the controller.
Referring to fig. 4, fig. 4 is a flow chart of another software-defined network architecture scheduling method according to an embodiment of the present disclosure, where, based on the foregoing embodiment of the software-defined network architecture scheduling method, the embodiment selects a switch to be migrated and a migrated target controller by calculating a benefit function after each switch of the controller is migrated, so as to implement load balancing optimization, and specifically, step S103 is further divided into step S103b and step S103c.
In step S103b, a benefit function between each of all switches connected to the controller and the first plurality of alternative controllers is calculated.
Specifically, the calculating the benefit function between each of all switches connected with the controller and the first alternative controllers respectively includes the following steps:
after all switches connected with the controller are calculated to be respectively migrated to the plurality of first alternative controllers, the load condition of the controller and the load condition of each of the plurality of first alternative controllers are calculated; the method comprises the steps of,
and respectively calculating the profit functions between all the switches connected with the controller and the first alternative controllers based on the load conditions of the controllers and the load conditions of the first alternative controllers.
It will be appreciated that in this embodiment, the overload condition and the load condition are different concepts, where the load condition indicates a specific load of the controller, and the overload condition indicates that the overload of the load of the controller needs to be scheduled.
In step S103c, a switch to be migrated is selected from all switches connected to the controller based on the benefit function between each of all switches connected to the controller and the plurality of first alternative controllers, and a target controller of the switch to be migrated is selected from the plurality of first alternative controllers.
Further, the profit functions between each of all switches connected with the controller and the first alternative controllers are calculated respectively, and the profit functions are obtained according to the following formula:
S jk ＝α*L a +β*L k +γ*D jk
wherein S is jk Representing a benefit function, L, between a j-th exchange and a k-th first alternative control to which the controller a is connected a Representing the load condition of the controller a after the jth switch is migrated to the kth first alternative controller, L k Representing the load condition of a kth controller after the jth switch is migrated to the kth first alternative controller, D jk The delay of the j-th switch to migrate to the k-th controller is indicated, α, β, γ are adjustment factors, and α+β+γ=1.
Wherein, the smaller the benefit function is, the more balanced the load of the controller a and the target controller is after the switch is migrated to the target controller, the benefit function S is obtained by calculation jk The minimum scheme selects the corresponding migration switch and the target controller to realize the network load balancing optimization.
In summary, according to the SDN architecture scheduling method based on local optimization provided by the embodiment of the present disclosure, first, a corresponding neighbor set is established for each controller, and when an overload condition occurs in a certain controller, a scheduling request is initiated; all neighbor controllers meeting the conditions commonly establish a temporary scheduling group; selecting a switch to be migrated and a migrated target controller by calculating the profit function of each controller; and then starting the switch migration, and updating corresponding parameters after the migration is finished, so that the scheduling process can be controlled in a local range where the overload controller is close to, and the scheduling frequency and the required calculated amount are reduced.
Based on the same technical concept, the embodiments of the present disclosure correspondingly further provide a software defined network architecture scheduling system, as illustrated in fig. 5, where the system includes a selection module 51, a detection module 52, and a migration scheduling module 53, where,
the selection module 51 is configured to set a controller neighbor set related to switch migration for each controller in the network, where the controller neighbor set includes a number of first alternative controllers;
the detecting module 52 is configured to detect whether an overload condition occurs in each controller in the network at preset time intervals;
the migration scheduling module 53 is configured to select a switch to be migrated from all switches connected to the controller when the detection module detects that an overload condition occurs in a certain controller, and select a target controller of the switch to be migrated from the plurality of first alternative controllers in the controller neighbor set of the controller, so that the network controller migrates the switch to be migrated to the target controller.
In one embodiment, the detecting module 52 is specifically configured to detect, at intervals of a preset period of time, whether the sum of the ratios of the network request flows of all switches connected to each controller in the network to the link load amounts of the switches is greater than a first preset threshold, and if so, determine that an overload condition occurs in the controller.
In one embodiment, the system further comprises:
the establishing module is used for establishing a temporary scheduling group of a certain controller when the overload condition of the certain controller is detected after the overload condition is detected by the detecting module and before the switch to be migrated and the target controller are selected by the scheduling migration module;
the selection module is further configured to select, from the controlled set of controller neighbors, all first alternative controllers that are not currently joined to the temporary scheduling group of other controllers as second alternative controllers;
a calculation module, configured to calculate the sum of the ratios of the network request flows of all switches connected to each of the second alternative controllers and the link bearing capacity thereof;
the selection module is further configured to select, as a third alternative controller, all second alternative controllers with a ratio greater than a second preset threshold value from all the second alternative controllers; and adding all third alternative controllers into a temporary scheduling group of the controllers;
the selecting module is specifically configured to select a target controller of the switch to be migrated from the temporary scheduling group of the controllers.
In one embodiment, the scheduling module migration 53 includes:
a calculation unit configured to calculate a benefit function between each of all switches connected to the controller and the plurality of first alternative controllers, respectively; the method comprises the steps of,
the selection unit is configured to select a switch to be migrated from all switches connected to the controller based on a benefit function between each of all switches connected to the controller and the plurality of first alternative controllers, and select a target controller of the switch to be migrated from the plurality of first alternative controllers.
In one embodiment, the calculating unit is specifically configured to calculate, after all switches connected to the controller are migrated to the plurality of first alternative controllers, a load condition of the controller and a load condition of each of the plurality of first alternative controllers respectively; and calculating a profit function between each of all switches connected with the controller and the plurality of first alternative controllers based on the load condition of the controller and the load condition of each of the plurality of first alternative controllers.
In one embodiment, the calculation unit is derived according to the following formula:
S jk ＝α*L a +β*L k +γ*D jk
wherein S is jk Representing a benefit function, L, between a j-th exchange and a k-th first alternative control to which the controller a is connected a Representing the load condition of the controller a after the jth switch is migrated to the kth first alternative controller, L k Representing the load condition of a kth controller after the jth switch is migrated to the kth first alternative controller, D jk The delay of the j-th switch to migrate to the k-th controller is indicated, α, β, γ are adjustment factors, and α+β+γ=1.
Based on the same technical concept, the embodiment of the present disclosure correspondingly provides a terminal device, as shown in fig. 6, where the terminal device includes a memory 61 and a processor 62, where the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the software defined network architecture scheduling method.
Based on the same technical concept, the embodiments of the present disclosure correspondingly further provide a computer readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, performs the software defined network architecture scheduling method.
Those of ordinary skill in the art will appreciate that all or some of the steps, systems, functional modules/units in the apparatus, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed cooperatively by several physical components. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present disclosure, and not for limiting the same; although the present disclosure has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present disclosure.
Claims (9)
1. A method for scheduling a software defined network architecture, comprising:
setting a controller neighbor set related to switch migration for each controller in a network, wherein the controller neighbor set comprises a plurality of first alternative controllers;
detecting whether overload condition occurs to each controller in the network or not at preset time intervals;
if an overload condition of a certain controller is detected, selecting a switch to be migrated from all switches connected with the controller, and selecting a target controller of the switch to be migrated from the plurality of first alternative controllers in a controller neighbor set of the controller, so that the controller migrates the switch to be migrated to the target controller;
after detecting that an overload condition occurs in a certain controller and before selecting a switch to be migrated from all switches connected with the controller, the method further comprises the following steps:
establishing a temporary scheduling group of the controller;
selecting all first alternative controllers which are not added to the temporary scheduling group of other controllers from the controller neighbor set of the controller as second alternative controllers;
calculating the sum of the ratio of the network request flow of all the switches connected with all the second alternative controllers to the link bearing capacity of the switches respectively;
selecting all second alternative controllers with the sum of the ratios larger than a second preset threshold value from all second alternative controllers as a third alternative controller; and adding all third alternative controllers into a temporary scheduling group of the controllers;
the selecting the target controller of the switch to be migrated from the controller neighbor set of the controller includes:
and selecting the target controller of the switch to be migrated from the temporary scheduling group of the controllers.
2. The method according to claim 1, wherein detecting whether each controller in the network is overloaded at each preset time interval, respectively, comprises:
and detecting whether the sum of the ratios of network request flows of all switches connected with each controller in the network and the link bearing capacity of the switches is larger than a first preset threshold value or not respectively at preset time intervals, and if so, judging that the controllers are overloaded.
3. The method according to claim 1, wherein selecting a switch to be migrated from all switches connected to the controller, and selecting a target controller of the switch to be migrated from the plurality of first candidate controllers in a controller neighbor set of the controller, comprises:
calculating the profit functions between all the exchanges connected with the controller and the first alternative controllers respectively; the method comprises the steps of,
and selecting a switch to be migrated from all switches connected with the controller based on a benefit function between all switches connected with the controller and the first alternative controllers respectively, and selecting a target controller of the switch to be migrated from the first alternative controllers.
4. A method according to claim 3, wherein said separately calculating a benefit function between each of all switches connected to said controller and said first plurality of alternative controllers comprises:
after all switches connected with the controller are calculated to be respectively migrated to the plurality of first alternative controllers, the load condition of the controller and the load condition of each of the plurality of first alternative controllers are calculated; the method comprises the steps of,
and respectively calculating the profit functions between all the switches connected with the controller and the first alternative controllers based on the load conditions of the controllers and the load conditions of the first alternative controllers.
5. The method of claim 4, wherein the calculating the profit function between each of all switches connected to the controller and the first plurality of alternative controllers is performed according to the following formula:
S jk ＝α*L a +β*L k +γ*D jk
wherein S is jk Representing a benefit function, L, between a j-th exchange connected to the controller a and a k-th first alternative controller a Representing the load condition of the controller a after the jth switch is migrated to the kth first alternative controller, L k Representing the load condition of the kth first alternative controller after the jth switch is migrated to the kth first alternative controller, D jk Representing the delay of the j-th switch migrating to the k-th first alternative controller, α, β, γ is the adjustment factor, and α+β+γ=1.
6. A software defined networking architecture scheduling system, comprising:
the selection module is configured to set a controller neighbor set related to switch migration for each controller in the network, wherein the controller neighbor set comprises a plurality of first alternative controllers;
the detection module is used for respectively detecting whether overload conditions occur to each controller in the network or not at preset time intervals;
the migration scheduling module is configured to select a switch to be migrated from all switches connected with a controller when the detection module detects that an overload condition occurs on a certain controller, and select a target controller of the switch to be migrated from the plurality of first alternative controllers of a controller neighbor set of the controller, so that the controller migrates the switch to be migrated to the target controller;
the establishing module is used for establishing a temporary scheduling group of a certain controller when the overload condition of the certain controller is detected after the overload condition is detected by the detecting module and before the switch to be migrated and the target controller are selected by the migration scheduling module;
the selection module is further configured to select, from a set of controller neighbors of the controller, all first alternative controllers that are not currently joined to the temporary scheduling group of the other controllers as second alternative controllers;
a calculation module, configured to calculate the sum of the ratios of the network request flows of all switches connected to each of the second alternative controllers and the link bearing capacity thereof;
the selection module is further configured to select, as a third alternative controller, all second alternative controllers with a ratio greater than a second preset threshold value from all the second alternative controllers; and adding all third alternative controllers into a temporary scheduling group of the controllers;
the selecting module is specifically configured to select a target controller of the switch to be migrated from the temporary scheduling group of the controllers.
7. The system of claim 6, wherein the detection module is specifically configured to detect, at intervals of a preset period of time, whether a sum of ratios of network request flows of all switches connected to each controller in the network to link capacities thereof is greater than a first preset threshold, and if yes, determine that an overload condition occurs in the controller.
8. A terminal device comprising a memory and a processor, the memory having a computer program stored therein, the processor executing the software defined network architecture scheduling method of any one of claims 1 to 5 when the processor runs the computer program stored in the memory.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, performs the software defined network architecture scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110649104.5A CN113504976B (en) | 2021-06-10 | 2021-06-10 | Scheduling method, system, terminal equipment and storage medium for software-defined network architecture |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110649104.5A CN113504976B (en) | 2021-06-10 | 2021-06-10 | Scheduling method, system, terminal equipment and storage medium for software-defined network architecture |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113504976A CN113504976A (en) | 2021-10-15 |
| CN113504976B true CN113504976B (en) | 2023-05-23 |
Family
ID=78009867
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110649104.5A Active CN113504976B (en) | 2021-06-10 | 2021-06-10 | Scheduling method, system, terminal equipment and storage medium for software-defined network architecture |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113504976B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103259740A (en) * | 2013-04-27 | 2013-08-21 | 杭州华三通信技术有限公司 | Load balancing processing method and device |
| CN104539551A (en) * | 2014-12-22 | 2015-04-22 | 清华大学 | Virtual service migration method for routing and switching platform |
| US9537953B1 (en) * | 2016-06-13 | 2017-01-03 | 1Qb Information Technologies Inc. | Methods and systems for quantum ready computations on the cloud |
| CN108156014A (en) * | 2016-12-06 | 2018-06-12 | 华为技术有限公司 | A kind of loop fault processing method and interchanger |
| CN108880918A (en) * | 2018-08-24 | 2018-11-23 | 北京邮电大学 | A kind of SDN multi-controller load-balancing method and system |
| CN110784366A (en) * | 2019-11-11 | 2020-02-11 | 重庆邮电大学 | Switch migration method based on IMMAC algorithm in SDN |
| CN111787060A (en) * | 2020-05-28 | 2020-10-16 | 网宿科技股份有限公司 | Traffic scheduling method, system and device |
| CN112637286A (en) * | 2020-12-10 | 2021-04-09 | 中国联合网络通信集团有限公司 | Network architecture adjusting method, device, system and computer readable storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10203993B2 (en) * | 2009-02-18 | 2019-02-12 | International Business Machines Corporation | Method and system for continuous optimization of data centers by combining server and storage virtualization |
-
2021
- 2021-06-10 CN CN202110649104.5A patent/CN113504976B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103259740A (en) * | 2013-04-27 | 2013-08-21 | 杭州华三通信技术有限公司 | Load balancing processing method and device |
| CN104539551A (en) * | 2014-12-22 | 2015-04-22 | 清华大学 | Virtual service migration method for routing and switching platform |
| US9537953B1 (en) * | 2016-06-13 | 2017-01-03 | 1Qb Information Technologies Inc. | Methods and systems for quantum ready computations on the cloud |
| CN108156014A (en) * | 2016-12-06 | 2018-06-12 | 华为技术有限公司 | A kind of loop fault processing method and interchanger |
| CN108880918A (en) * | 2018-08-24 | 2018-11-23 | 北京邮电大学 | A kind of SDN multi-controller load-balancing method and system |
| CN110784366A (en) * | 2019-11-11 | 2020-02-11 | 重庆邮电大学 | Switch migration method based on IMMAC algorithm in SDN |
| CN111787060A (en) * | 2020-05-28 | 2020-10-16 | 网宿科技股份有限公司 | Traffic scheduling method, system and device |
| CN112637286A (en) * | 2020-12-10 | 2021-04-09 | 中国联合网络通信集团有限公司 | Network architecture adjusting method, device, system and computer readable storage medium |
Non-Patent Citations (2)
| Title |
|---|
| "Customizable network update planning in SDN";Shouxi Luo;《Journal of Network and Computer Applications》;第141卷;第104-115页 * |
| "软件定义网络中基于效率区间的负载均衡在线优化算法";史久根;《电子与信息学报》;第41卷(第03期);第694-701页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113504976A (en) | 2021-10-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11758415B2 (en) | Method and apparatus of sharing information related to status | |
| CN107204894B (en) | Method and device for monitoring network service quality | |
| CN108965014B (en) | QoS-aware service chain backup method and system | |
| CN110891093A (en) | Method and system for selecting edge computing node in delay sensitive network | |
| WO2023024219A1 (en) | Joint optimization method and system for delay and spectrum occupancy in cloud-edge collaborative network | |
| CN102427585B (en) | Interconnection method for base station and access network system | |
| CN110519783B (en) | 5G network slice resource allocation method based on reinforcement learning | |
| US10404616B2 (en) | Virtual resource automatic selection system and method | |
| EP3675420B1 (en) | Distributed storage system upgrade management method and device, and distributed storage system | |
| WO2012000760A1 (en) | Cellular telecommunication system network element, corresponding method and computer -readable storage medium | |
| WO2020042612A1 (en) | Method and device for storing and reading a message, server, and storage medium | |
| WO2020134133A1 (en) | Resource allocation method, substation, and computer-readable storage medium | |
| CN111694517B (en) | Distributed data migration method, system and electronic equipment | |
| EP3644646A1 (en) | Load-balancing method and apparatus | |
| CN114531448B (en) | Calculation force determining method and device and calculation force sharing system | |
| CN114691372A (en) | Group intelligent control method of multimedia end edge cloud system | |
| CN106936926A (en) | Access the method and system of back end | |
| CN113504976B (en) | Scheduling method, system, terminal equipment and storage medium for software-defined network architecture | |
| US10986036B1 (en) | Method and apparatus for orchestrating resources in multi-access edge computing (MEC) network | |
| CN114500544B (en) | Method, system, equipment and medium for balancing load among nodes | |
| CN114466059B (en) | Method for providing reliable service function chain for mobile edge computing system | |
| CN110719183B (en) | Real-time software defined industrial network transmission priority dynamic adjustment method and system | |
| CN114553964A (en) | Control method, device and equipment of simulcast system and simulcast system | |
| CN111901425A (en) | CDN scheduling method and device based on Pareto algorithm, computer equipment and storage medium | |
| CN112260869B (en) | Service degradation method, system, terminal device and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |