CN105721297A - Routing loop detecting method and system based on SDN - Google Patents
Routing loop detecting method and system based on SDN Download PDFInfo
- Publication number
- CN105721297A CN105721297A CN201610059884.7A CN201610059884A CN105721297A CN 105721297 A CN105721297 A CN 105721297A CN 201610059884 A CN201610059884 A CN 201610059884A CN 105721297 A CN105721297 A CN 105721297A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- network
- forwarding
- route
- 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
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000001514 detection method Methods 0.000 claims abstract description 47
- 230000006835 compression Effects 0.000 claims abstract description 18
- 238000007906 compression Methods 0.000 claims abstract description 18
- 238000004364 calculation method Methods 0.000 claims abstract description 7
- 241000238876 Acari Species 0.000 claims description 8
- 230000008569 process Effects 0.000 claims description 8
- 238000002910 structure generation Methods 0.000 claims description 6
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 3
- 230000006399 behavior Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000002372 labelling Methods 0.000 description 5
- 230000002159 abnormal effect Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000011156 evaluation Methods 0.000 description 3
- 230000002085 persistent effect Effects 0.000 description 3
- 230000005856 abnormality Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 2
- 230000002547 anomalous effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000001149 cognitive effect Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 101100339496 Caenorhabditis elegans hop-1 gene Proteins 0.000 description 1
- 102100036255 Glucose-6-phosphatase 2 Human genes 0.000 description 1
- 101000930907 Homo sapiens Glucose-6-phosphatase 2 Proteins 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000013024 troubleshooting Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a routing loop detecting method based on a SDN. The routing loop detecting method comprises the following steps of: obtaining routing table information and routing event information of each node in a network in real time; constructing a real-time topological structure of the network according to the obtained routing table information and routing event information; constructing a multi-routing-form prefix tree matched with the longest prefix by adopting a hierarchical compression method according to the real-time topological structure, and storing a forwarding subnet segment in the routing table of each node; generating a routing next-hop table for each subnet node in the prefix tree in the subnet segment, in which the loop is necessary to judge, and traversing each subnet node of the prefix tree to generate a node forwarding figure; and judging whether the routing loop exists or not according to the node forwarding figure. The invention further discloses a routing loop detecting system based on the SDN. By means of the routing loop detecting method and system based on the SDN, the routing loop detection efficiency and accuracy are increased; and simultaneously, the storage space and the calculation time are reduced.
Description
Technical field
The present invention relates to technical field of network communication, particularly relate to a kind of based on the detection method of route loop in SDN and system.
Background technology
SDN is software defined network (SDN-Software-DefinedNetworking), is network technology and the network frame of a kind of novelty being suggested recently.Its core concept is to adopt centerized fusion and distributed AC servo system to combine, plane will be controlled separate with Forwarding plane, and control to be communicated by disclosed agreement (such as Openflow etc.) between plane and Forwarding plane, thus realizing the service logic of complexity and not affecting particular vendor and realize its Forwarding plane, greatly facilitate the innovation of network, under the Internet overall background developed rapidly now, SDN has well adapted to diversified demand and the multifarious complex situations of business.
SDN realizes its function controlling plane by the software being called controller (Controller).Due to the dynamic of the network operation, the complexity of environment and the various asynchronous event occurred at any time, properly functioning network can the various fault of regular generation, the anomalous routes situation such as including route loop, path black hole and unreachable route.The exception of route can cause congested and packet loss, if this kind of fault can not quickly be solved, it is possible to there will be serious communication disruption, in turn result in huge economic loss.Meanwhile, along with the expansion of network size and becoming increasingly complex of business, solve this kind of fault become more and more difficult by manually positioning.
The determination methods of route loop in existing SDN, owing to nodal function is limited, node does not generally run distributed routing protocol simultaneously, therefore the judgement of loop has been difficult on node.Although after route test function transfers to controller, controller obtains the running status of the whole network and the routing iinformation of each node.By every routing table of each network node is analyzed and judges, it is possible to find the route loop phenomenon in network.But, complexity and multiformity due to business, number of routes/routing policy on usual individual node is just very many, number of routes/the routing policy of the whole network node adds up and carries out judging to spend huge calculating time and memory space, will be a very huge burden for controller.That is, what carry out network loop in existing SDN judges whether to intensive calculating and googol according to storage.
Summary of the invention
In view of this, it is an object of the invention to propose a kind of based on the detection method of route loop in SDN and system, can not only quickly, accurately realize the detection of route loop, and required memory space greatly reduces.
Provided by the invention based on the detection method of route loop in SDN based on above-mentioned purpose, including:
Obtain routing table information and the routing-events information of each node in network in real time；
According to the routing table information obtained and routing-events information, the real-time topology structure of tectonic network；
According to real-time topology structure, adopt 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 needing to judge loop, each subnet node in described prefix trees generating route next jump table, each subnet node of traversal prefix trees generates the forwarding figure of node；
Forwarding figure according to node, it may be judged whether there is route loop.
Preferably, in described real-time acquisition network, the routing table information of each node and the step of routing-events information include:
According to the different agreement that router runs, detector corresponding with agreement is adopted to obtain routing table information and routing-events information.
Preferably, the method for described level compression be specially fixing hierarchical level compression method, it is achieved step be:
Prefix trees is configured to 5 interconnective different levels successively, and the rank that level is from top to bottom adopts the distribution mode of 8-8-8-4-4 successively.
Preferably, the step of the forwarding figure of described generation node includes:
First, network being modeled, obtain network model G (V, E, W), wherein, V represents the set of nodes, and E represents the limit set between two nodes namely the connecting link between node corresponding device, and W represents the weight of each of the links；
Forwarding behavior definition on router is as follows:
F (p, ru)=v, u, v ∈ V, wherein, u, v are different nodes, and p is the message being intended to forward, ruRepresent the routing table on node u；
Obtain the message p definition forwarded in the entire network:
F (p, R∑u)={<i, j>| f (p, ru)=j；I, j, u ∈ V}, wherein, R represents the routing table set of each router on network；
Then, in prefix trees, the bit of message p being decomposed, and prefix trees is made a look up, until reaching the prefix of p, each in record search process being accessed for the down hop that node comprises；
By these down hops, namely the forwarding result of message p, obtain the message p set T (p, R) forwarding result to be ordered pair on network, and
T (p, R)=F (p, R∑u)
By the set T (p, R) of the ordered pair directed graph formed, obtain the forwarding figure of node.
Further, for the route of multipath, the forwarding behavior on described router is:
F (p, ru)={ vi|viFor message p next-hop node on node u }, u, vi∈V。
Preferably, judge whether described in that the step of route loop includes:
It is alive by all vertex ticks, and stack space is initialized as sky；
Judge whether present node has in-degree and out-degree simultaneously, be if so, then labeled as visited, and make present node stacked, if it is not, be then labeled as dead；
Judge whether stack space is empty, if, then it represents that it is absent from route loop, if it is not, determine whether whether stack top node has subsequent node；
If stack top node does not have subsequent node, then stack top vertex ticks is dead, and makes stack top node pop；
Return and continue to judge whether stack space is empty, until all nodes are all marked as dead, then it represents that be absent from route loop.
Further, described judge whether stack top node has the step of subsequent node to include:
If stack top node has subsequent node, then obtain the subsequent node of stack top node；
Judge whether subsequent node is labeled as alive, if so, then return the described step judging whether present node has in-degree and out-degree simultaneously, continue to judge to this subsequent node, if it is not, then determine whether whether subsequent node is labeled as visited；
If subsequent node is labeled as visited, then it represents that there is route loop；
If subsequent node is not marked with visited, then it is dead by stack top vertex ticks, and makes stack top node pop.
Present invention also offers a kind of based on the detection system of route loop in SDN, including:
Routing information acquisition module, for obtaining routing table information and the routing-events information of each node in network in real time；
Topological structure generation module, for according to the routing table information obtained in described routing information acquisition module and routing-events information, the real-time topology structure of tectonic network；
Prefix trees constructing module, for according to the real-time topology structure in described topological structure generation module, adopting 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；
Routing calculation module, is used in the subnet network segment needing to judge loop, and each subnet node in described prefix trees generates route next jump table, and each subnet node of traversal prefix trees generates the forwarding figure of node；
Route detection module, for the forwarding figure according to the node in described routing calculation module, it may be judged whether there is route loop.
As can be seen from above, the multirouting list prefix trees of real-time topology structure chart based on the detection method of route loop in SDN and system by tectonic network provided by the invention and structure longest prefix match, in final acquisition network, the forwarding figure of all nodes, can judge whether route loop rapidly and accurately according to the forwarding figure of described node.So, not only make judge process unrelated with Routing Protocol and network traffics, improve efficiency and the accuracy of route loop detection；Meanwhile, the multirouting list prefix trees of structure can greatly reduce memory space and calculating time.
Accompanying drawing explanation
Fig. 1 is the flow chart of normal condition in existing provisional route loop；
Flow chart when Fig. 2 is that in existing provisional route loop, R1 detects fault；
Flow chart when Fig. 3 is that in existing provisional route loop, R2 is not detected by fault；
Fig. 4 is flow chart during troubleshooting in existing provisional route loop；
Fig. 5 is the flow chart of existing persistency route loop；
Fig. 6 is provided by the invention based on the flow chart of the embodiment of the detection method of route loop in SDN；
Fig. 7 is the structural representation based on the fixing hierarchical level compression method adopted in the detection method of route loop in SDN provided by the invention；
Fig. 8 is provided by the invention based on the structural representation of the route loop of the detection method of route loop in SDN；
Fig. 9 is provided by the invention based on the structural representation of the forwarding figure of the detection method of route loop in SDN；
Figure 10 is provided by the invention based on the flow chart of the route loop evaluation algorithm of the detection method of route loop in SDN；
Figure 11 is the structural representation of an example based on the route loop evaluation algorithm in the detection method of route loop in SDN provided by the invention；
Figure 12 is provided by the invention based on the system structure schematic diagram of the detection system of route loop in SDN；
Figure 13 is provided by the invention based on the system architecture schematic diagram of the detection system of route loop in SDN.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.
First, the root produced for the type of route loop and route loop 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 the communication function realized between distinct device and different user.For the routing of correct and suitable realizing route, what router must know network in advance is connected with each other state, and then router can run specific routing algorithm to calculate corresponding routing policy.
Despite the presence of many different Routing Protocols, but according to the difference of routing information acquisition and circulation way, and 2 classes can be divided into: link-state routing protocol (link-stateroutingprotocols) and distance vector routing protocol (distance-vectorroutingprotocols).The example of link-state routing protocol has: the agreement of OSPF and IS-IS type；Distance vector routing protocol then has: the agreement of the types such as RIP/RIPv2 and IGRP.It is not fully complete at routing convergence, or when error configurations, is likely to cause the generation of route loop.If message forwards and is absorbed in route loop, then message can come and go between the router forming loop in circulation, until the TTL of message exhausts and abandons.
Route loop is also classified into 2 classes: provisional route loop and persistency route loop.When network state changes, for instance when topology changes, correct routing policy must regenerate；Then router startup routing algorithm calculates route.The router being in different node varies, and the time point that router-level topology completes to enter convergence is different.This distributed discordance can cause the generation of route loop.But once the convergence of all devices completes, network enters consistent state, route loop Lock-out now.This route loop is called provisional route loop, and it is that nature produces and inevitable, the persistent period short (generally within millisecond even microsecond), thus network communication is impacted hardly.
Provisional loop results from each node cognitive inconsistent situation of state to the whole network.Fig. 1-Fig. 4 gives an extremely simple situation:
With reference to shown in Fig. 1, it is in structure during normal condition for node, obtains the node R 2 Route Selection shortest path sequence to destination node R4 according to routing algorithm: R2-R1-R3-R4.
With reference to, shown in Fig. 2 and Fig. 3, forwarding to the path of destination node from R2, but R2 is not detected by fault or fault is detected be not fully complete process, and R1 detects fault and processes, and the path to destination node still forwards from R1, forms provisional route loop.
With reference to shown in Fig. 4, the cognitive of the whole network is unanimously forwarded from R2 by R1/R2 to the route of destination node R4, and provisional loop disappears.
It will be seen that provisional route loop is after all nodes have been restrained, the route loop Lock-out of generation.For IGP agreement such as OSPF etc., the deadline of convergence can bring up within second rank.Therefore the provisional loop of IGP Routing Protocol does not result in very big impact.Bgp protocol convergence time is more long than IGP agreement institute's time spent, points out that the convergence time of BGP was even up to more than tens minutes in some document.If long-time not converged time occur provisional route loop, network delay and network traffics to increase, thus reducing the performance of network.
The producing cause of persistency route loop has multiple, for instance error configurations, or network equipment failure etc..In the network of a lot of large enterprises, it is frequently present of multiple routed domain, and due to the reason (merger etc. of such as business/company) of history, these routed domain are likely to adopt different IGP agreements, such as OSPF, RIP or EIGPR etc., the configuration of mistake leads to the generation of persistency route loop.In list of references " End-to-endroutingbehaviorintheInternet ", to more than 40,000 end to end Internet route detection, it has been found that the persistent period can reach the route loop phenomenon of several hours.Persistency route loop once produce, then must can solve in manual intervention, and owing to the persistent period is long, therefore cost is big, and the impact caused is also big.If across the route loop of Autonomous Domain (AS:AutonomousSystem), then different tissues is needed to coordinate, consuming time bigger with cost.
When operating network is upgraded or migrated, network must configure or reconfigure.Its step follows the carrying out of router one by one, although at the initial and last route loop that do not produce of configuration, but the process of configuration is gradually completing, and therefore there will be the situation that routing state is inconsistent.Some documents being pointed out, this situation may produce route loop.In SDN, the step of config update is inconsistent, also there will be of short duration route loop, directly results in the packet loss of short time and the Quality Down situation of network service.When route prefix is polymerized by the core router in network, if being polymerized the inappropriate situation being likely to and loop occurring.
With reference to shown in Fig. 5, being connected to the server cluster of 2/24 prefixes below client router R, therefore R has declared the route of two "/24 " prefixes to the router Core of provider.Core router thinks that the network address section of 10.2.2.0/22 can be transferred through R and arrives, therefore is a route by the route aggregation of these two prefixes.When message 10.2.2.2 arrives Core, R router will be forwarded to, and R router will find that this message is not belonging to the server below R and owns, and then be forwarded to Core according to the default route of R, cause route loop phenomenon.
With reference to shown in Fig. 6, for provided by the invention based on the flow chart of the embodiment of the detection method of route loop in SDN.Described include based on the detection method of route loop in SDN:
Step 101, obtains routing table information and the routing-events information of each node in network in real time.
Wherein, described routing table information and routing-events information comprise the routing iinformation of the link-state information in SDN and Real-time Feedback.Here, routing iinformation is to be acquired by relevant detector.
Step 102, according to the routing table information obtained and routing-events information, the real-time topology structure of tectonic network.
By the routing table information obtained in step 101 and routing-events information, just can obtain the annexation between adjacent node in SDN, be generated as topology of networks in conjunction with all nodal informations.Annexation between node, namely the acquisition of network connection information is completed by Link Layer Discovery Protocol LLDP (LinkLayerDiscoveryProtocol), and this agreement is defined by IEEE802.1AB and is the two-layer protocol unrelated with manufacturer.Interconnective equipment regularly can send message to neighbours, this message contains the information such as the management address on local device, unique ability, device identification and interface identifier, and is encapsulated in the protocol Data Unit (LLDPDU:LinkLayerDiscoveryProtocolDataUnit) of LLDP with the form of TLV (Type/Length/Value) and is transmitted.
When the switch in SDN is connected to controller, switch is sent to the message of controller and carries the opposite equip. information being joined directly together with this equipment, and according to this information, controller can realize passive network discovery mechanism.If switch does not send the information collected by LLDP agreement, then controller issues message that type is OFPT_PACKET_OUT to switch, switch is instructed to send LLDP message from its interface, then the switch receiving LLDP message delivers to controller by FPT_PACKET_IN type message, and then controller just can construct the topological relation of whole network.
Step 103, according to real-time topology structure, adopts the multirouting list prefix trees of the method construct longest prefix match of level compression, and stores the forwarding subnet network segment in the routing table of each node.
The detection that route is abnormal depends on the routing iinformation of each node, in order to store and the routing iinformation of easy-to-look-up each node, it is necessary to construct the scheme of the storage of effective routing table and inquiry.List of references " Atree-basedpacketroutingtableforBerkeleyunix " proposes and a kind of construct binary chop tree and carry out the solution of route querying.This scheme can effectively carry out the lookup of route table items in theory.But, nonunf ormity due to IP route prefix length, such as: mentioning IPv4 address block at list of references " VisibilityofPrefixLengthsinIPv4andIPv6 ", to be concentrated mainly on prefix length be between 16 to 24, especially with prefix length be 24 address block maximum.The scheme adopting binary chop tree needs to store substantial amounts of intermediate node, so, not only causes the waste of memory space, and has delayed the time of inquiry.Dynamic level compression method construct prefix trees in list of references " IP-addresslookupusingLC-tries " namely LC-Trie tree, but inefficient when more than 100K reaches for routing table entry.List of references " Layer3 Switching technology and the applied research in wideband IP network thereof " have employed the method for static layer second compression storage LC-Trie prefix trees, when route entry is more than 100K bar, inquiry velocity faster can be obtained by the method, memory space can be saved simultaneously.Herein in conjunction with above-mentioned all methods, the situation for SDN has done improvement to adapt to the needs that real network is run.
Step 104, in the subnet network segment needing to judge loop, generates route next jump table to each subnet node in described prefix trees, and each subnet node of traversal prefix trees generates the forwarding figure of node.
Wherein, described down hop refers to the next router node that message will be forwarded on current router node, and correspondence, next skip list refers to the set of interconnective state between node.
Step 105, the forwarding figure according to node, it may be judged whether there is route loop.
After constructing the forwarding figure of corresponding each network segment, namely forwarding figure can determine whether the situation that whether there is route loop in network.Forwarding on figure, if there is route loop, then it is equivalent to this forwarding figure and there is the loop of closing.What give a kind of complexity O (V+E) in list of references " Depth-firstsearchandlineargraphalgorithms " calculates the linear time algorithm of all strong continune components in directed graph.But, more simple based on the problem related in the present invention, namely have only to judge whether loop.Thus above-mentioned algorithm is improved, obtaining depth-first labeling algorithm, its complexity is still equally O (V+E) with document, but calculating time and memory space when realizing is more excellent.
By above-described embodiment it can be seen that of the present invention have the advantage that based on the detection method of route loop in SDN
(1) judge whether route loop based on the basic reason that route loop occurs from SDN of the detection method of route loop in SDN and routing table described in, so can judge, close to 100%, phenomenon that whether route loop occurs.Meanwhile, judge the abnormal conditions of route from routing table, it is to avoid analysis to Routing Protocol, accomplish the independence of Routing Protocol.
(2) detection method of the present invention is owing to need not adopt network traffics, but monitor in real time routing table event, introduces extra flow thus without to SDN, it is ensured that network properly functioning.
(3) when being absent from flow in network, the detection method of the present invention can also detect whether have route loop.As such, it is possible to loop behavior is carried out early warning, avoid the generation of major accident in advance.
(4) method of the level compression adopted in the detection method of the present invention, constructs the prefix trees simultaneously storing multiple routing tables, effectively reduces memory space and the time of calculating.
(5) due to prefix trees, heterogeneous networks prefix can be checked parallel, thus there is good autgmentability and retractility, when network size changes, it is possible to be easy to the hardware increasing parallel processing to promote calculated performance.
(6) detection method of the present invention has good adaptability, IPv4 is being route on abnormality detection basis, it is possible to be easily integrated the abnormality detection of IPv6 and the abnormal detection function (such as MPLS etc.) to other Routing Protocol.
In some preferred embodiments, in described real-time acquisition network, the routing table information of each node and the step 101 of routing-events information include:
According to the different agreement that router runs, detector corresponding with agreement is adopted to obtain routing table information and routing-events information.Such as: run ospf protocol or bgp protocol for router, then installation OSPF detector (OSPFProber) or BGP detector (BGPProber) obtain the routing iinformation of network.Wherein, OSPF detector can adopt the Quagga software increased income to modify and can realize.BGP detector adopts the BGPMon increased income, it is possible to obtain the prefix broadcast message of BGP in real time.
So so that described can be applicable for use with the network of various different agreement based on the detection method of route loop in SDN.Not only, improve the practicality of the inventive method, and be conducive to described based on the detection method of route loop extension in heterogeneous networks in SDN.
In further embodiment of the present invention, the method for described level compression be specially fixing hierarchical level compression method, it is achieved step be:
Prefix trees is configured to 5 interconnective different levels successively, and the rank that level is from top to bottom adopts the distribution mode of 8-8-8-4-4 successively.
The present invention is directed to the network address distribution situation of IPv4, the prefix trees mode using fixing hierarchical level compress mode to be 8-8-8-4-4 and the prefix trees mode of the prefix length 4-4 less than 8.With reference to shown in Fig. 7, for the prefix trees scheme that hierarchical approaches is 8-8-8-4-4.In like manner, prefix length 4-4 prefix trees within 8 can construct too.
In prefix trees, the definition of each node is as follows:
Wherein, the concrete meaning of each field is as follows:
On each node of prefix trees, storage is the index of next skip list NHDB, and concrete down hop content needs to inquire about in next skip list NHDB, stores the default route of all nodes in the position that index is 0.Next skip list is organized as form in logic, and the form of its every row element is as follows:
Wherein MAX_ROUTER is the maximum of the router number existed in network.
So, the mode of the fixing implements spatial scalable compression of the 8-8-8-4-4 adopted by the present invention can improve the efficiency of storage of prefix trees and the efficiency of detection calculating further.
In some preferred embodiments, the step 104 of the forwarding figure of described generation node includes:
First, in order to realize the analysis of anomalous routes situation, it is necessary to for network be modeled, obtain network model G (V, E, W), wherein, V represents the set of nodes, and each node illustrates the equipment in network, for instance router, layer-3 switch etc..E represents the limit set between two nodes, and each edge illustrates the connecting link between two network equipments.W represents the weight of each of the links, for instance: w (e) represents the weight of certain link e.
If u, v ∈ V represents two routers with connecting link on network, the routing table on node u represents a snapshot of node at that time, uses ruRepresent；The message p being intended to forward represents.
Forwarding behavior definition on router is as follows:
F (p, ru)=v, u, v ∈ V, wherein, u, v are different nodes, and p is the message being intended to forward, ruRepresent the routing table on node u.
Above-mentioned forwarding behavior representation message will be forwarded to its down hop v on router node u.Generally when implementing, down hop is the outgoing interface of node u；But when analyzing abnormal conditions, it is possible to directly obtaining, from outgoing interface, the router that this interface is direct-connected, therefore, v herein is defined as the router that down hop is corresponding.
Thus, the message p definition forwarded in the entire network is obtained:
F (p, R∑u)={<i, j>| f (p, ru)=j；I, j, u ∈ V}, wherein, R represents the routing table set of each router on network.
Then, in prefix trees, the bit of message p being decomposed, and from tree root to leaves, prefix trees is made a look up, until reaching the prefix of message p, each in record search process being accessed for the down hop that node comprises；
By these down hops, namely the forwarding result of message p, obtain the message p set T (p, R) forwarding result to be ordered pair on network, and
T (p, R)=F (p, R∑u)
By the set T (p, R) of the ordered pair directed graph formed, the forwarding figure of node finally just can be obtained.
In some optional embodiments, forwarding figure is defined as: ForwardingGraph (V, E, R, p): the directed graph being made up of ordered pair set T (p, R) on=node set V
For discussion purposes, sometimes eliminate V, E, and be simply designated as: FG (p, R).Or, when specific routing table R is known, it is possible to be abbreviated as FG (p).
To all of message p checking forward result be unrealistic also it is not necessary that, it is only necessary to the network belonging to message p is verified.For the expression of network and subnet thereof, introducing the conventional method for expressing coming from CISCO, namely { IP address/mask-scope } represents.Such as { 192.168/16-24} represents that first 16 of IP address are 192.168, and the mask-length of correspondence is the IP address range of 16 to 24.{ 0/0} represents default route, and { 0/0-32} represents all possible IPv4 network address, and { 0/1-32} represents the institute likely IPv4 network address except default route.With reference to shown in Fig. 8, it is the forwarding figure of 192.168/16 correspondence, it can be seen that it causes the loop of route.
So, by the definition relevant for figure that forwards adopted in above-described embodiment, and map generalization is forwarded, it is possible to make the method for the present invention quickly obtain the forwarding figure of node, and the forwarding figure of this node comprises the information needed judging route loop.Namely, it is possible to increase described based on the detection efficiency of the detection method of route loop in SDN and accuracy.
Further, during for the route of multipath, the forwarding behavior on described router is defined as:
F (p, ru)={ vi|viFor message p next-hop node on node u }, u, vi∈V。
That is, the corresponding multiple next-hop nodes of current node.Now, other definition relevant to forwarding figure are just the same, and the method for generation forwarding figure is too, and explanation is not repeated herein.
In some preferred embodiments, with reference to shown in Fig. 9, illustrate for the forwarding figure of 10.22.33/24, forward map generalization process specific as follows:
With IP address front 8 namely 10 for index, lookup one-level Trie block, (nhop, next) all it is not zero, there is no route table items with nhop=65 for index search down hop tables of data, router 1 and router 2, router 3 has down hop 1, obtains ordered pair<3,1>.
With time 8 namely 22 of IP address for index, with the next of previous step for pointer, search two grades of Trie blocks, obtain list item (nhop, next) to be not zero, search NHDB table with nhop=47, obtain router 1 down hop 3, the down hop 3 of router 2, altogether obtaining ordered pair is: {<3,1>,<1,3>,<2,3>}.
Because next is not zero, it was shown that there is longer prefix route to exist, with IP address follow-up 8 namely 33 for indexing, obtain list item (nhop, next).By nhop=48, searching NHDB table, obtain longer prefix route<1,2>, replace<1,3>in previous step, the ordered pair altogether obtained is:
{<3,1>,<1,2>,<2,3>}
Owing to having reached the prefix length 24 of 10.22.33/24, the forwarding figure that the ordered pair therefore obtained is constituted, with reference to forwarding figure as shown in Figure 8.
With reference to shown in Figure 10, described in judge whether that the method for route loop is depth-first labeling algorithm, concrete steps include:
All vertex ticks are alive, and stack space are initialized as sky by step 201.
Step 202, it is judged that whether present node has in-degree and out-degree simultaneously, if so, then forwards step 203 to, if it is not, then forward step 204 to.
Step 203, according to step 202, is labeled as present node visited, and makes present node stacked.
Step 204, according to step 202, is labeled as dead by present node；And this present node is not stacked.
Step 205, it is judged that whether stack space is empty, if so, then forwards step 212 to, if it is not, then forward step 206 to.
Step 206, according to step 205, represents in stack space have node, determines whether whether stack top node has subsequent node, if it is not, then forward step 207 to.Wherein, described stack top node refers to the node being in stack top.
Step 207, if stack top node does not have subsequent node, then stack top vertex ticks is dead, and makes stack top node pop, and removes stack space by node.
Return step 205, continue to judge whether stack space is empty, until all nodes are all marked as dead, that is, stack space is empty.
Step 212, stack space is empty, represents and is absent from route loop, detects complete.
So, of the present invention rapidly and accurately forwarding figure can be detected based on the detection method of route loop in SDN and judge, namely substantially increase the detection efficiency of route loop.
Further, described judge whether stack top node has the step 206 of subsequent node to include:
Step 208, if stack top node has subsequent node, then obtains the subsequent node of stack top node.
Step 209, it is judged that whether subsequent node is labeled as alive, if so, then returns step 202 and continues to judge to this subsequent node, if it is not, then forward step 210 to.
Step 210, it is judged that whether subsequent node is labeled as visited；If so, then forward step 211 to, then return step 207 if not.
Step 211, according to step 210, subsequent node is labeled as visited, then it represents that there is route loop in network.
It should be noted that above-mentioned labelling alive, visited and dead are intended merely to distinguishes the node being in different conditions, it is possible to according to actual needs, correspondingly revise mode and the content of labelling.
With reference to shown in Figure 11, for the structural representation of an example based on the route loop evaluation algorithm in the detection method of route loop in SDN provided by the invention.
The depth-first labeling algorithm that the present invention is adopted forwarding figure in fig. 11 runs and calculates, it is possible to obtaining route loop is: R2-R3-R5.
With reference to shown in Figure 12, for provided by the invention based on the system structure schematic diagram of the detection system of route loop in SDN.Described based on the detection system of route loop in SDN, including:
Routing information acquisition module 301, for obtaining routing table information and the routing-events information of each node in network in real time；
Topological structure generation module 302, for according to the routing table information obtained in described routing information acquisition module 301 and routing-events information, the real-time topology structure of tectonic network；
Prefix trees constructing module 303, for according to the real-time topology structure in described topological structure generation module 302, adopting 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；
Routing calculation module 304, is used in the subnet network segment needing to judge loop, and each subnet node in described prefix trees generates route next jump table, and each subnet node of traversal prefix trees generates the forwarding figure of node；
Route detection module 305, for the forwarding figure according to the node in described routing calculation module 304, it may be judged whether there is route loop.
With reference to shown in Figure 13, for provided by the invention based on the system architecture schematic diagram of the detection system of route loop in SDN.Described based in SDN route loop detection system deployment on the controller Controller of SDN.
Those of ordinary skill in the field are it is understood that the discussion of any of the above embodiment is exemplary only, it is not intended that hint the scope of the present disclosure (including claim) is limited to these examples；Under the thinking of the present invention, can also be combined between technical characteristic in above example or different embodiment, step can realize with random order, and there are other changes many of the different aspect of the present invention as above, for they not offers in details simple and clear.Therefore, all within the spirit and principles in the present invention, any omission of making, amendment, equivalent replacement, improvement etc., should be included within protection scope of the present invention.
Claims (8)
1. one kind based on the detection method of route loop in SDN, it is characterised in that including:
Obtain routing table information and the routing-events information of each node in network in real time；
According to the routing table information obtained and routing-events information, the real-time topology structure of tectonic network；
According to real-time topology structure, adopt 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 needing to judge loop, each subnet node in described prefix trees generating route next jump table, each subnet node of traversal prefix trees generates the forwarding figure of node；
Forwarding figure according to node, it may be judged whether there is route loop.
2. method according to claim 1, it is characterised in that in described real-time acquisition network, the routing table information of each node and the step of routing-events information include:
According to the different agreement that router runs, detector corresponding with agreement is adopted to obtain routing table information and routing-events information.
3. method according to claim 1, it is characterised in that the method for described level compression be specially fixing hierarchical level compression method, it is achieved step be:
Prefix trees is configured to 5 interconnective different levels successively, and the rank that level is from top to bottom adopts the distribution mode of 8-8-8-4-4 successively.
4. method according to claim 1, it is characterised in that the step of the forwarding figure of described generation node includes:
First, network being modeled, obtain network model G (V, E, W), wherein, V represents the set of nodes, and E represents the limit set between two nodes namely the connecting link between node corresponding device, and W represents the weight of each of the links；
Forwarding behavior definition on router is as follows:
F (p, ru)=v, u, v ∈ V, wherein, u, v are different nodes, and p is the message being intended to forward, ruRepresent the routing table on node u；
Obtain the message p definition forwarded in the entire network:
F (p, R∑u)={<i, j>| f (p, ru)=j；I, j, u ∈ V}, wherein, R represents the routing table set of each router on network；
Then, in prefix trees, the bit of message p being decomposed, and prefix trees is made a look up, until reaching the prefix of p, each in record search process being accessed for the down hop that node comprises；
By these down hops, namely the forwarding result of message p, obtain the message p set T (p, R) forwarding result to be ordered pair on network, and
T (p, R)=F (p, R∑u)
By the set T (p, R) of the ordered pair directed graph formed, obtain the forwarding figure of node.
5. method according to claim 4, it is characterised in that for the route of multipath, the forwarding behavior on described router is:
F (p, ru)={ vi|viFor message p next-hop node on node u }, u, vi∈V。
6. method according to claim 1, it is characterised in that described in judge whether that the step of route loop includes:
It is alive by all vertex ticks, and stack space is initialized as sky；
Judge whether present node has in-degree and out-degree simultaneously, be if so, then labeled as visited, and make present node stacked, if it is not, be then labeled as dead；
Judge whether stack space is empty, if, then it represents that it is absent from route loop, if it is not, determine whether whether stack top node has subsequent node；
If stack top node does not have subsequent node, then stack top vertex ticks is dead, and makes stack top node pop；
Return and continue to judge whether stack space is empty, until all nodes are all marked as dead, then it represents that be absent from route loop.
7. method according to claim 6, it is characterised in that described judge whether stack top node has the step of subsequent node to include:
If stack top node has subsequent node, then obtain the subsequent node of stack top node；
Judge whether subsequent node is labeled as alive, if so, then return the described step judging whether present node has in-degree and out-degree simultaneously, continue to judge to this subsequent node, if it is not, then determine whether whether subsequent node is labeled as visited；
If subsequent node is labeled as visited, then it represents that there is route loop；
If subsequent node is not marked with visited, then it is dead by stack top vertex ticks, and makes stack top node pop.
8. one kind based on the detection system of route loop in SDN, it is characterised in that including:
Routing information acquisition module, for obtaining routing table information and the routing-events information of each node in network in real time；
Topological structure generation module, for according to the routing table information obtained in described routing information acquisition module and routing-events information, the real-time topology structure of tectonic network；
Prefix trees constructing module, for according to the real-time topology structure in described topological structure generation module, adopting 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；
Routing calculation module, is used in the subnet network segment needing to judge loop, and each subnet node in described prefix trees generates route next jump table, and each subnet node of traversal prefix trees generates the forwarding figure of node；
Route detection module, for the forwarding figure according to the node in described routing calculation module, it may be judged whether there is route loop.
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 true CN105721297A (en) | 2016-06-29 |
| CN105721297B 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) |
Cited By (82)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789889A (en) * | 2016-11-22 | 2017-05-31 | 广州市诚毅科技软件开发有限公司 | A kind of method for monitoring network and device based on network structure |
| CN107809381A (en) * | 2017-10-19 | 2018-03-16 | 北京邮电大学 | One kind, which is realized, is based on route loop active auditing algorithm and implementation method in SDN |
| CN108259326A (en) * | 2016-12-29 | 2018-07-06 | 华为技术有限公司 | Routing table update method, apparatus, distribution node and leaf message forwarding equipment |
| CN108270645A (en) * | 2017-12-19 | 2018-07-10 | 中国电子科技网络信息安全有限公司 | A kind of SDN network isolation detection method |
| CN108881005A (en) * | 2017-05-15 | 2018-11-23 | 华为国际有限公司 | Inspection software defines network（SDN）In route loop system and method |
| US10218572B2 (en) | 2017-06-19 | 2019-02-26 | Cisco Technology, Inc. | Multiprotocol border gateway protocol routing validation |
| CN109617776A (en) * | 2018-12-20 | 2019-04-12 | 桂林电子科技大学 | The method and system of software defined network controller based on distributed hash table |
| CN109684217A (en) * | 2018-12-25 | 2019-04-26 | 网易（杭州）网络有限公司 | A kind of method and device of computer games check, electronic equipment, storage medium |
| CN109873724A (en) * | 2019-02-28 | 2019-06-11 | 南京创网网络技术有限公司 | Service chaining high availability method applied to SDN network |
| US10333787B2 (en) | 2017-06-19 | 2019-06-25 | Cisco Technology, Inc. | Validation of L3OUT configuration for communications outside a network |
| US10333833B2 (en) | 2017-09-25 | 2019-06-25 | Cisco Technology, Inc. | Endpoint path assurance |
| US10341184B2 (en) | 2017-06-19 | 2019-07-02 | Cisco Technology, Inc. | Validation of layer 3 bridge domain subnets in in a network |
| US10348564B2 (en) | 2017-06-19 | 2019-07-09 | Cisco Technology, Inc. | Validation of routing information base-forwarding information base equivalence in a network |
| US10411996B2 (en) | 2017-06-19 | 2019-09-10 | Cisco Technology, Inc. | Validation of routing information in a network fabric |
| US10432467B2 (en) | 2017-06-19 | 2019-10-01 | Cisco Technology, Inc. | Network validation between the logical level and the hardware level of a network |
| US10439875B2 (en) | 2017-05-31 | 2019-10-08 | Cisco Technology, Inc. | Identification of conflict rules in a network intent formal equivalence failure |
| US10437641B2 (en) | 2017-06-19 | 2019-10-08 | Cisco Technology, Inc. | On-demand processing pipeline interleaved with temporal processing pipeline |
| CN110445703A (en) * | 2019-07-26 | 2019-11-12 | 新华三技术有限公司合肥分公司 | Loop message hold-up interception method, forwarding device and controller |
| US10498608B2 (en) | 2017-06-16 | 2019-12-03 | Cisco Technology, Inc. | Topology explorer |
| US10505816B2 (en) | 2017-05-31 | 2019-12-10 | Cisco Technology, Inc. | Semantic analysis to detect shadowing of rules in a model of network intents |
| US10528444B2 (en) | 2017-06-19 | 2020-01-07 | Cisco Technology, Inc. | Event generation in response to validation between logical level and hardware level |
| US10536337B2 (en) | 2017-06-19 | 2020-01-14 | Cisco Technology, Inc. | Validation of layer 2 interface and VLAN in a networked environment |
| US10547715B2 (en) | 2017-06-16 | 2020-01-28 | Cisco Technology, Inc. | Event generation in response to network intent formal equivalence failures |
| US10547509B2 (en) | 2017-06-19 | 2020-01-28 | Cisco Technology, Inc. | Validation of a virtual port channel (VPC) endpoint in the network fabric |
| US10554483B2 (en) | 2017-05-31 | 2020-02-04 | Cisco Technology, Inc. | Network policy analysis for networks |
| US10554477B2 (en) | 2017-09-13 | 2020-02-04 | Cisco Technology, Inc. | Network assurance event aggregator |
| US10554493B2 (en) | 2017-06-19 | 2020-02-04 | Cisco Technology, Inc. | Identifying mismatches between a logical model and node implementation |
| US10560328B2 (en) | 2017-04-20 | 2020-02-11 | Cisco Technology, Inc. | Static network policy analysis for networks |
| US10560355B2 (en) | 2017-06-19 | 2020-02-11 | Cisco Technology, Inc. | Static endpoint validation |
| US10567229B2 (en) | 2017-06-19 | 2020-02-18 | Cisco Technology, Inc. | Validating endpoint configurations between nodes |
| US10567228B2 (en) | 2017-06-19 | 2020-02-18 | Cisco Technology, Inc. | Validation of cross logical groups in a network |
| US10574513B2 (en) | 2017-06-16 | 2020-02-25 | Cisco Technology, Inc. | Handling controller and node failure scenarios during data collection |
| US10572495B2 (en) | 2018-02-06 | 2020-02-25 | Cisco Technology Inc. | Network assurance database version compatibility |
| US10581694B2 (en) | 2017-05-31 | 2020-03-03 | Cisco Technology, Inc. | Generation of counter examples for 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 |
| 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 |
| US10616072B1 (en) | 2018-07-27 | 2020-04-07 | Cisco Technology, Inc. | Epoch data interface |
| CN110968429A (en) * | 2019-12-20 | 2020-04-07 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for loop detection in directed graph |
| US10623271B2 (en) | 2017-05-31 | 2020-04-14 | Cisco Technology, Inc. | Intra-priority class ordering of rules corresponding to a model of network intents |
| US10623259B2 (en) | 2017-06-19 | 2020-04-14 | Cisco Technology, Inc. | Validation of layer 1 interface in a network |
| US10623264B2 (en) | 2017-04-20 | 2020-04-14 | Cisco Technology, Inc. | Policy assurance for service chaining |
| US10644946B2 (en) | 2017-06-19 | 2020-05-05 | Cisco Technology, Inc. | Detection of overlapping subnets in a network |
| US10652102B2 (en) | 2017-06-19 | 2020-05-12 | Cisco Technology, Inc. | Network node memory utilization analysis |
| US10659298B1 (en) | 2018-06-27 | 2020-05-19 | Cisco Technology, Inc. | Epoch comparison for network events |
| US10673702B2 (en) | 2017-06-19 | 2020-06-02 | Cisco Technology, Inc. | Validation of layer 3 using virtual routing forwarding containers in a network |
| US10686669B2 (en) | 2017-06-16 | 2020-06-16 | Cisco Technology, Inc. | Collecting network models and node information from a network |
| CN111327504A (en) * | 2020-02-26 | 2020-06-23 | 深信服科技股份有限公司 | Virtual local area network loop detection method, device, equipment and readable storage medium |
| US10693738B2 (en) | 2017-05-31 | 2020-06-23 | Cisco Technology, Inc. | Generating device-level logical models for a network |
| US10700933B2 (en) | 2017-06-19 | 2020-06-30 | Cisco Technology, Inc. | Validating tunnel endpoint addresses in a network fabric |
| CN111447091A (en) * | 2020-03-25 | 2020-07-24 | 深信服科技股份有限公司 | Network loop detection method, device, equipment and storage medium |
| CN111641729A (en) * | 2019-05-23 | 2020-09-08 | 北京航空航天大学 | Inter-domain path identification prefix conflict detection and decomposition method based on prefix tree |
| CN111698110A (en) * | 2019-03-14 | 2020-09-22 | 深信服科技股份有限公司 | Network equipment performance analysis method, system, equipment and computer medium |
| US10797951B2 (en) | 2014-10-16 | 2020-10-06 | Cisco Technology, Inc. | Discovering and grouping application endpoints in a network environment |
| US10805160B2 (en) | 2017-06-19 | 2020-10-13 | Cisco Technology, Inc. | Endpoint bridge domain subnet validation |
| US10812315B2 (en) | 2018-06-07 | 2020-10-20 | Cisco Technology, Inc. | Cross-domain network assurance |
| US10812336B2 (en) | 2017-06-19 | 2020-10-20 | Cisco Technology, Inc. | Validation of bridge domain-L3out association for communication outside a network |
| 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 |
| US10826770B2 (en) | 2018-07-26 | 2020-11-03 | Cisco Technology, Inc. | Synthesis of models for networks using automated boolean learning |
| US10826788B2 (en) | 2017-04-20 | 2020-11-03 | Cisco Technology, Inc. | Assurance of quality-of-service configurations in a network |
| US10873509B2 (en) | 2018-01-17 | 2020-12-22 | Cisco Technology, Inc. | Check-pointing ACI network state and re-execution from a check-pointed state |
| US10904070B2 (en) | 2018-07-11 | 2021-01-26 | Cisco Technology, Inc. | Techniques and interfaces for troubleshooting datacenter networks |
| US10904101B2 (en) | 2017-06-16 | 2021-01-26 | Cisco Technology, Inc. | Shim layer for extracting and prioritizing underlying rules for modeling network intents |
| US10911495B2 (en) | 2018-06-27 | 2021-02-02 | Cisco Technology, Inc. | Assurance of security rules in a network |
| CN112437065A (en) * | 2020-11-12 | 2021-03-02 | 安徽大学 | Strategy conflict detection and solution method based on graphic representation under SDN environment |
| CN112491726A (en) * | 2020-11-03 | 2021-03-12 | 晏平 | Route searching and analyzing method and device, computer equipment and storage medium |
| CN112565072A (en) * | 2020-11-02 | 2021-03-26 | 鹏城实验室 | Router compression method, router and storage medium |
| US11019027B2 (en) | 2018-06-27 | 2021-05-25 | Cisco Technology, Inc. | Address translation for external network appliance |
| US11044273B2 (en) | 2018-06-27 | 2021-06-22 | Cisco Technology, Inc. | Assurance of security rules in a network |
| CN113204678A (en) * | 2021-05-27 | 2021-08-03 | 中国工商银行股份有限公司 | Loop detection method, device, system, equipment and medium of directed graph |
| US11102053B2 (en) | 2017-12-05 | 2021-08-24 | Cisco Technology, Inc. | Cross-domain assurance |
| US11121927B2 (en) | 2017-06-19 | 2021-09-14 | Cisco Technology, Inc. | Automatically determining an optimal amount of time for analyzing a distributed network environment |
| US11150973B2 (en) | 2017-06-16 | 2021-10-19 | Cisco Technology, Inc. | Self diagnosing distributed appliance |
| CN113518034A (en) * | 2021-05-07 | 2021-10-19 | 中国移动通信集团陕西有限公司 | Method, device, equipment and storage medium for route detection |
| US11218508B2 (en) | 2018-06-27 | 2022-01-04 | Cisco Technology, Inc. | Assurance of security rules in a network |
| US11258657B2 (en) | 2017-05-31 | 2022-02-22 | Cisco Technology, Inc. | Fault localization in large-scale network policy deployment |
| US11283680B2 (en) | 2017-06-19 | 2022-03-22 | Cisco Technology, Inc. | Identifying components for removal in a network configuration |
| WO2022088843A1 (en) * | 2020-10-28 | 2022-05-05 | 华为技术有限公司 | Routing advertisement method, routing loop detection method, and device |
| US11343150B2 (en) | 2017-06-19 | 2022-05-24 | Cisco Technology, Inc. | Validation of learned routes in a network |
| US11469986B2 (en) | 2017-06-16 | 2022-10-11 | Cisco Technology, Inc. | Controlled micro fault injection on a distributed appliance |
| US11645131B2 (en) | 2017-06-16 | 2023-05-09 | Cisco Technology, Inc. | Distributed fault code aggregation across application centric dimensions |
| US12149399B2 (en) | 2023-10-11 | 2024-11-19 | Cisco Technology, Inc. | Techniques and interfaces for troubleshooting datacenter networks |
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 |
Cited By (128)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11824719B2 (en) | 2014-10-16 | 2023-11-21 | Cisco Technology, Inc. | Discovering and grouping application endpoints in a network environment |
| US11811603B2 (en) | 2014-10-16 | 2023-11-07 | Cisco Technology, Inc. | Discovering and grouping application endpoints in a network environment |
| US11539588B2 (en) | 2014-10-16 | 2022-12-27 | Cisco Technology, Inc. | Discovering and grouping application endpoints in a network environment |
| US10797951B2 (en) | 2014-10-16 | 2020-10-06 | Cisco Technology, Inc. | Discovering and grouping application endpoints in a network environment |
| CN106789889A (en) * | 2016-11-22 | 2017-05-31 | 广州市诚毅科技软件开发有限公司 | A kind of method for monitoring network and device based on network structure |
| CN106789889B (en) * | 2016-11-22 | 2020-05-05 | 广州市诚毅科技软件开发有限公司 | Network monitoring method and device based on mesh structure |
| CN108259326A (en) * | 2016-12-29 | 2018-07-06 | 华为技术有限公司 | Routing table update method, apparatus, distribution node and leaf message forwarding equipment |
| US11178009B2 (en) | 2017-04-20 | 2021-11-16 | Cisco Technology, Inc. | Static network policy analysis for networks |
| 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 |
| CN108881005A (en) * | 2017-05-15 | 2018-11-23 | 华为国际有限公司 | Inspection software defines network（SDN）In route loop system and method |
| US11411803B2 (en) | 2017-05-31 | 2022-08-09 | Cisco Technology, Inc. | Associating network policy objects with specific faults corresponding to fault localizations in large-scale network deployment |
| US11258657B2 (en) | 2017-05-31 | 2022-02-22 | Cisco Technology, Inc. | Fault localization in large-scale network policy deployment |
| 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 |
| US11303531B2 (en) | 2017-05-31 | 2022-04-12 | Cisco Technologies, Inc. | Generation of counter examples for network intent formal equivalence failures |
| US10951477B2 (en) | 2017-05-31 | 2021-03-16 | 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 |
| US10505816B2 (en) | 2017-05-31 | 2019-12-10 | Cisco Technology, Inc. | Semantic analysis to detect shadowing of rules in a model of network intents |
| 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 |
| US10581694B2 (en) | 2017-05-31 | 2020-03-03 | Cisco Technology, Inc. | Generation of counter examples for network intent formal equivalence failures |
| US10554483B2 (en) | 2017-05-31 | 2020-02-04 | Cisco Technology, Inc. | Network policy analysis for networks |
| US11469986B2 (en) | 2017-06-16 | 2022-10-11 | Cisco Technology, Inc. | Controlled micro fault injection on a distributed appliance |
| US10547715B2 (en) | 2017-06-16 | 2020-01-28 | Cisco Technology, Inc. | Event generation in response to network intent formal equivalence failures |
| 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 |
| US11102337B2 (en) | 2017-06-16 | 2021-08-24 | Cisco Technology, Inc. | Event generation in response to network intent formal equivalence failures |
| US11150973B2 (en) | 2017-06-16 | 2021-10-19 | Cisco Technology, Inc. | Self diagnosing distributed appliance |
| US10686669B2 (en) | 2017-06-16 | 2020-06-16 | Cisco Technology, Inc. | Collecting network models and node information from a network |
| US11463316B2 (en) | 2017-06-16 | 2022-10-04 | 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 |
| US11563645B2 (en) | 2017-06-16 | 2023-01-24 | Cisco Technology, Inc. | Shim layer for extracting and prioritizing underlying rules for modeling network intents |
| US11645131B2 (en) | 2017-06-16 | 2023-05-09 | Cisco Technology, Inc. | Distributed fault code aggregation across application centric dimensions |
| 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 |
| US10880169B2 (en) | 2017-06-19 | 2020-12-29 | Cisco Technology, Inc. | Multiprotocol border gateway protocol routing validation |
| US11469952B2 (en) | 2017-06-19 | 2022-10-11 | Cisco Technology, Inc. | Identifying mismatches between a logical model and node implementation |
| US11750463B2 (en) | 2017-06-19 | 2023-09-05 | Cisco Technology, Inc. | Automatically determining an optimal amount of time for analyzing a distributed network environment |
| US11736351B2 (en) | 2017-06-19 | 2023-08-22 | Cisco Technology Inc. | Identifying components for removal in a network configuration |
| US10218572B2 (en) | 2017-06-19 | 2019-02-26 | Cisco Technology, Inc. | Multiprotocol border gateway protocol routing validation |
| US10623259B2 (en) | 2017-06-19 | 2020-04-14 | Cisco Technology, Inc. | Validation of layer 1 interface in a network |
| US11595257B2 (en) | 2017-06-19 | 2023-02-28 | Cisco Technology, Inc. | Validation of cross logical groups in a network |
| 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 |
| US10652102B2 (en) | 2017-06-19 | 2020-05-12 | Cisco Technology, Inc. | Network node memory utilization analysis |
| US11570047B2 (en) | 2017-06-19 | 2023-01-31 | Cisco Technology, Inc. | Detection of overlapping subnets in a network |
| US10673702B2 (en) | 2017-06-19 | 2020-06-02 | Cisco Technology, Inc. | Validation of layer 3 using virtual routing forwarding containers in a network |
| US10567229B2 (en) | 2017-06-19 | 2020-02-18 | Cisco Technology, Inc. | Validating endpoint configurations between nodes |
| US11558260B2 (en) | 2017-06-19 | 2023-01-17 | Cisco Technology, Inc. | Network node memory utilization analysis |
| US10560355B2 (en) | 2017-06-19 | 2020-02-11 | Cisco Technology, Inc. | Static endpoint validation |
| US10700933B2 (en) | 2017-06-19 | 2020-06-30 | Cisco Technology, Inc. | Validating tunnel endpoint addresses in a network fabric |
| US10333787B2 (en) | 2017-06-19 | 2019-06-25 | Cisco Technology, Inc. | Validation of L3OUT configuration for communications outside a network |
| US11438234B2 (en) | 2017-06-19 | 2022-09-06 | Cisco Technology, Inc. | Validation of a virtual port channel (VPC) endpoint in the network fabric |
| US11405278B2 (en) | 2017-06-19 | 2022-08-02 | 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 |
| US10805160B2 (en) | 2017-06-19 | 2020-10-13 | Cisco Technology, Inc. | Endpoint bridge domain subnet validation |
| US11343150B2 (en) | 2017-06-19 | 2022-05-24 | Cisco Technology, Inc. | Validation of learned routes in a network |
| US10812336B2 (en) | 2017-06-19 | 2020-10-20 | Cisco Technology, Inc. | Validation of bridge domain-L3out association for communication outside a network |
| US11303520B2 (en) | 2017-06-19 | 2022-04-12 | Cisco Technology, Inc. | Validation of cross logical groups in a network |
| US10341184B2 (en) | 2017-06-19 | 2019-07-02 | Cisco Technology, Inc. | Validation of layer 3 bridge domain subnets in in a network |
| US10547509B2 (en) | 2017-06-19 | 2020-01-28 | Cisco Technology, Inc. | Validation of a virtual port channel (VPC) endpoint in the network fabric |
| US10862752B2 (en) | 2017-06-19 | 2020-12-08 | Cisco Technology, Inc. | Network validation between the logical level and the hardware level of a network |
| US10873505B2 (en) | 2017-06-19 | 2020-12-22 | Cisco Technology, Inc. | Validation of layer 2 interface and VLAN in a networked environment |
| US10873506B2 (en) | 2017-06-19 | 2020-12-22 | Cisco Technology, Inc. | Validation of a virtual port channel (VPC) endpoint in the network fabric |
| US11283680B2 (en) | 2017-06-19 | 2022-03-22 | Cisco Technology, Inc. | Identifying components for removal in a network configuration |
| US10536337B2 (en) | 2017-06-19 | 2020-01-14 | Cisco Technology, Inc. | Validation of layer 2 interface and VLAN in a networked environment |
| US11283682B2 (en) | 2017-06-19 | 2022-03-22 | Cisco Technology, Inc. | Validation of bridge domain-L3out association for communication outside 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 |
| US10348564B2 (en) | 2017-06-19 | 2019-07-09 | Cisco Technology, Inc. | Validation of routing information base-forwarding information base equivalence in a network |
| US10411996B2 (en) | 2017-06-19 | 2019-09-10 | Cisco Technology, Inc. | Validation of routing information in a network fabric |
| US10432467B2 (en) | 2017-06-19 | 2019-10-01 | Cisco Technology, Inc. | Network validation between the logical level and the hardware level of a network |
| US11153167B2 (en) | 2017-06-19 | 2021-10-19 | Cisco Technology, Inc. | Validation of L3OUT configuration for communications outside a network |
| US11121927B2 (en) | 2017-06-19 | 2021-09-14 | Cisco Technology, Inc. | Automatically determining an optimal amount of time for analyzing a distributed network environment |
| US10972352B2 (en) | 2017-06-19 | 2021-04-06 | Cisco Technology, Inc. | Validation of routing information base-forwarding information base equivalence in a network |
| US10437641B2 (en) | 2017-06-19 | 2019-10-08 | Cisco Technology, Inc. | On-demand processing pipeline interleaved with temporal processing pipeline |
| US11102111B2 (en) | 2017-06-19 | 2021-08-24 | Cisco Technology, Inc. | Validation of routing information in a network fabric |
| US11063827B2 (en) | 2017-06-19 | 2021-07-13 | Cisco Technology, Inc. | Validation of layer 3 bridge domain subnets in a network |
| US10587456B2 (en) | 2017-09-12 | 2020-03-10 | Cisco Technology, Inc. | Event clustering for a network assurance platform |
| US11038743B2 (en) | 2017-09-12 | 2021-06-15 | 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 |
| US11115300B2 (en) | 2017-09-12 | 2021-09-07 | 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 |
| CN107809381A (en) * | 2017-10-19 | 2018-03-16 | 北京邮电大学 | One kind, which is realized, is based on route loop active auditing algorithm and implementation method in SDN |
| US11102053B2 (en) | 2017-12-05 | 2021-08-24 | Cisco Technology, Inc. | Cross-domain assurance |
| CN108270645A (en) * | 2017-12-19 | 2018-07-10 | 中国电子科技网络信息安全有限公司 | A kind of 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 |
| US11824728B2 (en) | 2018-01-17 | 2023-11-21 | 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 |
| US11374806B2 (en) | 2018-06-07 | 2022-06-28 | Cisco Technology, Inc. | Cross-domain network assurance |
| US11902082B2 (en) | 2018-06-07 | 2024-02-13 | Cisco Technology, Inc. | Cross-domain network assurance |
| US10812315B2 (en) | 2018-06-07 | 2020-10-20 | Cisco Technology, Inc. | Cross-domain network assurance |
| US10659298B1 (en) | 2018-06-27 | 2020-05-19 | Cisco Technology, Inc. | Epoch comparison for network events |
| US11218508B2 (en) | 2018-06-27 | 2022-01-04 | Cisco Technology, Inc. | Assurance of security rules in a network |
| US11909713B2 (en) | 2018-06-27 | 2024-02-20 | Cisco Technology, Inc. | Address translation for external network appliance |
| US11888603B2 (en) | 2018-06-27 | 2024-01-30 | 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 |
| US11044273B2 (en) | 2018-06-27 | 2021-06-22 | 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 |
| US10904070B2 (en) | 2018-07-11 | 2021-01-26 | Cisco Technology, Inc. | Techniques and interfaces for troubleshooting datacenter networks |
| US11805004B2 (en) | 2018-07-11 | 2023-10-31 | 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 |
| CN109684217A (en) * | 2018-12-25 | 2019-04-26 | 网易（杭州）网络有限公司 | A kind of method and device of computer games check, electronic equipment, storage medium |
| CN109873724B (en) * | 2019-02-28 | 2022-05-10 | 南京创网网络技术有限公司 | Service chain high-availability method applied to SDN network |
| CN109873724A (en) * | 2019-02-28 | 2019-06-11 | 南京创网网络技术有限公司 | Service chaining high availability method applied to SDN network |
| CN111698110A (en) * | 2019-03-14 | 2020-09-22 | 深信服科技股份有限公司 | Network equipment performance analysis method, system, equipment and computer medium |
| CN111698110B (en) * | 2019-03-14 | 2023-07-18 | 深信服科技股份有限公司 | Network equipment performance analysis method, system, equipment and computer medium |
| CN111641729A (en) * | 2019-05-23 | 2020-09-08 | 北京航空航天大学 | 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 |
| CN110445703A (en) * | 2019-07-26 | 2019-11-12 | 新华三技术有限公司合肥分公司 | Loop message hold-up interception method, forwarding device and controller |
| CN110968429A (en) * | 2019-12-20 | 2020-04-07 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for loop detection in directed graph |
| 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 |
| CN111447091A (en) * | 2020-03-25 | 2020-07-24 | 深信服科技股份有限公司 | 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 |
| CN112565072A (en) * | 2020-11-02 | 2021-03-26 | 鹏城实验室 | 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 |
| CN112491726A (en) * | 2020-11-03 | 2021-03-12 | 晏平 | Route searching and analyzing method and device, computer equipment and storage medium |
| CN112437065A (en) * | 2020-11-12 | 2021-03-02 | 安徽大学 | 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 |
| CN113518034A (en) * | 2021-05-07 | 2021-10-19 | 中国移动通信集团陕西有限公司 | Method, device, equipment and storage medium for route detection |
| CN113204678A (en) * | 2021-05-27 | 2021-08-03 | 中国工商银行股份有限公司 | Loop detection method, device, system, equipment and medium of directed graph |
| US12149399B2 (en) | 2023-10-11 | 2024-11-19 | Cisco Technology, Inc. | Techniques and interfaces for troubleshooting datacenter networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105721297B (en) | 2019-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105721297A (en) | Routing loop detecting method and system based on SDN | |
| US10742556B2 (en) | Tactical traffic engineering based on segment routing policies | |
| US9369371B2 (en) | Method and system for path monitoring using segment routing | |
| US11943136B2 (en) | Advanced preferred path route graph features in a network | |
| US9537769B2 (en) | Opportunistic compression of routing segment identifier stacks | |
| Rakheja et al. | Performance analysis of RIP, OSPF, IGRP and EIGRP routing protocols in a network | |
| CN104168154B (en) | The multi-level network system and its construction method of network-oriented Situation Awareness | |
| CN101645842B (en) | Communication network system, path calculation device, and communication path establishment control method | |
| US12034632B2 (en) | Fault protection method, node, and storage medium | |
| US8503464B2 (en) | Techniques for efficiently updating routing information | |
| US11632322B2 (en) | Preferred path route graphs in a network | |
| EP3190755B1 (en) | Identification of the paths taken through a network of interconnected devices | |
| US20130088967A1 (en) | Communication system, control apparatus, packet capture method and packet capture program | |
| US20110274111A1 (en) | Edge link discovery | |
| US10778545B2 (en) | Network verification system | |
| US9537760B2 (en) | Executing loops | |
| Varyani et al. | QROUTE: An efficient quality of service (QoS) routing scheme for software-defined overlay networks | |
| US20160050142A1 (en) | Transmission path switching | |
| US20150256407A1 (en) | Control apparatus, control method thereof, and program | |
| US8630189B2 (en) | Methods, apparatus and articles of manufacture to monitor tunnels within traffic engineering/fast reroute enabled networks | |
| CN108924011A (en) | Monitoring system, relevant device, method and medium for OSPF+ Routing Protocol | |
| CN105637806A (en) | Method and apparatus for determining network topology, and centralized network state information storage device | |
| US11546252B2 (en) | Fast flooding topology protection | |
| US11502940B2 (en) | Explicit backups and fast re-route mechanisms for preferred path routes in a network | |
| US7860024B1 (en) | Network monitoring method and system |
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. 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. 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. Co-patentee before: Beijing University of Posts and Telecommunications Co-patentee before: STATE GRID ZHEJIANG ELECTRIC POWER Co.,Ltd. |
|
| TR01 | Transfer of patent right |