CN113872856B - Path calculation method and device in SD-WAN environment - Google Patents
Path calculation method and device in SD-WAN environment Download PDFInfo
- Publication number
- CN113872856B CN113872856B CN202111130386.4A CN202111130386A CN113872856B CN 113872856 B CN113872856 B CN 113872856B CN 202111130386 A CN202111130386 A CN 202111130386A CN 113872856 B CN113872856 B CN 113872856B
- Authority
- CN
- China
- Prior art keywords
- wan
- domain
- link
- path
- request
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 31
- 230000007246 mechanism Effects 0.000 claims abstract description 30
- 238000000034 method Methods 0.000 claims abstract description 19
- 238000001514 detection method Methods 0.000 claims description 3
- 238000011084 recovery Methods 0.000 abstract description 12
- 238000000926 separation method Methods 0.000 abstract description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 230000011664 signaling Effects 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/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a path calculation method and a path calculation device in an SD-WAN environment, which belong to the technical field of path calculation and comprise the following steps: s101: obtaining an optimal solution of the SD-WAN by setting a target equation and related constraint conditions; s102: carrying out layered solution on the SD-WAN; s103: after solving the IPL between domains and in the domains, extracting the non-zero variables and values of the domains which belong to the request, and connecting the corresponding links to obtain corresponding calculation paths; s104: the link is verified. The method comprises the steps of setting a domain-by-domain protection mechanism, establishing a standby path along a domain sequence which is the same as that of a main path, realizing high-degree link separation of a working path and a protection path in a domain, protecting the intra-domain fault by using intra-domain resources, limiting the propagation of fault information in the domain, and having relatively short recovery time and relatively low implementation difficulty.
Description
Technical Field
The invention relates to the technical field of path calculation, in particular to a path calculation method and device in an SD-WAN environment.
Background
The SD-WAN (software defined Wide area network) is a service formed by applying SDN technology to a wide area network scene, is used for connecting enterprise networks, data centers, internet applications and cloud services in a wide geographic range, and can enable users to obtain better network use experience through the SD-WAN technology.
The application demand scenario of the SDN technology is actively explored globally, and currently, the mainstream demand scenarios include virtualization in a data center, wide area network traffic optimization, mobile backhaul network IPRAN, IP access network/metropolitan area network, transport network, service chain and service route, IP + optical collaborative networking, network security, and the like.
In order to improve the reliability of the SD-WAN, the SD-WAN survivability problem is widely regarded and researched, and the mechanisms for improving the SD-WAN survivability can be divided into two types: compared with the protection mechanism and the recovery mechanism, the protection mechanism calculates the backup path before the failure occurs, can provide faster failure recovery and can ensure the recovery of the single link failure; the recovery mechanism uses the remaining resources in the network to perform dynamic rerouting after the failure occurs, thereby having lower resource consumption. However, since the failure recovery time of the recovery mechanism is long and recovery of a single failure cannot be ensured, it is not suitable for a service requiring high survivability. The protection mechanism provides "pre" protection against possible link failures by establishing both working and protection paths. Most protection mechanisms are designed for single-domain networks, depend on detailed topological information, and have certain difficulty in expanding the protection mechanisms to multi-domain networks.
In order to solve the problems, a domain-by-domain protection mechanism is supposed to be adopted to limit the working path and the protection path in the same domain sequence, but the assumed implementation has high requirements on inter-domain connectivity, and the limitation not only reduces the risk resistance in the case of multiple faults, but also makes traffic engineering between domains difficult to implement. If the existing end-to-end protection mechanism is adopted, a two-step distributed path calculation method is needed, namely, a loose route is calculated in an abstract high-level inter-domain topological structure, and then the loose route is expanded into an intra-domain path through distributed signaling, wherein the end-to-end protection mechanism increases the 'domain' difference between a working path and a protection path. However, the existing end-to-end protection mechanism relies on a routing method for obtaining a global network skeleton, which has too high overhead and computation complexity, and is not suitable for being applied in an actual network.
Disclosure of Invention
The invention aims to provide a path calculation method and a path calculation device in an SD-WAN (secure digital-to-Wide area network) environment, wherein a domain-by-domain protection mechanism is arranged, a standby path is established along a domain sequence which is the same as a main path, a working path and a protection path realize high-degree link separation in a domain, a fault in the domain can be protected by utilizing resources in the domain, the propagation of fault information can be limited in the domain, the recovery time is relatively short, and the realization difficulty is relatively low; different mechanisms depend on different topology abstract methods and routing mechanisms, and the protection mechanism is divided into domain-by-domain protection and end-to-end protection according to the domain difference of a main path and a protection path used in the SD-WAN environment, wherein the calculation method of the end-to-end protection path in the SD-WAN effectively reduces the routing overhead and the calculation complexity, and simultaneously achieves a better protection effect so as to solve the problems provided in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme: a path calculation method in an SD-WAN environment comprises the following steps:
s101: obtaining an optimal solution of the SD-WAN by setting a target equation and related constraint conditions;
s102: performing layered solution on the SD-WAN, specifically comprising the steps of performing solution on the SD-WAN between domains and performing solution on the SD-WAN in the domain;
s103: after solving the IPL between domains and in the domains, extracting the non-zero variables and values of the domains which belong to the request, and connecting the corresponding links to obtain corresponding calculation paths;
s104: and verifying the link, forming the connection from the source node to the destination node after the link is connected, and if the bandwidth unit is a predicted path, determining that the path is calculated correctly, otherwise, repeating the step S102.
Further, in S101, G = (V, E) is used to represent a network without wavelength consistency requirement, where V represents a node set, E represents an edge set, and for N routing requests, a vector (S) is used n ，d n ，r n ) Denotes the Nth request, where S n Representing a source node, d n Represents a target node, r n Representing the number of requested unit bandwidths or the number of wavelengths,
represents the traffic belonging to the nth request carried by link (i, j), is->
Represents the backup link traffic for the nth request carried by link (i, j), and->
Representing the capacity of the link, definition f n ∈(0,r n ) To aim at the r n The number of connections successfully established for each request, the following objective equation is set:
f n ∈{0,r n }n∈N,(i,j)∈E (8)
the formula (1) is an objective equation and consists of two parts, the number of successfully established requests and the total consumption of network resources, wherein w1 and w2 are constants and are used for adjusting the weight of the two parts;
the formulas (2) and (3) are respectively the flow constraints of the main path and the standby path;
equation (4) constrains the traffic carried on each link to be less than its link capacity;
equation (5) is a link disjoint constraint;
equations (6), (7) and (8) constrain the connection established by each request to make its flow value equal to or 0, or request bandwidth and wavelength number r n 。
Further, the S102 includes the steps of:
s121: solving the inter-domain SD-WAN, instantiating an SD-WAN equation according to the request and the topological structure, and obtaining the value of a target equation;
s122: and (4) solving the intra-domain SD-WAN, bringing the obtained request vector examples into an SD-WAN equation to obtain intra-domain requests, and performing intra-domain solution by domain to obtain detailed paths.
Further, in S121, the SD-WAN equation is instantiated according to a specific request and a topology structure using all topology information H (U, E) that is the same as the protection mechanism, so as to obtain a relationship between the number of equations and the network topology scale and the number of requests.
Further, the number of the acquisition equations is:
setting the number of target equations to be 1;
the equations (2) and (3) are flow constraints established by each request aiming at each node, and the quantity of the equations is Nx |. U |;
equation (4) is a link capacity constraint established for each link, the number of equations being N;
equation (5) is a link disjoint constraint established for each request, each link, with the number of equations nx E |;
the constraint conditions (6) and (7) are used for constraining the value ranges of the variables x and y, and the number of the constraint conditions is the number N x E of the variables;
the number of formula (8) is N;
then after instantiation, the total number of equations is: 1+2 (N x U |) +3 (N x E |) +2N.
Further, in the network topology H (U, E), the method
Indicating that a node in the field Di is pick>
Node to domain Dj
When i = j, the link is an abstract link between different boundary nodes in the same domain, and is/are->
To indicate that the link->
Up to the traffic carried by the nth request.
Further, the example of the obtained request vector is brought into an SD-WAN equation based on the processing of the inter-domain SD-WAN solution result, the instantiated equation is solved through a solving tool, the value of the target equation and the value of each variable are obtained, the flow on the virtual link in the domain can be obtained through the processing of the solution given by the SD-WAN, the information is used as the request in the domain, namely the request in the domain of each domain, the solution in the domain can be carried out by domain, and the detailed path is obtained;
for sub-requests of working path within domain (S) n ，d n ，r n ) Indicating that the sub-request of the protection path is signed (S) 1 n ，d 1 n ，r n ) Expressed, then the SD-WAN equation is as follows:
f n ∈{0,r n }n∈N,(i,j)∈E (16)
f 1 n ∈{0,r 1 n }n∈N,(i,j)∈E (17)
in the intra-domain Di, for the request fn, the corresponding relation when instantiating is:
the working link requests: (S) n ，d n ，r n ) Is converted into
Protection link request: (S) 1 n ，d 1 n ，r n ) Is converted into
Further, the links in S104 are connected to form a slave source node S n To destination node d n And bandwidth unit is r n A path.
According to another aspect of the present invention, there is provided a path computation apparatus in an SD-WAN environment, including a global SD-WAN composed of local SD-WANs vertically deployed by a plurality of controllers, where the local SD-WAN controller is a local controller, and manages network traffic in the local SD-WAN; and a top layer controller of the global SD-WAN is a root controller, and manages the network traffic of the global SD-WAN.
Further, the local area SD-WAN comprises a data plane, a control plane and an application plane, wherein the data plane consists of a switching node and a network link; the control plane is composed of a local area SD-WAN controller, and the controller comprises a south interface southbound interface, a north interface northbound interface, an East-west interface East-Westinterface, a data plane state detection module and a path calculation module; the application plane is accessed to the network by a network application service.
Compared with the prior art, the invention has the beneficial effects that:
1. the method and the device for calculating the path in the SD-WAN environment provided by the invention are characterized in that a domain-by-domain protection mechanism is arranged, a standby path is established along a domain sequence which is the same as a main path, a working path and a protection path realize high-degree link separation in a domain, a fault in the domain can be protected by utilizing resources in the domain, the propagation of fault information can be limited in the domain, the recovery time is relatively short, and the realization difficulty is relatively low.
2. According to the path calculation method and device in the SD-WAN environment, different mechanisms depend on different topological abstract methods and routing mechanisms, and the protection mechanism is divided into domain-by-domain protection and end-to-end protection according to the domain difference between a main path and a protection path used in the SD-WAN environment, wherein the calculation method of the end-to-end protection path in the SD-WAN effectively reduces routing overhead and calculation complexity, and meanwhile achieves a better protection effect.
Drawings
FIG. 1 is a flow chart of a method of path computation in an SD-WAN environment of the present invention;
fig. 2 is a flowchart for performing hierarchical solution on SD-WAN in the path calculation method in the SD-WAN environment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. 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 invention.
Referring to fig. 1, a path calculation method in an SD-WAN environment includes the steps of:
s101: obtaining an optimal solution of the SD-WAN by setting a target equation and related constraint conditions;
wherein, G = (V, E) is used for representing a network without wavelength consistency requirement, wherein V represents a node set, E represents an edge set, N route establishing requests are compared, and a vector (S) is used n ，d n ，r n ) Denotes the Nth request, where S n Representing a source node, d n Represents a target node, r n Representing the number of requested unit bandwidths or the number of wavelengths,
represents the traffic belonging to the nth request carried by link (i, j), is->
Represents the backup link traffic for the nth request carried by link (i, j), and->
Representing the capacity of the link, definition f n ∈(0,r n ) To aim at the r n The number of connections successfully established for each request, the following objective equation is set:
f n ∈{0,r n }n∈N,(i,j)∈E (8)
the formula (1) is an objective equation and consists of two parts, the number of successfully established requests and the total consumption of network resources, wherein w1 and w2 are constants and are used for adjusting the weight of the two parts;
the formulas (2) and (3) are respectively the flow constraints of the main path and the standby path;
equation (4) constrains the traffic carried on each link to be less than its link capacity;
equation (5) is a link disjoint constraint;
equations (6), (7) and (8) constrain the connection established by each request to make its flow value equal to or 0, or request bandwidth and wavelength number r n 。
S102: performing layered solution on the SD-WAN, specifically comprising the steps of performing solution on the SD-WAN between domains and performing solution on the SD-WAN in the domain;
s103: after solving the IPL between domains and in the domains, extracting the non-zero variables and values of the domains which belong to the request, and connecting the corresponding links to obtain corresponding calculation paths;
s104: link is verified, after the link is connected, the connection from source node to destination node is formed, and bandwidth unit is prediction path, said path is defined as correct calculation, and its contraryIn which the links are connected to form a slave source node S n To destination node d n And bandwidth unit is r n A path.
Referring to fig. 2, the S102 includes the steps of:
s121: solving the inter-domain SD-WAN, instantiating an SD-WAN equation according to the request and the topological structure, and obtaining the value of a target equation;
using all topology information H (U, E) which is the same as a protection mechanism, instantiating an SD-WAN equation according to a specific request and a topology structure, and obtaining the relation between the number of the equations and the network topology scale and the number of the requests; the number of the acquisition equations:
setting the number of target equations to be 1;
the equations (2) and (3) are flow constraints established by each request aiming at each node, and the quantity of the equations is Nx |. U |;
equation (4) is a link capacity constraint established for each link, the number of equations being N;
equation (5) is a link disjoint constraint established for each request, each link, with the number of equations nx E |;
the constraint conditions (6) and (7) are used for constraining the value ranges of the variables x and y, and the number of the constraint conditions is the number N x E of the variables;
the number of formula (8) is N;
then after instantiation, the total number of equations is: 1+2 (N x U |) +3 (N x E |) +2N.
In the network topology H (U, E), use
Indicating that a node in the field Di is pick>
Node ^ to field Dj>
When i = j, the link is an abstract link between different boundary nodes in the same domain, and is/are->
To indicate that the link->
Up to the traffic carried by the nth request.
S122: the method comprises the steps of solving an intra-domain SD-WAN, bringing an obtained instance of a request vector into an SD-WAN equation, obtaining intra-domain requests, performing intra-domain solution on a domain-by-domain basis, obtaining detailed paths, setting a domain-by-domain protection mechanism, establishing a standby path along a domain sequence which is the same as a main path, realizing high-degree link separation of a working path and a protection path in the domain, protecting intra-domain faults by using intra-domain resources, limiting propagation of fault information in the domain, relatively shortening recovery time and reducing implementation difficulty;
the method comprises the steps that an instance of an obtained request vector is brought into an SD-WAN equation based on the processing of an inter-domain SD-WAN solution result, the instantiated equation is solved through a solving tool, the value of a target equation and the value of each variable are obtained, the flow on an intra-domain virtual link can be obtained through the processing of the solution given by the SD-WAN, the information is used as an intra-domain request, namely the intra-domain request of each domain, the intra-domain solution can be carried out by domains, and a detailed path is obtained;
for sub-requests of working path within domain (S) n ，d n ，r n ) Indicating that the sub-request of the protection path is signed (S) 1 n ，d 1 n ，r n ) Expressed, then the SD-WAN equation is as follows:
f n ∈{0,r n }n∈N,(i,j)∈E (16)
f 1 n ∈{0,r 1 n }n∈N,(i,j)∈E (17)
in the intra-domain Di, for the request fn, the corresponding relation when instantiating is:
the working link requests: (S) n ，d n ，r n ) Is converted into
Protection link request: (S) 1 n ，d 1 n ，r n ) Is converted into
In order to better show the implementation of the path calculation method in the SD-WAN environment, the embodiment now provides a path calculation device in the SD-WAN environment, which includes a global SD-WAN composed of local SD-WANs vertically deployed by a plurality of controllers, where the local SD-WAN controller is a local controller, and manages network traffic in the local SD-WAN; a top controller of the global SD-WAN is a root controller, and manages the network flow of the global SD-WAN; the local area SD-WAN comprises a data plane, a control plane and an application plane, wherein the data plane consists of a switching node and a network link; the control plane is composed of a local area SD-WAN controller, and the controller comprises a south interface southbound interface, a north interface northbound interface, an East-west interface East-Westinterface, a data plane state detection module and a path calculation module; the application plane is accessed to the network by a network application service.
In summary, the following steps: according to the method and the device for calculating the path in the SD-WAN environment, a domain-by-domain protection mechanism is arranged, the standby path is established along the domain sequence which is the same as the main path, the working path and the protection path realize high-degree link separation in the domain, the intra-domain fault can be protected by using intra-domain resources, the propagation of fault information can be limited in the domain, the recovery time is relatively short, and the realization difficulty is relatively low; different mechanisms depend on different topology abstract methods and routing mechanisms, and the protection mechanism is divided into domain-by-domain protection and end-to-end protection according to the domain difference of a main path and a protection path used in the SD-WAN environment, wherein the calculation method of the end-to-end protection path in the SD-WAN effectively reduces the routing overhead and the calculation complexity, and simultaneously achieves a better protection effect.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be able to cover the technical solutions and the inventive concepts of the present invention within the technical scope of the present invention.
Claims (8)
1. A path calculation method in an SD-WAN environment is characterized by comprising the following steps:
s101: obtaining an optimal solution of the SD-WAN by setting a target equation and related constraint conditions;
s102: performing layered solution on the SD-WAN, specifically comprising the steps of performing solution on the SD-WAN between domains and performing solution on the SD-WAN in the domain;
s103: after solving the IPL between domains and in the domains, extracting the non-zero variables and values of the domains which belong to the request, and connecting the corresponding links to obtain corresponding calculation paths;
s104: verifying the link, forming a connection from the source node to the destination node after the link is connected, and if the bandwidth unit is a predicted path, determining that the path is correctly calculated, otherwise, repeating the step S102;
in S101, G = (V, E) is used to represent a network without wavelength consistency requirement, where V represents a node set, E represents an edge set, N routing requests are compared, and vector (S) is used (S) n ，d n ，r n ) Denotes the Nth request, where S n Representing a source node, d n Represents a target node, r n Representing the number of requested unit bandwidths or the number of wavelengths,
represents the traffic belonging to the nth request carried by link (i, j), is->
Represents the backup link traffic for the nth request carried by link (i, j), and->
Representing the capacity of the link, definition f n ∈(0,r n ) To aim at the r n The number of connections successfully established for each request, the following objective equation is set:
f n ∈{0,r n }n∈N,(i,j)∈E (8)
the formula (1) is an objective equation and consists of two parts, the number of successfully established requests and the total consumption of network resources, wherein w1 and w2 are constants and are used for adjusting the weight of the two parts;
the formulas (2) and (3) are respectively the flow constraints of the main path and the standby path;
equation (4) constrains the traffic carried on each link to be less than its link capacity;
equation (5) is a link disjoint constraint;
equations (6), (7) and (8) constrain the connection established by each request to make its flow value equal to or 0, or request bandwidth and wavelength number r n ；
S102 includes the steps of:
s121: solving the inter-domain SD-WAN, instantiating an SD-WAN equation according to the request and the topological structure, and obtaining the value of a target equation;
s122: and (4) solving the intra-domain SD-WAN, bringing the obtained request vector examples into an SD-WAN equation to obtain intra-domain requests, and performing intra-domain solution by domain to obtain detailed paths.
2. The method according to claim 1, wherein the SD-WAN equations are instantiated according to the specific request and topology structure using all topology information H (U, E) same as the protection mechanism in S121, and the relationship between the number of equations and the size of the network topology and the number of requests is obtained.
3. The method of path computation in an SD-WAN environment of claim 2, wherein the number of acquisition equations is:
setting the number of target equations to be 1;
the equations (2) and (3) are flow constraints established by each request aiming at each node, and the quantity of the equations is Nx |. U |;
equation (4) is a link capacity constraint established for each link, the number of equations being N;
equation (5) is a link disjoint constraint established for each request, each link, with the number of equations nx E |;
the constraint conditions (6) and (7) are used for constraining the value ranges of the variables x and y, and the number of the constraint conditions is the number N x E of the variables;
the number of formula (8) is N;
then after instantiation, the total number of equations is: 1+2 (N x U |) +3 (N x E |) +2N.
4. The method of claim 3, wherein in network topology H (U, E), the path computation method in SD-WAN environment is applied
Indicating that a node in the field Di is pick>
Node ^ to field Dj>
When i = j, the link is an abstract link between different boundary nodes in the same domain, and is/are->
To indicate that the link->
Up to the traffic carried by the nth request.
5. The method of claim 4, wherein based on the processing of the inter-domain SD-WAN solution result, the instance of the obtained request vector is brought into the SD-WAN equation, the instantiated equation is solved by a solving tool to obtain the value of the objective equation and the value of each variable, the flow on the intra-domain virtual link can be obtained by processing the solution given by the SD-WAN, and the information is used as an intra-domain request, that is, the intra-domain request of each domain, and the intra-domain solution can be performed by each domain to obtain a detailed path;
for sub-requests of working path within domain (S) n ，d n ，r n ) Indicating that the sub-request of the protection path is signed (S) 1 n ，d 1 n ，r 1 n ) Expressed, then the SD-WAN equation is as follows:
f n ∈{0,r n }n∈N,(i,j)∈E (16)
f 1 n ∈{0,r 1 n }n∈N,(i,j)∈E (17)
in the domain Di, for the request fn, the corresponding relation in instantiation is as follows:
the working link requests: (S) n ，d n ，r n ) Is converted into
Protection link request: (S) 1 n ，d 1 n ，r 1 n ) Is converted into
6. The method of claim 5, wherein the S104 link is connected to form a slave source node S n To destination node d n And bandwidth unit is r n A path.
7. The device of the path computation method in the SD-WAN environment according to claim 6, comprising a global SD-WAN composed of local SD-WANs vertically deployed by a plurality of controllers, wherein the local SD-WAN controller is a local controller, and manages network traffic in the local SD-WAN; and a top layer controller of the global SD-WAN is a root controller, and manages the network traffic of the global SD-WAN.
8. The apparatus of a path computation method in an SD-WAN environment of claim 7, wherein the local area SD-WAN comprises a data plane, a control plane and an application plane, wherein the data plane is composed of switching nodes and network links; the control plane is composed of a local area SD-WAN controller, and the controller comprises a south interface southbound interface, a north interface northbound interface, an East-west interface East-Westinterface, a data plane state detection module and a path calculation module; the application plane is accessed to the network by a network application service.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111130386.4A CN113872856B (en) | 2021-09-26 | 2021-09-26 | Path calculation method and device in SD-WAN environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111130386.4A CN113872856B (en) | 2021-09-26 | 2021-09-26 | Path calculation method and device in SD-WAN environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113872856A CN113872856A (en) | 2021-12-31 |
| CN113872856B true CN113872856B (en) | 2023-04-18 |
Family
ID=78994731
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111130386.4A Active CN113872856B (en) | 2021-09-26 | 2021-09-26 | Path calculation method and device in SD-WAN environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113872856B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101715149A (en) * | 2009-07-21 | 2010-05-26 | 北京邮电大学 | Method and device for restoring parallel cross-domain fault of multilayer and multi-domain distributed optical network |
| CN108449265A (en) * | 2018-02-05 | 2018-08-24 | 西安交通大学 | Path calculation method and device in a kind of SD-WAN environment |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8559334B2 (en) * | 2008-03-28 | 2013-10-15 | Telefonaktiebolaget L M Ericsson (Publ) | End-to end inter-domain routing |
| CN109787801B (en) * | 2017-11-15 | 2022-01-21 | 华为技术有限公司 | Network service management method, device and system |
| US11336482B2 (en) * | 2019-01-31 | 2022-05-17 | Juniper Networks, Inc. | Policy-driven on-demand tunnel creation/deletion based on traffic information in a wide area network (WAN) |
| US10979316B2 (en) * | 2019-05-31 | 2021-04-13 | Juniper Networks, Inc. | Dynamic application SLA metric generation, distribution, and intent-based SD-WAN link selection |
| CN110611616A (en) * | 2019-09-18 | 2019-12-24 | 下一代互联网重大应用技术（北京）工程研究中心有限公司 | Traffic scheduling method, system, device and medium based on Radius server |
| US11405427B2 (en) * | 2020-01-23 | 2022-08-02 | Cisco Technology, Inc. | Multi-domain policy orchestration model |
| CN112214258B (en) * | 2020-10-19 | 2022-08-16 | 中国信息通信研究院 | End-to-end capability benchmark test method and device based on software defined wide area network |
-
2021
- 2021-09-26 CN CN202111130386.4A patent/CN113872856B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101715149A (en) * | 2009-07-21 | 2010-05-26 | 北京邮电大学 | Method and device for restoring parallel cross-domain fault of multilayer and multi-domain distributed optical network |
| CN108449265A (en) * | 2018-02-05 | 2018-08-24 | 西安交通大学 | Path calculation method and device in a kind of SD-WAN environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113872856A (en) | 2021-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hu et al. | Multi-controller based software-defined networking: A survey | |
| Byers et al. | Fog computing distributing data and intelligence for resiliency and scale necessary for iot: The internet of things (ubiquity symposium) | |
| Goscien et al. | Protection in elastic optical networks | |
| CN107682258A (en) | A kind of multi-path network transmission method and device based on virtualization | |
| CN110266368A (en) | Incorporate information network emulation mode based on cloud platform | |
| Togou et al. | A hierarchical distributed control plane for path computation scalability in large scale software-defined networks | |
| Kokkinos et al. | Survey: Live migration and disaster recovery over long-distance networks | |
| CN106817306B (en) | Method and device for determining target route | |
| CN110011913A (en) | A kind of path calculation method and system | |
| Zhang et al. | Service function chaining in multi-domain networks | |
| CN104639557B (en) | A kind of method, system and equipment for establishing PCEP sessions | |
| CN108965013A (en) | IP and the quick open system of optical network service and method | |
| CN113872856B (en) | Path calculation method and device in SD-WAN environment | |
| CN110912822A (en) | Path finding method, controller, electronic device and readable storage medium | |
| Zhou et al. | A hierarchical digital twin network for satellite communication networks | |
| Han et al. | Survivable virtual network link shared protection method based on maximum spanning tree | |
| Yasin et al. | Reliable multipath flow for link failure recovery in 5G networks using SDN paradigm | |
| Llorens-Carrodeguas et al. | A data distribution service in a hierarchical sdn architecture: Implementation and evaluation | |
| CN105282025A (en) | Method of determining end-to-end routing and apparatus thereof | |
| Leal et al. | Reliability provision in software defined power substations communication networks | |
| CN113068083A (en) | Method, device and equipment for establishing connection and computer readable storage medium | |
| Jianping et al. | SM-UAN: A software-defined underwater acoustic network of multi-controllers for inland waterway systems | |
| Hu et al. | Leo software defined networking based on onboard controller | |
| JP5856699B1 (en) | Hierarchical path control system, path control method and program, and lower level control apparatus | |
| Guo et al. | Challenges and opportunities in space service computing |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 510000 room 406, building 2, No. 2, siyouyi Road, Yuexiu District, Guangzhou, Guangdong Province Applicant after: China Southern Power Grid Digital Power Grid Group Information Communication Technology Co.,Ltd. Address before: 510030 4th floor, building 2, Zhujiang bin, siyouyima Road, Yuexiu District, Guangzhou City, Guangdong Province Applicant before: GUANGZHOU POWER COMMUNICATION NETWORKS CO.,LTD. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |