CN114500353A - Routing method, routing device, electronic equipment and storage medium - Google Patents
Routing method, routing device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114500353A CN114500353A CN202210070700.2A CN202210070700A CN114500353A CN 114500353 A CN114500353 A CN 114500353A CN 202210070700 A CN202210070700 A CN 202210070700A CN 114500353 A CN114500353 A CN 114500353A
- Authority
- CN
- China
- Prior art keywords
- information
- path
- delay
- network
- routing
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000004422 calculation algorithm Methods 0.000 claims description 14
- 230000008569 process Effects 0.000 claims description 11
- 230000007704 transition Effects 0.000 claims description 8
- 238000012545 processing Methods 0.000 claims description 7
- 230000037361 pathway Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
-
- 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
- H04L45/121—Shortest path evaluation by minimising delays
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
According to the routing method, the routing device, the electronic device and the storage medium, by acquiring the requirement information of the application, the requirement information comprises: and the first bandwidth information, the delay information and the path node information are used for quickly selecting the route based on the demand information, so that the route selection based on the typical network performance index is realized.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a routing method, a routing device, an electronic device, and a storage medium.
Background
With the widespread of the internet, the network performance requirements of users faced by network service providers are also more and more severe. On one hand, the network application has higher requirements on the network forwarding performance, for example, the requirements of the high-definition video application on the network bandwidth can reach dozens of Mbps; on the other hand, the requirements of different network applications on network performance are more diversified and refined, for example, video applications usually pay more attention to bandwidth, and conference communication software and the like pay more attention to network delay. In addition, with the development of cloud computing and network function virtualization, network traffic often needs to have detailed requirements on the sequence of functional nodes flowing through, such as requiring that the traffic first pass through the filtering of firewall nodes.
The existing routing algorithm is biased to be single and cannot support routing of such fine and diversified routes. A common routing algorithm is usually based on shortest path routing, for example, a common RIP/OSPF protocol is usually based on shortest routing hop number to perform routing, and cannot support selection of a high-bandwidth and low-delay path; although the BGP protocol supports selection of nodes for forwarding paths, its configuration and updating are complex and rarely used for network forwarding in autonomous domains. At present, some routing algorithms supporting multiple performance indexes usually rely on optimization algorithms under multiple constraint conditions, and many such algorithms have no solutions within polynomial time, and some heuristic algorithms are usually needed to obtain results quickly, so that routing results cannot completely meet the performance requirements of users.
In summary, a fast routing algorithm supporting typical network performance index requirements is still lacking at present.
Disclosure of Invention
The present application provides a routing method, a routing device, an electronic device, and a storage medium, which address the above problems in the related art.
The application provides a routing method, which comprises the following steps:
acquiring requirement information of an application, wherein the requirement information comprises: first bandwidth information, delay information, and path node information;
removing links lower than the first bandwidth information in the first network topology to obtain a second network topology map;
determining a logical topology graph based on the second network topology graph and the pathway node information;
and performing routing based on the delay information and the logic topological graph.
In some embodiments, each link in the network topology has second bandwidth information, and the removing links lower than the bandwidth information in the first network topology map to obtain a second network topology map includes:
comparing the second bandwidth information of each link in the first network topological graph with the first bandwidth information;
determining second bandwidth information smaller than the first bandwidth information based on the size relationship;
and removing links corresponding to second bandwidth information smaller than the first bandwidth information from the first network topological graph to obtain a second network topological graph.
In some embodiments, said determining a logical topology map based on said second network topology map and said pathway node information comprises:
determining a path requirement expressed by a regular expression based on the path node information;
constructing a non-deterministic finite state automaton corresponding to the path requirement;
and constructing the logic topological graph based on the non-deterministic finite state automata corresponding to the path demand and the second network topological graph.
In some embodiments, the logical topology representation is represented as Gr＝(Vr,Er) Wherein V isrWhere, V × Q uto { s, t }, where V uto, where, V uto)rRepresenting a collection of network nodes v, ErA set formed by network links E, Q is a state set, s and t are nodes in the path node information, and one is in ErFrom (v) ofi,qi) To (v)j,qj) If and only if it: (v)i,qi) And (v)j,qj) Satisfies (v)i,vj) Is a legitimate path in the first network topology graph, and (q)i,qj) Processing v in non-deterministic finite state automatajA legal state transition of; for a logical link to s, there is one from s to (v)i,qi) If and only if (q)0,qi) Is to process viLegal state transition of q0An initial state of the non-deterministic finite state automaton; for a logical link connected to t, there is one slave (v)i,qi) Tothe side of t is if and only if qiIs the accepting state of a non-deterministic finite state automaton.
In some embodiments, said routing based on said delay information and said logical topology map comprises:
selecting the total delay of each path from s to t in the logic topological graph by adopting a Dixose algorithm;
determining a target path based on the total delay and the delay information.
In some embodiments, said determining a target path based on said total delay and said delay information comprises:
determining whether a minimum total delay is greater than the delay information;
determining a path corresponding to the minimum total delay as a logic path under the condition that the minimum total delay is smaller than the delay information;
a target path is determined based on the logical path.
In some embodiments, the method further comprises:
and outputting alarm information and outputting a path corresponding to the minimum total delay under the condition that the minimum total delay is greater than the delay information.
An embodiment of the present application provides an image processing apparatus, including:
an obtaining module, configured to obtain requirement information of an application, where the requirement information includes: first bandwidth information, delay information, and path node information;
the removing module is used for removing links lower than the first bandwidth information in the first network topology to obtain a second network topology map;
a first determining module, configured to determine a logical topology map based on the second network topology map and the pathway node information;
and the routing module is used for carrying out routing based on the delay information and the logic topological graph.
Embodiments of the present application provide a storage medium storing a computer program, which can be executed by one or more processors, and can be used to implement any one of the routing methods described above.
According to the routing method, the routing device, the electronic device and the storage medium, by acquiring the requirement information of the application, the requirement information comprises: and the first bandwidth information, the delay information and the path node information are used for quickly selecting the route based on the demand information, so that the route selection based on the typical network performance index is realized.
Drawings
The present application will be described in more detail below on the basis of embodiments and with reference to the accompanying drawings.
Fig. 1 is a schematic flow chart illustrating an implementation of a routing method according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a routing device according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
In the drawings, like parts are designated with like reference numerals, and the drawings are not drawn to scale.
Detailed Description
In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be described in further detail with reference to the attached drawings, the described embodiments should not be considered as limiting the present application, and all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.
In the following description, reference is made to "some embodiments" which describe a subset of all possible embodiments, but it is understood that "some embodiments" may be the same subset or different subsets of all possible embodiments, and may be combined with each other without conflict.
The following description will be added if a similar description of "first \ second \ third" appears in the application file, and in the following description, the terms "first \ second \ third" merely distinguish similar objects and do not represent a specific ordering for the objects, and it should be understood that "first \ second \ third" may be interchanged under certain circumstances in a specific order or sequence, so that the embodiments of the application described herein can be implemented in an order other than that shown or described herein.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the present application only and is not intended to be limiting of the application.
Based on the problems in the related art, the embodiments of the present application provide a routing method, which is applied to an electronic device, where the electronic device may be a mobile terminal, a computer, a router, a switch, a server, and the like. The functions implemented by the routing method provided in the embodiments of the present application may be implemented by calling program codes by a processor of an electronic device, where the program codes may be stored in a computer storage medium.
An embodiment of the present application provides a routing method, and fig. 1 is a schematic flow chart illustrating an implementation of the routing method provided in the embodiment of the present application, as shown in fig. 1, including:
step S1, obtaining requirement information of the application, where the requirement information includes: first bandwidth information, delay information, and path node information.
In the embodiment of the application, the application can provide a language interface for representing the user requirement, and the user can use the language interface to indicate the identity and the requirement information of the user.
In the embodiment of the application, the language interface representing the user requirement comprises an identity (identity) part and a requirement (request) part. The identity is used to represent the name or type of the user application, and the identity may also be extended to include a user identity, a device or virtual machine identifier to provide more detailed identity management. The requirement information represents the requirements of the application. In the embodiment of the present application, the requirement information includes: first bandwidth information, delay information, and path node information. The first bandwidth information and the delay information are the most representative QoS indexes.
In the embodiment of the application, after the application determines the demand information, the demand information is sent to the electronic equipment, so that the electronic equipment obtains the demand information.
In some embodiments, the requirement information of the application may be acquired through input of an external storage device, where the external storage device may be a usb disk, a mechanical hard disk, or the like; the requirement information of the application can also be acquired by means of network receiving, such as the internet, a local area network; or may be obtained by reading local data, etc.
Illustratively, the first bandwidth information is that the bandwidth is not lower than B, the delay information is that the delay is not higher than D, and the path node information is from node s to node t.
And step S2, removing links lower than the first bandwidth information in the first network topology to obtain a second network topology map.
In the embodiment of the present application, the first network topology is represented as a graph G ═ (V, E), where V represents a set of network nodes V (V ∈ V), which may be hosts, switching devices, and the like, and E represents a set of network links E (E ∈ E). Each link e ═ u, V, where u and V represent the start and end points of the link, respectively (u, V ∈ V), with two attributes: bandwidth and delay. Bandwidth bu,vRepresenting the bandwidth from u to v, delay du,Representing the delay from the u to v link. Thus, a given path p ═ v (v)1,v2,…,vn),viE.v, the bandwidth of this path can be expressed as the smallest link bandwidth on the path, i.e. bp＝min(u,v)∈ pbu,v(ii) a The delay of this path is expressed as the sum of the delays of the links, i.e. dp＝Σ(u,v)∈pdu,v。
In the embodiment of the application, the size relationship between the second bandwidth information and the first bandwidth information of each link in the first network topology map can be compared; determining second bandwidth information smaller than the first bandwidth information based on the size relationship; and removing links corresponding to second bandwidth information smaller than the first bandwidth information from the first network topological graph to obtain a second network topological graph.
Taking the above example in mind, the topology G is pruned (i.e., dropped), and the graph is prunedObtaining a second network topological graph after pruning the links with the bandwidth lower than B
Step S3, determining a logical topology map based on the second network topology map and the path node information.
In the embodiment of the application, the path requirements are determined to be expressed by adopting a regular expression based on the path node information; constructing a non-deterministic finite state automaton corresponding to the path requirement; and constructing the logic topological graph based on the non-deterministic finite state automata corresponding to the path demand and the second network topological graph.
Illustratively, the path requirement r expressed using a regular expression is expressed according to the path node information. Constructing r corresponding non-deterministic finite state automata (NFA) which comprises a state set Q, and then constructing a novel logic topological graph G according to G' and rr. In the embodiment of the present application, the logical topology is represented by Gr＝(Vr,Er) Wherein V isrVixq utou { s, t }, where V ═ Q utou { s, t }, where V {, Q } is equal to V {, Q {, t }, where V {, Q } is equal to V { (r) } Q { (r), where V { (r) } Q { (r), V { (r) } Q { (r)rRepresents a collection of network nodes v, ErA set formed by network links E, Q is a state set, s and t are nodes in the path node information, and one is in ErFrom (v) ofi,qi) To (v)j,qj) If and only if it: (v)i,qi) And (v)j,qj) Satisfies (v)i,vj) Is a legitimate path in the first network topology graph, and (q)i,qj) Processing v in non-deterministic finite state automatajA legal state transition of; for a logical link to s, there is one from s to (v)i,qi) If and only if (q)0,qi) Is to process viLegal state transition of q0An initial state of the non-deterministic finite state automaton; for a logical link connected to t, there is one slave (v)i,qi) The side to t is if and only if qiIs the accepting state of a non-deterministic finite state automaton.
In the embodiment of the application, the path obtained by routing on the logic topological graph can meet the attribute of dual requirements of physical topology and path expression.
And step S4, performing routing based on the delay information and the logic topological graph.
In the embodiment of the application, a Dikes algorithm can be adopted to select the total delay of each path from s to t in the logic topological graph; determining a target path based on the total delay and the delay information. In the embodiment of the present application, since we have deleted the link with the bandwidth lower than B, we only need to select the link with the smallest delay.
In the embodiment of the application, the logic topology adopts Dijkstra algorithm, and selects the link with the minimum delay from s to t; determining a path corresponding to the minimum total delay as a logic path when the minimum total delay is smaller than the delay information; a target path is determined based on the logical path.
Taking the above example in mind, it is calculated whether the sum of the delays of the links does not exceed D, and if the condition is satisfied, the link is determined to be the target link.
In the embodiment of the present application, when the minimum total delay is greater than the delay information, alarm information is output, and a path corresponding to the minimum total delay is output.
In the embodiment of the application, the form of the returned logic path is
Only the physical node in the node is extracted to obtain an actual path
The routing method provided by the embodiment of the application is used for a network with a centralized network control server. The network manager needs to provide an interface for the application to indicate the identity and the requirement by using the language interface provided by the invention, and the interface can have various implementation methods, such as HTTPS communication or modification of the existing network communication protocol (such as modification of a DHCP protocol). The administrator needs to select a route by using the algorithm provided by the invention according to the user requirements, and maps the message sent by the user to a corresponding path.
The routing method provided by the embodiment of the application can support three typical user requirements, including flow forwarding path node requirements, bandwidth requirements and delay requirements, and the algorithm can quickly complete routing calculation, so that the possibility is provided for meeting various requirements of network application.
Based on the foregoing embodiments, the present application provides a routing device, where each module included in the routing device and each unit included in each module can be implemented by a processor in a computer device; of course, the implementation can also be realized through a specific logic circuit; in the implementation process, the processor may be a Central Processing Unit (CPU), a Microprocessor Unit (MPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), or the like.
An embodiment of the present application provides a routing device, and fig. 2 is a schematic structural diagram of the routing device provided in the embodiment of the present application, and as shown in fig. 2, the routing device 200 includes:
an obtaining module 201, configured to obtain requirement information of an application, where the requirement information includes: first bandwidth information, delay information, and path node information;
a removing module 202, configured to remove a link in the first network topology that is lower than the first bandwidth information to obtain a second network topology map;
a first determining module 203, configured to determine a logical topology map based on the second network topology map and the path node information;
a routing module 204, configured to perform routing based on the delay information and the logical topology.
In some embodiments, each link in the network topology has second bandwidth information, and the removing module 202 includes:
the comparison unit is used for comparing the size relationship between the second bandwidth information and the first bandwidth information of each link in the first network topological graph;
a first determination unit configured to determine second bandwidth information smaller than the first bandwidth information based on the size relationship;
and the removing unit is used for removing a link corresponding to second bandwidth information smaller than the first bandwidth information from the first network topological graph to obtain a second network topological graph.
In some embodiments, the first determining module 203 comprises:
the second determining unit is used for determining the path requirement expressed by a regular expression based on the path node information;
the construction unit is used for constructing a non-deterministic finite state automaton corresponding to the path requirement;
and the third determining unit is used for constructing the logic topological graph based on the non-deterministic finite state automata corresponding to the path demand and the second network topological graph.
In some embodiments, the logical topology representation is represented as Gr＝(Vr,Er) Wherein V isrVixq utou { s, t }, where V ═ Q utou { s, t }, where V {, Q } is equal to V {, Q {, t }, where V {, Q } is equal to V { (r) } Q { (r), where V { (r) } Q { (r), V { (r) } Q { (r)rRepresenting a collection of network nodes v, ErA set formed by network links E, Q is a state set, s and t are nodes in the path node information, and one is in ErFrom (v) ofi,qi) To (v)j,qj) If and only if it: (v)i,qi) And (v)j,qj) Satisfies (v)i,vj) Is a legitimate path in the first network topology graph, and (q)i,qj) Processing v in non-deterministic finite state automatajA legal state transition of; for a logical link to s, there is one from s to (v)i,qi) If and only if (q)0,qi) Is to process viLegal state transition of q0An initial state of the non-deterministic finite state automaton; for a logical link connected to t, there is one slave (v)i,qi) The side to t is if and only if qiIs the accepting state of a non-deterministic finite state automaton.
In some embodiments, the routing module 204 includes:
the first calculation unit is used for selecting the total delay of each path from s to t in the logic topological graph by adopting a Dixosta algorithm;
a fourth determining unit for determining a target path based on the total delay and the delay information.
In some embodiments, the fourth determining unit includes:
a first determining subunit configured to determine whether a minimum total delay is greater than the delay information;
a second determining subunit, configured to determine, when the minimum total delay is smaller than the delay information, a path corresponding to the minimum total delay as a logic path;
a third determining subunit, configured to determine a target path based on the logical path.
In some embodiments, the routing module further comprises:
and the output unit is used for outputting alarm information and outputting a path corresponding to the minimum total delay under the condition that the minimum total delay is greater than the delay information.
It should be noted that, in the embodiment of the present application, if the routing method is implemented in the form of a software functional module and sold or used as a standalone product, the routing method may also be stored in a computer-readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially implemented or portions thereof contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read Only Memory (ROM), a magnetic disk, or an optical disk. Thus, embodiments of the present application are not limited to any specific combination of hardware and software.
Accordingly, an embodiment of the present application provides a storage medium, on which a computer program is stored, wherein the computer program is executed by a processor to implement the steps in the routing method provided in the above embodiment.
The embodiment of the application provides an electronic device; fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application, and as shown in fig. 3, the electronic device 300 includes: a processor 301, at least one communication bus 302, a user interface 303, at least one external communication interface 304, a memory 305. Wherein the communication bus 302 is configured to enable connective communication between these components. The user interface 303 may comprise a display screen, and the external communication interface 304 may comprise a standard wired interface and a wireless interface, among others. The processor 301 is configured to execute a program of the routing method stored in the memory to implement the steps in the routing method provided in the above-described embodiments.
Here, it should be noted that: the above description of the storage medium and the electronic device embodiments is similar to the description of the method embodiments described above, with similar advantageous effects as the method embodiments. For technical details not disclosed in the embodiments of the storage medium and apparatus of the present application, reference is made to the description of the embodiments of the method of the present application for understanding.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present application. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application. The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the processes, methods, objects, or apparatuses comprising the element.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as a removable Memory device, a Read Only Memory (ROM), a magnetic disk, or an optical disk.
Alternatively, the integrated units described above in the present application may be stored in a computer-readable storage medium if they are implemented in the form of software functional modules and sold or used as independent products. Based on such understanding, the technical solutions of the embodiments of the present application may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a controller to execute all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.
The above description is only for the embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A routing method, the method comprising:
acquiring requirement information of an application, wherein the requirement information comprises: first bandwidth information, delay information, and path node information;
removing links lower than the first bandwidth information in the first network topology to obtain a second network topology graph;
determining a logical topology graph based on the second network topology graph and the pathway node information;
and performing routing based on the delay information and the logic topological graph.
2. The method of claim 1, wherein each link in the network topology has second bandwidth information, and wherein removing links in the first network topology that are lower than the bandwidth information to obtain a second network topology comprises:
comparing the second bandwidth information of each link in the first network topological graph with the first bandwidth information;
determining second bandwidth information smaller than the first bandwidth information based on the size relationship;
and removing links corresponding to second bandwidth information smaller than the first bandwidth information from the first network topological graph to obtain a second network topological graph.
3. The method of claim 1, wherein determining a logical topology graph based on the second network topology graph and the pathway node information comprises:
determining a path requirement expressed by a regular expression based on the path node information;
constructing a non-deterministic finite state automaton corresponding to the path requirement;
and constructing the logic topological graph based on the non-deterministic finite state automata corresponding to the path demand and the second network topological graph.
4. The method of claim 3, wherein the logical topology graph is represented as Gr＝(Vr，Er) Wherein V isrVixq utou { s, t }, where V ═ Q utou { s, t }, where V {, Q } is equal to V {, Q {, t }, where V {, Q } is equal to V { (r) } Q { (r), where V { (r) } Q { (r), V { (r) } Q { (r)rRepresenting a collection of network nodes v, ErA set formed by network links E, Q is a state set, s and t are nodes in the path node information, and one is in ErFrom (v) ofi，qi) To (v)j，qj) If and only if it: (v)i，qi) And (v)j，qj) Satisfies (v)i，vj) Is a legitimate path in the first network topology graph, and (q)i，qj) Processing v in non-deterministic finite state automatajA legal state transition of; for a logical link to s, there is one from s to (v)i，qi) If and only if (q)0，qi) Is to process viLegal state transition of q0An initial state of the non-deterministic finite state automaton; for a logical link connected to t, there is one slave (v)i，qi) The side to t is if and only if qiIs the accepting state of a non-deterministic finite state automaton.
5. The method of claim 4, wherein the routing based on the delay information and the logical topology graph comprises:
selecting the total delay of each path from s to t in the logic topological graph by adopting a Dixose algorithm;
determining a target path based on the total delay and the delay information.
6. The method of claim 5, wherein determining a target path based on the total delay and the delay information comprises:
determining whether a minimum total delay is greater than the delay information;
determining a path corresponding to the minimum total delay as a logic path under the condition that the minimum total delay is smaller than the delay information;
a target path is determined based on the logical path.
7. The method of claim 6, further comprising:
and outputting alarm information and outputting a path corresponding to the minimum total delay under the condition that the minimum total delay is greater than the delay information.
8. A routing device, comprising:
an obtaining module, configured to obtain requirement information of an application, where the requirement information includes: first bandwidth information, delay information, and path node information;
the removing module is used for removing links lower than the first bandwidth information in the first network topology to obtain a second network topology map;
a first determining module for determining a logical topology map based on the second network topology map and the pathway node information;
and the routing module is used for carrying out routing based on the delay information and the logic topological graph.
9. An electronic device, comprising:
a memory and a processor, the memory having stored thereon a computer program which, when executed by the processor, performs the routing method according to any one of claims 1 to 7.
10. A storage medium storing a computer program executable by one or more processors and operable to implement a routing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210070700.2A CN114500353A (en) | 2022-01-21 | 2022-01-21 | Routing method, routing device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210070700.2A CN114500353A (en) | 2022-01-21 | 2022-01-21 | Routing method, routing device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114500353A true CN114500353A (en) | 2022-05-13 |
Family
ID=81472211
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210070700.2A Pending CN114500353A (en) | 2022-01-21 | 2022-01-21 | Routing method, routing device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114500353A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080170510A1 (en) * | 2007-01-11 | 2008-07-17 | Oracle International Corporation | Efficient Determination Of Fast Routes When Voluminous Data Is To Be Sent From A Single Node To Many Destination Nodes Via Other Intermediate Nodes |
| US8577817B1 (en) * | 2011-03-02 | 2013-11-05 | Narus, Inc. | System and method for using network application signatures based on term transition state machine |
| CN104753916A (en) * | 2013-12-30 | 2015-07-01 | 凯为公司 | Method and apparatus for processing of finite automata |
| US20190098046A1 (en) * | 2016-03-17 | 2019-03-28 | Johann Schlamp | Constructible automata for internet routes |
-
2022
- 2022-01-21 CN CN202210070700.2A patent/CN114500353A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080170510A1 (en) * | 2007-01-11 | 2008-07-17 | Oracle International Corporation | Efficient Determination Of Fast Routes When Voluminous Data Is To Be Sent From A Single Node To Many Destination Nodes Via Other Intermediate Nodes |
| US8577817B1 (en) * | 2011-03-02 | 2013-11-05 | Narus, Inc. | System and method for using network application signatures based on term transition state machine |
| CN104753916A (en) * | 2013-12-30 | 2015-07-01 | 凯为公司 | Method and apparatus for processing of finite automata |
| US20190098046A1 (en) * | 2016-03-17 | 2019-03-28 | Johann Schlamp | Constructible automata for internet routes |
Non-Patent Citations (1)
| Title |
|---|
| 陈继明等: "基于正则路径表达式的XML查询优化技术研究", 《计算机科学》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI813743B (en) | Independent datastore in a network routing environment | |
| US7990877B2 (en) | Method and apparatus for dynamically runtime adjustable path computation | |
| CN112087379B (en) | Service chain arranging method and device, storage medium and electronic device | |
| US20060171333A1 (en) | Network configuration management apparatus, network configuration management program and network configuration management method | |
| CN101971563A (en) | Method and apparatus for providing full logical connectivity in mpls networks | |
| US10367686B2 (en) | Automatically detecting roles of nodes in layered network topologies | |
| EP1984819A2 (en) | Techniques for decreasing queries to discover routes in an interior gateway protocol | |
| US11070434B2 (en) | Communications network node | |
| US20180367440A1 (en) | Method and apparatus for determining next hop and advertising routing information | |
| CN112532408B (en) | Method, device and storage medium for extracting fault propagation condition | |
| WO2017077521A1 (en) | A data augmentation pipeline for augmenting events and/or data associated with events | |
| WO2009074098A1 (en) | A method and an equipment for dispatching the optical layer wavelength from end to end | |
| WO2016004752A1 (en) | Method and device for determining end-to-end routing | |
| CN114500353A (en) | Routing method, routing device, electronic equipment and storage medium | |
| CN110851275A (en) | Load transfer method and device for routing node | |
| JP2013175913A (en) | Communication system, path determination device, path determination method, and path determination program | |
| JP6658134B2 (en) | Cost setting device, method and program | |
| CN109861908A (en) | A kind of routing conversion and equipment | |
| CN114531360A (en) | Semantic name acquisition method, device, equipment and storage medium | |
| Bórquez-Paredes et al. | Agent-based distributed protocol for resource discovery and allocation of virtual networks over elastic optical networks | |
| JP6721549B2 (en) | Service construction order determination device and service construction order determination method | |
| CN113507411B (en) | Path selection method, device, equipment and storage medium | |
| US20240064089A1 (en) | Priority based route programing and advertising | |
| TWI839379B (en) | Single node and multiple node datastore architecture in a network routing environment | |
| WO2023005993A1 (en) | Method and apparatus for selecting cloud platform, and device, and 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220513 |