CN105391638A - OSPF and ISIS routing traffic data fusion method and system - Google Patents
OSPF and ISIS routing traffic data fusion method and system Download PDFInfo
- Publication number
- CN105391638A CN105391638A CN201510663264.XA CN201510663264A CN105391638A CN 105391638 A CN105391638 A CN 105391638A CN 201510663264 A CN201510663264 A CN 201510663264A CN 105391638 A CN105391638 A CN 105391638A
- Authority
- CN
- China
- Prior art keywords
- router
- information
- network
- network topology
- ospf
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an OSPF and ISIS routing traffic data fusion method and system. The system includes: an OSPF message collecting module for acquiring network routing information of an OSPF; an OSPF topological stitching module for stitching a current network topology and sending the current network topology to an OSPF routing analyzing module; the OSPF routing analyzing module for acquiring network topology information of the whole network, correlating with the network topology information of the whole network through streams in the network, and acquiring source router information, destination router information and middle router information, combined with a CD algorithm; an ISIS message collecting module for collecting the message and acquiring network routing information of an ISIS; an ISIS topological stitching module for stitching the current network topology and sending the current network topology to the OSPF routing analyzing module; and an ISIS routing analyzing module for acquiring the network topology information of the whole network, correlating with the network topology information of the whole network through the streams in the network, and acquiring the source router information, the destination router information and the middle router information, combined with the CD algorithm.
Description
Technical field
The present invention relates to routing traffic domain of data fusion, particularly a kind of method and system of OSPF, ISIS routing traffic data fusion.
Background technology
OSPF Routing Protocol is a kind of Routing Protocol of typical Link State (Link-state), be generally used in same routed domain, here, routed domain refers to an autonomous system (AutonomousSystem), i.e. AS, it refers to that one group is intercoursed the network of routing iinformation by unified routing policy or Routing Protocol, in this AS, all ospf routers all safeguard the database of identical this AS structure of description, what deposit in this database is the state information of respective link in routed domain, ospf router calculates its ospf routing table by this database just.
Intermediate System to Intermediate System is a kind of Routing Protocol based on link-state algorithm, this means the router as intermediate system, must know completely oneself region inner all other router and their Link State, Intermediate System to Intermediate System carries out routing iinformation notice by sending LSP (Link State Protocol Data Unit), find neighbours by HelloPDU and create adjacent, guarantee that router is held up-to-date by SNP (sequence number protocol Data Unit), effective LSP, router is on the basis of the LSP received, finally routing table is determined by SPF (SPF) algorithm.
Stream in network reports acquisition by Netflow, the Netflow technology of Cisco System Co. is exactly the source IP address utilizing analyzing IP packet, target ip address, sources traffic port numbers, destinations traffic port numbers, third layer protocol type, these seven attributes of logical network port of TOS byte (DSCP) and network equipment input (or output), the data flow of the various different kinds of business that can transmit in diffServ network fast, can follow the tracks of separately and accurate-metering each Netflow data flow distinguished, record its direction of transfer and destination etc. and flow to characteristic, add up its starting and ending time, COS, the flow informations such as the data packet number comprised and byte quantity, to the data flow traffic collected and flow to information, Netflow regularly can export original record, also statistics is exported after automatically can converging original record.
Data fusion technique, comprise the collection to the useful information that various information source provides, transmission, comprehensively, filter, be correlated with and synthesize, so that auxiliary people carry out situation/environment judgement, planning, detection, checking, diagnosis, this is to obtaining various useful information timely and accurately, carrying out in good time complete evaluation to situation and threat and significance level thereof, is extremely important.
The shortcoming of prior art: comprising in static routing hybrid network, routing traffic can not merge accurately
Summary of the invention
For the deficiencies in the prior art, the present invention proposes a kind of method and system of OSPF, ISIS routing traffic data fusion.
The present invention proposes a kind of system of OSPF, ISIS routing traffic data fusion, comprising:
OSPF message acquisition module, for by setting up peering session to a router in region each in tunnel and autonomous system, gathers message, obtains the network route information of OSPF;
OSPF topology concatenation module, for according to described network route information, splices current network topology, and issues OSPF routing resolution module;
OSPF routing resolution module, for according to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information;
ISIS message acquisition module, for by setting up peering session to a router in region each in tunnel and autonomous system, gathers message, obtains the network route information of ISIS;
ISIS topology concatenation module, for according to described network route information, splices current network topology, and issues OSPF routing resolution module;
ISIS routing resolution module, for according to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information.
In described OSPF routing resolution module, whole network topology is resolved, comprising:
Analyze each route in network topology, according to the neighbor information of each router, neighbor router ID corresponding with each router for neighbours' interface IP information of each router is bound and is stored in interior zone set;
In analysis stub zone, analyze route prefix corresponding to each router and route mask phase and the network segment, and be stored in during Prefix regions gathers;
Border router is analyzed and the router of the down hop of border router IP and the outside autonomous system of border routing, and be stored in borderline region set.
Carry out associating comprising with described whole network of network topology information by stream in network in OSPF routing resolution module, judge whether to have in interior zone set and comprise router id corresponding to described source router IP, if had, directly return results; If do not had, then by described source router IP and source mask phase with, obtain inquiry in the set of Prefix regions after the prefix of source, if had, directly return results, if no, then obtained at the border router of borderline region and next hop router by described source router IP and inquire about in borderline region set, returning Query Result, if inquire about less than, be then the stream of non-ospf network, wherein, find object router identical with source router method.
Carry out parsing to whole network topology in described ISIS routing resolution module to comprise, analyze each router in network topology, according to the neighbor information of each router, store neighbours' link information of each router, and the system identifier of each router and router id correspondence relationship information are stored in interior zone set;
The intermediate router IP in level1 region and level2 region is stored in Reachability regional ensemble to the mapping of router id, and the correspondence relationship information of system identifiers all for described Reachability regional ensemble to router id is stored in zone line set.
Carry out associating comprising with described whole network of network topology information by stream in network in ISIS routing resolution module, according to source router IP and object accessor, judge whether source router and object router are present in interior zone set, if existed, return the router id corresponding with object accessor with source router IP and system identifier, if there is no, then go to search router id in Reachability regional ensemble, if all there is router id in all Reachability regional ensembles, then find the object router of the minimum router of declaration metric value as one's respective area, if only have in part Reachability regional ensemble and there is router id information, then find object router according to the longest coupling of network prefix.
The present invention also proposes a kind of method of OSPF, ISIS routing traffic data fusion, comprising:
By setting up peering session to a router in region each in tunnel and autonomous system, message being gathered, obtaining the network route information of OSPF;
According to described network route information, splice current network topology;
According to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information;
By setting up peering session to a router in region each in tunnel and autonomous system, message being gathered, obtaining the network route information of ISIS;
According to described network route information, splice current network topology;
According to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information.
Whole network topology is resolved, comprising:
Analyze each route in network topology, according to the neighbor information of each router, neighbor router ID corresponding with each router for neighbours' interface IP information of each router is bound and is stored in interior zone set;
In analysis stub zone, analyze route prefix corresponding to each router and route mask phase and the network segment, and be stored in during Prefix regions gathers;
Border router is analyzed and the router of the down hop of border router IP and the outside autonomous system of border routing, and be stored in borderline region set.
Carry out associating comprising with described whole network of network topology information by stream in network, judge whether to have in interior zone set and comprise router id corresponding to described source router IP, if had, directly return results; If do not had, then by described source router IP and source mask phase with, obtain inquiry in the set of Prefix regions after the prefix of source, if had, directly return results, if no, then obtained at the border router of borderline region and next hop router by described source router IP and inquire about in borderline region set, returning Query Result, if inquire about less than, be then the stream of non-ospf network, wherein, find object router identical with source router method.
Carry out parsing to whole network topology to comprise, analyze each router in network topology, according to the neighbor information of each router, store neighbours' link information of each router, and the system identifier of each router and router id correspondence relationship information are stored in interior zone set;
The intermediate router IP in level1 region and level2 region is stored in Reachability regional ensemble to the mapping of router id, and the correspondence relationship information of system identifiers all for described Reachability regional ensemble to router id is stored in zone line set.
Carry out associating comprising with described whole network of network topology information by stream in network in ISIS routing resolution module, according to source router IP and object accessor, judge whether source router and object router are present in interior zone set, if existed, return the router id corresponding with object accessor with source router IP and system identifier, if there is no, then go to search router id in Reachability regional ensemble, if all there is router id in all Reachability regional ensembles, then find the object router of the minimum router of declaration metric value as one's respective area, if only have in part Reachability regional ensemble and there is router id information, then find object router according to the longest coupling of network prefix.From above scheme, the invention has the advantages that:
The present invention is in routing resolution module, by the analysis to network topology, realize according to source IP, source subnet mask, object IP locates source router and object router respectively fast and accurately to object subnet mask, after receiving the stream that flow collection module sends, data correlation can be carried out with topology portion rapidly; Using Dijkstra's algorithm to calculate a node to the time complexity of other all nodes is O (N
2) (N is interstitial content), then use the time complexity average out to O (N of this algorithm
3), and use CachingDijkstra algorithm, after finding shortest path at every turn, all be stored in cache list, then be aware of the beeline of each node to another node, like this time complexity average out to O (E+N*logN) (E is the number on limit), space complexity is O (E), thus reduces complexity computing time.
Accompanying drawing explanation
Fig. 1 is CD algorithm pattern;
Fig. 2 is OSPF mono-AS network design mode figure.
Embodiment
The object of the invention is in OSPF and ISIS network environment, according to network topological information and the stream information collected, data correlation can be carried out, the result of the topological sum data on flows fusion of accurate, real-time reflection network.
The module that the present invention relates to has message acquisition module, route topological parsing module, flow collection module, routing traffic analysis module.
Concept wherein in the present invention is: neighbor node: the neighbours that each topological node is all; Stub zone: the subnet region hung under border router; Borderline region: the all-router be connected with other territories; Interior zone set: the result of inventory analysis neighbor node; Prefix regions is gathered: the result of inventory analysis stub zone; Borderline region set: the result of inventory analysis borderline region.
Be below concrete steps of the present invention, as follows:
The data correlation of OSPF topology and flow, OSPF message acquisition module sets up peering session by a router in region each in tunnel and autonomous system, realizes the collection of message, gets the network route information of OSPF.OSPF topology concatenation module according to routing iinformation, can splice current network topology, then issues routing resolution module.Whole network topology is resolved, point three stepping row relax after OSPF routing resolution module receives network topology, as follows:
The first step, analyzes neighbor node.Progressively analyze each node in network topology, according to the neighbor information of each node, neighbours' interface IP information and this neighbor router ID are bound and is stored in interior zone set;
Second step, analyzes stub zone (STUB).In stub area, analyze and preserve each route corresponding be this route prefix and mask phase and the network segment in Prefix regions is gathered;
3rd step, analyzes the borderline region (ASBR) of router.Border routing is analyzed and the route of preserving the down hop of border router IP and the outside AS of border routing in borderline region set.
After having analyzed network topology, routing resolution module has started to receive the stream (NETFLOWV9 form) that flow collection module is sent, and then combines the topological data just analyzed and processes.
For a process wherein stream, resolve in the information getting this stream and comprise source IP, source mask, object IP and object mask, as follows:
(1) find source router ID to judge whether to have in interior zone set and comprise router id corresponding to this source IP, if had, directly return results; If no, jumped to (2);
(2) by source IP and source mask phase with, obtain inquiry in the set of Prefix regions after the prefix of source, if had, directly return results; If no, jumped to (3);
(3) source IP is used to obtain in the border router of ASBR borderline region and down hop.Return Query Result.If inquire about less than, then may non-ospf network flow.
Find object router identical with source router method.
The data correlation of ISIS topology and flow, ISIS message acquisition module, by the collection to LSP message, can get the routing iinformation of ISIS network.Topology concatenation module according to routing iinformation, can splice current network topology, then issues routing resolution module.Routing resolution module resolves network topology after receiving network topology, processes in two steps, as follows:
The first step: analyze neighbor node region.Progressively analyze each node in network topology, according to the neighbor information of each node, store this neighbours' link information, and this node SystemID (system identifier) is stored in interior zone set with RouteID (router id) correspondence relationship information.
Second step: analyze the intermediate router IP in level1 region and level2 region in the mapping Reachability regional ensemble of router id, and the correspondence relationship information of SystemID to RouteID all for this region is stored in zone line set.
After having analyzed network topology, routing resolution module has started to receive the stream (NETFLOWV9 form) that flow collection module is sent, and then combines the topological data just analyzed and processes.
For a process wherein stream, resolve in the information getting this stream and comprise source IP, source mask, object IP and object mask.
(1) according to source router IP and object accessor, judge whether source router IP and object accessor are present in interior zone set.If existed, directly return RouteID and SystemID that source router IP is corresponding with object accessor.If there is no, then jump to (2);
(2) then go to search this RouteID (router id) in Reachability regional ensemble (Reachability regional ensemble is the mapping set of the IP routers ID of the router of borderline region), if all there is this RouteID in all Reachability regional ensembles, then find the object router of the minimum router of declaration metric value as one's respective area; There is this RouteID information if only had in part Reachability regional ensemble, then find router according to the longest coupling of network prefix.
CD (CachingDijkstra) algorithm, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information, because what in ospf network be is shortest path first, so the beeline in network topology between router is analogized to the beeline of the point-to-point of figure by us.
Algorithm safeguards two vertex set S and Q.The value that S set remains we known all d [v] has been the value summit of shortest path, gathers Q and then retains other all summits.S set initial condition is empty, and then each step has a summit to move to S from Q.This is the summit having minimum d [u] value in Q by the summit selected.When a summit u has transferred in S from Q, algorithm is expanded the outer edge fit (u, v) of every bar.
By retaining the shortest path from s (source node) to v found so far for each vertex v (destination node), removing double counting, reducing time complexity.Time initial, the path length value of source point s is 0 (d [s]=0 by tax, d [s] is for source point is to the beeline of destination node s), if there is the limit (s that can directly arrive, m), then d [m] is set to w (s, m), the path on every other (s can not directly arrive) summit is set to infinity simultaneously, namely represents that we do not know any path (for d [the v]=∞ except s and above-mentioned m of all vertex v in G (figure)) leading to these summits.When algorithm exits, what store in d [v] is shortest path from s to v, if or the non-existent words in path be infinitely great.The fundamental operation of Dijkstra's algorithm is the expansion on limit: if there is a limit from u to v, the shortest path so from s to v can by adding afterbody to expand a path from s to v by limit (u, v).The length of this paths is d [u]+w (u, v).If this value is less than the value of d [v] known at present, we can carry out the value in alternative current d [v] by new value.The operation of expanding limit runs to the cost that all d [v] represent the shortest path from s to v always.This algorithm through organizing thus when d [u] reaches its final value time every bar limit (u, v) all only expanded once.
Composition graphs 1 introduces the analytic process of CD algorithm:
spf{A},candidate{B:6，C:3,D:∞，E:∞,F:∞}
spf{A,C}candidate{B:5，D:6，E:7,F:∞}
spf{A,C,B}candidate{D:6，E:7,F:∞}
spf{A,C,B,D}candidate{E:7,F:9}
spf{A,C,B,D,E}candidate{F:9}
spf{A,C,B,D,E,F}
In conjunction with above-mentioned analytical procedure, we can find to safeguard two set in analytic process---spf array and candidate array, be called " mirror image " (saving the information of the state that current algorithm is run) of this CachingDijkstra, and (namely in the source that have found this stream at the end of each analytic process, destination path), all with source router id for key, " mirror image " is a for value preserves in main thread to be mapped.Like this when analyzing the path that this source starts next time, just directly can be loaded into " mirror image " that last analytic process is preserved, continuing on this basis to analyze, so just avoiding double counting well.Above map analysis process is example: analyze A---the path of D, but only analyzed A before---the path between B, therefore A is not had in buffer memory---the path of D, this situation needs with A to be that CD algorithm is run in source, before initialization spf and candidate array, so first searches in main thread the analysis " mirror image " that whether to have had with this source be root, if had, with " mirror image " initialization these two set, continue to calculate, for this example, be loaded with:
“2.spf{A,C,B}candidate{D:6，E:7,F:∞}”
As long as rerun on this basis, a step can obtain path.In order to improve the speed of service, this method have employed the thought of space for time.
Be below one embodiment of the invention, as shown in Figure 2:
For OSPF: in the ospf network of single AS, by the message in OSPF message acquisition module collection network, topology concatenation module is according to the message collected, splice the topology in network and send to routing resolution module, routing resolution module is resolved topological analysis and is gone out router id corresponding to each IP, calculate the shortest path between every two routers simultaneously, after receiving the stream information that flow collection module sends over, network topology and stream information are also carried out data correlation by resolution flow information, get the result of data fusion, shown according to this result by display module.
Claims (10)
1. a system for OSPF, ISIS routing traffic data fusion, is characterized in that, comprising:
OSPF message acquisition module, for by setting up peering session to a router in region each in tunnel and autonomous system, gathers message, obtains the network route information of OSPF;
OSPF topology concatenation module, for according to described network route information, splices current network topology, and issues OSPF routing resolution module;
OSPF routing resolution module, for according to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information;
ISIS message acquisition module, for by setting up peering session to a router in region each in tunnel and autonomous system, gathers message, obtains the network route information of ISIS;
ISIS topology concatenation module, for according to described network route information, splices current network topology, and issues OSPF routing resolution module;
ISIS routing resolution module, for according to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information.
2. the system of OSPF, ISIS routing traffic data fusion as claimed in claim 1, is characterized in that, resolve, comprising in described OSPF routing resolution module to whole network topology:
Analyze each route in network topology, according to the neighbor information of each router, neighbor router ID corresponding with each router for neighbours' interface IP information of each router is bound and is stored in interior zone set;
In analysis stub zone, analyze route prefix corresponding to each router and route mask phase and the network segment, and be stored in during Prefix regions gathers;
Border router is analyzed and the router of the down hop of border router IP and the outside autonomous system of border routing, and be stored in borderline region set.
3. the system of OSPF, ISIS routing traffic data fusion as claimed in claim 2, it is characterized in that, carry out associating comprising with described whole network of network topology information by stream in network in OSPF routing resolution module, judge whether to have in interior zone set and comprise router id corresponding to described source router IP, if had, directly return results; If do not had, then by described source router IP and source mask phase with, obtain inquiry in the set of Prefix regions after the prefix of source, if had, directly return results, if no, then obtained at the border router of borderline region and next hop router by described source router IP and inquire about in borderline region set, returning Query Result, if inquire about less than, be then the stream of non-ospf network, wherein, find object router identical with source router method.
4. the system of OSPF, ISIS routing traffic data fusion as claimed in claim 1, it is characterized in that, carry out parsing to whole network topology in described ISIS routing resolution module to comprise, analyze each router in network topology, according to the neighbor information of each router, store neighbours' link information of each router, and the system identifier of each router and router id correspondence relationship information are stored in interior zone set;
The intermediate router IP in level1 region and level2 region is stored in Reachability regional ensemble to the mapping of router id, and the correspondence relationship information of system identifiers all for described Reachability regional ensemble to router id is stored in zone line set.
5. OSPF as claimed in claim 4, the system of ISIS routing traffic data fusion, it is characterized in that, carry out associating comprising with described whole network of network topology information by stream in network in ISIS routing resolution module, according to source router IP and object accessor, judge whether source router and object router are present in interior zone set, if existed, return the router id corresponding with object accessor with source router IP and system identifier, if there is no, then go to search router id in Reachability regional ensemble, if all there is router id in all Reachability regional ensembles, then find the object router of the minimum router of declaration metric value as one's respective area, if only have in part Reachability regional ensemble and there is router id information, then find object router according to the longest coupling of network prefix.
6. a method for OSPF, ISIS routing traffic data fusion, is characterized in that, comprising:
By setting up peering session to a router in region each in tunnel and autonomous system, message being gathered, obtaining the network route information of OSPF;
According to described network route information, splice current network topology;
According to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information;
By setting up peering session to a router in region each in tunnel and autonomous system, message being gathered, obtaining the network route information of ISIS;
According to described network route information, splice current network topology;
According to described current network topology, whole network topology is resolved, obtain whole network of network topology information, associated with described whole network of network topology information by stream in network, in conjunction with CD algorithm, obtain source router information, object route-map, intermediate router information.
7. the method for OSPF, ISIS routing traffic data fusion as claimed in claim 6, is characterized in that, resolve, comprising whole network topology:
Analyze each route in network topology, according to the neighbor information of each router, neighbor router ID corresponding with each router for neighbours' interface IP information of each router is bound and is stored in interior zone set;
In analysis stub zone, analyze route prefix corresponding to each router and route mask phase and the network segment, and be stored in during Prefix regions gathers;
Border router is analyzed and the router of the down hop of border router IP and the outside autonomous system of border routing, and be stored in borderline region set.
8. the method for OSPF, ISIS routing traffic data fusion as claimed in claim 7, it is characterized in that, carry out associating comprising with described whole network of network topology information by stream in network, judge whether to have in interior zone set and comprise router id corresponding to described source router IP, if had, directly return results; If do not had, then by described source router IP and source mask phase with, obtain inquiry in the set of Prefix regions after the prefix of source, if had, directly return results, if no, then obtained at the border router of borderline region and next hop router by described source router IP and inquire about in borderline region set, returning Query Result, if inquire about less than, be then the stream of non-ospf network, wherein, find object router identical with source router method.
9. the method for OSPF, ISIS routing traffic data fusion as claimed in claim 6, it is characterized in that, carry out parsing to whole network topology to comprise, analyze each router in network topology, according to the neighbor information of each router, store neighbours' link information of each router, and the system identifier of each router and router id correspondence relationship information are stored in interior zone set;
The intermediate router IP in level1 region and level2 region is stored in Reachability regional ensemble to the mapping of router id, and the correspondence relationship information of system identifiers all for described Reachability regional ensemble to router id is stored in zone line set.
10. OSPF as claimed in claim 9, the method of ISIS routing traffic data fusion, it is characterized in that, carry out associating comprising with described whole network of network topology information by stream in network in ISIS routing resolution module, according to source router IP and object accessor, judge whether source router and object router are present in interior zone set, if existed, return the router id corresponding with object accessor with source router IP and system identifier, if there is no, then go to search router id in Reachability regional ensemble, if all there is router id in all Reachability regional ensembles, then find the object router of the minimum router of declaration metric value as one's respective area, if only have in part Reachability regional ensemble and there is router id information, then find object router according to the longest coupling of network prefix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510663264.XA CN105391638B (en) | 2015-10-14 | 2015-10-14 | A kind of method and system of OSPF, ISIS routing traffic data fusion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510663264.XA CN105391638B (en) | 2015-10-14 | 2015-10-14 | A kind of method and system of OSPF, ISIS routing traffic data fusion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105391638A true CN105391638A (en) | 2016-03-09 |
| CN105391638B CN105391638B (en) | 2018-10-09 |
Family
ID=55423485
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510663264.XA Expired - Fee Related CN105391638B (en) | 2015-10-14 | 2015-10-14 | A kind of method and system of OSPF, ISIS routing traffic data fusion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105391638B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111211979A (en) * | 2018-11-22 | 2020-05-29 | 中国移动通信集团河北有限公司 | Traffic management method, device, equipment and medium |
| CN112491726A (en) * | 2020-11-03 | 2021-03-12 | 晏平 | Route searching and analyzing method and device, computer equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101517998A (en) * | 2006-11-09 | 2009-08-26 | 华为技术有限公司 | Method for announcing border connecting information of autonomous system and boundary nodes |
| WO2011021815A2 (en) * | 2009-08-21 | 2011-02-24 | Samsung Electronics Co., Ltd. | Network elements, integrated circuits and methods for routing control |
| CN104539623A (en) * | 2015-01-07 | 2015-04-22 | 烽火通信科技股份有限公司 | Achieving system and method for IGP multi-process CSPE in hybrid network |
| CN104579946A (en) * | 2013-10-21 | 2015-04-29 | 华为技术有限公司 | Method for determining path calculation unit and communication device |
| CN105049345A (en) * | 2015-07-22 | 2015-11-11 | 中国科学院计算技术研究所 | Method and system for fusing BGP route traffic data |
-
2015
- 2015-10-14 CN CN201510663264.XA patent/CN105391638B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101517998A (en) * | 2006-11-09 | 2009-08-26 | 华为技术有限公司 | Method for announcing border connecting information of autonomous system and boundary nodes |
| WO2011021815A2 (en) * | 2009-08-21 | 2011-02-24 | Samsung Electronics Co., Ltd. | Network elements, integrated circuits and methods for routing control |
| CN104579946A (en) * | 2013-10-21 | 2015-04-29 | 华为技术有限公司 | Method for determining path calculation unit and communication device |
| CN104539623A (en) * | 2015-01-07 | 2015-04-22 | 烽火通信科技股份有限公司 | Achieving system and method for IGP multi-process CSPE in hybrid network |
| CN105049345A (en) * | 2015-07-22 | 2015-11-11 | 中国科学院计算技术研究所 | Method and system for fusing BGP route traffic data |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111211979A (en) * | 2018-11-22 | 2020-05-29 | 中国移动通信集团河北有限公司 | Traffic management method, device, equipment and medium |
| CN111211979B (en) * | 2018-11-22 | 2022-04-01 | 中国移动通信集团河北有限公司 | Traffic management method, device, equipment and medium |
| CN112491726A (en) * | 2020-11-03 | 2021-03-12 | 晏平 | Route searching and analyzing method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105391638B (en) | 2018-10-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| ES2551727T3 (en) | Use of an expansion tree protocol (STP) to improve layer 2 network topology maps | |
| CN105721297B (en) | Detection method and system based on route loop in SDN network | |
| Nomikos et al. | O peer, where art thou? Uncovering remote peering interconnections at IXPs | |
| Haddadi et al. | Network topologies: inference, modeling, and generation | |
| EP2050237B1 (en) | Mapping off-network traffic to an administered network | |
| Madhyastha et al. | A structural approach to latency prediction | |
| US8670326B1 (en) | System and method for probing multiple paths in a network environment | |
| US20030076840A1 (en) | Multi-path analysis for managing machine communications in a network | |
| US8165038B2 (en) | Network physical connection inference for IP tunnels | |
| US11632322B2 (en) | Preferred path route graphs in a network | |
| WO2013159451A1 (en) | Method and apparatus for acquiring cross-domain end-to-end route, and child path computation entity | |
| CN113242179B (en) | SDN-based SR path calculation and label stack generation method and SDN controller | |
| CN1859239A (en) | Monitoring and analytic system for route between domain of internet and its working method | |
| Giotsas et al. | O peer, where art thou? Uncovering remote peering interconnections at IXPs | |
| US20150334009A1 (en) | System for monitoring the performance of flows carried over networks with dynamic topology | |
| US9954761B2 (en) | Dynamic detection of VPN sites | |
| CN105391638A (en) | OSPF and ISIS routing traffic data fusion method and system | |
| CN101808005B (en) | Method, device and system for evaluating network quality | |
| CN105049345B (en) | A kind of method and system of BGP routing traffics data fusion | |
| Wu et al. | Research on the application of cross-domain VPN technology based on MPLS BGP | |
| Farah et al. | Collection of BCNET BGP traffic | |
| Dong et al. | A novel algorithm of IPv6 network topology discovery for campus network | |
| CN106411748B (en) | The dynamic topology maintaining method of across a network | |
| Akter et al. | Analysis and comparative study for developing computer network in terms of routing protocols having IPv6 network using cisco packet tracer | |
| Spring | Efficient discovery of network topology and routing policy in the Internet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181009 Termination date: 20201014 |