CN108667727A - network link failure processing method, device and controller - Google Patents
network link failure processing method, device and controller Download PDFInfo
- Publication number
- CN108667727A CN108667727A CN201810396284.9A CN201810396284A CN108667727A CN 108667727 A CN108667727 A CN 108667727A CN 201810396284 A CN201810396284 A CN 201810396284A CN 108667727 A CN108667727 A CN 108667727A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- link
- network
- mobile
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of network link failure processing method, device and controllers, are applied to software defined network SDN, are related to field of communication technology, this method includes：When the current ink of SDN breaks down, pre-stored reserve link corresponding with current ink is obtained；Target Link is chosen from reserve link；Current ink is switched into Target Link.Network link failure processing method, device and controller provided by the invention can accomplish lower configuration, management and O＆M cost, possess preferable flexibility and scalability due to that need not carry out multilink bundling；It goes to calculate new routing since network need not be restrained again when link sends failure, saves the calculating time of a large amount of fault restoration, improve the processing speed of network link failure, to reduce the influence that upper-level virtual network is subject to.
Description
Technical field
The present invention relates to fields of communication technology, more particularly, to a kind of network link failure processing method, device and control
Device.
Background technology
Network virtualization technical support virtual multiple virtual networks on physical network, to allowing different user shared or
The slice of exclusive Internet resources, and then network resource utilization is improved, realize the network of elasticity.SDN(Software Defined
Network, software defined network) it is a kind of transmission via net framework of Emulex networks, it is a kind of realization method of network virtualization,
Its core technology OpenFlow is by separating network equipment control plane with data surface, to realize the spirit of network flow
Control living makes network become more intelligent as pipeline.The appearance of SDN technologies makes network virtualization be easier to realize, has more preferable
Flexibility and scalability.
Since the multiple virtual networks in upper layer share underlying physical network so that the physical network links failure of lower layer, it can be big
The influence upper-level virtual network of scale, so the link failure of physical network is switched fast reparation and becomes particularly important.
In the prior art, generally network link failure is handled using following two modes：First, by multilink bundling, two
Item or multilink are bundled into a logical links, when a link breaks down, are directly switch to other available links
On；Second is that after link failure occurs, convergence network goes to calculate newly routing and obtains new link again, then switches to the new link.So
And the configuration of multilink bundling, management and O＆M cost are higher, flexibly and autgmentability is poor, and is often to require same producer
The network equipment；Again convergence network, which goes to calculate the method newly routeing, needs to spend the calculating time of a large amount of fault restoration, causes
What upper-level virtual network was subject to is affected.
Invention content
In view of this, the purpose of the present invention is to provide a kind of network link failure processing method, device and controller, with
Configuration, management and O＆M cost are reduced, improves flexibility and scalability, while saving the calculating time of fault restoration, improves net
The processing speed of network link failure, to reduce the influence that upper-level virtual network is subject to.
In a first aspect, an embodiment of the present invention provides a kind of network link failure processing method, it is applied to software defined network
Network SDN, the method includes：
When the current ink of the SDN breaks down, obtain pre-stored corresponding with the current ink spare
Link；
Target Link is chosen from the reserve link；
The current ink is switched into the Target Link.
With reference to first aspect, an embodiment of the present invention provides the first possible embodiments of first aspect, wherein institute
It states and obtains pre-stored reserve link corresponding with the current ink, including：
Obtain the source node and destination node of the current ink；
According to the source node and the destination node, the path of the SDN is inquired in preset path record sheet；
Using the path of the non-current ink found as reserve link.
The possible embodiment of with reference to first aspect the first, an embodiment of the present invention provides second of first aspect
Possible embodiment, wherein the path record sheet is established by the following method：
Obtain network topology structure, source node, destination node and the preset path quantity of the SDN；Wherein, the network
Topological structure includes the weights of the connection path and the connection path between each node of the SDN；
According to connection path and its weights described in each item, the mobile generation between the source node and the destination node is obtained
Valence is minimum and a plurality of redundant path of loop is not present, and establishes path record sheet according to redundant path described in each item；
Wherein, the quantity of the redundant path is equal to the preset path quantity, and redundant path is included described in each item
Connection path is not overlapped, the weights for each connection path that the mobile cost of the redundant path includes by the redundant path
The sum of.
Second of possible embodiment with reference to first aspect, an embodiment of the present invention provides the third of first aspect
Possible embodiment, wherein it is described according to connection path and its weights described in each item, obtain the source node and the purpose
Mobile Least-cost between node and a plurality of redundant path there is no loop, and road is established according to redundant path described in each item
Diameter record sheet, including：
The source node, the corresponding mobile route of the source node and its mobile cost are added as a path unit
To, to establish the Priority Queues, and establishing the path record sheet of blank in Priority Queues；Wherein, the Priority Queues includes adding
The path unit added, the path unit include node, the corresponding mobile route of the node and its mobile cost；I-th
The corresponding mobile route of a node is the path that i-th of node is moved to from the source node, and i is positive integer；
Obtain redundant path：It is taken out from the Priority Queues and deletes the path unit of mobile Least-cost as current
Path unit, and judge whether the present node in the current path unit is the destination node；
If the present node is the destination node, judge that the current mobile route in the current path unit is
It is no there are loop and the current mobile route and the path in the path record sheet whether there is Chong Die link road
Diameter；
If loop is not present in the current mobile route, and there is no the connection paths of overlapping, then will be described when Forward
Dynamic path is added to as redundant path in the path record sheet；
The step of repeating above-mentioned acquisition redundant path, the quantity of the redundant path described in the path record sheet
Reach the preset path quantity, obtains the path record sheet.
The third possible embodiment with reference to first aspect, an embodiment of the present invention provides the 4th kind of first aspect
Possible embodiment, wherein the method further includes：
If the present node is not the destination node, each next section being connect with the present node is obtained
Point, and the Priority Queues is updated according to each next node.
The 4th kind of possible embodiment with reference to first aspect, an embodiment of the present invention provides the 5th kind of first aspect
Possible embodiment, wherein it is described that the Priority Queues is updated according to each next node, including：
The corresponding next mobile route of the next node is obtained, judges that next mobile route whether there is loop,
And next mobile route whether there is Chong Die connection path with the path in the path record sheet；
If loop is not present in next mobile route, and there is no the connection paths of overlapping, then by next section
Point, next mobile route and its mobile cost are added to the Priority Queues as new path unit；
Each path unit is ranked up according to the magnitude relationship of mobile cost, obtains updated preferential team
Row.
With reference to first aspect, an embodiment of the present invention provides the 6th kind of possible embodiments of first aspect, wherein institute
It states and chooses Target Link from the reserve link, including：
The normal link not influenced by failure is filtered out from the reserve link；
The normal link of mobile Least-cost is chosen for Target Link.
With reference to first aspect, an embodiment of the present invention provides the 7th kind of possible embodiments of first aspect, wherein institute
It states and the current ink is switched into the Target Link, including：
Flow table corresponding with the Target Link is issued, to switch to the Target Link.
Second aspect, the embodiment of the present invention also provide a kind of network link failure processing unit, are applied to software defined network
Network SDN, described device include：
Reserve link acquisition module, when the current ink of the SDN breaks down, acquisition is pre-stored to work as with described
The corresponding reserve link of preceding link；
Target Link selecting module, for choosing Target Link from the reserve link；
Link switching module, for the current ink to be switched to the Target Link.
The third aspect, the embodiment of the present invention also provide a kind of controller, including memory, processor, in the memory
It is stored with the computer program that can be run on the processor, the processor is realized above-mentioned when executing the computer program
Method described in first aspect or its any possible embodiment.
The embodiment of the present invention brings following advantageous effect：
In the embodiment of the present invention, when the current ink of SDN breaks down, obtain pre-stored corresponding with current ink
Reserve link；Target Link is chosen from reserve link；Current ink is switched into Target Link.The embodiment of the present invention provides
Network link failure processing method, device and controller can accomplish lower match since multilink bundling need not be carried out
It sets, manage and O＆M cost, possess preferable flexibility and scalability；Since net need not be restrained again when link sends failure
Network goes to calculate new routing, therefore saves the calculating time of a large amount of fault restoration, improves the processing speed of network link failure
Degree, to reduce the influence that upper-level virtual network is subject to.
Other features and advantages of the present invention will illustrate in the following description, also, partly become from specification
It obtains it is clear that understand through the implementation of the invention.The purpose of the present invention and other advantages are in specification and attached drawing
Specifically noted structure is realized and is obtained.
To enable the above objects, features and advantages of the present invention to be clearer and more comprehensible, preferred embodiment cited below particularly, and coordinate
Appended attached drawing, is described in detail below.
Description of the drawings
It, below will be to specific in order to illustrate more clearly of the specific embodiment of the invention or technical solution in the prior art
Embodiment or attached drawing needed to be used in the description of the prior art are briefly described, it should be apparent that, in being described below
Attached drawing is some embodiments of the present invention, for those of ordinary skill in the art, before not making the creative labor
It puts, other drawings may also be obtained based on these drawings.
Fig. 1 is a kind of flow diagram of network link failure processing method provided in an embodiment of the present invention；
Fig. 2 is a kind of flow diagram for establishing path record sheet provided in an embodiment of the present invention；
Fig. 3 is a kind of network topological diagram provided in an embodiment of the present invention；
Fig. 4 is the first state figure for establishing path record sheet of the network topological diagram based on Fig. 3；
Fig. 5 is the second state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Fig. 6 is the third state figure for establishing path record sheet of the network topological diagram based on Fig. 3；
Fig. 7 is the 4th state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Fig. 8 is the 5th state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Fig. 9 is the 6th state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Figure 10 is the 7th state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Figure 11 is the 8th state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Figure 12 is the 9th state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Figure 13 is the tenth state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Figure 14 is the 11st state diagram for establishing path record sheet of the network topological diagram based on Fig. 3；
Figure 15 is the tenth two-state figure for establishing path record sheet of the network topological diagram based on Fig. 3；
Figure 16 is a kind of structural schematic diagram of network link failure processing unit provided in an embodiment of the present invention；
Figure 17 is a kind of structural schematic diagram of controller provided in an embodiment of the present invention.
Specific implementation mode
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with attached drawing to the present invention
Technical solution be clearly and completely described, it is clear that described embodiments are some of the embodiments of the present invention, rather than
Whole embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creative work premise
Lower obtained every other embodiment, shall fall within the protection scope of the present invention.
The configuration, management of multilink bundling and O＆M cost are higher at present, and flexibly and autgmentability is poor；Again convergence network is gone
The method that newly route is calculated to need to spend the calculating time of a large amount of fault restoration, cause the influence that upper-level virtual network is subject to compared with
Greatly.And the appearance of SDN technologies so that control plane and forwarding surface phase separation, the control of the whole network concentrates in controller, in controller
In can take the topology and link information of the whole network, can easily calculate a plurality of non-overlapping link as reserve link.
Based on this, a kind of network link failure processing method, device and controller provided in an embodiment of the present invention, the characteristics of according to SDN,
It prepares a plurality of reserve link in advance, once link failure occurs, issues flow table at once and be switched to available reserve link, can accomplish
Lower configuration, management and O＆M cost, possess preferable flexibility and scalability, while need not restrain network again and go to count
New routing is calculated, the calculating time of a large amount of fault restoration is saved so that upper-level virtual network is unaffected or reduction influences
It is minimum.
For ease of understanding the present embodiment, first to a kind of network link failure disclosed in the embodiment of the present invention at
Reason method describes in detail.
Embodiment one：
Network link failure processing method provided in an embodiment of the present invention, a large amount of calculating of needs before failure generation
The router-level topology of time is ready, and a plurality of non-overlapping link is calculated as reserve link, simultaneously due to a failure
The probability for influencing this plurality of non-overlapping reserve link is low-down, once failure generation generally has available reserve link
It allows hand over, saves the calculating time of a large amount of fault restoration in this way so that upper-level virtual network is unaffected or reduces shadow
It rings to minimum.This method can be executed by controller.
Fig. 1 is a kind of flow diagram of network link failure processing method provided in an embodiment of the present invention, and this method is answered
For SDN, as shown in Figure 1, this method includes following steps：
Step S102 is obtained pre-stored corresponding with current ink spare when the current ink of SDN breaks down
Link.
When the current ink of SDN breaks down, reserve link can be obtained in the following manner：Obtain current ink
Source node and destination node；According to source node and destination node, the path of the SDN is inquired in preset path record sheet；It will
The path of the non-present link found is as reserve link.Wherein, corresponding source node and purpose are stored in the record sheet of path
The a plurality of redundant path of node, redundant path carry mobile cost (mobile cost is bigger, and cost is bigger), and each redundant path
It is not overlapped and (connection path of overlapping is not present, which refers to the company side between two nodes)；Node is specific physics
Equipment, such as switch or router.
Step S104, chooses Target Link from reserve link.
Specifically, the normal link not influenced by failure is first filtered out from above-mentioned reserve link, then again from normal, chain
Target Link is chosen in road.Random fashion may be used and choose Target Link from normal link；It, can also in order to reduce cost
The normal link of mobile Least-cost is chosen for Target Link.
Current ink is switched to Target Link by step S106.
After having chosen Target Link, controller can will be broken down by issuing flow table corresponding with Target Link
Current ink switch to Target Link, i.e., controller carries out issuing for flow table according to the path (Target Link) of selection, quickly
Toggle path.Specific handoff procedure is referred to the prior art, and which is not described herein again.
In the embodiment of the present invention, when the current ink of SDN breaks down, obtain pre-stored corresponding with current ink
Reserve link；Target Link is chosen from reserve link；Current ink is switched into Target Link.The embodiment of the present invention provides
Network link failure processing method can accomplish lower configuration, management and O＆M since multilink bundling need not be carried out
Cost possesses preferable flexibility and scalability；It goes to calculate new road since network need not be restrained again when link sends failure
By, therefore the calculating time of a large amount of fault restoration is saved, the processing speed of network link failure is improved, to reduce
Upper-level virtual network is by being influenced.
Fig. 2 is a kind of flow diagram for establishing path record sheet provided in an embodiment of the present invention, as shown in Fig. 2, path
Record sheet can be established by following steps：
Step S202 obtains network topology structure, source node, destination node and the preset path quantity of SDN；Wherein, net
Network topological structure includes the weights of the connection path and connection path between each node of SDN.
Preset path quantity pre-enters setting by user, refers to calculative number of path between source node, destination node
Amount.Preset path quantity is positive integer, indicates the preset path quantity below with K.
Below by step S204 to S214 source node and purpose are obtained according to above-mentioned each connection path and its weights
Mobile Least-cost between node and a plurality of redundant path there is no loop, and path note is established according to each redundant path
Record table.Wherein, the quantity of redundant path is equal to preset path quantity K, and the connection path that each redundant path is included is not overlapped,
The weights sum for each connection path that the mobile cost of redundant path includes by redundant path.
Step S204 adds source node, the corresponding mobile route of source node and its mobile cost as a path unit
It is added in Priority Queues to establish Priority Queues, and establishes the path record sheet of blank.
Wherein, Priority Queues include addition path unit, path unit include node, the corresponding mobile route of node and
It moves cost；The corresponding mobile route of i-th of node is the path that i-th of node is moved to from source node, and i is positive integer.
It adds paths before unit, first calculates the mobile cost of source node, it is clear that the mobile cost of source node is 0.
The acquisition of redundant path is carried out below.
Step S206 takes out from Priority Queues and deletes the path unit of mobile Least-cost as current path list
Member, and judge whether the present node in current path unit is purpose node.
If not, executing step S208；If so, executing step S210.For example, if present node is source node, hold
Row step S208.
Step S208 obtains each next node being connect with present node, and is updated preferentially according to each next node
Queue.Return to step S206 later.
Specifically, in some possible embodiments, the corresponding next mobile route of each next node is first obtained, is calculated
The mobile cost of each next mobile route of item, and judge next mobile route with the presence or absence of loop and next mobile route with
The connection path of path in the record sheet of path with the presence or absence of overlapping, wherein next mobile route by present node mobile road
Diameter adds next node and obtains.If loop is not present in next mobile route, and there is no the connection path of overlapping, then should
Next node, next mobile route and its mobile cost are added to as new path unit in Priority Queues, on the contrary then do not add
It is added in Priority Queues.Then each path unit is ranked up according to the magnitude relationship of mobile cost, such as by each road
Diameter unit sorts from small to large according to mobile cost, obtains updated Priority Queues.
Step S210 judges that the current mobile route in current path unit whether there is with the path in the record sheet of path
The connection path of overlapping.
If not, executing step S212；If so, return to step S206.If for example, current path record sheet be blank,
Then there is no the connection paths of overlapping certainly for current mobile route.
Step S212 judges that current mobile route whether there is loop.
If not, executing step S214；If so, return to step S206.
It should be noted that above-mentioned steps S210 and step S212 execute sequence without priority.
Step S214 is added to current mobile route as redundant path in the record sheet of path, and judges that path records
Whether the quantity of redundant path reaches preset path quantity K in table.
If not, return to step S206；If so, flow terminates.
The step of repeating above-mentioned acquisition redundant path in this way, until the quantity of redundant path in the record sheet of path reaches
Preset path quantity obtains path record sheet.
Fig. 3 is a kind of network topological diagram provided in an embodiment of the present invention, for the ease of to above-mentioned path record sheet of establishing
Understand, below based on Fig. 3, solves 3 non-overlapping loop free paths (i.e. K=3) of source node V0 to destination node V5, wherein from
The mobile cost that source node is moved to present node is denoted as G, node for path (mobile route) be denoted as path.
(1) it is empty as shown in figure 4, when initializing, in the record sheet of path, the region that two horizontal lines are constituted is can be according to G
The queue (Priority Queues) that is ranked up of value, the node of G minimums is placed on queue heads, and the maximum nodes of G are placed on rear of queue, every time
First node is only taken out in queue.Source node V0 is added in queue first, due to from source node V0 to working as prosthomere
Point V0 is mobile not yet, so practical mobile cost G=0, path：{V0}.
(2) it is taken out in the queue heads of Fig. 4 and deletes first node V0, while whether checking the path of taking-up node
Through reaching destination node, if with the path in the record sheet of path, there are sides to be overlapped (connection path overlapping), finds all do not have at this time
Have, the node V0 nodes being connected are added in queue.I.e. as shown in figure 5, V1, V2, V3 are added in queue, figure
Newly added vertex ticks is new (follow-up identical) in 5.The value and path of G are calculated simultaneously, such as calculates V1, from source node
The practical mobile cost G=70 of V0 to present node V1；Path is its path value to be taken out from the node V0 of deletion, and be added
V1, i.e. path:{ V0, V1 }.The same method of V2, V3 node calculates, and which is not described herein again.
(3) the taking-up node V2 in the queue of Fig. 5, the same step with above-mentioned (2), node V0, V1 that it is connected,
V3, V5 are added in queue, and the result being illustrated in fig. 6 shown below.Since there is loop in the path of newly generated node V0,
V0 is dropped.
(4) V3 nodes, the result being illustrated in fig. 7 shown below are taken out in the queue of Fig. 6.Newly generated node V0, equally
Since there is loop in its path, and it is dropped.
(5) V5 nodes are taken out in the queue of Fig. 7.Due to having arrived at destination node, while its path is not with road
There is overlapping in path in diameter record sheet, loop is also not present, so path { V0, V2, V5 } is added in the record sheet of path, such as
Shown in Fig. 8.Since the number of paths in the record sheet of path is also less than 3, continue to solve.
(6) V1 nodes are taken out in the queue of Fig. 8, and result as shown in Figure 9 is calculated.
(7) first node V1 is taken out in the queue heads of Fig. 9, due in the path path and path record sheet of the node
There are link overlappings in path, i.e. its path：{ V0, V2, V1 } overlaps with { V0, V2, the V5 } in the record sheet of path, weight
It is stacked as V0 to V2, so the node is dropped.Result as shown in Figure 10 is calculated.
(8) first node V3 is taken out in the queue heads of Figure 10, also due to its path path and path record sheet
In there are link overlappings in path, i.e. its path：{ V0, V2, V3 } overlaps with { V0, V2, the V5 } in the record sheet of path,
It is laminated in V0 to V2, so the node is dropped.Result as shown in figure 11 is calculated.
(9) node V4 is taken out in the queue heads of Figure 11, and result as shown in figure 12 is calculated.Newly generated node
V3 since there is loop in its path, and is dropped.
(10) V5 nodes are taken out in the queue of Figure 12, due to having arrived at destination node, while its path not with
There is overlapping in path in the record sheet of path, and loop is also not present, so path { V0, V1, V5 } is added in the record sheet of path,
As shown in figure 13.Since the number of paths in the record sheet of path is also less than 3, continue to solve.
(11) node V2 is taken out in the queue heads of Figure 13, and result as shown in figure 14 is calculated.Newly generated node
V0 and V3 since there is loop in its path, and is dropped.And newly generated node V5, due to the path in the record sheet of path
It is dropped there are overlapping.
(12) node V5 is taken out in the queue heads of Figure 14, due to having arrived at destination node, while its path does not have
There is overlapping with the path in the record sheet of path, loop is also not present, so path { V0, V3, V4, V5 } is added to path record
In table, as shown in figure 15.Since the number of paths in the record sheet of path has been not less than 3, meets and calculate requirement, terminates to calculate.
Embodiment two：
Figure 16 is a kind of structural schematic diagram of network link failure processing unit provided in an embodiment of the present invention, which answers
For SDN, as shown in figure 16, which includes：
Reserve link acquisition module 32 obtains pre-stored and current ink when the current ink of SDN breaks down
Corresponding reserve link；
Target Link selecting module 34, for choosing Target Link from reserve link；
Link switching module 36, for current ink to be switched to Target Link.
Above-mentioned reserve link acquisition module 32 is specifically used for：Obtain the source node and destination node of current ink；According to source
Node and destination node inquire the path of SDN in preset path record sheet；The path of the non-present link found is made
For reserve link.
Above-mentioned Target Link selecting module 34 is specifically used for：The normal, chain not influenced by failure is filtered out from reserve link
Road；The normal link of mobile Least-cost is chosen for Target Link.
Above-mentioned link switching module 36 is specifically used for：Flow table corresponding with Target Link is issued, to switch to Target Link.
Further, above-mentioned apparatus further includes establishing module, this is established module and is connect with reserve link acquisition module 32.It should
Establishing module includes：
Acquiring unit, network topology structure, source node, destination node and preset path quantity for obtaining SDN；Its
In, network topology structure includes the weights of the connection path and connection path between each node of SDN；
Unit is established, is connect with acquiring unit, for according to each connection path and its weights, obtaining source node and purpose
Mobile Least-cost between node and a plurality of redundant path there is no loop, and path note is established according to each redundant path
Record table；
Wherein, the quantity of redundant path is equal to preset path quantity, and the connection path that each redundant path is included does not weigh
It is folded, the weights sum for each connection path that the mobile cost of redundant path includes by redundant path.
Above-mentioned unit of establishing is specifically used for：
Source node, the corresponding mobile route of source node and its mobile cost are added to preferential team as a path unit
To establish Priority Queues in row, and establish the path record sheet of blank；Wherein, Priority Queues includes the path unit of addition, road
Diameter unit includes node, the corresponding mobile route of node and its mobile cost；The corresponding mobile route of i-th of node is to be saved from source
Point is moved to the path of i-th of node, and i is positive integer；
Obtain redundant path：It is taken out from Priority Queues and deletes the path unit of mobile Least-cost as current path
Unit, and judge whether the present node in current path unit is purpose node；
If present node is destination node, judge that the current mobile route in current path unit whether there is loop,
And current mobile route whether there is Chong Die connection path with the path in the record sheet of path；
If loop is not present in current mobile route, and there is no the connection path of overlapping, then makees current mobile route
It is added in the record sheet of path for redundant path；
The step of repeating above-mentioned acquisition redundant path, until the quantity of redundant path in the record sheet of path reaches default
Number of paths obtains path record sheet.
Above-mentioned unit of establishing is additionally operable to：If present node is not destination node, acquisition connect each with present node
Next node, and Priority Queues is updated according to each next node.
Further, it is above-mentioned establish unit also particularly useful for：
The corresponding next mobile route of next node is obtained, judges next mobile route with the presence or absence of loop and next
Mobile route whether there is Chong Die connection path with the path in the record sheet of path；
If loop is not present in next mobile route, and there is no the connection paths of overlapping, then by next node, Xia Yiyi
Dynamic path and its mobile cost are added to Priority Queues as new path unit；
Each path unit is ranked up according to the magnitude relationship of mobile cost, obtains updated Priority Queues.
In the embodiment of the present invention, when the current ink of SDN breaks down, obtain pre-stored corresponding with current ink
Reserve link；Target Link is chosen from reserve link；Current ink is switched into Target Link.The embodiment of the present invention provides
Network link failure processing unit can accomplish lower configuration, management and O＆M since multilink bundling need not be carried out
Cost possesses preferable flexibility and scalability；It goes to calculate new road since network need not be restrained again when link sends failure
By, therefore the calculating time of a large amount of fault restoration is saved, the processing speed of network link failure is improved, to reduce
Upper-level virtual network is by being influenced.
Embodiment three：
Referring to Figure 17, the embodiment of the present invention also provides a kind of controller 100, including：Processor 40, memory 41, bus
42 and communication interface 43, the processor 40, communication interface 43 and memory 41 connected by bus 42；Processor 40 is for holding
The executable module stored in line storage 41, such as computer program.
Wherein, memory 41 may include high-speed random access memory (RAM, RandomAccessMemory), also may be used
Can further include nonvolatile memory (non-volatile memory), for example, at least a magnetic disk storage.Pass through at least one
A communication interface 43 (can be wired or wireless) realizes the communication link between the system network element and at least one other network element
It connects, internet, wide area network, local network, Metropolitan Area Network (MAN) etc. can be used.
Bus 42 can be isa bus, pci bus or eisa bus etc..The bus can be divided into address bus, data
Bus, controlling bus etc..For ease of indicating, only indicated with a four-headed arrow in Figure 17, it is not intended that an only bus
Or a type of bus.
Wherein, memory 41 is for storing program, and the processor 40 executes the journey after receiving and executing instruction
Sequence, the method performed by device that the stream process that aforementioned any embodiment of the embodiment of the present invention discloses defines can be applied to handle
In device 40, or realized by processor 40.
Processor 40 may be a kind of IC chip, the processing capacity with signal.During realization, above-mentioned side
Each step of method can be completed by the integrated logic circuit of the hardware in processor 40 or the instruction of software form.Above-mentioned
Processor 40 can be general processor, including central processing unit (Central Processing Unit, abbreviation CPU), network
Processor (Network Processor, abbreviation NP) etc.；It can also be digital signal processor (Digital Signal
Processing, abbreviation DSP), application-specific integrated circuit (Application Specific Integrated Circuit, referred to as
ASIC), ready-made programmable gate array (Field-Programmable Gate Array, abbreviation FPGA) or other are programmable
Logical device, discrete gate or transistor logic, discrete hardware components.It may be implemented or execute in the embodiment of the present invention
Disclosed each method, step and logic diagram.General processor can be microprocessor or the processor can also be to appoint
What conventional processor etc..The step of method in conjunction with disclosed in the embodiment of the present invention, can be embodied directly in hardware decoding processing
Device executes completion, or in decoding processor hardware and software module combination execute completion.Software module can be located at
Machine memory, flash memory, read-only memory, programmable read only memory or electrically erasable programmable memory, register etc. are originally
In the storage medium of field maturation.The storage medium is located at memory 41, and processor 40 reads the information in memory 41, in conjunction with
Its hardware completes the step of above method.
It is apparent to those skilled in the art that for convenience and simplicity of description, the device of foregoing description
And the specific work process of controller, it can refer to corresponding processes in the foregoing method embodiment, details are not described herein.
Network link failure processing unit provided in an embodiment of the present invention and controller, the network provided with above-described embodiment
Link failure processing method technical characteristic having the same reaches identical technology so can also solve identical technical problem
Effect.
In all examples being illustrated and described herein, any occurrence should be construed as merely illustrative, without
It is as limitation, therefore, other examples of exemplary embodiment can have different values.
Flow chart and block diagram in attached drawing show device, method and the computer journey of multiple embodiments according to the present invention
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part for a part for one module, section or code of table, the module, section or code includes one or more uses
The executable instruction of the logic function as defined in realization.It should also be noted that in some implementations as replacements, being marked in box
The function of note can also occur in a different order than that indicated in the drawings.For example, two continuous boxes can essentially base
Originally it is performed in parallel, they can also be executed in the opposite order sometimes, this is depended on the functions involved.It is also noted that
It is the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart, can uses and execute rule
The dedicated hardware based system of fixed function or action is realized, or can use the group of specialized hardware and computer instruction
It closes to realize.
The computer program product for the progress network link failure processing method that the embodiment of the present invention is provided, including storage
The computer readable storage medium of the executable non-volatile program code of processor, the instruction that said program code includes can
For executing the method described in previous methods embodiment, specific implementation can be found in embodiment of the method, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed device and method can pass through it
Its mode is realized.The apparatus embodiments described above are merely exemplary, for example, the division of the unit, only
A kind of division of logic function, formula that in actual implementation, there may be another division manner, in another example, multiple units or component can combine
Or it is desirably integrated into another system, or some features can be ignored or not executed.Another point, shown or discussed phase
Coupling, direct-coupling or communication connection between mutually can be by some communication interfaces, the INDIRECT COUPLING of device or unit or
Communication connection can be electrical, machinery or other forms.
The unit illustrated as separating component may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, you can be located at a place, or may be distributed over multiple
In network element.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also
It is that each unit physically exists alone, it can also be during two or more units be integrated in one unit.
It, can be with if the function is realized in the form of SFU software functional unit and when sold or used as an independent product
It is stored in the executable non-volatile computer read/write memory medium of a processor.Based on this understanding, of the invention
Technical solution substantially the part of the part that contributes to existing technology or the technical solution can be with software in other words
The form of product embodies, which is stored in a storage medium, including some instructions use so that
One computer equipment (can be personal computer, server or the network equipment etc.) executes each embodiment institute of the present invention
State all or part of step of method.And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (ROM, Read-
Only Memory), random access memory (RAM, Random Access Memory), magnetic disc or CD etc. are various can be with
Store the medium of program code.
Finally it should be noted that：Embodiment described above, only specific implementation mode of the invention, to illustrate the present invention
Technical solution, rather than its limitations, scope of protection of the present invention is not limited thereto, although with reference to the foregoing embodiments to this hair
It is bright to be described in detail, it will be understood by those of ordinary skill in the art that：Any one skilled in the art
In the technical scope disclosed by the present invention, it can still modify to the technical solution recorded in previous embodiment or can be light
It is readily conceivable that variation or equivalent replacement of some of the technical features；And these modifications, variation or replacement, do not make
The essence of corresponding technical solution is detached from the spirit and scope of technical solution of the embodiment of the present invention, should all cover the protection in the present invention
Within the scope of.Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. a kind of network link failure processing method, which is characterized in that it is applied to software defined network SDN, the method includes：
When the current ink of the SDN breaks down, pre-stored reserve link corresponding with the current ink is obtained；
Target Link is chosen from the reserve link；
The current ink is switched into the Target Link.
2. according to the method described in claim 1, it is characterized in that, the acquisition is pre-stored corresponding with the current ink
Reserve link, including：
Obtain the source node and destination node of the current ink；
According to the source node and the destination node, the path of the SDN is inquired in preset path record sheet；
Using the path of the non-current ink found as reserve link.
3. according to the method described in claim 2, it is characterized in that, the path record sheet is established by the following method：
Obtain network topology structure, source node, destination node and the preset path quantity of the SDN；Wherein, the network topology
Structure includes the weights of the connection path and the connection path between each node of the SDN；
According to connection path and its weights described in each item, mobile cost between the source node and the destination node is obtained most
A plurality of redundant path small and there is no loop, and path record sheet is established according to redundant path described in each item；
Wherein, the quantity of the redundant path is equal to the preset path quantity, the connection that redundant path described in each item is included
Path is not overlapped, the weights of each connection path that the mobile cost of the redundant path includes by the redundant path it
With.
4. according to the method described in claim 3, it is characterized in that, described according to connection path and its weights described in each item, obtain
It takes the mobile Least-cost between the source node and the destination node and a plurality of redundant path of loop is not present, and according to
Redundant path described in each item establishes path record sheet, including：
It is added to using the source node, the corresponding mobile route of the source node and its mobile cost as a path unit excellent
To establish the Priority Queues in first queue, and establish the path record sheet of blank；Wherein, the Priority Queues includes addition
The path unit, the path unit include node, the corresponding mobile route of the node and its mobile cost；I-th of section
The corresponding mobile route of point is the path that i-th of node is moved to from the source node, and i is positive integer；
Obtain redundant path：It is taken out from the Priority Queues and deletes the path unit of mobile Least-cost as current path
Unit, and judge whether the present node in the current path unit is the destination node；
If the present node is the destination node, judge whether the current mobile route in the current path unit is deposited
It whether there is Chong Die connection path with the path in the path record sheet in loop and the current mobile route；
If loop is not present in the current mobile route, and there is no the connection paths of overlapping, then by the current mobile road
Diameter is added to as redundant path in the path record sheet；
The quantity of the step of repeating above-mentioned acquisition redundant path, the redundant path described in the path record sheet reaches
The preset path quantity obtains the path record sheet.
5. according to the method described in claim 4, it is characterized in that, the method further includes：
If the present node is not the destination node, each next node being connect with the present node is obtained, and
The Priority Queues is updated according to each next node.
6. according to the method described in claim 5, it is characterized in that, described described preferential according to each next node update
Queue, including：
The corresponding next mobile route of the next node is obtained, judges that next mobile route whether there is loop, and
Next mobile route whether there is Chong Die connection path with the path in the path record sheet；
If loop is not present in next mobile route, and there is no the connection paths of overlapping, then by the next node, institute
It states next mobile route and its mobile cost is added to the Priority Queues as new path unit；
Each path unit is ranked up according to the magnitude relationship of mobile cost, obtains updated Priority Queues.
7. according to the method described in claim 1, it is characterized in that, described choose Target Link, packet from the reserve link
It includes：
The normal link not influenced by failure is filtered out from the reserve link；
The normal link of mobile Least-cost is chosen for Target Link.
8. according to the method described in claim 1, it is characterized in that, described switch to the object chain by the current ink
Road, including：
Flow table corresponding with the Target Link is issued, to switch to the Target Link.
9. a kind of network link failure processing unit, which is characterized in that be applied to software defined network SDN, described device includes：
Reserve link acquisition module obtains the pre-stored and current chain when the current ink of the SDN breaks down
The corresponding reserve link in road；
Target Link selecting module, for choosing Target Link from the reserve link；
Link switching module, for the current ink to be switched to the Target Link.
10. a kind of controller, including memory, processor, be stored in the memory to run on the processor
Computer program, which is characterized in that the processor is realized any in the claims 1-8 when executing the computer program
Method described in.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810396284.9A CN108667727B (en) | 2018-04-27 | 2018-04-27 | Network link fault processing method and device and controller |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810396284.9A CN108667727B (en) | 2018-04-27 | 2018-04-27 | Network link fault processing method and device and controller |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108667727A true CN108667727A (en) | 2018-10-16 |
| CN108667727B CN108667727B (en) | 2021-03-16 |
Family
ID=63781245
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810396284.9A Active CN108667727B (en) | 2018-04-27 | 2018-04-27 | Network link fault processing method and device and controller |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108667727B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109361545A (en) * | 2018-11-01 | 2019-02-19 | 郑州云海信息技术有限公司 | A kind of method and device of software defined network SDN controller control link switching |
| CN109951331A (en) * | 2019-03-15 | 2019-06-28 | 北京百度网讯科技有限公司 | For sending the method, apparatus and computing cluster of information |
| CN110933697A (en) * | 2019-11-19 | 2020-03-27 | Oppo（重庆）智能科技有限公司 | Network state detection method and device, storage medium and electronic equipment |
| CN111404734A (en) * | 2020-03-06 | 2020-07-10 | 北京邮电大学 | Cross-layer network fault recovery system and method based on configuration migration |
| CN111782137A (en) * | 2020-06-17 | 2020-10-16 | 杭州宏杉科技股份有限公司 | Path fault processing method and device |
| CN112491700A (en) * | 2020-12-14 | 2021-03-12 | 成都颜创启新信息技术有限公司 | Network path adjusting method, system, device, electronic equipment and storage medium |
| CN113099321A (en) * | 2019-12-23 | 2021-07-09 | 中国电信股份有限公司 | Method, device and computer readable storage medium for determining communication path |
| CN114244689A (en) * | 2021-12-13 | 2022-03-25 | 中国电信股份有限公司 | SDN network maintenance method and device, electronic equipment and readable medium |
| CN114338357A (en) * | 2021-12-13 | 2022-04-12 | 阿里巴巴（中国）有限公司 | Method and device for transmitting data message in network |
| CN116760763B (en) * | 2023-08-16 | 2024-01-09 | 苏州浪潮智能科技有限公司 | Link switching method, device, computing system, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301146A (en) * | 2014-10-23 | 2015-01-21 | 杭州华三通信技术有限公司 | Link switching method and device in software defined network |
| US9559948B2 (en) * | 2012-02-29 | 2017-01-31 | Dell Products, Lp | System and method for managing unknown flows in a flow-based switching device |
| CN106385363A (en) * | 2016-09-18 | 2017-02-08 | 北京邮电大学 | SDN data plane data-flow backup method and device |
| CN107465611A (en) * | 2017-09-05 | 2017-12-12 | 北京东土科技股份有限公司 | The pretection switch method and device of SDN controllers and Switch control link |
-
2018
- 2018-04-27 CN CN201810396284.9A patent/CN108667727B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9559948B2 (en) * | 2012-02-29 | 2017-01-31 | Dell Products, Lp | System and method for managing unknown flows in a flow-based switching device |
| CN104301146A (en) * | 2014-10-23 | 2015-01-21 | 杭州华三通信技术有限公司 | Link switching method and device in software defined network |
| CN106385363A (en) * | 2016-09-18 | 2017-02-08 | 北京邮电大学 | SDN data plane data-flow backup method and device |
| CN107465611A (en) * | 2017-09-05 | 2017-12-12 | 北京东土科技股份有限公司 | The pretection switch method and device of SDN controllers and Switch control link |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109361545A (en) * | 2018-11-01 | 2019-02-19 | 郑州云海信息技术有限公司 | A kind of method and device of software defined network SDN controller control link switching |
| CN109951331A (en) * | 2019-03-15 | 2019-06-28 | 北京百度网讯科技有限公司 | For sending the method, apparatus and computing cluster of information |
| CN109951331B (en) * | 2019-03-15 | 2021-08-20 | 北京百度网讯科技有限公司 | Method, device and computing cluster for sending information |
| CN110933697A (en) * | 2019-11-19 | 2020-03-27 | Oppo（重庆）智能科技有限公司 | Network state detection method and device, storage medium and electronic equipment |
| CN110933697B (en) * | 2019-11-19 | 2022-12-20 | Oppo（重庆）智能科技有限公司 | Network state detection method and device, storage medium and electronic equipment |
| CN113099321A (en) * | 2019-12-23 | 2021-07-09 | 中国电信股份有限公司 | Method, device and computer readable storage medium for determining communication path |
| CN111404734B (en) * | 2020-03-06 | 2021-03-19 | 北京邮电大学 | Cross-layer network fault recovery system and method based on configuration migration |
| US11431556B2 (en) | 2020-03-06 | 2022-08-30 | Beijing University Of Posts And Telecommunications | Cross-layer network fault recovery system and method based on configuration migration |
| CN111404734A (en) * | 2020-03-06 | 2020-07-10 | 北京邮电大学 | Cross-layer network fault recovery system and method based on configuration migration |
| CN111782137A (en) * | 2020-06-17 | 2020-10-16 | 杭州宏杉科技股份有限公司 | Path fault processing method and device |
| CN112491700A (en) * | 2020-12-14 | 2021-03-12 | 成都颜创启新信息技术有限公司 | Network path adjusting method, system, device, electronic equipment and storage medium |
| CN114244689A (en) * | 2021-12-13 | 2022-03-25 | 中国电信股份有限公司 | SDN network maintenance method and device, electronic equipment and readable medium |
| CN114338357A (en) * | 2021-12-13 | 2022-04-12 | 阿里巴巴（中国）有限公司 | Method and device for transmitting data message in network |
| CN114338357B (en) * | 2021-12-13 | 2024-05-14 | 阿里巴巴（中国）有限公司 | Method and device for transmitting data message in network |
| CN116760763B (en) * | 2023-08-16 | 2024-01-09 | 苏州浪潮智能科技有限公司 | Link switching method, device, computing system, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108667727B (en) | 2021-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108667727A (en) | network link failure processing method, device and controller | |
| US9454408B2 (en) | Managing network utility of applications on cloud data centers | |
| CN106464530B (en) | The method and system for the dynamic dispatching that network updates | |
| US11005781B2 (en) | Networking method for data center network and data center network | |
| CN108260169A (en) | A kind of service function chain dynamic deployment method ensured based on QoS | |
| US20180077048A1 (en) | Controller, control method and program | |
| CN107666412A (en) | The virtual network function dispositions method of service function chain | |
| KR20170017903A (en) | Proactive handling of network faults | |
| CN104469845B (en) | A kind of message processing method, system and equipment | |
| CN105721307A (en) | Multipath message forwarding method and device | |
| US20170331706A1 (en) | Method and Device for Implementing Capacity Planning | |
| CN108023761A (en) | The method and apparatus for distributing resource | |
| CN106817306B (en) | Method and device for determining target route | |
| CN115065637B (en) | Method and device for transmitting computing power resource information and electronic equipment | |
| JP2016018387A (en) | Information processing system, control method, and control program | |
| CN109361596A (en) | Route computing method, device and electronic equipment | |
| WO2016197301A1 (en) | Policy coordination method and apparatus in nfv system | |
| CN105247823B (en) | The method and apparatus for adjusting link overhead | |
| CN106104503B (en) | Using unified API to for forwarding server and framework program to be used for the fine granularity network optimization | |
| CN104601364A (en) | Method and device for managing members in management cluster | |
| CN105745874A (en) | Method and device for determining service function path | |
| CN106470165A (en) | A kind of load sharing method, system and relevant device | |
| CN108347377A (en) | Data forwarding method and device | |
| US9686099B2 (en) | Updating virtual network maps | |
| US11483210B2 (en) | Interdomain path calculation based on an abstract topology |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |