CN107517155A - A kind of software defined network, node, path calculation method and device - Google Patents
A kind of software defined network, node, path calculation method and device Download PDFInfo
- Publication number
- CN107517155A CN107517155A CN201610428476.4A CN201610428476A CN107517155A CN 107517155 A CN107517155 A CN 107517155A CN 201610428476 A CN201610428476 A CN 201610428476A CN 107517155 A CN107517155 A CN 107517155A
- Authority
- CN
- China
- Prior art keywords
- node
- network layer
- candidate nodes
- path
- network
- 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.)
- Withdrawn
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 34
- 238000004891 communication Methods 0.000 claims abstract description 19
- 238000000034 method Methods 0.000 abstract description 9
- 239000010410 layer Substances 0.000 description 43
- 238000010586 diagram Methods 0.000 description 13
- 238000004590 computer program Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 239000012792 core layer Substances 0.000 description 5
- 238000004422 calculation algorithm Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000000205 computational method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- -1 convergence-level Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
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
- H04L45/123—Evaluation of link metrics
-
- 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/24—Multipath
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiments of the invention provide a kind of software defined network, node, path calculation method and device, this method includes：According to topological network, the both candidate nodes of next-hop node are determined；Obtain the constrained parameters of each both candidate nodes；According to the constrained parameters of constraints and each both candidate nodes, from the destination node of the selection next-hop node in both candidate nodes.The embodiment of the present invention introduces constraints, and agreed terms can be configured according to practical application, Internet such as node is inferior, row constraint is entered to path computing, the original path that worked departing from communication network node is avoided the occurrence of, configuration is simple, is well positioned to meet various path computing requirements, compatible existing carrier network, solve the problems, such as that existing SDN path calculation method can not exclude not meeting the path that actual flow forwarding requires.
Description
Technical field
The present invention relates to the communications field, more particularly to a kind of software defined network, node, path computing side
Method and device.
Background technology
SDN (software defined network, software defined network) is carried by the controller of centralization
The high programmability of network, control plane and Forwarding plane separation and open programmable feature, pole
The earth has promoted the development of Next Generation Internet；Relative to current carrier network, SDN can be significantly
Complexity and the flexibility of operation maintenance are reduced, but SDN merges with the networking of current operator
But the problem of many be present.
Carrier network operation schematic diagram as shown in Figure 1, carrier network include Access Layer, convergence-level,
Core layer, each level corresponds to equipment of the different type from different transfer capabilitys, (from access when flow is up
Layer arrives convergence-level to core layer), flow can not pass through other layers when from Access Layer to convergence-level, also not
Other layers can be passed through when from convergence-level to core layer, can not be directly from convergence-level to core layer.Flow
It is descending same.And the path computation technique of existing SDN do not have Access Layer, convergence-level,
The concept of core layer, it also can not just provide corresponding limitation.For example, it is desired in CSY11 and CSY12
Between activate the service, if the communication cost value metric adjustment of each link is appropriate, SDN path computings
It is likely to be obtained such path：CSY11->Agg-Y11->CSY13-Agg-Y12->CSY12, even if
Such path is the minimum shortest path of metric values, but does not meet the requirement of actual flow forwarding,
The node of small treating capacity can not be such as returned to from the node of high throughput, so to exclude, it is clear that existing
SDN path calculation method does not possess such ability, it is impossible to which exclusion does not meet actual flow forwarding will
The path asked.
The content of the invention
The embodiments of the invention provide a kind of software defined network, node, path calculation method and device,
It can not exclude not meeting the road of actual flow forwarding requirement to solve existing SDN path calculation method
The problem of footpath.
On the one hand, there is provided a kind of path calculation method for software defined network node, including：
According to topological network, the both candidate nodes of next-hop node are determined；
Obtain the constrained parameters of each both candidate nodes；
According to the constrained parameters of constraints and each both candidate nodes, from the selection next-hop section in both candidate nodes
The destination node of point.
On the one hand, there is provided a kind of path calculation device for software defined network node, including：Wait
Node module and destination node module are selected, wherein,
Both candidate nodes module is used for according to topological network, determines the both candidate nodes of next-hop node, and obtain
The constrained parameters of each both candidate nodes；
Destination node module be used for according to the constrained parameters of present node, the constrained parameters of each both candidate nodes and
Constraints, from the destination node of the selection next-hop node in both candidate nodes, write reachable path set
Table.
On the one hand, there is provided a kind of software defined network node, it includes processor and memory, processing
Device is used for the both candidate nodes for according to topological network, determining next-hop node, is joined according to the constraint of present node
The constrained parameters and constraints of several, each both candidate nodes, from the selection next-hop node in both candidate nodes
Destination node, reachable path collection table is write, according to the communication cost value of present node to each destination node,
Destination node is ranked up, selects communication cost to be worth optimal destination node write-in optimal path set
Table；Memory is used to store reachable path collection table and optimal path collection table.
On the other hand, there is provided a kind of software defined network, including：At least one embodiment of the present invention carries
The software defined network node of confession.
On the other hand, there is provided a kind of computer-readable storage medium, be stored with calculating in computer-readable storage medium
Machine executable instruction, computer executable instructions, which are used to perform, is previously described for software defined network node
Path calculation method.
The beneficial effect of the embodiment of the present invention：
The embodiments of the invention provide a kind of path calculation method, first according to topological network, determines next
The both candidate nodes of hop node, the constrained parameters of each both candidate nodes are then obtained, and according to constraints and respectively
The constrained parameters of both candidate nodes, from the destination node of the selection next-hop node in both candidate nodes；This method
Constraints is introduced, and agreed terms can be configured according to practical application, such as the Internet of node
It is inferior, row constraint is entered to path computing, avoids the occurrence of the original path that worked departing from communication network node,
Configuration is simple, is well positioned to meet various path computing requirements, compatible existing carrier network, solves
Existing SDN path calculation method can not exclude not meeting the path that actual flow forwarding requires
Problem.
Brief description of the drawings
Fig. 1 is the common networking schematic diagram of communication network；
Fig. 2 is the flow chart for the path calculation method that first embodiment of the invention provides；
Fig. 3 is the structural representation for the path calculation device that second embodiment of the invention provides；
Fig. 4 is the network topology schematic diagram that third embodiment of the invention uses；
Fig. 5 is the schematic diagram of the shortest path tree obtained using existing route computational methods；
Fig. 6 is the schematic diagram that third embodiment of the invention carries out the shortest path tree that path computing obtains；
Fig. 7 is the proper network topology schematic diagram that fourth embodiment of the invention is related to；
Fig. 8 is the abnormal network topology schematic diagram that fourth embodiment of the invention is related to.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out
Clearly and completely describing, it is clear that described embodiment is part of the embodiment in the present invention, and
The embodiment being not all of.Based on the embodiment in the present invention, those of ordinary skill in the art are not doing
Go out under the premise of creative work the every other embodiment obtained, belong to the scope of protection of the invention.
Further annotation explanation is now made to the present invention by way of embodiment combination accompanying drawing.
First embodiment：
Fig. 2 is the flow chart for the path calculation method that first embodiment of the invention provides, as shown in Figure 2,
In the present embodiment, path calculation method provided by the invention includes：
S101：According to topological network, the both candidate nodes of next-hop node are determined；
S102：Obtain the constrained parameters of each both candidate nodes；
S103：According to the constrained parameters of constraints and each both candidate nodes, under the selection in both candidate nodes
The destination node of one hop node.
In certain embodiments, there are multiple destination nodes in the path calculation method in above-described embodiment
When, in addition to：
Get the communication cost value of each destination node；
Destination node is ranked up according to communication cost value.
In certain embodiments, the path calculation method in above-described embodiment is it is determined that before both candidate nodes,
Also include：Judge whether it is path termination, if so, then terminating, path computing is completed, if it is not, then true
Determine both candidate nodes.
In certain embodiments, the path calculation method in above-described embodiment is it is determined that after destination node,
Also include：Judge whether destination node includes path termination, if so, then electing path termination as next-hop
Node, complete path computing.
In certain embodiments, the constrained parameters in above-described embodiment include network layer, constraints bag
Include：
If the network layer of present node with reach node the highest network layer through node it is identical, under
The network layer of one hop node is unrestricted；
If the network layer of present node less than reach node the highest network layer through node, it is next
Network layer of the network layer of hop node not above present node；
If the network layer of present node is unknown, the network layer of next-hop node is unrestricted；
If the network layer of both candidate nodes is unknown, meet constraints.
Second embodiment：
Fig. 3 is the structural representation for the path calculation device that second embodiment of the invention provides, can by Fig. 3
Know, in the present embodiment, path calculation device provided by the invention includes：Both candidate nodes module 31 and
Destination node module 32, wherein,
Both candidate nodes module 31 is used for the both candidate nodes for according to topological network, determining next-hop node, and
Obtain the constrained parameters of each both candidate nodes；
Destination node module 32 is used for the constrained parameters according to present node, the constraint of each both candidate nodes is joined
Number and constraints, from the destination node of the selection next-hop node in both candidate nodes, write reachable path
Collection table.
In certain embodiments, the destination node module 32 in above-described embodiment is additionally operable to according to working as prosthomere
Destination node is ranked up to the communication cost value of each destination node, selects communication cost value optimal by point
Destination node write-in optimal path collection table.
In certain embodiments, the constrained parameters in above-described embodiment include network layer, constraints bag
Include：
If the network layer of present node with reach node the highest network layer through node it is identical, under
The network layer of one hop node is unrestricted；
If the network layer of present node less than reach node the highest network layer through node, it is next
Network layer of the network layer of hop node not above present node；
If the network layer of present node is unknown, the network layer of next-hop node is unrestricted；
If the network layer of both candidate nodes is unknown, meet constraints.
The embodiment of the present invention additionally provides a kind of software defined network node, and it includes processor and storage
Device, processor is used for the both candidate nodes for according to topological network, determining next-hop node, according to present node
Constrained parameters, the constrained parameters and constraints of each both candidate nodes, it is next from the selection in both candidate nodes
The destination node of hop node, reachable path collection table is write, according to the logical of present node to each destination node
Credit worthiness, destination node is ranked up, selects communication cost to be worth optimal destination node write-in optimal
Set of paths table；Memory is used to store reachable path collection table and optimal path collection table.
In certain embodiments, when constrained parameters include network layer, the processor in above-described embodiment
For present node network layer with reach node institute the highest network layer through node it is identical when, general
All both candidate nodes elect destination node as；It is less than in the network layer of present node and reaches node institute warp knuckle
During the highest network layer of point, both candidate nodes of the network layer not higher than present node are elected as target section
Point；It is unknown in the network layer of present node, elect all both candidate nodes as destination node；In candidate
When the network layer of node is unknown, destination node is elected as.
It is corresponding, the embodiments of the invention provide a kind of software defined network, including：At least one hair
The software defined network node that bright embodiment provides.
3rd embodiment：
Further annotation explanation is done to the present invention in conjunction with concrete application scene.
Exemplified by the present embodiment is using the network layer that existing carrier network requires as constrained parameters, there is provided band
The shortest path first of level constraint, this method configuration is simple, and being well positioned to meet various path computings will
Ask, compatible existing carrier network.
The present embodiment is using the network forwarding equipment management module increase equipment level on SDN controllers
Information, in path calculation module, when calculating next-hop, selected according to equipment hierarchical information qualified
Most short next-hop, so, SDN controllers mainly include：
Network forwarding equipment management module：When adding equipment, while add the network layer where the equipment
(access device<Convergence device<Nucleus equipment), in order to improve compatibility, mechanical floor can not be judged
Secondary, this information can not fill out, i.e. unknown device type.And the hierarchical information of equipment is write into generation
Facility information in, there is provided read interface, it is convenient to use elsewhere.
Path calculation module：In the algorithm that shortest path calculates, when selecting next hop information, increase
Judgment rule is as follows to be judged to the hierarchical information of next-hop device：
If the equipment level of present node with reach this node the highest level through equipment it is identical,
The level for the next node that present node is arrived is unrestricted (system of selection is according to shortest path)；
If the equipment level of present node than reach this node the highest level through equipment it is small, currently
Node to the level of next node can only be less than equal to present node；
If present node or next node device type are unknown, unrestrictedly.
Embodiment three
Network topology and metric values sketch such as Fig. 4 meet level, it is necessary to calculate A1 to A3 path
Constraint.This example is by changing shortest path first, in Tent tables (reachable path collection table) and Path
Next-hop node information and metric values are not only stored in table (optimal path collection table), also to be stored
The highest level information that this node is passed through：Level.
So that shortest path computational methods are Dijkstra's algorithm as an example, amended Dijkstra's algorithm
Including：
Step 1：From source point, next hop information is put into Tent tables by metric sequences, and
Record corresponding node highest level, source point and next-hop node level it is high be next-hop node passed through
The highest level crossed.
Step 2：The optimal nodes of metric are taken out from Tent tables, are put into Path tables.
Step 3：Judge whether this node is destination node, if just terminating, now deposited in Path tables
The active shortest path to purpose.If not continuation in next step.
Step 4：The node obtained from step 3, the next-hop node information of this node is traveled through, such as
The information of fruit next-hop node meets, the next hop information of this node is inserted into according to metric sequences
In Tent tables, if this node in Path tables, does not have to be reentered into Tent tables, again
Find next node.Step 2 is returned to afterwards.
As shown in figure 5, using existing shortest path first, the optimal path number obtained since A1,
A1 to A3 path will pass through Access Layer->Convergence-level, Access Layer is returned to afterwards again and enters remittance
Poly layer, this does not allow.
As shown in fig. 6, during using the shortest path first constrained with level, A1 to A2 path, warp
The highest level crossed is convergence-level, and current level is Access Layer, less than highest level, so next-hop
Level can only be less than equal to Access Layer, so next-hop will not be B2 nodes.The path tree finally given
Such as figure four.
Example IV
When network is normal, network topology sketch is as shown in fig. 7, A1 and B1 are direct-connected, when certain moment,
Network failure etc. is abnormal, and network topology is changed into shown in Fig. 8, and A1 to B1 exclusive path is
A1-B2-A2-B1, A1 to B1 flow can be sent to B1 by B2, A2, inevitably result in A2
The uplink traffic that processing B2 comes, and A2 disposal abilities without as, it is unsatisfactory for the layer of operator
Secondary constraint requirements.If using the algorithm constrained with level, such situation can be avoided to occur, prompt to calculate road
Failure, so as to send alarm notification administrative staff.Step is as follows：
Step 1：Network topology changes, and causes A1 to B1 path needs to be recalculated.
Step 2：Since A1, next-hop B2, highest level 2, convergence-level, opened from B2
Beginning, next-hop A2, highest level remains as 2, since A2, next-hop B1, current A2
Level be 1, less than highest level 2, and next-hop B1 level is 2, more than current level, institute
To be unsatisfactory for level constraints, road failure is calculated, A1 to B1 paths are obstructed.
Step 3：Business detects that path is obstructed and sends alarm.
The present embodiment for equipment by increasing hierarchical information, and the shortest path first constrained using level can
To meet the automatic calculation road of any scene of operator.
In summary, by the implementation of the embodiment of the present invention, following beneficial effect at least be present：
The embodiments of the invention provide a kind of path calculation method, first according to topological network, determines next
The both candidate nodes of hop node, the constrained parameters of each both candidate nodes are then obtained, and according to constraints and respectively
The constrained parameters of both candidate nodes, from the destination node of the selection next-hop node in both candidate nodes；This method
Constraints is introduced, and agreed terms can be configured according to practical application, such as the Internet of node
It is inferior, row constraint is entered to path computing, avoids the occurrence of the original path that worked departing from communication network node,
Configuration is simple, is well positioned to meet various path computing requirements, compatible existing carrier network, solves
Existing SDN path calculation method can not exclude not meeting the path that actual flow forwarding requires
Problem.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method, system or
Computer program product.Therefore, the present invention can use hardware embodiment, software implementation or combine soft
The form of the embodiment of part and hardware aspect.Wherein included in one or more moreover, the present invention can use
Have computer usable program code computer-usable storage medium (include but is not limited to magnetic disk storage and
Optical memory etc.) on the form of computer program product implemented.
The present invention is produced with reference to method according to embodiments of the present invention, equipment (system) and computer program
The flow chart and/or block diagram of product describes.It should be understood that can by computer program instructions implementation process figure and
/ or each flow in block diagram and/or square frame and the flow in flow chart and/or block diagram and/or side
The combination of frame.These computer program instructions can be provided to all-purpose computer, special-purpose computer, embedded
Processor or the processor of other programmable data processing devices are to produce a machine so that pass through calculating
The instruction of the computing device of machine or other programmable data processing devices is produced for realizing in flow chart
The device for the function of being specified in one flow or multiple flows and/or one square frame of block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or other programmable datas to handle
In the computer-readable memory that equipment works in a specific way so that be stored in the computer-readable storage
Instruction in device produces the manufacture for including command device, and the command device is realized in one flow of flow chart
Or the function of being specified in one square frame of multiple flows and/or block diagram or multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices,
So that series of operation steps is performed on computer or other programmable devices to produce computer realization
Processing, so as to which the instruction that is performed on computer or other programmable devices is provided for realizing in flow
The step for the function of being specified in one flow of figure or multiple flows and/or one square frame of block diagram or multiple square frames
Suddenly.
It the above is only the embodiment of the present invention, any formal limit not done to the present invention
Make, every any simple modification made according to technical spirit of the invention to embodiment of above, be equal
Change, combination or modification, still fall within the protection domain of technical solution of the present invention.
Claims (11)
1. a kind of path calculation method for software defined network node, including：
According to topological network, the both candidate nodes of next-hop node are determined；
Obtain the constrained parameters of each both candidate nodes；
According to the constrained parameters of constraints and each both candidate nodes, the selection from the both candidate nodes
The destination node of next-hop node.
2. path calculation method as claimed in claim 1, it is characterised in that multiple target sections be present
During point, in addition to：
Get the communication cost value of each destination node；
The destination node is ranked up according to the communication cost value.
3. path calculation method as claimed in claim 1, it is characterised in that it is determined that both candidate nodes it
Before, in addition to：Judge whether it is path termination, if so, then terminating, complete path computing, if it is not,
Then determine both candidate nodes.
4. path calculation method as claimed in claim 1, it is characterised in that it is determined that destination node it
Afterwards, in addition to：Judge whether the destination node includes path termination, if so, then that the path is whole
Point elects next-hop node as, completes path computing.
5. the path calculation method as described in any one of Claims 1-4, it is characterised in that it is described about
Beam parameter includes network layer, and the constraints includes：
If the network layer of present node with reach node the highest network layer through node it is identical, under
The network layer of one hop node is unrestricted；
If the network layer of present node less than reach node the highest network layer through node, it is next
Network layer of the network layer of hop node not above present node；
If the network layer of present node is unknown, the network layer of next-hop node is unrestricted；
If the network layer of both candidate nodes is unknown, meet constraints.
6. a kind of path calculation device for software defined network node, including：Both candidate nodes module and
Destination node module, wherein,
The both candidate nodes module is used for the both candidate nodes for according to topological network, determining next-hop node, and
Obtain the constrained parameters of each both candidate nodes；
The destination node module is used for the constrained parameters according to present node, the constraint of each both candidate nodes is joined
Number and constraints, it is reachable from the destination node of the selection next-hop node in the both candidate nodes, write-in
Set of paths table.
7. path calculation device as claimed in claim 6, it is characterised in that the destination node module
The communication cost value to each destination node according to present node is additionally operable to, the destination node is arranged
Sequence, communication cost is selected to be worth optimal destination node write-in optimal path collection table.
8. path calculation device as claimed in claims 6 or 7, it is characterised in that the constrained parameters
Including network layer, the constraints includes：
If the network layer of present node with reach node the highest network layer through node it is identical, under
The network layer of one hop node is unrestricted；
If the network layer of present node less than reach node the highest network layer through node, it is next
Network layer of the network layer of hop node not above present node；
If the network layer of present node is unknown, the network layer of next-hop node is unrestricted；
If the network layer of both candidate nodes is unknown, meet constraints.
A kind of 9. software defined network node, it is characterised in that including processor and memory, the place
The both candidate nodes that device is used to according to topological network, determine next-hop node are managed, according to the constraint of present node
Parameter, the constrained parameters of each both candidate nodes and constraints, from the selection next-hop in the both candidate nodes
The destination node of node, write reachable path collection table, the communication according to present node to each destination node
Cost value, the destination node is ranked up, selects communication cost to be worth optimal destination node write-in most
Shortest path collection table；The memory is used to store the reachable path collection table and optimal path set
Table.
10. software defined network node as claimed in claim 9, it is characterised in that when it is described about
When beam parameter includes network layer；The processor is used for the network layer in present node with reaching node
The highest network layer through node it is identical when, elect all both candidate nodes as destination node；Current
The network layer of node less than reach node highest network layer through node when, network layer is not high
Destination node is elected as in the both candidate nodes of present node；It is unknown in the network layer of present node, will be all
Both candidate nodes elect destination node as；When the network layer of both candidate nodes is unknown, destination node is elected as.
11. a kind of software defined network, it is characterised in that including as described in claim 9 or 10
Software defined network node.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610428476.4A CN107517155A (en) | 2016-06-15 | 2016-06-15 | A kind of software defined network, node, path calculation method and device |
| PCT/CN2017/083835 WO2017215378A1 (en) | 2016-06-15 | 2017-05-10 | Software-defined network, node, path calculation method and device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610428476.4A CN107517155A (en) | 2016-06-15 | 2016-06-15 | A kind of software defined network, node, path calculation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107517155A true CN107517155A (en) | 2017-12-26 |
Family
ID=60664254
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610428476.4A Withdrawn CN107517155A (en) | 2016-06-15 | 2016-06-15 | A kind of software defined network, node, path calculation method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107517155A (en) |
| WO (1) | WO2017215378A1 (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109639387A (en) * | 2018-12-25 | 2019-04-16 | 苏州智汇云祥通信系统有限公司 | A kind of multisystem anti-interference filtration method based in digital display circuit transmission |
| CN109756421A (en) * | 2019-01-23 | 2019-05-14 | 华南理工大学 | A congestion control system and method based on OpenFlow technology |
| CN110636000A (en) * | 2018-06-22 | 2019-12-31 | 贵州白山云科技股份有限公司 | Virtual cloud network control method, system and network device |
| WO2020164473A1 (en) * | 2019-02-13 | 2020-08-20 | 华为技术有限公司 | Path calculation method, apparatus and device |
| CN112019436A (en) * | 2019-05-30 | 2020-12-01 | 中国移动通信集团北京有限公司 | Transmission path selection method, device, device and medium |
| CN113691445A (en) * | 2020-05-18 | 2021-11-23 | 华为技术有限公司 | Message forwarding backup path determining method and related equipment |
| CN117834515A (en) * | 2024-01-03 | 2024-04-05 | 深圳中维安科技有限公司 | Remote data transmission control method and system |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109818865B (en) * | 2019-03-11 | 2020-09-18 | 江苏君英天达人工智能研究院有限公司 | SDN enhanced path boxing device and method |
| CN113595750B (en) * | 2020-04-30 | 2023-06-20 | 华为技术有限公司 | Network topology dividing method and device and network topology management equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100061722A1 (en) * | 2008-09-08 | 2010-03-11 | Fujitsu Limited | Network design apparatus and network design method |
| JP2014023050A (en) * | 2012-07-20 | 2014-02-03 | Kddi Corp | Method and apparatus for setting monitoring path for defective link identification system |
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| CN104702502A (en) * | 2013-12-09 | 2015-06-10 | 中兴通讯股份有限公司 | Network path calculation method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104158733B (en) * | 2013-05-13 | 2019-04-05 | 华为技术有限公司 | A kind of fast rerouting method and device, transmission network |
| CN104254107B (en) * | 2013-06-27 | 2018-06-05 | 华为技术有限公司 | data distribution method, user equipment and network system |
| US9986434B2 (en) * | 2014-04-30 | 2018-05-29 | Avago Technologies General Ip (Singapore) Pte. Ltd. | System for accelerated network route update through exclusive access to routing tables |
-
2016
- 2016-06-15 CN CN201610428476.4A patent/CN107517155A/en not_active Withdrawn
-
2017
- 2017-05-10 WO PCT/CN2017/083835 patent/WO2017215378A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100061722A1 (en) * | 2008-09-08 | 2010-03-11 | Fujitsu Limited | Network design apparatus and network design method |
| JP2014023050A (en) * | 2012-07-20 | 2014-02-03 | Kddi Corp | Method and apparatus for setting monitoring path for defective link identification system |
| CN104702502A (en) * | 2013-12-09 | 2015-06-10 | 中兴通讯股份有限公司 | Network path calculation method and device |
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110636000A (en) * | 2018-06-22 | 2019-12-31 | 贵州白山云科技股份有限公司 | Virtual cloud network control method, system and network device |
| CN110636000B (en) * | 2018-06-22 | 2021-07-27 | 贵州白山云科技股份有限公司 | Virtual cloud network control method, system and network device |
| CN109639387A (en) * | 2018-12-25 | 2019-04-16 | 苏州智汇云祥通信系统有限公司 | A kind of multisystem anti-interference filtration method based in digital display circuit transmission |
| CN109756421A (en) * | 2019-01-23 | 2019-05-14 | 华南理工大学 | A congestion control system and method based on OpenFlow technology |
| WO2020164473A1 (en) * | 2019-02-13 | 2020-08-20 | 华为技术有限公司 | Path calculation method, apparatus and device |
| US11929915B2 (en) | 2019-02-13 | 2024-03-12 | Huawei Technologies Co., Ltd. | Path calculation method, apparatus, and device |
| CN112019436A (en) * | 2019-05-30 | 2020-12-01 | 中国移动通信集团北京有限公司 | Transmission path selection method, device, device and medium |
| CN113691445A (en) * | 2020-05-18 | 2021-11-23 | 华为技术有限公司 | Message forwarding backup path determining method and related equipment |
| WO2021232906A1 (en) * | 2020-05-18 | 2021-11-25 | 华为技术有限公司 | Method for determining packet forwarding and backup path and related device |
| CN117834515A (en) * | 2024-01-03 | 2024-04-05 | 深圳中维安科技有限公司 | Remote data transmission control method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017215378A1 (en) | 2017-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107517155A (en) | A kind of software defined network, node, path calculation method and device | |
| CN109495300B (en) | Reliable SDN virtual network mapping method | |
| US8443079B2 (en) | Mixed integer programming model for minimizing leased access network costs | |
| US7782773B2 (en) | Metric optimization for traffic engineering in a metric-routed network | |
| US20200059412A1 (en) | SDN Network System, Controller, and Controlling Method | |
| WO2010090759A1 (en) | Systems, methods, and apparatuses for managing the flow of traffic in data networks | |
| GB2536606A (en) | Network topology optimization | |
| CN100419444C (en) | Method and system for performing traffic engineering in a network based on metric routing | |
| CN102546432B (en) | Method and device for planning packet transmission bearer network capacity | |
| CN111211987A (en) | Method, system, electronic device and storage medium for dynamic adjustment of traffic in network | |
| EP3214800A1 (en) | Method and device for implementing capacity planning | |
| CN110740394B (en) | Power optical transmission network optimization method and system based on site classification business classification | |
| CN107306224A (en) | A kind of routed path update method and network administration apparatus | |
| CN102882722A (en) | PTN (packet transport network) /IPRAN (internet protocol radio access network) end-to-end business data quick creation method | |
| CN108092733A (en) | Determining method of path that IP network is merged with optical transport network, apparatus and system | |
| CN108075980A (en) | A kind of control method of forward-path, device and control device | |
| WO2008046354A1 (en) | System of path computation element protocol support for large-scale concurrent path computation | |
| CN109246013A (en) | A kind of method for routing in FC-AE-1553 switching network | |
| US6744734B1 (en) | Method for generating the optimal PNNI complex node representations for restrictive costs | |
| CN114124791B (en) | SPTN network tunnel rerouting method | |
| CN102934491B (en) | Wavelength-division network planing method and equipment | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay | |
| CN105282025A (en) | Method of determining end-to-end routing and apparatus thereof | |
| CN106982162A (en) | Methods, devices and systems for forwarding service stream | |
| CN101986625B (en) | Path calculation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20171226 |
|
| WW01 | Invention patent application withdrawn after publication |