CN105721297B - Detection method and system based on route loop in SDN network - Google Patents
Detection method and system based on route loop in SDN network Download PDFInfo
- Publication number
- CN105721297B CN105721297B CN201610059884.7A CN201610059884A CN105721297B CN 105721297 B CN105721297 B CN 105721297B CN 201610059884 A CN201610059884 A CN 201610059884A CN 105721297 B CN105721297 B CN 105721297B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- routing
- forwarding
- loop
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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/18—Loop-free operations
-
- 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/48—Routing tree calculation
Abstract
The invention discloses a kind of detection methods based on route loop in SDN network, comprising: obtains the routing table information and routing-events information of each node in network in real time；According to the routing table information of acquisition and routing-events information, the real-time topology structure of tectonic network；According to real-time topology structure, using the multirouting list prefix trees of the method construct longest prefix match of level compression, and the forwarding subnet network segment in the routing table of each node is stored；In the subnet network segment for needing to judge loop, route next jump table is generated to each subnet node in the prefix trees, each subnet node for traversing prefix trees generates the forwarding figure of node；According to the forwarding figure of node, route loop is judged whether there is.The invention also discloses a kind of detection systems based on route loop in SDN network.The detection method and system based on route loop in SDN network not only increases the efficiency and accuracy of route loop detection；Meanwhile reducing memory space and calculating the time.
Description
Technical field
The present invention relates to technical field of network communication, particularly relate to a kind of detection side based on route loop in SDN network
Method and system.
Background technique
SDN is software defined network (SDN-Software-Defined Networking), is one be suggested recently
The innovative network technology of kind and network frame.Its core concept is combined using centerized fusion and distributed AC servo system, will
Plane and Forwarding plane separation are controlled, and controls and passes through disclosed agreement (such as Openflow etc.) between plane and Forwarding plane
It is communicated, to realize that complicated service logic realizes its Forwarding plane without influencing particular vendor, has greatly facilitated net
The innovation of network, under the internet overall background developed rapidly now, SDN network has well adapted to diversified demand and business is more
The complex situations of sample.
SDN network is known as its function of controlling plane of the software realization of controller (Controller) by one.Due to
The network of the dynamic of the network operation, the complexity of environment and the various asynchronous events occurred at any time, normal operation can be frequent
Property the anomalous routes situations such as various failures, including route loop, path black hole and unreachable routing occur.The exception of routing can be led
Congestion and packet loss are caused, if this kind of failure cannot be solved quickly, it is possible to will appear serious communication disruption, in turn result in huge
Economic loss.Meanwhile becoming increasingly complex with the expansion of network size and business, solved by being positioned manually it is this kind of therefore
Barrier becomes more and more difficult.
The judgment method of route loop in existing SDN network, since nodal function is limited, while node is not run generally point
Cloth Routing Protocol, therefore the judgement of loop is difficult to complete on node.Although route test function be transferred to controller it
Afterwards, controller obtains the operating status of the whole network and the routing iinformation of each node.Pass through every routing to each network node
Table is analyzed and is judged, it can be found that the route loop phenomenon in network.However, due to the complexity and diversity of business,
Number of routes/routing policy on usual individual node is just very more, and number of routes/routing policy of the whole network node has added
It carries out the calculating time and memory space that judgement will be costly, will be one very huge negative for controller
Load.That is, the judgement for carrying out network loop in existing SDN network needs intensive calculating and the storage of huge data.
Summary of the invention
In view of this, it is an object of the invention to propose a kind of detection method based on route loop in SDN network and be
System, can not only quickly, accurately realize the detection of route loop, and required memory space greatly reduces.
Based on the above-mentioned purpose detection method provided by the invention based on route loop in SDN network, comprising:
The routing table information and routing-events information of each node in network are obtained in real time；
According to the routing table information of acquisition and routing-events information, the real-time topology structure of tectonic network；
According to real-time topology structure, using the multirouting list prefix of the method construct longest prefix match of level compression
Tree, and store the forwarding subnet network segment in the routing table of each node；
In the subnet network segment for needing to judge loop, route next jump is generated to each subnet node in the prefix trees
Table, each subnet node for traversing prefix trees generate the forwarding figure of node；
According to the forwarding figure of node, route loop is judged whether there is.
Preferably, described real-time the step of obtaining the routing table information and routing-events information of each node in network, wraps
It includes:
According to the different agreement that router is run, routing table information and routing are obtained using detector corresponding with agreement
Event information.
Preferably, the step of method of the specially fixed hierarchical level compression of the method for the level compression, realization are as follows:
Prefix trees are configured to 5 successively different levels interconnected, and the rank of level from top to bottom is successively adopted
With the distribution mode of 8-8-8-4-4.
Preferably, the step of forwarding figure for generating node includes:
Firstly, modeling to network, network model G (V, E, W) is obtained, wherein V indicates the set of nodes, E
Indicate that line set namely node between two nodes correspond to the connecting link between equipment, W indicates the weight of each of the links；
Forwarding behavior on router is defined as follows:
F (p, ru)=v, u, v ∈ V, wherein u, v are different nodes, and p is the message to be forwarded, ruIt indicates on node u
Routing table；
Obtain the definition that message p is forwarded in the entire network:
F (p, R∑u)={<i, j>| f (p, ru)=j；I, j, u ∈ V }, wherein R indicates the routing of each router on network
Table set；
Then, in prefix trees, the bit of message p is decomposed, and prefix trees are searched, until reaching p's
Until prefix, node each accessed includes during record search next-hop；
By the forwarding of these next-hops namely message p as a result, obtaining message p to forward result on network being ordered pair
Set T (p, R), and
T (p, R)=F (p, R∑u)
The digraph formed by the set T (p, R) of ordered pair, obtains the forwarding figure of node.
Further, the forwarding behavior for the routing of multipath, on the router are as follows:
F (p, ru)={ vi|viFor next-hop node of the message p on node u }, u, vi∈V。
Preferably, described the step of judging whether there is route loop, includes:
It is alive by all vertex ticks, and stack space is initialized as sky；
Judge present node whether and meanwhile there is in-degree and out-degree, if so, being labeled as visited, and make present node
Stacking, if it is not, being then labeled as dead；
Judge whether stack space is empty, if so, indicating that route loop is not present, if it is not, further judging stack top node
Whether subsequent node is had；
If stack top node does not have subsequent node, stack top vertex ticks is dead, and stack top node is made to pop；
Return continues to judge whether stack space is sky, until all nodes are all marked as dead, then it represents that road is not present
By loop.
Further, described to judge whether stack top node has the step of subsequent node to include:
If stack top node has subsequent node, the subsequent node of stack top node is obtained；
Judge whether subsequent node is labeled as alive, if so, return it is described judge present node whether and meanwhile have into
The step of degree and out-degree, which is continued to judge, if it is not, then further judging whether subsequent node is labeled as
visited；
If subsequent node is labeled as visited, then it represents that there are route loops；
It is dead by stack top vertex ticks, and stack top node is made to pop if subsequent node is not marked with visited.
The present invention also provides a kind of detection systems based on route loop in SDN network, comprising:
Routing information acquisition module, for obtaining the routing table information of each node and routing-events letter in network in real time
Breath；
Topological structure generation module, for according to the routing table information and routing obtained in the routing information acquisition module
Event information, the real-time topology structure of tectonic network；
Prefix trees constructing module, for according to the real-time topology structure in the topological structure generation module, using level
The multirouting list prefix trees of the method construct longest prefix match of compression, and store forwarding in the routing table of each node
Net network segment；
Routing calculation module, in the subnet network segment for needing to judge loop, to each subnet in the prefix trees
Node generates route next jump table, and each subnet node for traversing prefix trees generates the forwarding figure of node；
It routes detection module and judges whether there is road for the forwarding figure according to the node in the routing calculation module
By loop.
From the above it can be seen that the detection method and system provided by the invention based on route loop in SDN network
By the real-time topology structure chart of tectonic network and the multirouting list prefix trees of construction longest prefix match, net is finally obtained
The forwarding figure of all nodes in network can rapidly and accurately judge whether there is route loop according to the forwarding figure of the node.
In this way, not only make deterministic process unrelated with Routing Protocol and network flow, the efficiency of route loop detection and accurate is improved
Property；Meanwhile the multirouting list prefix trees of construction can greatly reduce memory space and calculate the time.
Detailed description of the invention
Fig. 1 is the flow chart of normal condition in existing provisional route loop；
Fig. 2 detects flow chart when failure for R1 in existing provisional route loop；
Flow chart when failure is not detected for R2 in existing provisional route loop by Fig. 3；
Flow chart when Fig. 4 is troubleshooting in existing provisional route loop；
Fig. 5 is the flow chart of existing persistence route loop；
Fig. 6 is the flow chart provided by the invention based on the embodiment of the detection method of route loop in SDN network；
Fig. 7 is fixation hierarchical layer employed in the detection method provided by the invention based on route loop in SDN network
The structural schematic diagram of second compression method；
Fig. 8 is the structural representation provided by the invention based on the route loop of the detection method of route loop in SDN network
Figure；
Fig. 9 is the structural schematic diagram provided by the invention based on the forwarding figure of the detection method of route loop in SDN network；
Figure 10 is that the route loop provided by the invention based on the detection method of route loop in SDN network judges algorithm
Flow chart；
Figure 11 is that the route loop in the detection method provided by the invention based on route loop in SDN network judges algorithm
An exemplary structural schematic diagram；
Figure 12 is the system structure diagram provided by the invention based on the detection system of route loop in SDN network；
Figure 13 is the system architecture schematic diagram provided by the invention based on the detection system of route loop in SDN network.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with specific embodiment, and reference
Attached drawing, the present invention is described in more detail.
Firstly, the root that the type and route loop for route loop generate is briefly described.
Routing Protocol is used to refer to the router in wire guide network when E-Packeting, and how to select appropriate path, thus
Realize the communication function between distinct device and different user.For the routing of realizing route correct and appropriate, router
The interconnection state of network must be known in advance, and then router can run specific routing algorithm to calculate corresponding choosing
Road strategy.
Despite the presence of many different Routing Protocols, but can according to routing information acquisition and the difference of circulation way,
And it is divided into 2 classes: link-state routing protocol (link-state routing protocols) and distance vector routing protocol
(distance-vector routing protocols).The example of link-state routing protocol has: OSPF and IS-IS type
Agreement；And distance vector routing protocol then has: the agreement of the types such as RIP/RIPv2 and IGRP.It is not completed in routing convergence, or
In the case where person's error configurations, it is likely to lead to the generation of route loop.If message forwarding falls into route loop, message
It can be recycled back and forth between the router for forming loop, until the TTL of message is exhausted and abandoned.
Route loop is also classified into 2 classes: provisional route loop and persistence route loop.When network state changes,
Such as topology, when changing, correct routing policy must regenerate；Then router startup routing algorithm calculates routing.
Router in different nodes is multifarious, and router-level topology is completed different into convergent time point.This distribution
Inconsistency can lead to the generation of route loop.However once the convergence of all devices is completed, network enters consistent state,
Route loop Lock-out at this time.This route loop is known as provisional route loop, it is that nature is generated and can not be kept away
Exempt from, the duration is short (usually within millisecond even microsecond), thus hardly impacts to network communication.
Provisional loop results from each node and recognizes inconsistent situation to the state of the whole network.Fig. 1-Fig. 4 gives one
A extremely simple situation:
Shown in referring to Fig.1, it is in structure when normal condition for node, node R 2 is obtained to purpose section according to routing algorithm
The Route Selection shortest path sequence of point R4: R2-R1-R3-R4.
It referring to shown in Fig. 2 and Fig. 3, is forwarded to the path of destination node from R2, R2 is not detected failure or detects event
Barrier does not complete processing still, and R1 detects failure and handles, and is still forwarded to the path of destination node from R1, forms provisional road
By loop.
Referring to shown in Fig. 4, R1/R2 is consistent to the cognition of the whole network, forwards to the routing of destination node R4 from R2, provisional ring
Road disappears.
It can be seen that provisional route loop is after the completion of all nodes are restrained, the route loop Lock-out of generation.It is right
In IGP agreement such as OSPF etc., the convergent deadline be can be improved within second rank.Therefore IGP Routing Protocol faces
When property loop not will cause very big influence.The time spent in bgp protocol convergence time ratio IGP agreement long, some documents
In point out that the convergence time of BGP is even up to more than ten minutes or more.If provisional route loop occurs when not converged for a long time,
Network delay and network flow will increase, to reduce the performance of network.
There are many producing causes of persistence route loop, such as error configurations or network equipment failure etc..Very much
In the network of large enterprise, multiple routed domains are frequently present of, and due to history (such as merger of business/company etc.),
These routed domains may use different IGP agreements, such as OSPF, RIP or EIGPR etc., and the configuration of mistake leads to hold
The generation of long property route loop.It is right in bibliography " End-to-end routing behavior in the Internet "
More than 40,000, the routing detection of Internet, the route loop that the discovery duration can achieve several hours are existing end to end
As.Persistence route loop once generate, then must manual intervention can solve, and since the duration is long, cost
Greatly, it is influenced caused by also big.If it is the route loop across Autonomous Domain (AS:Autonomous System), then different groups are needed
It knits and is coordinated, time-consuming and cost is bigger.
When running network is upgraded perhaps migrated when network must configure or reconfigure.Its step is abided by
Follow the progress of router one by one, although in the initial of configuration and last without generating route loop, the process of configuration be by
What step was completed, therefore will appear the inconsistent situation of routing state.Point out that such case may generate routing in some documents
Loop.In SDN network, configuration update the step of it is inconsistent, also will appear of short duration route loop, directly result in the short time
Packet loss and the quality of network service decline situation.When the core router in network polymerize route prefix, if poly-
Close it is inappropriate may also can there is a situation where loops.
Referring to Figure 5, it is connected with the server cluster of 2/24 prefixes below client router R, therefore R is to offer
The router Core of quotient has declared the routing of two "/24 " prefixes.Core router thinks the network address section of 10.2.2.0/22
It can be transferred through R arrival, therefore be a routing by the route aggregation of this two prefixes.It, will when message 10.2.2.2 reaches Core
It is forwarded to R router, and R router finds that the server that this message is not belonging to below R is all, then according to the default road of R
By being forwarded to Core, route loop phenomenon is caused.
It is the stream provided by the invention based on the embodiment of the detection method of route loop in SDN network referring to shown in Fig. 6
Cheng Tu.The detection method based on route loop in SDN network includes:
Step 101, the routing table information and routing-events information of each node in network are obtained in real time.
Wherein, the routing table information and routing-events information include link-state information in SDN network and anti-in real time
The routing iinformation of feedback.Here, routing iinformation is acquired by relevant detector.
Step 102, according to the routing table information of acquisition and routing-events information, the real-time topology structure of tectonic network.
By the routing table information and routing-events information obtained in step 101, adjacent node in SDN network can be obtained
Between connection relationship, the topological structure of network is just generated in conjunction with all nodal informations.Connection relationship between node, i.e.,
The acquisition of network connection information is by Link Layer Discovery Protocol LLDP (Link Layer Discovery Protocol) come complete
At, which is defined by IEEE 802.1AB and is the two-layer protocol unrelated with manufacturer.Equipment interconnected can be regular
Message is sent to neighbours, which contains management address, unique ability, device identification and interface identifier on local device etc.
Information, and it is encapsulated into the form of TLV (Type/Length/Value) protocol Data Unit (LLDPDU:Link of LLDP
Layer Discovery Protocol Data Unit) in sent.
When the interchanger in SDN network is connected to controller, the message that interchanger is sent to controller is carried and this
The opposite equip. information that equipment is connected directly, according to this information, passively network discovery mechanism is may be implemented in controller.If handed over
It changes planes information collected by not sent LLDP agreement, then controller issues message that type is OFPT_PACKET_OUT to exchanging
Machine instructs interchanger to send LLDP message from its interface, and the interchanger for then receiving LLDP message passes through FPT_PACKET_IN class
Type message up sending is to controller, and then controller can construct the topological relation of whole network.
Step 103, according to real-time topology structure, using the multiple routing tables of the method construct longest prefix match of level compression
Single prefix trees, and store the forwarding subnet network segment in the routing table of each node.
The abnormal detection of routing depends on the routing iinformation of each node, in order to store the road with easy-to-look-up each node
By information, need to construct the scheme of effective routing table storage and inquiry.In bibliography " A tree-based packet
Routing table for Berkeley unix " in propose it is a kind of construction binary chop tree progress route querying solution
Scheme.This scheme theoretically can effectively carry out the lookup of route table items.But not due to the distribution of IP route prefix length
Uniformity, such as: IPv4 is mentioned in bibliography " Visibility of Prefix Lengths in IPv4 and IPv6 "
It is between 16 to 24 that address block, which is concentrated mainly on prefix length, and the address block for being especially 24 with prefix length is most.Using two points
The scheme of search tree needs to store a large amount of intermediate node, in this way, not only causing the waste of memory space, but also has delayed inquiry
Time.Before dynamic level compression method construct in bibliography " IP-address lookup using LC-tries "
Efficiency is lower when sewing tree namely LC-Trie tree, but reaching 100K or more for routing table entry.Bibliography " hand over by third layer
Change technology and its application study in wideband IP network " in use the method storage LC-Trie prefix trees of static level compression,
When routing entry is more than 100K, faster inquiry velocity can be obtained by this method, while memory space can be saved.
Herein in conjunction with above-mentioned all methods, does and improved to adapt to the needs of real network operation for the case where SDN network.
Step 104, in the subnet network segment for needing to judge loop, road is generated to each subnet node in the prefix trees
By next skip list, each subnet node for traversing prefix trees generates the forwarding figure of node.
Wherein, the next-hop refers to next router section that message will be forwarded on current router node
Point, corresponding, next skip list refers to the set of state interconnected between node.
Step 105, according to the forwarding figure of node, route loop is judged whether there is.
After the forwarding figure for constructing corresponding each network segment, it can determine whether in network on forwarding figure with the presence or absence of Routing Loop
The case where road.On forwarding figure, if there is route loop, then this forwarding figure is equivalent to closed loop.In reference text
It offers and gives a kind of complexity O (V+E) in " Depth-first search and linear graph algorithms "
Calculate the linear time algorithm of all strong continune components in digraph.But it is more simple based on being involved in the problems, such as in the present invention
It is single, namely only need to judge whether there is loop.To be improved to above-mentioned algorithm, obtains depth-first label and calculate
Method, complexity are still equally O (V+E) with document, but realize when the calculating time and memory space it is more excellent.
As can be seen from the above embodiments, the detection method of the present invention based on route loop in SDN network has following
Advantage:
(1) it is basic that the detection method based on route loop in SDN network described in the route loop from SDN network occurs
Reason, that is, routing table can judge whether route loop occur close to 100% in this way to determine whether there are route loop
Phenomenon.Meanwhile the abnormal conditions of routing are judged from routing table, the analysis to Routing Protocol is avoided, has accomplished Routing Protocol
Independence.
(2) detection method of the invention uses network flow due to not needing, but monitors routing list event in real time, therefore
Additional flow will not be introduced to SDN network, ensure that the normal operation of network.
(3) when flow is not present in network, whether detection method of the invention also can detecte out has route loop.
In this way, early warning can be carried out to loop behavior, the generation of major accident is avoided in advance.
(4) method of the level compression used in detection method of the invention, before constructing while storing multiple routing tables
Sew tree, effectively reduce memory space and calculates the time.
(5) due to prefix trees the characteristics of, can check heterogeneous networks prefix parallel, thus have good
Scalability and retractility, when network size changes, the hardware that can be easy to increase parallel processing is computational to be promoted
Energy.
(6) detection method of the invention has good adaptability, on the basis of routing abnormality detection to IPv4, Ke Yirong
The abnormality detection of IPv6 easy of integration, and the abnormal detection function (such as MPLS etc.) to other Routing Protocols.
In some preferred embodiments, the real-time routing table information and routing-events for obtaining each node in network
The step 101 of information includes:
According to the different agreement that router is run, routing table information and routing are obtained using detector corresponding with agreement
Event information.Such as: by taking router runs ospf protocol or bgp protocol as an example, then OSPF detector (OSPF is installed
Prober) or BGP detector (BGP Prober) obtains the routing iinformation of network.Wherein, OSPF detector can use
The Quagga software of open source, which is modified, can be realized.BGP detector can obtain in real time BGP's using the BGPMon of open source
Prefix broadcast message.
In this way, the detection method based on route loop in SDN network is enabled to be suitable for using various different associations
The network of view.Not only, the practicability of the method for the present invention is improved, and is conducive to described based on route loop in SDN network
Extension of the detection method in heterogeneous networks.
In further embodiment of the present invention, the method for the level compression is specially the side of fixed hierarchical level compression
The step of method, realization are as follows:
Prefix trees are configured to 5 successively different levels interconnected, and the rank of level from top to bottom is successively adopted
With the distribution mode of 8-8-8-4-4.
The present invention is directed to the network address distribution situation of IPv4, the use of fixed hierarchical level compress mode is 8-8-8-4-4
The 4-4 of prefix trees mode and prefix length less than 8 prefix trees mode.It is hierarchical approaches is 8-8-8-4- referring to shown in Fig. 7
4 prefix trees scheme.Similarly, 4-4 prefix trees of the prefix length within 8 can similarly construct.
Each node is defined as follows in prefix trees:
Wherein, the concrete meaning of each field is as follows:
On each node of prefix trees, storage be next skip list NHDB index, specific next-hop content needs
It is inquired into next skip list NHDB, stores the default route of all nodes in the position that index is 0.Next skip list group in logic
It is woven to form, the format of every row element is as follows:
Wherein MAX_ROUTER is the maximum value of router number present in network.
In this way, through the invention using 8-8-8-4-4 fixation implements spatial scalable compression by the way of can further increase prefix
The efficiency that the efficiency of storage of tree and detection calculate.
In some preferred embodiments, the step 104 of the forwarding figure for generating node includes:
Firstly, the analysis in order to realize anomalous routes situation, needs to model the network being directed to, obtains network model
G (V, E, W), wherein V indicates the set of nodes, and each node illustrates the equipment in network, such as router, the
Three-tier switch etc..E indicates that the line set between two nodes, each edge illustrate the connection chain between two network equipments
Road.W indicates the weight of each of the links, such as: w (e) indicates the weight of certain link e.
If u, v ∈ V represent two routers with connecting link on network, the routing table on node u is represented at that time
One snapshot of node, uses ruIt indicates；The message to be forwarded is indicated with p.
Forwarding behavior on router is defined as follows:
F (p, ru)=v, u, v ∈ V, wherein u, v are different nodes, and p is the message to be forwarded, ruIt indicates on node u
Routing table.
Above-mentioned forwarding behavior representation message will be forwarded to its next-hop v on router node u.Usually implementing
When, next-hop is the outgoing interface of node u；But when analyzing abnormal conditions, it is direct-connected this interface can be directly obtained from outgoing interface
Router, therefore, v herein is defined as the corresponding router of next-hop.
The definition that message p is forwarded in the entire network is obtained as a result:
F (p, R∑u)={<i, j>| f (p, ru)=j；I, j, u ∈ V }, wherein R indicates the routing of each router on network
Table set.
Then, in prefix trees, the bit of message p is decomposed, and prefix trees are looked into from tree root to leaf
It looks for, until reaching the prefix of message p, node each accessed includes during record search next-hop；
By the forwarding of these next-hops namely message p as a result, obtaining message p to forward result on network being ordered pair
Set T (p, R), and
T (p, R)=F (p, R∑u)
The digraph formed by the set T (p, R) of ordered pair, can finally obtain the forwarding figure of node.
In some alternative embodiments, forwarding is schemed is defined as: ForwardingGraph (V, E, R, p) :=node collection
Close the digraph being made of on V ordered pair set T (p, R)
For discussion purposes, V, E are omitted sometimes, and is simply denoted as: FG (p, R).Alternatively, known to specific routing table R
When, FG (p) can be abbreviated as.
To all message p verifying forwardings the result is that unrealistic is also to be not necessarily to, it is only necessary to belonging to message p
Network is verified.Expression for network and its subnet introduces the common representation method from CISCO, i.e. { IP
Address/mask-range } it indicates.Such as { 192.168/16-24 } indicates that first 16 of IP address are 192.168, and corresponding cover
The IP address range that code length is 16 to 24.{ 0/0 } default route is indicated, and { 0/0-32 } indicates all possible IPv4 network
Address, and { 0/1-32 } indicates all possibility IPv4 network address other than default route.Referring to shown in Fig. 8, it is
192.168/16 corresponding forwarding figure, it can be seen that it causes the loop of routing.
In this way, the relevant definition of forwarding figure used in through the foregoing embodiment, and forwarding map generalization, it enables to
Method of the invention is quickly obtained the forwarding figure of node, and information needed of the forwarding figure comprising judging route loop of the node.
That is, can be improved the detection efficiency and accuracy based on the detection method of route loop in SDN network.
Further, for the routing of multipath the case where, the forwarding behavior on the router is defined as:
F (p, ru)={ vi|viFor next-hop node of the message p on node u }, u, vi∈V。
That is, current node corresponds to multiple next-hop nodes.At this point, other definition complete one relevant to forwarding figure
Sample, and the method for generating forwarding figure is same, is not repeated to illustrate herein.
In some preferred embodiments, it referring to shown in Fig. 9, is illustrated, turns by taking the forwarding figure of 10.22.33/24 as an example
It is specific as follows to send out map generalization process:
It is index with first 8 of IP address i.e. 10, searches level-one Trie block, (nhop, next) is all not zero, with nhop=
65 search next-hop tables of data for index, and router 1 and router 2 do not have route table items, and router 3 has next-hop 1, had
Ordered pair<3,1>.
It is index with time 8 i.e. 22 of IP address, using the next of previous step as pointer, searches second level Trie block, obtain table
(nhop, next) is not zero, and searches NHDB table with nhop=47, obtains 1 next-hop 3 of router, the next-hop 3 of router 2,
Ordered pair is always obtained are as follows:<3,1>,<1,3>,<2,3>}.
Because next is not zero, shows with the presence of longer prefix route, is index with subsequent 8 of IP address i.e. 33,
Obtain list item (nhop, next).By nhop=48, search NHDB table, obtain longer prefix route<1,2>, replace one
In step<1,3>, the ordered pair being always obtained are as follows:
<3,1>,<1,2>,<2,3>}
Due to having reached the prefix length 24 of 10.22.33/24, the forwarding figure that obtained ordered pair is constituted, referring to such as
Forwarding figure shown in fig. 8.
Referring to Fig.1 shown in 0, the method for judging whether there is route loop is depth-first labeling algorithm, specific to walk
Suddenly include:
Step 201, it is alive by all vertex ticks, and stack space is initialized as sky.
Step 202, judge present node whether and meanwhile there is in-degree and out-degree, if so, step 203 is gone to, if it is not, then
Go to step 204.
Step 203, according to step 202, present node is labeled as visited, and make present node stacking.
Step 204, according to step 202, present node is labeled as dead；And the present node not stacking.
Step 205, judge whether stack space is sky, if so, step 212 is gone to, if it is not, then going to step 206.
Step 206, according to step 205, indicate that there is node in stack space, it is subsequent further to judge whether stack top node has
Node, if it is not, then going to step 207.Wherein, the stack top node refers to the node of the top in stack.
Step 207, if stack top node does not have subsequent node, stack top vertex ticks is dead, and stack top node is made to pop,
Node is removed into stack space.
Return step 205 continues to judge whether stack space is sky, until all nodes are all marked as dead, that is, stack
Space is sky.
Step 212, stack space is sky, indicates that route loop is not present, detection finishes.
In this way, the detection method of the present invention based on route loop in SDN network can rapidly and accurately scheme forwarding
It is detected and is judged, namely substantially increase the detection efficiency of route loop.
Further, described to judge whether stack top node has the step 206 of subsequent node to include:
Step 208, if stack top node has subsequent node, the subsequent node of stack top node is obtained.
Step 209, judge whether subsequent node is labeled as alive, if so, return step 202 to the subsequent node after
Continuous judgement, if it is not, then going to step 210.
Step 210, judge whether subsequent node is labeled as visited；If so, step 211 is gone to, if otherwise returning to step
Rapid 207.
Step 211, according to step 210, subsequent node is labeled as visited, then it represents that there are route loops in network.
It should be noted that above-mentioned label alive, visited and dead are intended merely to distinguish section in different states
Point correspondingly can modify the mode and content of label according to actual needs.
It is the Routing Loop in the detection method provided by the invention based on route loop in SDN network referring to Fig.1 shown in 1
Road judges an exemplary structural schematic diagram of algorithm.
The depth-first labeling algorithm that the present invention is used runs in the forwarding figure in Figure 11 and calculates, available routing
Loop are as follows: R2-R3-R5.
It is the system structure provided by the invention based on the detection system of route loop in SDN network referring to Fig.1 shown in 2
Schematic diagram.The detection system based on route loop in SDN network, comprising:
Routing information acquisition module 301, for obtaining the routing table information and routing-events of each node in network in real time
Information；
Topological structure generation module 302, for according to the routing table information obtained in the routing information acquisition module 301
With routing-events information, the real-time topology structure of tectonic network；
Prefix trees constructing module 303, for adopting according to the real-time topology structure in the topological structure generation module 302
With the multirouting list prefix trees of the method construct longest prefix match of level compression, and store in the routing table of each node
Forward subnet network segment；
Routing calculation module 304, in the subnet network segment for needing to judge loop, to every height in the prefix trees
Net node generates route next jump table, and each subnet node for traversing prefix trees generates the forwarding figure of node；
Routing detection module 305 judges whether for the forwarding figure according to the node in the routing calculation module 304
There are route loops.
It is the system architecture provided by the invention based on the detection system of route loop in SDN network referring to Fig.1 shown in 3
Schematic diagram.The detection system based on route loop in SDN network be deployed in SDN network controller Controller it
On.
It should be understood by those ordinary skilled in the art that: the discussion of any of the above embodiment is exemplary only, not
It is intended to imply that the scope of the present disclosure (including claim) is limited to these examples；Under thinking of the invention, above embodiments
Or can also be combined between the technical characteristic in different embodiments, step can be realized with random order, and be existed such as
Many other variations of the upper different aspect of the invention, for simplicity, they are not provided in details.Therefore, it is all
Within the spirit and principles in the present invention, any omission, modification, equivalent replacement, improvement for being made etc. be should be included in of the invention
Within protection scope.
Claims (6)
1. a kind of detection method based on route loop in SDN network characterized by comprising
The routing table information and routing-events information of each node in network are obtained in real time；
According to the routing table information of acquisition and routing-events information, the real-time topology structure of tectonic network；
According to real-time topology structure, using the multirouting list prefix trees of the method construct longest prefix match of level compression, and
Store the forwarding subnet network segment in the routing table of each node；
In the subnet network segment for needing to judge loop, route next jump table is generated to each subnet node in the prefix trees,
The each subnet node for traversing prefix trees generates the forwarding figure of node；
According to the forwarding figure of node, route loop is judged whether there is；
It is described generate node forwarding figure the step of include:
Firstly, modeling to network, network model G (V, E, W) is obtained, wherein V indicates the set of nodes, and E is indicated
Line set namely node between two nodes correspond to the connecting link between equipment, and W indicates the weight of each of the links；
Forwarding behavior on router is defined as follows:
F (p, ru)=v, u, v ∈ V, wherein u, v are different nodes, and p is the message to be forwarded, ruIndicate the routing on node u
Table；
Obtain the definition that message p is forwarded in the entire network:
F (p, R∑u)={<i, j>| f (p, ru)=j；I, j, u ∈ V }, wherein R∑uIndicate the routing table of each node u on network
Set, i, j, u indicate the node in network；
Then, in prefix trees, the bit of message p is decomposed, and prefix trees are searched, the prefix until reaching p
Until, node each accessed includes during record search next-hop；
By the forwarding of these next-hops namely message p as a result, obtaining message p to forward result on network being the collection of ordered pair
It closes T (p, R), and
T (p, R)=F (p, R∑u)
The digraph formed by the set T (p, R) of ordered pair, obtains the forwarding figure of node；
Described the step of judging whether there is route loop includes:
It is alive by all vertex ticks, and stack space is initialized as sky；
Judge present node whether and meanwhile there is in-degree and out-degree, if so, being labeled as visited, and make present node stacking,
If it is not, being then labeled as dead；
Judge whether stack space is empty, if so, indicating that route loop is not present, if it is not, further whether judging stack top node
There is subsequent node；
If stack top node does not have subsequent node, stack top vertex ticks is dead, and stack top node is made to pop；
Return continues to judge whether stack space is sky, until all nodes are all marked as dead, then it represents that Routing Loop is not present
Road.
2. the method according to claim 1, wherein the real-time routing table letter for obtaining each node in network
It ceases and includes: with the step of routing-events information
According to the different agreement that router is run, routing table information and routing-events are obtained using detector corresponding with agreement
Information.
3. the method according to claim 1, wherein the method for the level compression is specially fixed hierarchical level
The step of method of compression, realization are as follows:
Prefix trees are configured to 5 successively different levels interconnected, and the rank of level from top to bottom successively uses 8-
The distribution mode of 8-8-4-4.
4. the forwarding the method according to claim 1, wherein the routing for multipath, on the router
Behavior are as follows:
F (p, ru)={ vi|viFor next-hop node of the message p on node u }, u, vi∈V。
5. judging whether stack top node has the step of subsequent node the method according to claim 1, wherein described
Include:
If stack top node has subsequent node, the subsequent node of stack top node is obtained；
Judge whether subsequent node is labeled as alive, if so, return it is described judge present node whether and meanwhile have in-degree with
The step of out-degree, continues to judge to the subsequent node, if it is not, then further judging whether subsequent node is labeled as visited；
If subsequent node is labeled as visited, then it represents that there are route loops；
It is dead by stack top vertex ticks, and stack top node is made to pop if subsequent node is not marked with visited.
6. a kind of detection system based on route loop in SDN network characterized by comprising
Routing information acquisition module, for obtaining the routing table information of each node and routing-events information in network in real time；
Topological structure generation module, for according to the routing table information and routing-events obtained in the routing information acquisition module
Information, the real-time topology structure of tectonic network；
Prefix trees constructing module, for according to the real-time topology structure in the topological structure generation module, using level compression
Method construct longest prefix match multirouting list prefix trees, and store the forwarding subnet net in the routing table of each node
Section；
Routing calculation module, in the subnet network segment for needing to judge loop, to each subnet node in the prefix trees
Route next jump table is generated, each subnet node for traversing prefix trees generates the forwarding figure of node；
It routes detection module and judges whether there is Routing Loop for the forwarding figure according to the node in the routing calculation module
Road；
The routing calculation module, for obtaining network model G (V, E, W) firstly, model to network, wherein V is indicated
The set of nodes, E indicate that line set namely node between two nodes correspond to the connecting link between equipment, W table
Show the weight of each of the links；
Forwarding behavior on router is defined as follows:
F (p, ru)=v, u, v ∈ V, wherein u, v are different nodes, and p is the message to be forwarded, ruIndicate the routing on node u
Table；
Obtain the definition that message p is forwarded in the entire network:
F (p, R∑u)={<i, j>| f (p, ru)=j；I, j, u ∈ V }, wherein R indicates the routing table collection of each router on network
It closes；
R∑uIndicate the routing table set of each node u on network, i, j, u indicates the node in network；
Then, in prefix trees, the bit of message p is decomposed, and prefix trees are searched, the prefix until reaching p
Until, node each accessed includes during record search next-hop；
By the forwarding of these next-hops namely message p as a result, obtaining message p to forward result on network being the collection of ordered pair
It closes T (p, R), and
T (p, R)=F (p, R∑u)
The digraph formed by the set T (p, R) of ordered pair, obtains the forwarding figure of node；
Stack space for being alive by all vertex ticks, and is initialized as sky by the routing detection module；
Judge present node whether and meanwhile there is in-degree and out-degree, if so, being labeled as visited, and make present node stacking,
If it is not, being then labeled as dead；
Judge whether stack space is empty, if so, indicating that route loop is not present, if it is not, further whether judging stack top node
There is subsequent node；
If stack top node does not have subsequent node, stack top vertex ticks is dead, and stack top node is made to pop；
Return continues to judge whether stack space is sky, until all nodes are all marked as dead, then it represents that Routing Loop is not present
Road.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610059884.7A CN105721297B (en) | 2016-01-28 | 2016-01-28 | Detection method and system based on route loop in SDN network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610059884.7A CN105721297B (en) | 2016-01-28 | 2016-01-28 | Detection method and system based on route loop in SDN network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105721297A CN105721297A (en) | 2016-06-29 |
| CN105721297B true CN105721297B (en) | 2019-04-09 |
Family
ID=56155246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610059884.7A Active CN105721297B (en) | 2016-01-28 | 2016-01-28 | Detection method and system based on route loop in SDN network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105721297B (en) |
Families Citing this family (80)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9781004B2 (en) | 2014-10-16 | 2017-10-03 | Cisco Technology, Inc. | Discovering and grouping application endpoints in a network environment |
| CN106789889B (en) * | 2016-11-22 | 2020-05-05 | 广州市诚毅科技软件开发有限公司 | Network monitoring method and device based on mesh structure |
| CN108259326B (en) * | 2016-12-29 | 2020-06-26 | 华为技术有限公司 | Routing table updating method and device, distribution node and leaf message forwarding equipment |
| US10623264B2 (en) | 2017-04-20 | 2020-04-14 | Cisco Technology, Inc. | Policy assurance for service chaining |
| US10826788B2 (en) | 2017-04-20 | 2020-11-03 | Cisco Technology, Inc. | Assurance of quality-of-service configurations in a network |
| US10560328B2 (en) | 2017-04-20 | 2020-02-11 | Cisco Technology, Inc. | Static network policy analysis for networks |
| SG10201703959RA (en) * | 2017-05-15 | 2018-12-28 | Huawei Int Pte Ltd | System and method for detecting routing loops in a software defined network (sdn) |
| US10581694B2 (en) | 2017-05-31 | 2020-03-03 | Cisco Technology, Inc. | Generation of counter examples for network intent formal equivalence failures |
| US10812318B2 (en) | 2017-05-31 | 2020-10-20 | Cisco Technology, Inc. | Associating network policy objects with specific faults corresponding to fault localizations in large-scale network deployment |
| US10505816B2 (en) | 2017-05-31 | 2019-12-10 | Cisco Technology, Inc. | Semantic analysis to detect shadowing of rules in a model of network intents |
| US10554483B2 (en) | 2017-05-31 | 2020-02-04 | Cisco Technology, Inc. | Network policy analysis for networks |
| US10693738B2 (en) | 2017-05-31 | 2020-06-23 | Cisco Technology, Inc. | Generating device-level logical models for a network |
| US10439875B2 (en) | 2017-05-31 | 2019-10-08 | Cisco Technology, Inc. | Identification of conflict rules in a network intent formal equivalence failure |
| US10623271B2 (en) | 2017-05-31 | 2020-04-14 | Cisco Technology, Inc. | Intra-priority class ordering of rules corresponding to a model of network intents |
| US20180351788A1 (en) | 2017-05-31 | 2018-12-06 | Cisco Technology, Inc. | Fault localization in large-scale network policy deployment |
| US10686669B2 (en) | 2017-06-16 | 2020-06-16 | Cisco Technology, Inc. | Collecting network models and node information from a network |
| US10904101B2 (en) | 2017-06-16 | 2021-01-26 | Cisco Technology, Inc. | Shim layer for extracting and prioritizing underlying rules for modeling network intents |
| US10498608B2 (en) | 2017-06-16 | 2019-12-03 | Cisco Technology, Inc. | Topology explorer |
| US10574513B2 (en) | 2017-06-16 | 2020-02-25 | Cisco Technology, Inc. | Handling controller and node failure scenarios during data collection |
| US11469986B2 (en) | 2017-06-16 | 2022-10-11 | Cisco Technology, Inc. | Controlled micro fault injection on a distributed appliance |
| US11150973B2 (en) | 2017-06-16 | 2021-10-19 | Cisco Technology, Inc. | Self diagnosing distributed appliance |
| US11645131B2 (en) | 2017-06-16 | 2023-05-09 | Cisco Technology, Inc. | Distributed fault code aggregation across application centric dimensions |
| US10547715B2 (en) | 2017-06-16 | 2020-01-28 | Cisco Technology, Inc. | Event generation in response to network intent formal equivalence failures |
| US10587621B2 (en) | 2017-06-16 | 2020-03-10 | Cisco Technology, Inc. | System and method for migrating to and maintaining a white-list network security model |
| US10567228B2 (en) | 2017-06-19 | 2020-02-18 | Cisco Technology, Inc. | Validation of cross logical groups in a network |
| US10644946B2 (en) | 2017-06-19 | 2020-05-05 | Cisco Technology, Inc. | Detection of overlapping subnets in a network |
| US11283680B2 (en) | 2017-06-19 | 2022-03-22 | Cisco Technology, Inc. | Identifying components for removal in a network configuration |
| US10432467B2 (en) | 2017-06-19 | 2019-10-01 | Cisco Technology, Inc. | Network validation between the logical level and the hardware level of a network |
| US10505817B2 (en) | 2017-06-19 | 2019-12-10 | Cisco Technology, Inc. | Automatically determining an optimal amount of time for analyzing a distributed network environment |
| US10805160B2 (en) | 2017-06-19 | 2020-10-13 | Cisco Technology, Inc. | Endpoint bridge domain subnet validation |
| US10700933B2 (en) | 2017-06-19 | 2020-06-30 | Cisco Technology, Inc. | Validating tunnel endpoint addresses in a network fabric |
| US10554493B2 (en) | 2017-06-19 | 2020-02-04 | Cisco Technology, Inc. | Identifying mismatches between a logical model and node implementation |
| US10341184B2 (en) | 2017-06-19 | 2019-07-02 | Cisco Technology, Inc. | Validation of layer 3 bridge domain subnets in in a network |
| US10437641B2 (en) | 2017-06-19 | 2019-10-08 | Cisco Technology, Inc. | On-demand processing pipeline interleaved with temporal processing pipeline |
| US10547509B2 (en) | 2017-06-19 | 2020-01-28 | Cisco Technology, Inc. | Validation of a virtual port channel (VPC) endpoint in the network fabric |
| US10218572B2 (en) | 2017-06-19 | 2019-02-26 | Cisco Technology, Inc. | Multiprotocol border gateway protocol routing validation |
| US10673702B2 (en) | 2017-06-19 | 2020-06-02 | Cisco Technology, Inc. | Validation of layer 3 using virtual routing forwarding containers in a network |
| US10560355B2 (en) | 2017-06-19 | 2020-02-11 | Cisco Technology, Inc. | Static endpoint validation |
| US10411996B2 (en) | 2017-06-19 | 2019-09-10 | Cisco Technology, Inc. | Validation of routing information in a network fabric |
| US10333787B2 (en) | 2017-06-19 | 2019-06-25 | Cisco Technology, Inc. | Validation of L3OUT configuration for communications outside a network |
| US10536337B2 (en) | 2017-06-19 | 2020-01-14 | Cisco Technology, Inc. | Validation of layer 2 interface and VLAN in a networked environment |
| US11343150B2 (en) | 2017-06-19 | 2022-05-24 | Cisco Technology, Inc. | Validation of learned routes in a network |
| US10623259B2 (en) | 2017-06-19 | 2020-04-14 | Cisco Technology, Inc. | Validation of layer 1 interface in a network |
| US10567229B2 (en) | 2017-06-19 | 2020-02-18 | Cisco Technology, Inc. | Validating endpoint configurations between nodes |
| US10812336B2 (en) | 2017-06-19 | 2020-10-20 | Cisco Technology, Inc. | Validation of bridge domain-L3out association for communication outside a network |
| US10652102B2 (en) | 2017-06-19 | 2020-05-12 | Cisco Technology, Inc. | Network node memory utilization analysis |
| US10348564B2 (en) | 2017-06-19 | 2019-07-09 | Cisco Technology, Inc. | Validation of routing information base-forwarding information base equivalence in a network |
| US10528444B2 (en) | 2017-06-19 | 2020-01-07 | Cisco Technology, Inc. | Event generation in response to validation between logical level and hardware level |
| US10587456B2 (en) | 2017-09-12 | 2020-03-10 | Cisco Technology, Inc. | Event clustering for a network assurance platform |
| US10587484B2 (en) | 2017-09-12 | 2020-03-10 | Cisco Technology, Inc. | Anomaly detection and reporting in a network assurance appliance |
| US10554477B2 (en) | 2017-09-13 | 2020-02-04 | Cisco Technology, Inc. | Network assurance event aggregator |
| US10333833B2 (en) | 2017-09-25 | 2019-06-25 | Cisco Technology, Inc. | Endpoint path assurance |
| CN107809381B (en) * | 2017-10-19 | 2021-08-10 | 北京邮电大学 | Method for realizing active audit based on routing loop in SDN |
| US11102053B2 (en) | 2017-12-05 | 2021-08-24 | Cisco Technology, Inc. | Cross-domain assurance |
| CN108270645B (en) * | 2017-12-19 | 2021-04-06 | 中国电子科技网络信息安全有限公司 | SDN network isolation detection method |
| US10873509B2 (en) | 2018-01-17 | 2020-12-22 | Cisco Technology, Inc. | Check-pointing ACI network state and re-execution from a check-pointed state |
| US10572495B2 (en) | 2018-02-06 | 2020-02-25 | Cisco Technology Inc. | Network assurance database version compatibility |
| US10812315B2 (en) | 2018-06-07 | 2020-10-20 | Cisco Technology, Inc. | Cross-domain network assurance |
| US11218508B2 (en) | 2018-06-27 | 2022-01-04 | Cisco Technology, Inc. | Assurance of security rules in a network |
| US10911495B2 (en) | 2018-06-27 | 2021-02-02 | Cisco Technology, Inc. | Assurance of security rules in a network |
| US10659298B1 (en) | 2018-06-27 | 2020-05-19 | Cisco Technology, Inc. | Epoch comparison for network events |
| US11044273B2 (en) | 2018-06-27 | 2021-06-22 | Cisco Technology, Inc. | Assurance of security rules in a network |
| US11019027B2 (en) | 2018-06-27 | 2021-05-25 | Cisco Technology, Inc. | Address translation for external network appliance |
| US10904070B2 (en) | 2018-07-11 | 2021-01-26 | Cisco Technology, Inc. | Techniques and interfaces for troubleshooting datacenter networks |
| US10826770B2 (en) | 2018-07-26 | 2020-11-03 | Cisco Technology, Inc. | Synthesis of models for networks using automated boolean learning |
| US10616072B1 (en) | 2018-07-27 | 2020-04-07 | Cisco Technology, Inc. | Epoch data interface |
| CN109617776A (en) * | 2018-12-20 | 2019-04-12 | 桂林电子科技大学 | The method and system of software defined network controller based on distributed hash table |
| CN109684217B (en) * | 2018-12-25 | 2022-06-14 | 网易（杭州）网络有限公司 | Game detection method and device, electronic equipment and storage medium |
| CN109873724B (en) * | 2019-02-28 | 2022-05-10 | 南京创网网络技术有限公司 | Service chain high-availability method applied to SDN network |
| CN111698110B (en) * | 2019-03-14 | 2023-07-18 | 深信服科技股份有限公司 | Network equipment performance analysis method, system, equipment and computer medium |
| CN111641729B (en) * | 2019-05-23 | 2021-03-30 | 北京航空航天大学 | Inter-domain path identification prefix conflict detection and decomposition method based on prefix tree |
| CN110445703B (en) * | 2019-07-26 | 2021-05-07 | 新华三技术有限公司合肥分公司 | Loop message intercepting method, forwarding equipment and controller |
| CN110968429B (en) * | 2019-12-20 | 2022-11-11 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for loop detection in directed graph |
| CN111327504A (en) * | 2020-02-26 | 2020-06-23 | 深信服科技股份有限公司 | Virtual local area network loop detection method, device, equipment and readable storage medium |
| CN111447091B (en) * | 2020-03-25 | 2023-09-08 | 深信服科技股份有限公司 | Network loop detection method, device, equipment and storage medium |
| WO2022088843A1 (en) * | 2020-10-28 | 2022-05-05 | 华为技术有限公司 | Routing advertisement method, routing loop detection method, and device |
| CN112565072B (en) * | 2020-11-02 | 2022-08-09 | 鹏城实验室 | Router compression method, router and storage medium |
| CN112491726B (en) * | 2020-11-03 | 2022-09-16 | 晏平 | Route searching and analyzing method and device, computer equipment and storage medium |
| CN112437065B (en) * | 2020-11-12 | 2022-06-21 | 安徽大学 | Strategy conflict detection and solution method based on graphic representation under SDN environment |
| CN113518034B (en) * | 2021-05-07 | 2023-08-15 | 中国移动通信集团陕西有限公司 | Method, device, equipment and storage medium for route detection |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2000076126A2 (en) * | 1999-06-07 | 2000-12-14 | Nortel Networks Limited | System and method for loop avoidance in multi-protocol label switching |
| CN1489849A (en) * | 2001-01-30 | 2004-04-14 | ŵ�������ܱ�Ե·������˾ | Method and apparatus for ternary content addressable meomry (TCAM) table management |
| CN1897562A (en) * | 2005-07-12 | 2007-01-17 | 华为技术有限公司 | Method for storing routing hop and next skip list by routing hop |
| CN101478497A (en) * | 2009-01-21 | 2009-07-08 | 杭州华三通信技术有限公司 | Method and apparatus for preventing instant loop |
| CN102387068A (en) * | 2011-09-29 | 2012-03-21 | 中国人民解放军国防科学技术大学 | Extensible routing method and router of identification network |
| CN103457756A (en) * | 2012-06-05 | 2013-12-18 | 华为技术有限公司 | Method, device and system for loop path detection |
| CN103888369A (en) * | 2014-04-10 | 2014-06-25 | 何顺民 | Ethernet communication method and system and SDN exchanger |
| WO2015017422A1 (en) * | 2013-07-31 | 2015-02-05 | Oracle International Corporation | Methods, systems, and computer readable media for mitigating traffic storms |
| CN104639435A (en) * | 2015-02-16 | 2015-05-20 | 杭州华三通信技术有限公司 | Method and device for data stream forwarding in SDN (Software Defined Networking) |
| CN105007221A (en) * | 2015-07-28 | 2015-10-28 | 上海斐讯数据通信技术有限公司 | Loop detection method and system |
| CN105210329A (en) * | 2013-03-15 | 2015-12-30 | 惠普发展公司，有限责任合伙企业 | Loop-free hybrid network |
-
2016
- 2016-01-28 CN CN201610059884.7A patent/CN105721297B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2000076126A2 (en) * | 1999-06-07 | 2000-12-14 | Nortel Networks Limited | System and method for loop avoidance in multi-protocol label switching |
| CN1489849A (en) * | 2001-01-30 | 2004-04-14 | ŵ�������ܱ�Ե·������˾ | Method and apparatus for ternary content addressable meomry (TCAM) table management |
| CN1897562A (en) * | 2005-07-12 | 2007-01-17 | 华为技术有限公司 | Method for storing routing hop and next skip list by routing hop |
| CN101478497A (en) * | 2009-01-21 | 2009-07-08 | 杭州华三通信技术有限公司 | Method and apparatus for preventing instant loop |
| CN102387068A (en) * | 2011-09-29 | 2012-03-21 | 中国人民解放军国防科学技术大学 | Extensible routing method and router of identification network |
| CN103457756A (en) * | 2012-06-05 | 2013-12-18 | 华为技术有限公司 | Method, device and system for loop path detection |
| CN105210329A (en) * | 2013-03-15 | 2015-12-30 | 惠普发展公司，有限责任合伙企业 | Loop-free hybrid network |
| WO2015017422A1 (en) * | 2013-07-31 | 2015-02-05 | Oracle International Corporation | Methods, systems, and computer readable media for mitigating traffic storms |
| CN103888369A (en) * | 2014-04-10 | 2014-06-25 | 何顺民 | Ethernet communication method and system and SDN exchanger |
| CN104639435A (en) * | 2015-02-16 | 2015-05-20 | 杭州华三通信技术有限公司 | Method and device for data stream forwarding in SDN (Software Defined Networking) |
| CN105007221A (en) * | 2015-07-28 | 2015-10-28 | 上海斐讯数据通信技术有限公司 | Loop detection method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105721297A (en) | 2016-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105721297B (en) | Detection method and system based on route loop in SDN network | |
| US10742556B2 (en) | Tactical traffic engineering based on segment routing policies | |
| Ventre et al. | Segment routing: a comprehensive survey of research activities, standardization efforts, and implementation results | |
| Mendiola et al. | A survey on the contributions of software-defined networking to traffic engineering | |
| US11943136B2 (en) | Advanced preferred path route graph features in a network | |
| US9369371B2 (en) | Method and system for path monitoring using segment routing | |
| EP3164970B1 (en) | A method and system for compressing forward state of a data network | |
| US20020021675A1 (en) | System and method for packet network configuration debugging and database | |
| US11632322B2 (en) | Preferred path route graphs in a network | |
| US8493869B2 (en) | Distributed constraints-based inter-domain network traffic management | |
| US8503464B2 (en) | Techniques for efficiently updating routing information | |
| US10778545B2 (en) | Network verification system | |
| Varyani et al. | QROUTE: An efficient quality of service (QoS) routing scheme for software-defined overlay networks | |
| Ben-Ameur et al. | Routing strategies for IP networks | |
| US11502940B2 (en) | Explicit backups and fast re-route mechanisms for preferred path routes in a network | |
| CN105637806A (en) | Method and apparatus for determining network topology, and centralized network state information storage device | |
| Abushagur et al. | Hybrid software-defined network monitoring | |
| Hayamizu et al. | On-demand routing for chaining multiple functions in ICN-based in-network processing | |
| Papan et al. | New trends in fast reroute | |
| Zahemszky et al. | Fast reroute for stateless multicast | |
| Wang et al. | Towards an aggregation-aware internet routing | |
| Polverini et al. | Closing the gap among IP and per-flow green routing solutions: The tunneling approach | |
| Masuda et al. | Splitable: Toward routing scalability through distributed bgp routing tables | |
| Mamede et al. | Relieving Core Routers from Dynamic Routing with Off-the-Shelf Equipment and Protocols | |
| Sarje et al. | MPLS implementation in MANET with fast re-route mechanism in multiple link failure environments |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20160815 Address after: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Applicant after: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Applicant after: State Grid Corporation of China Applicant after: STATE POWER ECONOMIC Research Institute Applicant after: Beijing University of Posts and Telecommunications Applicant after: STATE GRID ZHEJIANG ELECTRIC POWER Co. Address before: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Applicant before: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Applicant before: State Grid Corporation of China Applicant before: State Power Economic Research Institute Applicant before: Beijing University of Posts and Telecommunications |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Co-patentee after: STATE GRID CORPORATION OF CHINA Patentee after: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Co-patentee after: STATE GRID ECONOMIC AND TECHNOLOGICAL RESEARCH INSTITUTE CO. LTD.B412, STATE GRID OFFICE Co-patentee after: Beijing University of Posts and Telecommunications Co-patentee after: STATE GRID ZHEJIANG ELECTRIC POWER Co.,Ltd. Address before: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Co-patentee before: State Grid Corporation of China Patentee before: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Co-patentee before: STATE POWER ECONOMIC Research Institute Co-patentee before: Beijing University of Posts and Telecommunications Co-patentee before: STATE GRID ZHEJIANG ELECTRIC POWER Co. |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190716 Address after: 100085 Beijing city Haidian District Qinghe small Camp Road No. 15 Co-patentee after: STATE GRID CORPORATION OF CHINA Patentee after: BEIJING CHINA POWER INFORMATION TECHNOLOGY Co.,Ltd. Co-patentee after: STATE GRID ECONOMIC AND TECHNOLOGICAL RESEARCH INSTITUTE CO. LTD.B412, STATE GRID OFFICE Co-patentee after: Beijing University of Posts and Telecommunications Co-patentee after: STATE GRID ZHEJIANG ELECTRIC POWER Co.,Ltd. Address before: 100070 Fengtai District, Feng Feng Road, the era of wealth on the 1st floor of the world's 28 floor, Beijing Co-patentee before: STATE GRID CORPORATION OF CHINA Patentee before: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd. Co-patentee before: STATE GRID ECONOMIC AND TECHNOLOGICAL RESEARCH INSTITUTE CO. LTD.B412, STATE GRID OFFICE Co-patentee before: Beijing University of Posts and Telecommunications Co-patentee before: STATE GRID ZHEJIANG ELECTRIC POWER Co.,Ltd. |
|
| TR01 | Transfer of patent right |