CN111181792A - SDN controller deployment method and device based on network topology and electronic equipment - Google Patents
SDN controller deployment method and device based on network topology and electronic equipment Download PDFInfo
- Publication number
- CN111181792A CN111181792A CN201911420654.9A CN201911420654A CN111181792A CN 111181792 A CN111181792 A CN 111181792A CN 201911420654 A CN201911420654 A CN 201911420654A CN 111181792 A CN111181792 A CN 111181792A
- Authority
- CN
- China
- Prior art keywords
- subgraph
- link
- undirected graph
- subgraphs
- weighted undirected
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
The embodiment of the invention relates to the technical field of networks, and discloses a method and a device for deploying an SDN controller based on network topology and electronic equipment. The SDN network topology is modeled to be a weighted undirected graph, the weight of each edge in the weighted undirected graph is the link weight of a corresponding link, and the higher the link weight is, the worse the data transmission capability of the corresponding link is; dividing the weighted undirected graph into a plurality of subgraphs according to a minimum cutting edge principle; and determining each subgraph as a control domain, wherein the central position of each subgraph is the deployment position of the controller, and the shortest distance and the smallest sum of the elements in the central position to other elements in the subgraph are determined. The method and the device can be suitable for multi-controller position deployment algorithms with various network scales, and the problem of controller position deployment is solved systematically.
Description
Technical Field
The embodiment of the invention relates to the technical field of networks, in particular to a method and a device for deploying an SDN controller based on network topology and electronic equipment.
Background
Software-Defined Networking (SDN) originated from the Ethane project developed by the Clean Slate project group of stanford university, usa. The SDN realizes the logic centralized control of the network data forwarding device by separating the control plane and the data plane. The distributed SDN network is composed of a plurality of controllers and data forwarding devices (such as openflow switches), the controllers respectively manage the data forwarding devices in respective control domains, forwarding strategies of bottom layer data forwarding devices are formulated and issued by upper layer controllers, deployment positions of the controllers and topological association relations between the switches and the controllers directly affect the performance of the whole SDN network, and how to reasonably and effectively deploy the controllers becomes one of current important research contents of the SDN.
Regarding the SDN controller deployment method, currently, the controller deployment location is mainly determined by targeting communication costs such as link delay, link bandwidth, link load and the like between the SDN controller and the data forwarding device. In related patents, a SDN network multi-controller deployment method that guarantees minimal latency is disclosed. The method comprises the steps of firstly analyzing network time delay and a topological structure, calculating the time delay from each switch to the rest of all switches, then randomly selecting one switch as an initial controller deployment point, updating the deployment position to a new switch according to a K-medoids algorithm, and ensuring the time delay to the rest of all switches to be minimum; selecting the switch with the maximum time delay from the controller deployment point in the whole network as another new controller deployment point, redistributing the switches in the whole network according to the time delay, and then updating each controller deployment point through a K-medoids algorithm; the above process is repeated until there are K controller deployment points.
In the related technology, a time delay and structure of a network topology are analyzed, time delay between every two switches and the degree of every node in the network are calculated, the number of the switches which can be deployed by every controller is determined, then a node which meets the conditions is selected as a deployment position of the controller according to a custom algorithm, all the switches in a management area are determined, and the minimum average time delay size and the minimum time delay size under the worst condition are obtained according to the minimum average time delay model and the minimum time delay model under the worst condition; calculating the residual nodes meeting the conditions by the same method to be used as the deployment position of another controller to obtain the minimum average time delay and the minimum time delay under the worst condition; the above process is repeated until the controller position is deployed.
However, the inventors of the present application have found that the following disadvantages exist in the above two schemes, respectively.
The first disadvantage of the scheme is that:
only the time delay between the switch and the controller is considered as network performance optimization, and the optimization target is single; the K-medoids algorithm used in the scheme has high complexity and is only suitable for a small-scale network, and the small-scale network is a low-delay network (compared with a medium-scale network and a large-scale network under the same condition); in the K-medoids algorithm used in the scheme, the number of controllers (K values mentioned in the algorithm) must be given in advance, and the algorithm is only applicable to a spherical network and is poor in applicability.
The second scheme has the following defects:
similar to the defect of the first scheme, the second scheme only considers the time delay between the switch and the controller as the network performance optimization, and the optimization target is single. The scheme is based on a greedy algorithm, and selects controller positions based on the degrees of the nodes as quality criteria. The greedy algorithm needs to traverse all possible combinations of solution spaces, and has low algorithm efficiency, high time complexity and inapplicability to medium-scale and large-scale networks.
Disclosure of Invention
The embodiment of the invention aims to provide a network topology-based SDN controller deployment scheme which can be suitable for multi-controller position deployment algorithms of various network scales and can solve the problem of controller position deployment systematically.
The embodiment of the invention provides a SDN controller deployment method based on network topology, which comprises the following steps:
modeling an SDN network topology as a weighted undirected graph, wherein the weight of each edge in the weighted undirected graph is the link weight of a corresponding link, and the higher the link weight is, the worse the data transmission capability of the corresponding link is;
dividing the weighted undirected graph into a plurality of subgraphs according to a minimum cutting edge principle;
and determining each subgraph as a control domain, wherein the central position of each subgraph is the deployment position of the controller, and the shortest distance and the smallest sum of the elements of the central position to other elements in the subgraph are determined.
The embodiment of the present invention further provides a device for deploying an SDN controller based on a network topology, including:
the mapping module is used for modeling an SDN network topology as a weighted undirected graph, wherein the weight of each edge in the weighted undirected graph is the link weight of a corresponding link, and the higher the link weight is, the worse the data transmission capacity of the corresponding link is;
the dividing module is used for dividing the weighted undirected graph into a plurality of subgraphs according to a minimum cutting edge principle;
and the determining module is used for determining each subgraph as a control domain, the central position of each subgraph is the deployment position of the controller, and the shortest distance sum of the element of the central position to other elements in the subgraph is minimum.
An embodiment of the present invention also provides an electronic device, including:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a network topology based SDN controller deployment method as described above.
Embodiments of the present invention also provide a computer readable storage medium storing a computer program, which when executed by a processor implements the SDN controller deployment method based on network topology as described above.
Compared with the prior art, the method and the device have the advantages that the SDN network topology is modeled into the weighted undirected graph, the weight of each edge in the weighted undirected graph is the link weight of the corresponding link, and the higher the link weight is, the poorer the data transmission capability of the corresponding link is; dividing the weighted undirected graph into a plurality of subgraphs according to a minimum cutting edge principle; and determining each subgraph as a control domain, wherein the central position of each subgraph is the deployment position of the controller, and the shortest distance and the smallest sum of the elements in the central position to other elements in the subgraph are determined. The scheme divides the subgraphs based on the rule of minimum cut edge for the weighted undirected graph, is not limited by the scale of the graph, can be suitable for the multi-controller position deployment algorithm with various network scales, and can effectively ensure the data transmission performance between the subgraphs due to the minimum cut edge value between the subgraphs, thereby more systematically solving the problem of controller position deployment.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the figures in which like reference numerals refer to similar elements and which are not to scale unless otherwise specified.
Fig. 1 is a flowchart of a network topology based SDN controller deployment method according to a first embodiment of the present invention;
figure 2 is a diagram of an SDN network topology according to a first embodiment of the present invention;
figure 3 is a schematic diagram of a network topology based SDN controller deployment apparatus architecture according to a second embodiment of the present invention;
fig. 4 is a schematic structural diagram of an electronic device according to a third embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that numerous technical details are set forth in order to provide a better understanding of the present application in various embodiments of the present invention. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments.
A first embodiment of the present invention relates to a network topology-based SDN controller deployment method, as shown in fig. 1, the method includes:
s101: modeling an SDN network topology as a weighted undirected graph, wherein the weight of each edge in the weighted undirected graph is the link weight of a corresponding link, and the higher the link weight is, the worse the data transmission capability of the corresponding link is;
as shown in fig. 2, in a typical SDN network topology diagram, when the SDN network topology diagram is modeled as a weighted undirected graph, each switch may be used as an element, a link between two switches having a direct connection relationship is used as an edge, and a weight of each edge is a link weight of a corresponding link, where the higher the link weight is, the worse the data transmission capability of the corresponding link is.
In particular, when evaluating the data transmission capability of each link in the SDN network topology, the evaluation may be performed through a plurality of transmission metrics. For example, shown in this scheme: and calculating the link weight of each link in the SDN network topology according to at least one index of link bandwidth, link delay, link load and link packet loss.
For example, assume that an SDN network has n switches, and the ith switch in the network is denoted as Vi1 ≦ i ≦ n, and the set of all switches is denoted V ═ V ≦ n1,V2,...,Vn}; in the network ViAnd VjThe inter-link is denoted as EijThe link weight (link bandwidth, link delay, link load, link packet loss) is denoted cij1 ≦ i, j ≦ n, and the set of all links denoted E ═ { E ≦ Eij}. for characterizing the network connection relationship between switches in the network, a switch link connection identifier α is introducedij，αijRepresents ViAnd VjInter link connection identifier, if ViAnd VjInter-route link Eijare directly connected, then αij1, otherwise αij＝0。
when the modeling SDN network topology is undirected graph G (V, E), elements in graph G represent switches in the SDN network, edges in graph G represent SDN network links, and an adjacency matrix of graph G is represented by M (G) ═ αij)n×nThe weight matrix is expressed as C (G) ═ Cij)n×n。
S102: and dividing the weighted undirected graph into a plurality of subgraphs according to a cut edge minimum principle.
Specifically, the weighted undirected graph can be segmented according to the minimum cut edge principle, so as to form a plurality of subgraphs. The specific division may be to divide a plurality of subgraphs at one time according to the order of the cut edge values from small to large, or to perform multiple iterative divisions to form a plurality of subgraphs.
For example, the partitioning can be iteratively performed by the following method steps:
step 1: confirming a minimum cut edge set of the weighted undirected graph by adopting a minimum cut Stoer-Wagner algorithm;
step 2: deleting the minimum cut edge set, and dividing the weighted undirected graph into two subgraphs;
and (3) taking the two subgraphs as the next weighted undirected graph to be divided, and repeatedly executing the step (1) and the step (2) until the weighted undirected graph is divided into subgraphs meeting the first preset number.
For example, the minimum cut edge set of the graph G is confirmed by adopting a minimum cut Stoer-Wagner algorithm, the minimum cut edge set is deleted, and the graph G is divided into subgraphs G1And subfigure G2(ii) a Then respectively confirming and deleting G1And G2Minimum cut edge set of G1Division into subgraphs G3And subfigure G4G is2Division into subgraphs G5And subfigure G6. The above process is repeated until G is divided into k subgraphs.
In addition, in the process of dividing the subsets, some subset divisions may be too scattered, and at this time, the divided subsets may be partially merged to reduce the number of subgraphs, thereby reducing the number of control domains and the number of deployed controllers.
For example, the relative interconnectivity and relative closeness between each two adjacent subgraphs in the weighted undirected graph may be calculated after a first preset number of subgraphs are obtained. The similarity between two subgraphs is determined by the relative interconnectivity and relative proximity between the two adjacent subgraphs.
Wherein, the relative interconnection degree between two adjacent subgraphs is:
wherein, EC (G)i,Gj) Representation subgraph GiAnd sub-diagram GjCut edge weight sum, EC (G) of cut edge set ofi) Representation subgraph GiThe sum of the weights of all edges within.
The relative proximity between two adjacent subgraphs is:
wherein, | GiI represents subgraph GiNumber of middle elements, | GjI represents subgraph GjThe number of the elements in the Chinese character 'Zhongqin'.
Of course, those skilled in the art may also rely on EC (G)i,Gj)、EC(Gi)、|GiOther formulas are constructed to express relative interconnectivity and relative proximity between two adjacent subgraphs.
And merging the partial adjacent subgraphs according to the relative interconnection degree and the relative proximity degree so as to reduce the number of the subgraphs to a second preset number.
For example, a subgraph similarity function of R (G) can be modeledi,Gj)＝RI(Gi,Gj)RC(Gi,Gj)μWherein RI (G)i,Gj) Representation subgraph GiAnd sub-diagram GjRelative degree of interconnection between, RC (G)i,Gj) Representation subgraph GiAnd sub-diagram GjRelative proximity between them, μ represents a function adjustment factor.
A relative interconnectivity threshold TRI, a relative closeness TRC is set. Computational sub-graph GiSimilarity with adjacent joint graph, find GiForm the maximum similarity
Sub-drawing of
If it is
Exceeding threshold TRI + TRCμThen subgraph G will beiAnd sub-diagram
Are combined into a drawing
S103: and determining each subgraph as a control domain, wherein the central position of each subgraph is the deployment position of the controller, and the shortest distance and the smallest sum of the elements in the central position to other elements in the subgraph are determined.
Specifically, the present embodiment is not limited to calculating the shortest distance between any two elements in the subgraph.
For example, Dijstra's algorithm may be used to calculate the graph
Shortest distance between any two elements in the list
Calculating the sum of the shortest distances from the element to all other elements (called the shortest distance sum for short) of each element, and determining the element corresponding to the minimum value from the shortest distances sum to be used as a graph
The center position of (a). To this end, the drawings
Namely a control domain, the central position is the deployment position of the controller in the control domain, and the diagram
The connection relation of the edges is the controllerAssociated with the switch.
Compared with the prior art, the method and the device have the advantages that the SDN network topology is modeled into the weighted undirected graph, the weight of each edge in the weighted undirected graph is the link weight of the corresponding link, and the higher the link weight is, the poorer the data transmission capability of the corresponding link is; dividing the weighted undirected graph into a plurality of subgraphs according to a minimum cutting edge principle; and determining each subgraph as a control domain, wherein the central position of each subgraph is the deployment position of the controller, and the shortest distance and the smallest sum of the elements in the central position to other elements in the subgraph are determined. The method and the device can be suitable for multi-controller position deployment algorithms with various network scales, and the problem of controller position deployment is solved systematically. The scheme divides the subgraphs based on the rule of minimum cut edge for the weighted undirected graph, is not limited by the scale of the graph, can be suitable for the multi-controller position deployment algorithm with various network scales, and can effectively ensure the data transmission performance between the subgraphs due to the minimum cut edge value between the subgraphs, thereby more systematically solving the problem of controller position deployment.
In addition, the scheme can optimize the link weight in a multi-dimensional way by taking the link bandwidth, the link time delay, the link load, the link packet loss and the like as optimization targets, not only considers the network performance in a control domain but also considers the network performance between control domains based on the network topology, and the overall performance of the network is better. And the number of the first and second electrodes,
in addition, compared with the prior scheme I, the scheme does not need to give the number of the controllers in advance; compared with the existing scheme II, the time complexity of the scheme is lower.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
A second embodiment of the present invention relates to an SDN controller deployment apparatus based on a network topology, as shown in fig. 3, including:
the mapping module 310 is configured to model an SDN network topology as a weighted undirected graph, where a weight of each edge in the weighted undirected graph is a link weight of a corresponding link, and a data transmission capability of the corresponding link is worse when the link weight is higher;
a dividing module 320, configured to divide the weighted undirected graph into multiple subgraphs according to a rule of minimum cut edge;
the determining module 330 is configured to determine each sub-graph as a control domain, where a central position of the sub-graph is a deployment position of the controller, and a shortest distance sum of an element in the central position to other elements in the sub-graph is minimum.
Further, the mapping module 310 may be further configured to calculate a link weight of each link in the SDN network topology according to at least one of the indexes of link bandwidth, link delay, link load, and link packet loss.
Further, the dividing module 320 may be configured to perform:
step 1: confirming a minimum cut edge set of the weighted undirected graph by adopting a minimum cut Stoer-Wagner algorithm;
step 2: deleting the minimum cut edge set, and dividing the weighted undirected graph into two subgraphs;
and (3) taking the two subgraphs as the next weighted undirected graph to be divided, and repeatedly executing the step (1) and the step (2) until the weighted undirected graph is divided into subgraphs meeting the first preset number.
Further, the partitioning module 320 may be further configured to calculate a relative interconnection degree and a relative proximity degree between every two adjacent subgraphs in the weighted undirected graph after obtaining the first preset number of subgraphs;
and merging the partial adjacent subgraphs according to the relative interconnection degree and the relative proximity degree so as to reduce the number of the subgraphs to a second preset number.
Further, the relative interconnection degree between the two adjacent subgraphs is as follows:
wherein, EC (G)i,Gj) Representation subgraph GiAnd sub-diagram GjCut edge weight sum, EC (G) of cut edge set ofi) Representation subgraph GiThe sum of the weights of all edges within.
Further, the relative proximity between the two adjacent subgraphs is:
wherein, | GiI represents subgraph GiNumber of middle elements, | GjI represents subgraph GjThe number of the elements in the Chinese character 'Zhongqin'.
Further, the determining module 330 may be configured to calculate a shortest distance between any two elements in the sub-graph by using Dijstra algorithm, and use an element of the shortest distance to another element and the minimum value as the center position of the sub-graph.
A third embodiment of the invention is directed to an electronic device, as shown in FIG. 4, comprising at least one processor 402; and a memory 401 communicatively coupled to the at least one processor 402; the memory 401 stores instructions executable by the at least one processor 402, and the instructions are executed by the at least one processor 402 to enable the at least one processor 402 to execute the SDN controller deployment method based on the network topology.
Where the memory 401 and the processor 402 are coupled by a bus, which may include any number of interconnected buses and bridges that couple one or more of the various circuits of the processor 402 and the memory 401 together. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor 402 is transmitted over a wireless medium through an antenna, which further receives the data and transmits the data to the processor 402.
The processor 402 is responsible for managing the bus and general processing and may also provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. And memory 401 may be used to store data used by processor 402 in performing operations.
A fourth embodiment of the present invention relates to a computer-readable storage medium storing a computer program. The computer program realizes any of the above-described method embodiments when executed by a processor.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
Claims (10)
1. An SDN controller deployment method based on network topology is characterized by comprising the following steps:
modeling an SDN network topology as a weighted undirected graph, wherein the weight of each edge in the weighted undirected graph is the link weight of a corresponding link, and the higher the link weight is, the worse the data transmission capability of the corresponding link is;
dividing the weighted undirected graph into a plurality of subgraphs according to a minimum cutting edge principle;
and determining each subgraph as a control domain, wherein the central position of each subgraph is the deployment position of the controller, and the shortest distance and the smallest sum of the elements of the central position to other elements in the subgraph are determined.
2. The method of claim 1, further comprising:
and calculating the link weight of each link in the SDN network topology according to at least one index of link bandwidth, link delay, link load and link packet loss.
3. The method of claim 1, wherein the dividing the weighted undirected graph into a plurality of subgraphs according to a cut edge minimization principle comprises:
step 1: confirming a minimum cut edge set of the weighted undirected graph by adopting a minimum cut Stoer-Wagner algorithm;
step 2: deleting the minimum cut edge set, and dividing the weighted undirected graph into two subgraphs;
and (3) respectively taking the two subgraphs as a next weighted undirected graph to be divided, and repeatedly executing the step (1) and the step (2) until the weighted undirected graph is divided into subgraphs meeting a first preset number.
4. The method of claim 3, further comprising:
after the first preset number of sub-graphs are obtained, calculating the relative interconnection degree and the relative proximity degree between every two adjacent sub-graphs in the weighted undirected graph;
and merging the adjacent subgraphs of the part according to the relative interconnection degree and the relative proximity degree so as to reduce the number of the subgraphs to a second preset number.
5. The method of claim 4, wherein the relative degree of interconnection between the two adjacent subgraphs is:
wherein, EC (G)i,Gj) Representation subgraph GiAnd sub-diagram GjCut edge weight sum, EC (G) of cut edge set ofi) Representation subgraph GiThe sum of the weights of all edges within.
6. The method of claim 5, wherein the relative proximity between the two adjacent subgraphs is:
wherein, | GiI represents subgraph GiNumber of middle elements, | GjI represents subgraph GjThe number of the elements in the Chinese character 'Zhongqin'.
7. The method of claim 5, wherein computing the center position of the subgraph comprises:
and calculating the shortest distance between any two elements in the subgraph by adopting a Dijstra algorithm, and taking the element with the shortest distance to other elements and the minimum value as the central position of the subgraph.
8. An SDN controller deployment device based on a network topology, comprising:
the mapping module is used for modeling an SDN network topology as a weighted undirected graph, wherein the weight of each edge in the weighted undirected graph is the link weight of a corresponding link, and the higher the link weight is, the worse the data transmission capacity of the corresponding link is;
the dividing module is used for dividing the weighted undirected graph into a plurality of subgraphs according to a minimum cutting edge principle;
and the determining module is used for determining each subgraph as a control domain, the central position of each subgraph is the deployment position of the controller, and the shortest distance sum of the element of the central position to other elements in the subgraph is minimum.
9. An electronic device, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the network topology based SDN controller deployment method of any of claims 1-7.
10. A computer readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the network topology based SDN controller deployment method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911420654.9A CN111181792B (en) | 2019-12-31 | 2019-12-31 | SDN controller deployment method and device based on network topology and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911420654.9A CN111181792B (en) | 2019-12-31 | 2019-12-31 | SDN controller deployment method and device based on network topology and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111181792A true CN111181792A (en) | 2020-05-19 |
| CN111181792B CN111181792B (en) | 2023-04-07 |
Family
ID=70657724
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911420654.9A Active CN111181792B (en) | 2019-12-31 | 2019-12-31 | SDN controller deployment method and device based on network topology and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111181792B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112699134A (en) * | 2021-03-25 | 2021-04-23 | 北京智源人工智能研究院 | Distributed graph database storage and query method based on graph subdivision |
| CN113810225A (en) * | 2021-09-03 | 2021-12-17 | 中科南京信息高铁研究院 | In-band network telemetry detection path planning method and system for SDN (software defined network) |
| CN116055385A (en) * | 2022-12-30 | 2023-05-02 | 中国联合网络通信集团有限公司 | Routing method, management node, routing node and medium |
| CN116192725A (en) * | 2023-04-23 | 2023-05-30 | 安徽中科晶格技术有限公司 | Distributed SDN controller deployment method, system and equipment based on FPS algorithm |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104717098A (en) * | 2015-04-09 | 2015-06-17 | 北京邮电大学 | Data processing method and device |
| US20160149816A1 (en) * | 2013-06-14 | 2016-05-26 | Haitao Wu | Fault Tolerant and Load Balanced Routing |
| CN108322525A (en) * | 2018-01-23 | 2018-07-24 | 浙江工商大学 | A kind of industry multi-core network establishing method |
| CN108401015A (en) * | 2018-02-02 | 2018-08-14 | 广州大学 | A kind of data center network method for routing based on deeply study |
| CN109921991A (en) * | 2019-01-14 | 2019-06-21 | 湘潭大学 | A kind of SDN controller portion arranging method based on Dinkelbach |
-
2019
- 2019-12-31 CN CN201911420654.9A patent/CN111181792B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160149816A1 (en) * | 2013-06-14 | 2016-05-26 | Haitao Wu | Fault Tolerant and Load Balanced Routing |
| CN104717098A (en) * | 2015-04-09 | 2015-06-17 | 北京邮电大学 | Data processing method and device |
| CN108322525A (en) * | 2018-01-23 | 2018-07-24 | 浙江工商大学 | A kind of industry multi-core network establishing method |
| CN108401015A (en) * | 2018-02-02 | 2018-08-14 | 广州大学 | A kind of data center network method for routing based on deeply study |
| CN109921991A (en) * | 2019-01-14 | 2019-06-21 | 湘潭大学 | A kind of SDN controller portion arranging method based on Dinkelbach |
Non-Patent Citations (2)
| Title |
|---|
| YING ZHANG，NEDA BEHESHTI，MALLIK TATIPAMULA: "On Resilience of Split-Architecture Networks", 《2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE - GLOBECOM 2011》 * |
| 高先明等: "SDN网络中控制器放置问题综述", 《通信学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112699134A (en) * | 2021-03-25 | 2021-04-23 | 北京智源人工智能研究院 | Distributed graph database storage and query method based on graph subdivision |
| CN113810225A (en) * | 2021-09-03 | 2021-12-17 | 中科南京信息高铁研究院 | In-band network telemetry detection path planning method and system for SDN (software defined network) |
| CN113810225B (en) * | 2021-09-03 | 2024-04-30 | 中科南京信息高铁研究院 | In-band network telemetry detection path planning method and system of SDN (software defined network) |
| CN116055385A (en) * | 2022-12-30 | 2023-05-02 | 中国联合网络通信集团有限公司 | Routing method, management node, routing node and medium |
| CN116192725A (en) * | 2023-04-23 | 2023-05-30 | 安徽中科晶格技术有限公司 | Distributed SDN controller deployment method, system and equipment based on FPS algorithm |
| CN116192725B (en) * | 2023-04-23 | 2023-07-07 | 安徽中科晶格技术有限公司 | Distributed SDN controller deployment method, system and equipment based on FPS algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111181792B (en) | 2023-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111181792B (en) | SDN controller deployment method and device based on network topology and electronic equipment | |
| CN112738820B (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| EP3151483B1 (en) | Path planning method and controller | |
| US9680665B2 (en) | Apparatus and method for dynamic hybrid routing in SDN networks to avoid congestion and balance loads under changing traffic load | |
| CN108684046B (en) | Random learning-based access network service function chain deployment method | |
| US20030161338A1 (en) | Network path selection based on bandwidth | |
| CN109451540B (en) | Resource allocation method and equipment for network slices | |
| CN105515987B (en) | A kind of mapping method based on SDN framework Virtual optical-fiber networks | |
| CN107659426B (en) | Method for allocating physical resources and network side equipment | |
| CN112543151B (en) | SDN controller deployment method and device, electronic equipment and storage medium | |
| CN109639575A (en) | Route planning method based on link congestion coefficient | |
| CN112560204B (en) | Optical network route optimization method based on LSTM deep learning and related device thereof | |
| CN109362093B (en) | Resource optimization method for maximizing total throughput of network function virtualization | |
| CN114650249A (en) | Algorithm model and path determination method, electronic device, SDN controller and medium | |
| CN111800352B (en) | Service function chain deployment method and storage medium based on load balancing | |
| US10474644B2 (en) | Systems and methods for optimizing selection of a replication data node in a distributed file system | |
| CN107995047B (en) | Topology networking method and device for data center | |
| JP2011091751A (en) | Candidate topology generating method using multi-agent system, topology generating method, topology generating system, and program | |
| CN112055394B (en) | Wireless sensor network clustering routing method and system for rapid inclusion elimination | |
| CN109889393B (en) | Method and system for processing geographic distributed graph | |
| CN115809148A (en) | Load balancing task scheduling method and device facing edge computing | |
| EP3225000A1 (en) | Determining bandwidth requirements for network services | |
| JP6120411B2 (en) | Network control method and apparatus | |
| CN110213149B (en) | Virtual network mapping method based on node entropy | |
| Sen et al. | Distributed training for deep learning models on an edge computing network using shielded reinforcement learning |
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 |