CN105391638B - A kind of method and system of OSPF, ISIS routing traffic data fusion - Google Patents
A kind of method and system of OSPF, ISIS routing traffic data fusion Download PDFInfo
- Publication number
- CN105391638B CN105391638B CN201510663264.XA CN201510663264A CN105391638B CN 105391638 B CN105391638 B CN 105391638B CN 201510663264 A CN201510663264 A CN 201510663264A CN 105391638 B CN105391638 B CN 105391638B
- Authority
- CN
- China
- Prior art keywords
- router
- network
- information
- ospf
- source
- 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.)
- Expired - Fee Related
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 present invention proposes the system and method for OSPF, ISIS routing traffic data fusion, which includes OSPF message acquisition modules, obtains the network route information of OSPF；OSPF topology concatenation modules, are spliced into current network topology, and issue OSPF routing resolution modules；OSPF routing resolution modules, obtain the network topological information of whole network, are associated with the network topological information of the whole network by being flowed in network, in conjunction with CD algorithms, obtain source router information, purpose route-map, intermediate router information；ISIS message acquisition modules, are acquired message, obtain the network route information of ISIS；ISIS topology concatenation modules, are spliced into current network topology, and issue OSPF routing resolution modules；ISIS routing resolution modules, obtain the network topological information of whole network, are associated with the network topological information of the whole network by being flowed in network, in conjunction with CD algorithms, obtain source router information, purpose route-map, intermediate router information.
Description
Technical field
The present invention relates to routing traffic domain of data fusion, more particularly to a kind of OSPF, ISIS routing traffic data fusion
Method and system.
Background technology
OSPF Routing Protocols are a kind of Routing Protocols of typical link state (Link-state), are generally used for same
In routed domain, herein, routed domain refers to an autonomous system (Autonomous System), i.e. AS, it refers to one group and passes through
Unified routing policy or Routing Protocol intercourses the network of routing iinformation, and in this AS, all ospf routers are all
Safeguard an identical database for describing this AS structure, what is stored in the database is the state of corresponding link in routed domain
Information, ospf router are exactly based on this database and calculate its ospf routing table.
Intermediate System to Intermediate System is a kind of Routing Protocol based on link-state algorithm, it means that the routing as intermediate system
Device, it is necessary to have full knowledge that the link state of all other router and they inside oneself region, Intermediate System to Intermediate System pass through
It sends LSP (Link State Protocol Data Unit) and carries out routing iinformation notice, neighbours are had found by Hello PDU and create adjacent
It connects, ensures that router holds newest, effective LSP by SNP (serial number protocol Data Unit), router is receiving
On the basis of LSP, routing table is finally determined by SPF (shortest path first) algorithm.
Stream in network is to report acquisition by Netflow, and the Netflow technologies of Cisco System Co. are exactly to utilize analyzing IP
Source IP address, target ip address, sources traffic port numbers, destinations traffic port numbers, third layer protocol type, the TOS words of data packet
This seven attributes of logical network port for saving (DSCP) and network equipment input (or output), can quickly distinguish in network and transmit
Various types of business data flow, each Netflow data flows distinguished can be carried out individually tracking and accurate
Metering, records its direction of transfer and destination etc. and flows to characteristic, counts its starting and ending time, service type, including number
According to flow informations such as packet quantity and byte quantities, to collected data flow traffic and information is flowed to, Netflow can be periodically defeated
Go out original record, original record can also be carried out to export statistical result after converging automatically.
Data fusion technique includes the acquisition of the useful information provided to various information sources, transmission, synthesis, filtering, correlation
And synthesis, to assist people to carry out situation/environment judgement, planning, detection, verification, diagnosis, this is each to timely and accurately obtaining
The useful information of kind, carries out in due course complete evaluation to situation and threat and its significance level, is extremely important.
The shortcomings that prior art：In comprising static routing hybrid network, routing traffic cannot be merged accurately
Invention content
In view of the deficiencies of the prior art, the present invention proposes a kind of method of OSPF, ISIS routing traffic data fusion and is
System.
The present invention proposes a kind of system of OSPF, ISIS routing traffic data fusion, including：
OSPF message acquisition modules, for by being established to a router in each region in tunnel and autonomous system
Peering session is acquired message, obtains the network route information of OSPF；
OSPF topology concatenation modules, for according to the network route information, being spliced into current network topology, and issue
OSPF routing resolution modules；
OSPF routing resolution modules, for according to the current network topology, parsing, obtaining to whole network topology
The network topological information for taking whole network is associated by being flowed in network with the network topological information of the whole network, is tied
CD algorithms are closed, source router information, purpose route-map, intermediate router information are obtained；
ISIS message acquisition modules, for by being established to a router in each region in tunnel and autonomous system
Peering session is acquired message, obtains the network route information of ISIS；
ISIS topology concatenation modules, for according to the network route information, being spliced into current network topology, and issue
OSPF routing resolution modules；
ISIS routing resolution modules, for according to the current network topology, parsing, obtaining to whole network topology
The network topological information for taking whole network is associated by being flowed in network with the network topological information of the whole network, is tied
CD algorithms are closed, source router information, purpose route-map, intermediate router information are obtained.
Whole network topology is parsed in the OSPF routing resolutions module, including：
It each route in analysis network topology, according to the neighbor information of each router, the neighbours of each router is connect
Mouth IP information neighbor router ID corresponding with each router binds and is stored in interior zone set；
In analyzing stub zone, analyze the corresponding route prefix of each router with route mask phase and the network segment, and
It is stored in the set of Prefix regions；
The road of the next-hop of analysis and border router IP and the outside autonomous system of border routing on border router
By device, and it is stored in borderline region set.
In OSPF routing resolution modules packet is associated with the network topological information of the whole network by being flowed in network
It includes, judges whether have in interior zone set comprising the corresponding router ids of the source router IP, if so, directly returning to knot
Fruit；If it is not, by the source router IP and source mask phase with looked into Prefix regions are gathered after obtaining source prefix
It askes, if so, directly returning the result, if it is not, obtaining the border routing in borderline region by the source router IP
Device and next hop router are simultaneously inquired in borderline region set, and query result is returned, if inquiry is less than for non-OSPF nets
The stream of network, wherein it is identical as source router method to find purpose router.
It includes analyzing each road in network topology to carry out parsing to whole network topology in the ISIS routing resolutions module
Neighbours' link information of each router is stored, and be by each router according to the neighbor information of each router by device
System ID is stored in router id correspondence relationship information in interior zone set；
The regions level1 and the mapping storage of intermediate router IP to the router id in the regions level2 are arrived
In Reachability regional ensembles, and by pair of all system identifiers of the Reachability regional ensembles to router id
In answering relation information storage to gather to intermediate region.
In ISIS routing resolution modules packet is associated with the network topological information of the whole network by being flowed in network
It includes, according to source router IP and purpose accessor, judges that source router whether there is with purpose router in interior zone collection
In conjunction, if it does, and source router IP router ids corresponding with purpose accessor and system identifier are returned to, if do not deposited
It is then going to search router id in Reachability regional ensembles, if in all Reachability regional ensembles
In all there is router id, then purpose router of the router as one's respective area of declaration metric value minimums is found, if only
Have in the Reachability regional ensembles of part that there are router id information, is then matched according to network prefix longest and find purpose road
By device.
The present invention also proposes a kind of method of OSPF, ISIS routing traffic data fusion, including：
By establishing peering session to a router in each region in tunnel and autonomous system, message is adopted
Collection, obtains the network route information of OSPF；
According to the network route information, it is spliced into current network topology；
According to the current network topology, whole network topology is parsed, obtains the network topology of whole network
Information is associated by being flowed in network with the network topological information of the whole network, in conjunction with CD algorithms, obtains source router
Information, purpose route-map, intermediate router information；
By establishing peering session to a router in each region in tunnel and autonomous system, message is adopted
Collection, obtains the network route information of ISIS；
According to the network route information, it is spliced into current network topology；
According to the current network topology, whole network topology is parsed, obtains the network topology of whole network
Information is associated by being flowed in network with the network topological information of the whole network, in conjunction with CD algorithms, obtains source router
Information, purpose route-map, intermediate router information.
Whole network topology is parsed, including：
It each route in analysis network topology, according to the neighbor information of each router, the neighbours of each router is connect
Mouth IP information neighbor router ID corresponding with each router binds and is stored in interior zone set；
In analyzing stub zone, analyze the corresponding route prefix of each router with route mask phase and the network segment, and
It is stored in the set of Prefix regions；
The road of the next-hop of analysis and border router IP and the outside autonomous system of border routing on border router
By device, and it is stored in borderline region set.
It is associated with the network topological information of the whole network including judging interior zone set by being flowed in network
In whether have comprising the corresponding router ids of the source router IP, if so, directly returning the result；If it is not,
By the source router IP and source mask phase with inquired in Prefix regions are gathered after obtaining source prefix, if so, directly return
As a result, if it is not, obtaining the border router and next hop router in borderline region by the source router IP
And inquired in borderline region set, query result is returned to, if inquiry is less than for the stream of non-ospf network, wherein find mesh
Router it is identical as source router method.
It includes each router in network topology being analyzed, according to each router to carry out parsing to whole network topology
Neighbor information, stores neighbours' link information of each router, and closes the system identifier of each router is corresponding with router id
It is information storage in internal regional ensemble；
The regions level1 and the mapping storage of intermediate router IP to the router id in the regions level2 are arrived
In Reachability regional ensembles, and by pair of all system identifiers of the Reachability regional ensembles to router id
In answering relation information storage to gather to intermediate region.
In ISIS routing resolution modules packet is associated with the network topological information of the whole network by being flowed in network
It includes, according to source router IP and purpose accessor, judges that source router whether there is with purpose router in interior zone collection
In conjunction, if it does, and source router IP router ids corresponding with purpose accessor and system identifier are returned to, if do not deposited
It is then going to search router id in Reachability regional ensembles, if in all Reachability regional ensembles
In all there is router id, then purpose router of the router as one's respective area of declaration metric value minimums is found, if only
Have in the Reachability regional ensembles of part that there are router id information, is then matched according to network prefix longest and find purpose road
By device.As it can be seen from the above scheme the advantage of the invention is that：
The present invention is in routing resolution module, by the analysis to network topology, realizes according to source IP, source subnet mask,
Destination IP pair and purpose subnet mask respectively fast and accurately position source router and purpose router, are receiving stream
After the stream that amount acquisition module is sent, rapidly data correlation can be carried out with topology portion；Use Dijkstra's algorithm meter
The time complexity for calculating a node to other all nodes is O (N2) (N is interstitial content), then use the time of the algorithm multiple
Miscellaneous degree average out to O (N3), and Caching dijkstra's algorithms are used, after finding shortest path every time, all it is stored in caching row
Table is then aware of each node to the shortest distance of another node, such words time complexity average out to O (E+N*logN) (E
For the item number on side), space complexity is O (E), to reduce calculating time complexity.
Description of the drawings
Fig. 1 is CD algorithm patterns；
Fig. 2 is the mono- AS networks deployment way figures of OSPF.
Specific implementation mode
It, can be according to network topological information and collected the purpose of the present invention is being directed in OSPF and ISIS network environments
Stream information carries out data correlation, the result of accurate, reflection network in real time topology and data on flows fusion.
The present invention relates to module have message acquisition module, route topological parsing module, flow collection module, route flow
Measure analysis module.
Wherein the present invention in concept be：Neighbor node：All neighbours of each topological node；Stub zone：Boundary road
By the subnet region hung under device；Borderline region：The all-router being connected with other domains；Interior zone set：Storage analysis is adjacent
Occupy the result of node；Gather Prefix regions：The result of storage analysis stub zone；Borderline region set：Storage analysis frontier district
The result in domain.
It is the specific steps of the present invention below, as follows：
The data correlation of OSPF topologys and flow, OSPF messages acquisition module pass through each region in tunnel and autonomous system
In a router establish peering session, realize the acquisition of message, get the network route information of OSPF.OSPF topologys are spelled
Connection module can be spliced into current network topology according to routing iinformation, be then issued to routing resolution module.OSPF routing resolution modules
Parsing whole network is topological after receiving network topology, is carried out in three steps processing, as follows：
The first step analyzes neighbor node.Each node in network topology is gradually analyzed, is believed according to the neighbours of each node
Neighbours' interface IP information and neighbor router ID are bound and are stored in interior zone set by breath；
Second step, analysis stub zone (STUB).In stub area, analyzes and preserve that each to route corresponding be the road
By prefix and mask phase and the network segment Prefix regions gather in；
Third walks, and analyzes the borderline region (ASBR) of router.It is analyzed on border routing and preserves border router IP
And the routing of the next-hop of the outside AS of border routing is in borderline region set.
After having analyzed network topology, routing resolution module starts to receive the stream (NETFLOW that flow acquisition module is sent
V9 formats), it is handled then in conjunction with the topological data just analyzed.
By processing wherein one stream for, be analyzed and acquired by this stream information in include source IP, source mask, destination IP and
Purpose mask, as follows：
(1) it finds source router ID and judges whether have in interior zone set comprising the corresponding router id of the source IP, such as
Fruit has, and directly returns the result；If not provided, jumping to (2)；
(2) by source IP and source mask phase with inquired in Prefix regions are gathered after obtaining source prefix, if so, directly returning
Return result；If not provided, jumping to (3)；
(3) source IP is used to obtain border router and next-hop in ASBR borderline regions.Return to query result.If looking into
It askes less than then may non-ospf network flow.
It is identical as source router method to find purpose router.
The data correlation of ISIS topologys and flow, ISIS messages acquisition module pass through the acquisition to LSP messages, you can obtain
To the routing iinformation of ISIS networks.Topological concatenation module can be spliced into current network topology, be then issued to road according to routing iinformation
By parsing module.Routing resolution module parses network topology after receiving network topology, is carried out in two steps processing, as follows：
The first step：Analyze neighbor node region.Each node in network topology is gradually analyzed, according to the neighbours of each node
Information, stores neighbours' link information, and by node SystemID (system identifier) and RouteID (router id) correspondence
Information storage is in internal regional ensemble.
Second step：Mappings of the intermediate router IP in analysis 1 regions level and the regions level2 to router id
In Reachability regional ensembles, and the correspondence relationship information storage of all SystemID to the RouteID in the region is arrived
In the set of intermediate region.
After having analyzed network topology, routing resolution module starts to receive the stream (NETFLOW that flow acquisition module is sent
V9 formats), it is handled then in conjunction with the topological data just analyzed.
By processing wherein one stream for, be analyzed and acquired by this stream information in include source IP, source mask, destination IP and
Purpose mask.
(1) according to source router IP and purpose accessor, judge that source router IP whether there is with purpose accessor
In interior zone set.If it does, directly return source router IP RouteIDs corresponding with purpose accessor and
SystemID.If it does not exist, then jumping to (2)；
(2) then in Reachability regional ensembles, (Reachability regional ensembles are the router of borderline region
Mapping sets of the IP to router id) in go to search the RouteID (router id), if in all areas Reachability
All there is the RouteID in the set of domain, then finds purpose router of the router of declaration metric value minimums as one's respective area；
If there are the RouteID information only in part Reachability regional ensembles, sought according to the matching of network prefix longest
Look for router.
CD (Caching Dijkstra) algorithm, in conjunction with CD algorithms, obtain source router information, purpose route-map,
Intermediate router information, because be in ospf network is shortest path first, we are by router in network topology
Between the shortest distance analogize to figure point-to-point the shortest distance.
Algorithm safeguards two vertex sets S and Q.It has been shortest path that set S, which remains our values of known all d [v],
The value vertex of diameter, and set Q then retains other all vertex.Set S original states are sky, and then all there are one vertex for each step
It is moved to S from Q.This selected vertex is the vertex for possessing minimum d [u] value in Q.When a vertex u is transferred to from Q
In S, algorithm expands every outer edge fit (u, v).
By retaining the shortest path slave s (source node) to v found so far by each vertex v (destination node)
Diameter, removal compute repeatedly, and reduce time complexity.When initial, the path length value of source point s is assigned to 0, and (d [s]=0, d [s] is
The shortest distance of the source point to destination node s), if in the presence of the side (s, m) that can directly reach, d [m] is set as w (s, m), simultaneously
The path length on every other (s cannot be reached directly) vertex is set as infinitely great, that is, indicates that we do not know any lead to
The path (d [v]=∞ in addition to s and above-mentioned m for all vertex vs in G (figure)) on these vertex.When algorithm exits, in d [v]
Storage is shortest path from s to v, or if path is not present is infinitely great.The base of Dijkstra's algorithm
Plinth operation is the expansion on side：If there is a side from u to v, then shortest path from s to v can be by by side (u, v)
It is added to tail portion to expand a path from s to v.The length of this paths is d [u]+w (u, v).If this value is than current
The value of known d [v] wants small, we can substitute the value in current d [v] with new value.The operation for expanding side is run to always
All d [v] represent the cost of the shortest path from s to v.This algorithm is by tissue thus when d [u] reaches its final value
When each edge (u, v) all only expanded it is primary.
The analytic process of CD algorithms is introduced in conjunction with Fig. 1：
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, which can be found that in analytic process, can safeguard two set --- spf arrays and
Candidate arrays, referred to as " mirror image " of this Caching Dijkstra (save the letter of the state of current algorithm operation
Breath), and be all with source router id (i.e. in the source for having found this stream, destination path) at the end of each analytic process
Key, " mirror image " are that value preserves a mapping in main thread.In this way when analyzing the path that this source starts next time, so that it may
To be directly loaded into " mirror image " that last analytic process preserves, continue to analyze on this basis, thus avoids weight well
It is multiple to calculate.For the above map analysis process：Analyze A --- the path of D, but A has only been analyzed before --- the road between B
Diameter, thus cache in there is no A --- the path of D, such case need using A be source run CD algorithms, then initialization spf with
The analysis " mirror image " whether having had in main thread using the source as root is first searched before candidate arrays, if so, with " mirror image "
The two set are initialized, continue to calculate, for this example, are loaded with：
“2.spf{A,C,B}candidate{D:6, E:7,F:∞}”
As long as a step of reruning on this basis can be obtained path.In order to improve the speed of service, this method uses sky
Between change the thought of time.
It is one embodiment of the invention below, as shown in Figure 2：
By taking OSPF as an example：In the ospf network of single AS, the message in network, topology are acquired by OSPF message acquisition modules
Concatenation module is according to collected message, and the topology that is spliced into network is simultaneously sent to routing resolution module, routing resolution module
Parsing topological analysis goes out the corresponding router ids of each IP, while calculating the shortest path between each two router, is receiving
After the stream information sended over to flow collection module, parses stream information and network topology and stream information is subjected to data correlation,
Get data fusion as a result, being shown according to this result by display module.
Claims (8)
1. a kind of system of OSPF, ISIS routing traffic data fusion, which is characterized in that including：
OSPF message acquisition modules, for by establishing equity to a router in each region in tunnel and autonomous system
Session is acquired message, obtains the network route information of OSPF；
OSPF topology concatenation modules, for according to the network route information, being spliced into current network topology, and issue OSPF
Routing resolution module；
OSPF routing resolution modules obtain whole for according to the current network topology, being parsed to whole network topology
The network topological information of a network is associated by being flowed in network with the network topological information of the whole network, in conjunction with
Caching dijkstra's algorithms obtain source router information, purpose route-map, intermediate router information；
ISIS message acquisition modules, for by establishing equity to a router in each region in tunnel and autonomous system
Session is acquired message, obtains the network route information of ISIS；
ISIS topology concatenation modules, for according to the network route information, being spliced into current network topology, and issue OSPF
Routing resolution module；
ISIS routing resolution modules obtain whole for according to the current network topology, being parsed to whole network topology
The network topological information of a network is associated by being flowed in network with the network topological information of the whole network, in conjunction with
Caching dijkstra's algorithms obtain source router information, purpose route-map, intermediate router information；
Whole network topology is parsed in the wherein described OSPF routing resolutions module, including：
It is each route in analysis network topology, according to the neighbor information of each router, by neighbours' interface IP of each router
Information neighbor router ID corresponding with each router binds and is stored in interior zone set；
In analyzing stub zone, analyze the corresponding route prefix of each router with route mask phase and the network segment, and store
In Prefix regions are gathered；
The router of the next-hop of analysis and border router IP and the outside autonomous system of border routing on border router,
And it is stored in borderline region set.
2. the system of OSPF, ISIS routing traffic data fusion as described in claim 1, which is characterized in that OSPF routing solutions
It is associated with the network topological information of the whole network including judging interior zone set in analysis module by being flowed in network
In whether have comprising the corresponding router ids of the source router IP, if so, directly returning the result；If it is not,
By the source router IP and source mask phase with inquired in Prefix regions are gathered after obtaining source prefix, if so, directly return
As a result, if it is not, obtaining the border router and next hop router in borderline region by the source router IP
And inquired in borderline region set, query result is returned to, if inquiry is less than for the stream of non-ospf network, wherein find mesh
Router it is identical as source router method.
3. the system of OSPF, ISIS routing traffic data fusion as described in claim 1, which is characterized in that the roads ISIS
Include each router in network topology being analyzed, according to each routing by carrying out parsing to whole network topology in parsing module
The neighbor information of device, stores neighbours' link information of each router, and by the system identifier of each router and router id pair
Relation information is answered to be stored in interior zone set；
By the intermediate router IP in the regions level1 and the regions level2 to the mapping storage of router id to Reachability
In regional ensemble, and the correspondence relationship information of the Reachability regional ensembles all system identifier to router id is deposited
It stores up to intermediate region in gathering.
4. the system of OSPF, ISIS routing traffic data fusion as claimed in claim 3, which is characterized in that ISIS routing solutions
In analysis module by flowed in network with the network topological information of the whole network be associated including, according to source router IP with
Purpose accessor judges that source router and purpose router whether there is in interior zone set, if it does, return with
Source router IP router ids corresponding with purpose accessor and system identifier, if it does not exist, then in the areas Reachability
Lookup router id is gone to be sought if all there is router id in all Reachability regional ensembles in the set of domain
Purpose router of the router of declaration metric value minimums as one's respective area is looked for, if the only regions part Reachability
There are router id information in set, then are matched according to network prefix longest and find purpose router.
5. a kind of method of OSPF, ISIS routing traffic data fusion, which is characterized in that including：
By establishing peering session to a router in each region in tunnel and autonomous system, message is acquired,
Obtain the network route information of OSPF；
According to the network route information, it is spliced into current network topology；
According to the current network topology, whole network topology is parsed, obtains the network topological information of whole network,
It is associated with the network topological information of the whole network by being flowed in network, in conjunction with Caching dijkstra's algorithms, is obtained
Take source router information, purpose route-map, intermediate router information；
By establishing peering session to a router in each region in tunnel and autonomous system, message is acquired,
Obtain the network route information of ISIS；
According to the network route information, it is spliced into current network topology；
According to the current network topology, whole network topology is parsed, obtains the network topological information of whole network,
It is associated with the network topological information of the whole network by being flowed in network, in conjunction with Caching dijkstra's algorithms, is obtained
Take source router information, purpose route-map, intermediate router information；
It is wherein described that whole network topology is parsed, including：
It is each route in analysis network topology, according to the neighbor information of each router, by neighbours' interface IP of each router
Information neighbor router ID corresponding with each router binds and is stored in interior zone set；
In analyzing stub zone, analyze the corresponding route prefix of each router with route mask phase and the network segment, and store
In Prefix regions are gathered；
The router of the next-hop of analysis and border router IP and the outside autonomous system of border routing on border router,
And it is stored in borderline region set.
6. the method for OSPF, ISIS routing traffic data fusion as claimed in claim 5, which is characterized in that by network
Stream and the network topological information of the whole network are associated including judging whether have comprising the source in interior zone set
The corresponding router id of accessor, if so, directly returning the result；If it is not, by the source router IP with
Source mask phase with inquired in Prefix regions are gathered after obtaining source prefix, if so, directly return the result, if it is not, leading to
The source router IP acquisitions are crossed in the border router and next hop router of borderline region and in borderline region set
Inquiry returns to query result, if inquiry is less than for the stream of non-ospf network, wherein find purpose router and source router
Method is identical.
7. the method for OSPF, ISIS routing traffic data fusion as claimed in claim 5, which is characterized in that whole network
Topology carries out parsing, analyzes each router in network topology and stores each road according to the neighbor information of each router
It is stored in interior zone by neighbours' link information of device, and by the system identifier of each router and router id correspondence relationship information
In set；
By the intermediate router IP in the regions level1 and the regions level2 to the mapping storage of router id to Reachability
In regional ensemble, and the correspondence relationship information of the Reachability regional ensembles all system identifier to router id is deposited
It stores up to intermediate region in gathering.
8. the method for OSPF, ISIS routing traffic data fusion as claimed in claim 7, which is characterized in that ISIS routing solutions
In analysis module by flowed in network with the network topological information of the whole network be associated including, according to source router IP with
Purpose accessor judges that source router and purpose router whether there is in interior zone set, if it does, return with
Source router IP router ids corresponding with purpose accessor and system identifier, if it does not exist, then in the areas Reachability
Lookup router id is gone to be sought if all there is router id in all Reachability regional ensembles in the set of domain
Purpose router of the router of declaration metric value minimums as one's respective area is looked for, if the only regions part Reachability
There are router id information in set, then are matched according to network prefix longest and find purpose router.
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 CN105391638A (en) | 2016-03-09 |
| CN105391638B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111211979B (en) * | 2018-11-22 | 2022-04-01 | 中国移动通信集团河北有限公司 | Traffic management method, device, equipment and medium |
| CN112491726B (en) * | 2020-11-03 | 2022-09-16 | 晏平 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105391638A (en) | 2016-03-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 | |
| Haddadi et al. | Network topologies: inference, modeling, and generation | |
| US9565160B2 (en) | Advertisement of adjacency segment identifiers | |
| Madhyastha et al. | A structural approach to latency prediction | |
| EP1861963B1 (en) | System and methods for identifying network path performance | |
| Nomikos et al. | O peer, where art thou? Uncovering remote peering interconnections at IXPs | |
| US7120120B2 (en) | Method and system for topology construction and path identification in a two-level routing domain operated according to a simple link state routing protocol | |
| US9397895B2 (en) | Method and system for collecting topology information | |
| CN103379032B (en) | The acquisition methods and device, sub-route computational entity of cross-domain end-to-end route | |
| US8948049B2 (en) | Method and systems for determining path of a virtual connection through a network | |
| US20030076840A1 (en) | Multi-path analysis for managing machine communications in a network | |
| US20020103631A1 (en) | Traffic engineering system and method | |
| CN105991430A (en) | Data router crossing multiple self-organizing network systems | |
| CN106992891A (en) | A kind of routing configuration method for detecting abnormality and system for ospf network | |
| CN113242179B (en) | SDN-based SR path calculation and label stack generation method and SDN controller | |
| CN107809382A (en) | The path detection of ratio is completed using side | |
| Giotsas et al. | O peer, where art thou? Uncovering remote peering interconnections at IXPs | |
| CN105391638B (en) | A kind of method and system of OSPF, ISIS routing traffic data fusion | |
| CN101808005B (en) | Method, device and system for evaluating network quality | |
| CN111064817A (en) | City-level IP positioning method based on node sorting | |
| CN107809346A (en) | The mark of route tracking node and associated equipment | |
| Shavitt et al. | Geographical internet pop level maps | |
| CN105049345B (en) | A kind of method and system of BGP routing traffics data fusion | |
| JP4579995B2 (en) | Route identification 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181009 Termination date: 20201014 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |