CN111917645A - SDN-based path optimization method and system for mobile network - Google Patents
SDN-based path optimization method and system for mobile network Download PDFInfo
- Publication number
- CN111917645A CN111917645A CN202010841802.0A CN202010841802A CN111917645A CN 111917645 A CN111917645 A CN 111917645A CN 202010841802 A CN202010841802 A CN 202010841802A CN 111917645 A CN111917645 A CN 111917645A
- Authority
- CN
- China
- Prior art keywords
- path
- optimal
- network
- link
- network topology
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
Abstract
The invention provides a path optimization method of a mobile network based on an SDN (software defined network), which is used in an SDN controller and comprises the following steps: acquiring network topology information of a network topology based on network topology discovery of channel sensing; and generating the first N optimal paths between the source node and the target node according to the network topology information, wherein N is more than or equal to 1. The scheme of the invention provides the quick topology discovery based on the channel perception aiming at the mobile network with the wireless link, thereby being capable of applying the SDN technology to the mobile network with the network configuration scene changing frequently, and quickly and effectively selecting and optimizing the path of the mobile network based on the network topology information obtained by the SDN technology and the quick topology discovery.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a method, a system, a computer device, and a computer-readable storage medium for path optimization of a mobility Network based on a Software Defined Network (SDN).
Background
With the development of the SDN concept and its application, an open flow (OpenFlow) technology, which is an SDN core technology, is in a rapid development stage and is being increasingly applied to actual production life. In SDN, the control plane is separate from the forwarding plane, and the SDN controller is responsible for the route calculation for path selection.
However, traditional SDN routing calculations and the like are performed based on fixed networks, and cannot be applied to a mobile network with a wireless link, because the mobile network with the wireless link has the characteristics of complex networking scene, frequent change and the like. Therefore, how to quickly and effectively perform path selection and optimization for a mobile network of a wireless link becomes a current technical difficulty.
Disclosure of Invention
The invention aims to provide a method, a system, a computer device and a computer readable storage medium for optimizing a path of a mobile network based on an SDN (software defined network), which can be used for solving the following problems: in a mobile network based on SDN, how to perform path selection and optimization quickly and efficiently.
One aspect of the present invention provides a method for optimizing a path of a mobile network based on an SDN, including: acquiring network topology information of a network topology based on network topology discovery of channel sensing; and generating the first N optimal paths between the source node and the target node according to the network topology information, wherein N is more than or equal to 1.
Optionally, the generating the first N optimal paths between the source node and the target node through the network topology information includes: generating a first optimal path between a source node and a target node; and after the first optimal path is generated, generating a second optimal path to an Nth optimal path through node separation operation.
Optionally, the generating the first N optimal paths between the source node and the target node through the network topology information includes: judging whether the second to Nth optimal paths are all generated through the node separation operation; and if the second to the Nth optimal paths are not completely generated through the node separation operation, executing a link separation operation: and generating the Mth to Nth optimal paths which are not generated in the node separation operation, wherein M is more than or equal to 2 and less than or equal to N.
Optionally, the generating the first N optimal paths between the source node and the target node through the network topology information includes: judging whether the Mth to Nth optimal paths are all generated through the link separation operation; and if the Mth to Nth optimal paths are not completely generated through the link separation operation, executing a path deviation operation: and deviating on the basis of the first optimal path to generate a residual optimal path which is not generated in the link separation operation.
Optionally, the network topology information includes link information between adjacent nodes, where the link information between adjacent nodes includes one or more or all of link bandwidth, time delay, jitter, packet loss rate, state, network type, and channel factor.
Optionally, the step of generating the first N optimal paths between the source node and the target node through the network topology information includes: calculating a link weight value between each two adjacent nodes according to the link information between each two adjacent nodes; and generating the first optimal path through a single-source optimal path algorithm and link information between the adjacent nodes.
Optionally, the method further includes: when a high-priority data stream needs to be transmitted: detecting whether the first optimal path meets the transmission requirement of the data stream; if the first optimal path meets the transmission requirement of the data stream, transmitting the data stream through the first optimal path; or if the first optimal path does not meet the transmission requirement of the data stream, regenerating a path meeting the transmission requirement.
Yet another aspect of the present invention provides a system for optimizing a path of a mobile network based on an SDN, comprising: the acquisition module is used for acquiring network topology information of the network topology based on network topology discovery of channel perception; and the path generation module is used for selecting a first optimal path between the source node and the target node according to the network topology information.
Yet another aspect of the present invention provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor when executing the computer program implementing the steps of the method for path optimization of an SDN based mobility network as described in any one of the above.
Yet another aspect of the present invention provides a computer readable storage medium, on which a computer program is stored, which, when being executed by a processor, is configured to implement the steps of the method for path optimization of an SDN based mobility network as described in any one of the above.
The invention provides a method, a system, computer equipment and a computer readable storage medium for optimizing a path of a maneuvering network based on an SDN (software defined network), aiming at the maneuvering network with a wireless link, and providing channel perception-based rapid topology discovery, so that the SDN technology can be applied to the maneuvering network with a frequently changed networking scene, and the maneuvering network can be rapidly and effectively selected and optimized for the path based on the network topology information obtained by the SDN technology and the rapid topology discovery.
Drawings
FIG. 1 schematically illustrates a topology diagram of a network topology;
fig. 2 schematically shows a flowchart of a method for optimizing a path of a SDN-based mobility network according to a first embodiment of the present invention;
FIG. 3 is a sub-flowchart of step S202 in FIG. 2;
fig. 4 is a diagram schematically illustrating additional steps of a method for optimizing a path of a mobile network based on an SDN according to an embodiment of the present invention;
figure 5 schematically illustrates another additional step diagram of a method for optimizing a path of a mobile network based on an SDN according to an embodiment of the present invention;
figure 6 schematically illustrates another additional step diagram of a method for optimizing a path of a mobile network based on an SDN according to an embodiment of the present invention;
figure 7 schematically illustrates another additional step diagram of a method for optimizing a path of a mobile network based on SDN according to an embodiment of the present invention;
figure 8 schematically illustrates a block diagram of modules of a path optimization system for an SDN based mobility network, in accordance with a third embodiment of the invention; and
fig. 9 schematically shows a hardware architecture diagram of a computer device suitable for implementing a path optimization method for an SDN-based mobile network according to a fourth embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the technical solutions in the embodiments may be combined with each other, but must be based on the realization of the technical solutions by those skilled in the art, and when the technical solutions are contradictory or cannot be realized, the combination of the technical solutions should be considered to be absent and not to be within the protection scope of the present invention.
In existing SDN solutions, no specific processing is done for a mobile network of wireless links. For example, in the prior art: (1) for a mobile network fused by a wired network and a wireless network, an effective and quick routing algorithm is unavailable; (2) there is also no efficient and fast routing algorithm for mobile networks with fast changes in topology scenarios.
Some embodiments will be provided below to improve the quality of service of a mobile network, for example:
(1) improving the network resource utilization of the mobile network;
(2) the effectiveness of path selection is improved;
(3) distributing reasonable paths according to the priority of the service;
(4) providing path selection with high protection effect for important service flow;
(5) a desired routing result is provided that supports human control.
Specifically, the scheme adopts a rapid topology discovery technology based on channel sensing. The fast topology discovery has the following characteristics: fast convergence, sensing link attribute information over a channel, etc. Among them, traffic flow and link load in the network have important influence on traffic scheduling. The routing technology based on rapid topology discovery can rapidly select the optimal path in the current topology network, and the priority, the bandwidth, the time delay, the jitter, the packet loss rate, the controllable and configurable channel factor and the like are used as the basis for influencing the path selection and optimization, so the method has the characteristics of high-efficiency resource maximum utilization, controllable selection and the like. The SDN controller routing algorithm also adopts a separation principle from strict to loose, and can provide path selection with functions of preempting secondary service bandwidth and high protection for important service flow.
For ease of understanding, FIG. 1 provides a topological diagram of a network topology of an exemplary mobile network, the network topology including a plurality of nodes. It should be understood that this network topology is exemplary only and is not intended to limit the scope of the invention.
The source node 1 may be a personal computer, a tablet computer, a mobile phone, or other electronic devices of various types.
The destination node 8 may be a personal computer, a tablet computer, a mobile phone, or a set-top box, among other electronic devices.
The routing nodes 2, 3, 4, 5, 6, 7 may be network devices such as switches, routers, APs, etc. supporting the OpenFlow protocol.
Of course, the source node 1 and the destination node 8 may also be routing nodes at the edge, such as routers connected by direct mobile phone.
Example one
Fig. 2 schematically shows a flowchart of a method for optimizing a path of a mobile network based on an SDN according to an embodiment of the present invention.
As shown in fig. 2, the method for optimizing the path of the SDN-based mobile network may include steps S200 to S202, wherein:
step S200, based on the network topology discovery of channel perception, the network topology information of the network topology is obtained.
And S202, generating the first N optimal paths between the source node and the target node according to the network topology information, wherein N is more than or equal to 1.
N may be set by the user or may be a default value.
Based on the channel-aware network topology discovery, the network topology information of the network topology can be intelligently perceived. Specifically, the fast topology discovery interactively senses link information through a self-defined protocol message, discovers a local unrecorded node through message content, sends a neighbor relation interaction message applying for establishment to the node, and periodically sends a synchronous network information message after the relationship is established, and the synchronous link information, the link state and the like so as to ensure network change updating. As an example, the network topology information includes link information. The link information includes link information between adjacent nodes, and the link information between adjacent nodes may include one or more or all of link bandwidth, time delay, jitter, packet loss rate, state, network type, and channel factor. The link bandwidth, the time delay, the jitter, the packet loss rate, the state, the network type, and the like may be link state information sensed by auto discovery. The channel factors may be worker configured link information used to influence the SDN controller to select a path that is artificially desired.
Step S200 may be implemented in a variety of ways.
As an example, as shown in fig. 3, step S200 may be implemented by: step S300, calculating a link weight value between each two adjacent nodes according to the link information between each two adjacent nodes; step S302, generating the first optimal path through a single-source optimal path algorithm and link information between the adjacent nodes.
The single-source optimal path algorithm can search the topological graph from a source node according to Dijkstra (Dixtera) algorithm, breadth-first traversal and greedy strategy principles, and a shortest path generating tree is constructed by taking the source node as a vertex, and each node of the shortest path generating tree except the vertex records the sum of link weights from the vertex to the node. When the destination node is searched, the optimal path is generated, namely, the optimal path searched this time is obtained according to the shortest path spanning tree.
And performing breadth-first search on the whole topological graph through the single-source optimal path algorithm, for example, starting from a source node as a vertex of the topological graph, searching all neighbors of the source node, searching the optimal neighbors according to the link weight value, and diffusing until a target node is searched, wherein at the moment, according to a priority search principle, a father node which is searched for the target node firstly is a priority node priority link, and the optimal path searched at this time can be obtained by continuously searching the father node of the priority node until the vertex.
In the embodiment, for a mobile network with a wireless link, channel-aware-based fast topology discovery is provided, so that the SDN technology can be applied to the mobile network whose networking scene changes frequently, and the mobile network is subjected to fast and effective path selection and optimization based on network topology information obtained by the SDN technology and the fast topology discovery.
In some preferred embodiments, a strict to loose separation principle is also implemented, namely: node split → link split → path deviation.
(1) The node separation principle is preferentially used:
after the first optimal path is generated, a second optimal path, a third optimal path and … are generated by preferentially adopting a node separation principle.
As a preferred embodiment, as shown in fig. 4, the path optimization method of the SDN-based mobile network includes a node separation operation, in which: step S400, generating a first optimal path between a source node and a target node; step S402, after the first optimal path is generated, a second optimal path to an Nth optimal path are generated through node separation operation.
Under the condition of obtaining the first optimal path, if a second optimal path is needed, a node separation operation may be performed, specifically as follows: acquiring all routing nodes on the first optimal path; acquiring all the rest routing nodes in the network topology according to all the routing nodes on the first optimal path; and generating a second optimal path between the source node and the target node based on all the remaining routing nodes.
Under the condition of obtaining the first optimal path and the second optimal path, if a third optimal path is needed, continuing to execute node separation operation: and excluding all routing nodes on the first optimal path and all routing nodes on the second optimal path in the network topology, wherein the rest routing nodes are used for generating a third optimal path. By analogy, a fourth optimal path, …, may be obtained until the traffic demand is met or the path is unreachable.
Note that, the node separation is: after one or more optimal paths are obtained, another optimal path is selected again. In order to support a high-protection service path, all routing nodes passed by the path must be excluded based on the previous optimal path, and the generated temporary topological graph calculates the optimal path except the nodes passed by the constructed path again, so that each service path has the functions of completely separating and high-protection service paths.
(2) Link split principle is used suboptimally:
and if the second optimal path cannot be generated based on the node separation principle, adopting a link separation principle.
As a preferred embodiment, as shown in fig. 5, the method for optimizing the path of the SDN-based mobile network includes steps S500 to S502, where: step S500, judging whether the second to Nth optimal paths are all generated through the node separation operation; step S502, if the second to Nth optimal paths are not generated completely through the node separation operation, executing a link separation operation: and generating the Mth to Nth optimal paths which are not generated in the node separation operation, wherein M is more than or equal to 2 and less than or equal to N.
Under the condition of obtaining a first optimal path and a second optimal path through node separation operation or link separation operation, if a third optimal path is needed, the link separation operation can be continuously executed: and generating a third optimal path different from the first optimal path and the second optimal path according to all nodes of the network topology. By analogy, a fourth optimal path, …, may be obtained until the traffic demand is met or the path is unreachable.
It should be noted that, the link is separated in that: if node separation cannot meet the service path requirement, the separation calculation of the link can be carried out: and eliminating all links passed by one or more paths selected in the node separation process and before, generating a temporary topological graph, and calculating the optimal path except the links passed by the constructed paths again, so that the routing result has the functions of separating from other paths and protecting service paths.
(3) Finally, using the principle of path deviation:
if the number of paths satisfying the service requirement still cannot be found based on the node separation principle and the link separation principle, a path deviation principle can be adopted.
As a preferred embodiment, as shown in fig. 6, the method for optimizing the path of the SDN-based mobile network includes steps S600 to S602, where: step S600, judging whether the Mth to Nth optimal paths are all generated through the link separation operation; step S602, if the mth to nth optimal paths are not all generated by the link splitting operation, performing a path deviation operation: and deviating on the basis of the first optimal path to generate a residual optimal path which is not generated in the link separation operation.
Under the condition of obtaining a first optimal path and obtaining a second optimal path through node separation operation, link separation operation or path deviation operation, if a third optimal path is needed, the path deviation operation can be continuously executed: and deviating the basis of the first optimal path to generate the third optimal path. By analogy, a fourth optimal path, …, may be obtained until the traffic demand is met or the path is unreachable.
It should be noted that the path deviation (the top k shortest path, which is an extension of Dijkstra algorithm) is to calculate a suboptimal path based on the gradual deviation of the first optimal path. If the node separation and the link separation can not meet the requirements of the service paths, a second optimal path, a third optimal path and … can be selected according to the first optimal path through the path deviation until the requirements of the service paths are met.
In specific implementation, the SDN controller may perform a path selection operation according to a link weight value and different priority bandwidths based on a Dijkstra single-source optimal path algorithm and following a separation calculation principle; forming a routing graph according to links meeting the service bandwidth requirement in the network topology: (1) an optimal path (i.e., a first optimal path) searched by a single-source optimal path algorithm; (2) when an optimal path (namely, a first optimal path) meeting the requirement is selected, searching a next high-protection path (namely, a second optimal path meeting a node separation principle) completely separated from the optimal path, and performing the single-source optimal path algorithm again to obtain the next path (namely, the second optimal path) based on all nodes which are not positioned on the first optimal path in the network topology; (3) if the next path (i.e., the second optimal path or a subsequent path of the second optimal path) cannot be selected based on the node separation principle, releasing the protection condition and executing the link separation principle, and performing the single-source optimal path algorithm again based on all nodes in the network topology to obtain the next path (i.e., the second optimal path or the subsequent path of the second optimal path); (4) if the next path (i.e., the second optimal path or the subsequent path of the second optimal path) cannot be selected based on the link separation principle, the path deviation (the previous k shortest path) is used for calculation, and a ksp (k-short paths) algorithm is used as a supplement of the Dijkstra single-source optimal path algorithm, and the next path (i.e., the second optimal path or the subsequent path of the second optimal path) is selected through the node link deviation of the first optimal path.
It can be known that, by means of three methods of node separation, link separation and path deviation (front k shortest path), a strict to loose path selection strategy is adopted, so that multiple paths with high protection effect can be established, and one service flow can be switched to another available path immediately to ensure stable service. Node separation, namely, completely eliminating a path which passes through a node and is generated for the business from the network topology, and then calculating a completely separated path, wherein the second path is completely separated from the previous path; link separation, namely, a link through which a path generated for the service passes is excluded from the network topology, and then a path of link separation is calculated, wherein the second path does not pass through the same link as the previous path; and (4) calculating the path deviation as the most relaxed alternative path, and selecting the deviation point to the target path based on the existing optimal path and the obtained deviation point, namely calculating the second optimal path and the next suboptimal path and the like.
It should be noted that the above mentioned routing algorithms are only exemplary, and other algorithms may be used. Similarly, the link weight calculation parameters are also exemplary, and the user may choose different parameters according to the network side.
To make the invention more comprehensible, an exemplary description is provided below in connection with fig. 1:
fig. 1 is an exemplary topology and link weights between neighboring nodes. The link weights are obtained by common calculation according to channel factors, time delay, jitter, packet loss rate and bandwidth, and the lower the link weight is, the better the link weight is. The SDN manager performs link bandwidth management, service path selection and the like, and manages and calculates according to the network topology relationship.
The SDN controller calculates three traffic paths between nodes 1 to 8 according to the request information. As shown in fig. 1:
(1) calculating 1-2-5-7-8 as a first optimal path through a single-source optimal path algorithm;
(2) finding a second optimal path through node separation;
(3) obtaining the operation failure of the second optimal path through node separation: 1. 3, 4, 6 and 8, can not reach, and enters into the step (4);
(4) and finding a second optimal path through link separation: 1-3-4-5-6-8;
(5) continuously separating through a link to find a third optimal path;
(6) finding the third optimal path through link separation fails, and entering (7);
(7) and finding a third optimal path through path deviation: 1-2-5-7-6-8;
the third optimal path is a suboptimal path (extended path) of the first optimal path, that is, the suboptimal path obtained based on the deviation of the node 7 of the first optimal path, and the process of selecting the path is ended when the requirement of the service path is met.
As a preferred embodiment, the SDN controller may further provide a high-priority service bandwidth preemption function. That is, for the path application of the high-priority service, the established low-priority service path resource is seized when the network resource is insufficient. Specifically, the link bandwidth of the topological network can be distinguished by 1-8 priority levels, each priority level can respectively occupy the bandwidth and the available bandwidth for management, and shared occupation of the same link bandwidth of different paths of the same service can be supported.
In an exemplary embodiment, the method for optimizing the path of the SDN-based mobile network may further include the following steps: step S700, when a high-priority data stream needs to be transmitted, detecting whether the first optimal path meets the transmission requirement of the data stream; step S702, if the first optimal path meets the transmission requirement of the data stream, transmitting the data stream through the first optimal path; step S704, if the first optimal path does not satisfy the transmission requirement of the data stream, a path meeting the transmission requirement is regenerated.
In conclusion, the invention provides a rapid topology discovery technology based on channel perception for a mobile network, and improves a routing algorithm so as to better meet the characteristics of the mobile network. Based on rapid topology discovery and supporting different priority link bandwidth management, weight assignment and following a separation calculation principle, the method has excellent network routing selection capability, high-efficiency resource maximum utilization and controllable selection, effectively improves network resource utilization, routing effectiveness and service distribution reasonable paths, and provides path selection with high protection effect for important service flow.
Example two
Fig. 8 schematically illustrates a block diagram of a path optimization system for an SDN-based mobile network according to a second embodiment of the present invention, which may be partitioned into one or more program modules, stored in a storage medium and executed by one or more processors to implement the present invention. The present invention is referred to as a program module, which refers to a series of computer program instruction segments that can perform specific functions, and the following description will specifically describe the functions of each program module in the present embodiment.
As shown in fig. 8, a path optimization system 800 for an SDN-based mobility network may include an acquisition module 810 and a path generation module 820, wherein:
an obtaining module 810, configured to obtain network topology information of a network topology based on channel-aware network topology discovery; and
and a path generating module 820, configured to generate the first N optimal paths between the source node and the target node according to the network topology information, where N is greater than or equal to 1.
In the exemplary embodiment, path generation module 820 is configured to: generating a first optimal path between a source node and a target node; and after the first optimal path is generated, generating a second optimal path to an Nth optimal path through node separation operation.
In the exemplary embodiment, path generation module 820 is configured to: judging whether the second to Nth optimal paths are all generated through the node separation operation; and if the second to the Nth optimal paths are not completely generated through the node separation operation, executing a link separation operation: and generating the Mth to Nth optimal paths which are not generated in the node separation operation, wherein M is more than or equal to 2 and less than or equal to N.
In the exemplary embodiment, path generation module 820 is configured to: judging whether the Mth to Nth optimal paths are all generated through the link separation operation; and if the Mth to Nth optimal paths are not completely generated through the link separation operation, executing a path deviation operation: and deviating on the basis of the first optimal path to generate a residual optimal path which is not generated in the link separation operation.
In an exemplary embodiment, the network topology information includes link information between adjacent nodes, and the link information between adjacent nodes includes one or more or all of link bandwidth, delay, jitter, packet loss rate, status, network type and channel factor.
In an exemplary embodiment, the path generation module 820 is further configured to: calculating a link weight value between each two adjacent nodes according to the link information between each two adjacent nodes; and generating the first optimal path through a single-source optimal path algorithm and link information between the adjacent nodes.
In an exemplary embodiment, the path optimization system 800 further includes a management module for: when a high-priority data stream needs to be transmitted: detecting whether the first optimal path meets the transmission requirement of the data stream; if the first optimal path meets the transmission requirement of the data stream, transmitting the data stream through the first optimal path; or if the first optimal path does not meet the transmission requirement of the data stream, regenerating a path meeting the transmission requirement.
EXAMPLE III
Fig. 9 is a schematic hardware architecture diagram of a computer device suitable for implementing a path optimization system of an SDN-based mobile network according to a third embodiment of the present invention. In the present embodiment, the computer device 20 is a device capable of automatically performing numerical calculation and/or information processing in accordance with a command set or stored in advance. For example, it may be an SDN controller or a network element device supporting the function, etc. As shown in fig. 9, the computer device 20 includes at least, but is not limited to: the memory 21, processor 22, and network interface 23 may be communicatively coupled to each other by a system bus. Wherein:
the memory 21 includes at least one type of computer-readable storage medium including a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the storage 21 may be an internal storage module of the computer device 20, such as a hard disk or a memory of the computer device 20. In other embodiments, the memory 21 may also be an external storage device of the computer device 20, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, provided on the computer device 20. Of course, the memory 21 may also include both internal and external memory modules of the computer device 20. In this embodiment, the memory 21 is generally used for storing an operating system installed in the computer device 20 and various types of application software, such as program codes of a path optimization method for a SDN-based mobile network. Further, the memory 21 may also be used to temporarily store various types of data that have been output or are to be output.
Processor 22 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 22 is generally configured to control the overall operation of the computer device 20, such as performing control and processing related to data interaction or communication with the computer device 20. In this embodiment, the processor 22 is configured to execute the program code stored in the memory 21 or process data.
The network interface 23 may comprise a wireless network interface or a wired network interface, and the network interface 23 is typically used to establish a communication connection between the computer device 20 and other computer devices. For example, the network interface 23 is used to connect the computer device 20 with an external terminal through a network, establish a data transmission channel and a communication connection between the computer device 20 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), Wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, Bluetooth (Bluetooth), or Wi-Fi.
It is noted that fig. 9 only shows a computer device with components 21-23, but it is to be understood that not all of the shown components are required to be implemented, and that more or less components may be implemented instead.
In this embodiment, the method for optimizing the path of the SDN-based mobile network stored in the memory 21 may be further divided into one or more program modules and executed by one or more processors (in this embodiment, the processor 22) to complete the present invention.
Example four
The present embodiments also provide a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, realizes the steps of the method for path optimization of an SDN-based mobility network in an embodiment.
In this embodiment, the computer-readable storage medium includes a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the computer readable storage medium may be an internal storage unit of the computer device, such as a hard disk or a memory of the computer device. In other embodiments, the computer readable storage medium may be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device. Of course, the computer-readable storage medium may also include both internal and external storage devices of the computer device. In this embodiment, the computer-readable storage medium is generally used for storing an operating system and various types of application software installed in a computer device, for example, the program code of the path optimization method for the SDN-based mobile network in the embodiment, and the like. Further, the computer-readable storage medium may also be used to temporarily store various types of data that have been output or are to be output.
It will be apparent to those skilled in the art that the modules or steps of the embodiments of the invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A method for optimizing a path of a mobile network based on an SDN (software defined network) is used in an SDN controller and is characterized by comprising the following steps:
acquiring network topology information of a network topology based on network topology discovery of channel sensing; and
and generating the first N optimal paths between the source node and the target node according to the network topology information, wherein N is more than or equal to 1.
2. The method of claim 1, wherein generating the first N optimal paths between a source node and a target node according to the network topology information comprises:
generating a first optimal path between a source node and a target node;
and after the first optimal path is generated, generating a second optimal path to an Nth optimal path through node separation operation.
3. The method of claim 2, wherein generating the first N optimal paths between the source node and the target node according to the network topology information comprises:
judging whether the second to Nth optimal paths are all generated through the node separation operation; and
if the second to Nth optimal paths are not all generated through the node separation operation, executing a link separation operation: and generating the Mth to Nth optimal paths which are not generated in the node separation operation, wherein M is more than or equal to 2 and less than or equal to N.
4. The method of claim 3, wherein generating the first N optimal paths between the source node and the target node according to the network topology information comprises:
judging whether the Mth to Nth optimal paths are all generated through the link separation operation; and
if the Mth to Nth optimal paths are not all generated through the link separation operation, executing a path deviation operation: and deviating on the basis of the first optimal path to generate a residual optimal path which is not generated in the link separation operation.
5. The method according to any one of claims 1 to 4, wherein the network topology information includes link information between adjacent nodes, and the link information between adjacent nodes includes one or more or all of link bandwidth, delay, jitter, packet loss rate, state, network type and channel factor.
6. The method for optimizing paths of a SDN-based mobile network according to claim 5, wherein the step of generating the first N optimal paths between the source node and the target node according to the network topology information comprises:
calculating a link weight value between each two adjacent nodes according to the link information between each two adjacent nodes;
and generating the first optimal path through a single-source optimal path algorithm and link information between the adjacent nodes.
7. The method for optimizing the path of the SDN-based mobile network according to any one of claims 1 to 4, further comprising:
when a high-priority data stream needs to be transmitted:
detecting whether the first optimal path meets the transmission requirement of the data stream;
if the first optimal path meets the transmission requirement of the data stream, transmitting the data stream through the first optimal path; or
And if the first optimal path does not meet the transmission requirement of the data stream, regenerating a path meeting the transmission requirement.
8. A system for optimizing a path of a mobile network based on an SDN, comprising:
the acquisition module is used for acquiring network topology information of the network topology based on network topology discovery of channel perception; and
and the path generation module is used for generating the first N optimal paths between the source node and the target node through the network topology information, wherein N is more than or equal to 1.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor when executing the computer program is adapted to implement the steps of the method for path optimization of a SDN based mobility network of any of claims 1 to 7.
10. A computer readable storage medium having stored thereon a computer program, wherein the computer program, when being executed by a processor, is adapted to carry out the steps of the method for path optimization of a SDN based mobility network according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010841802.0A CN111917645A (en) | 2020-08-20 | 2020-08-20 | SDN-based path optimization method and system for mobile network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010841802.0A CN111917645A (en) | 2020-08-20 | 2020-08-20 | SDN-based path optimization method and system for mobile network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111917645A true CN111917645A (en) | 2020-11-10 |
Family
ID=73278599
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010841802.0A Pending CN111917645A (en) | 2020-08-20 | 2020-08-20 | SDN-based path optimization method and system for mobile network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111917645A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113328893A (en) * | 2021-06-10 | 2021-08-31 | 北京知道创宇信息技术股份有限公司 | Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium |
| CN114124791A (en) * | 2021-12-08 | 2022-03-01 | 中国电子科技集团公司第三十四研究所 | SPTN (shortest path transport network) network tunnel rerouting method |
| CN115002022A (en) * | 2022-04-29 | 2022-09-02 | 中国航空无线电电子研究所 | Route configuration generation method for RapidIO network |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150103672A1 (en) * | 2013-10-14 | 2015-04-16 | Hewlett-Packard Development Company, L.P | Data flow path determination |
| CN107135159A (en) * | 2017-03-31 | 2017-09-05 | 武汉绿色网络信息服务有限责任公司 | The method and system that optimal path is determined in a kind of SDN |
| CN107135158A (en) * | 2017-07-11 | 2017-09-05 | 北京工业大学 | Optimal route selection method in a kind of multi-path transmission |
| CN107483337A (en) * | 2017-07-31 | 2017-12-15 | 郑州云海信息技术有限公司 | Determine the method and its network equipment in path |
| CN107689919A (en) * | 2017-09-20 | 2018-02-13 | 北京科技大学 | The dynamic adjustment weight fuzzy routing method of SDN |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
| CN108366093A (en) * | 2018-01-16 | 2018-08-03 | 北京邮电大学 | One kind being based on the distributed wireless ad hoc network of " virtual center " and " mobile agent " |
| CN108512760A (en) * | 2018-03-09 | 2018-09-07 | 西安电子科技大学 | The method for routing of QoS of survice is ensured based on SDN |
| CN108600102A (en) * | 2018-03-29 | 2018-09-28 | 北京交通大学 | A kind of flexible data Transmission system in the contract network based on wisdom |
| US10148551B1 (en) * | 2016-09-30 | 2018-12-04 | Juniper Networks, Inc. | Heuristic multiple paths computation for label switched paths |
| CN109120525A (en) * | 2017-06-26 | 2019-01-01 | 中国电信股份有限公司 | For the determining method of path of SDN, device, SDN controller and network |
| WO2019011338A1 (en) * | 2017-07-13 | 2019-01-17 | 华为技术有限公司 | Method for determining shortest path and controller |
| US20190036779A1 (en) * | 2017-07-31 | 2019-01-31 | Cisco Technology, Inc. | Virtualized software-defined network |
| CN110995591A (en) * | 2019-12-06 | 2020-04-10 | 苏州浪潮智能科技有限公司 | Method, device and medium for selecting optimal path based on link layer discovery protocol |
-
2020
- 2020-08-20 CN CN202010841802.0A patent/CN111917645A/en active Pending
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150103672A1 (en) * | 2013-10-14 | 2015-04-16 | Hewlett-Packard Development Company, L.P | Data flow path determination |
| US10148551B1 (en) * | 2016-09-30 | 2018-12-04 | Juniper Networks, Inc. | Heuristic multiple paths computation for label switched paths |
| CN107135159A (en) * | 2017-03-31 | 2017-09-05 | 武汉绿色网络信息服务有限责任公司 | The method and system that optimal path is determined in a kind of SDN |
| CN109120525A (en) * | 2017-06-26 | 2019-01-01 | 中国电信股份有限公司 | For the determining method of path of SDN, device, SDN controller and network |
| CN107135158A (en) * | 2017-07-11 | 2017-09-05 | 北京工业大学 | Optimal route selection method in a kind of multi-path transmission |
| WO2019011338A1 (en) * | 2017-07-13 | 2019-01-17 | 华为技术有限公司 | Method for determining shortest path and controller |
| CN107483337A (en) * | 2017-07-31 | 2017-12-15 | 郑州云海信息技术有限公司 | Determine the method and its network equipment in path |
| US20190036779A1 (en) * | 2017-07-31 | 2019-01-31 | Cisco Technology, Inc. | Virtualized software-defined network |
| CN107689919A (en) * | 2017-09-20 | 2018-02-13 | 北京科技大学 | The dynamic adjustment weight fuzzy routing method of SDN |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
| CN108366093A (en) * | 2018-01-16 | 2018-08-03 | 北京邮电大学 | One kind being based on the distributed wireless ad hoc network of " virtual center " and " mobile agent " |
| CN108512760A (en) * | 2018-03-09 | 2018-09-07 | 西安电子科技大学 | The method for routing of QoS of survice is ensured based on SDN |
| CN108600102A (en) * | 2018-03-29 | 2018-09-28 | 北京交通大学 | A kind of flexible data Transmission system in the contract network based on wisdom |
| CN110995591A (en) * | 2019-12-06 | 2020-04-10 | 苏州浪潮智能科技有限公司 | Method, device and medium for selecting optimal path based on link layer discovery protocol |
Non-Patent Citations (2)
| Title |
|---|
| 侯晓婷: ""基于SDN的动态负载均衡最优路径算法研究"", 《微型机与应用》, 25 December 2017 (2017-12-25) * |
| 池亚平等: "SDN架构下的链路分离路径算法的研究", 《计算机应用与软件》, no. 09, 12 September 2018 (2018-09-12) * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113328893A (en) * | 2021-06-10 | 2021-08-31 | 北京知道创宇信息技术股份有限公司 | Network topology mapping completeness evaluation method and system, electronic equipment and computer readable storage medium |
| CN114124791A (en) * | 2021-12-08 | 2022-03-01 | 中国电子科技集团公司第三十四研究所 | SPTN (shortest path transport network) network tunnel rerouting method |
| CN115002022A (en) * | 2022-04-29 | 2022-09-02 | 中国航空无线电电子研究所 | Route configuration generation method for RapidIO network |
| CN115002022B (en) * | 2022-04-29 | 2023-10-13 | 中国航空无线电电子研究所 | Route configuration generation method for rapidIO network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109257287B (en) | Shortest path determining method and controller | |
| CN111917645A (en) | SDN-based path optimization method and system for mobile network | |
| CN106209623B (en) | Method and control device for determining forwarding path | |
| CN110011913B (en) | Path calculation method and system | |
| JP5869041B2 (en) | Method for mapping network topology request to physical network, computer program product, mobile communication system, and network configuration platform | |
| CN113037527B (en) | Network slice creation method, message forwarding method and device thereof | |
| CN109274589B (en) | Service transmission method and device | |
| Li et al. | Farsighted spectrum resource assignment method for advance reservation requests in elastic optical networks | |
| CN112822106A (en) | Segment routing service processing method, device, source node and storage medium | |
| US20150043911A1 (en) | Network Depth Limited Network Followed by Compute Load Balancing Procedure for Embedding Cloud Services in Software-Defined Flexible-Grid Optical Transport Networks | |
| CN110650092B (en) | Data processing method and device | |
| CN109286563B (en) | Data transmission control method and device | |
| CN110062301B (en) | Routing method, device, equipment and storage medium | |
| CN108075981B (en) | Transmission method of link state data packet and routing node | |
| CN105207906A (en) | Service path determining method and device | |
| CN111405614A (en) | Method for calculating APP load sharing at mobile edge | |
| CN110417653A (en) | Message forwarding method, device and message transmission control method, device | |
| EP4075739B1 (en) | Service chain forwarding control methods and devices | |
| CN107295038B (en) | Method and device for establishing interface group | |
| CN117319343A (en) | Policy routing implementation method, device and storage medium | |
| EP3220581B1 (en) | Method and system for restoring optical layer service | |
| Kinoshita et al. | Joint bandwidth scheduling and routing method for large file transfer with time constraint and its implementation | |
| CN102685004A (en) | Method for implementing traffic engineering in GMPLS/OBS (generalized multi-protocol label switching/optical burst switching) network | |
| EP3425859B1 (en) | Multi-layer lsp control method and apparatus | |
| CN113873359A (en) | Optical transport network route calculation method, 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 | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20221230 |
|
| AD01 | Patent right deemed abandoned |