CN104518899B - Network routing traffic emulation mode and device - Google Patents
Network routing traffic emulation mode and device Download PDFInfo
- Publication number
- CN104518899B CN104518899B CN201310460068.3A CN201310460068A CN104518899B CN 104518899 B CN104518899 B CN 104518899B CN 201310460068 A CN201310460068 A CN 201310460068A CN 104518899 B CN104518899 B CN 104518899B
- Authority
- CN
- China
- Prior art keywords
- flow
- network
- data
- igp
- flux
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The invention discloses a kind of network routing traffic emulation modes and device and Large IP Network management systems technology field.This method includes：With reference to flux and flow direction FLOW data, IGP routings and topological data, BGP routings data, device port data on flows, loaded by the flow of BGP and IGP route iterations and end-to-end path, construct shadow network routing traffic model；The algorithm iterative constrained step by step that Traffic simulation uses in calculating.System is managed for IP network, and a kind of method of the routing and Traffic simulation applied to Large IP Network based on measured data is provided, with " the shadow network " for helping network management personnel's Fast Construction consistent with existing net discharge model, and analogue simulation adjustment is carried out on it, provide help for the network planning, optimization and engineering construction.
Description
Technical field
The present invention relates to Large IP Network management systems technology field, more particularly to a kind of network routing traffic emulation modes
And device.
Background technology
The adjustment of Large IP Network needs to consider the variation of network, flow and business, needs to do on emulation platform
Corresponding verification, to formulate strict embodiment.
Emulation platform is simulated with now netting completely the same node and connection, and true routing is extracted from network,
Including IGP（Interior Gateway Protocol, Interior Gateway Protocol）And BGP（Border Gateway Protocol,
Border Gateway Protocol）And flow information injection emulation platform, structure have identity logic topological structure and flow point with existing net
" the shadow network " of cloth characteristic, so as to carry out simulating, verifying in terms of network adjustment and service optimization.
In terms of routing simulation product, industry main product is mainly using based on device port flow and IGP routings
Topological inverse flow demand and then progress Traffic simulation.Enable Y=(y1,…,yI) ' represent a network in all links flow
Value, wherein, " ' " representing matrix transposition, I represent link sum, yiRepresent the flow of i-th link.Own in the network
Source node（O）And destination node（D）Between flow demand, that is, OD to form traffic matrix X=(x1,…,xJ) ', J represents network
Middle OD pairs of sum, xjRepresent j-th of demand between OD pairs.A is the 0-1 matrixes of I × J rank, and referred to as routing is put to the proof, it
Every a line represent a link, each row represent one OD pairs.If link i is in the path that OD passes through the flow demand of j
On, then aij=1, otherwise aij=0.The row of A specify the set of whole links to be passed through in a network of some OD demand, i.e.,
This OD pairs routing, it is clear that A is a matrix for containing practical routing iinformation.Relationship between more than parameter can use line
Property equation Y=AX represent.Traffic simulation product in the industry is all based on above-mentioned in the case of known link flow Y and route matrix A
Traffic matrix X is obtained in equation.Wherein, link flow Y can be obtained by SNMP data, and practical route matrix A can pass through
The configuration information of router is route by collecting IGP（OSPF or IS-IS）Link weight and calculate shortest path
It obtains.The difficult point of problem is, since OD pairs in usual network of quantity is significantly larger than number of links, i.e. J>>I, A are not one full
Order square formation, it means that equation Y=AX will have infinite multigroup possible solution, be a kind of linear inverse problem of morbid state.
Although improving the accuracy of emulation as possible by certain algorithm optimization, its essence solved equation still can not more
Ensure the order of accuarcy of its data, and do not account for BGP routings and emulated with IGP routing characteristics, with carrier network
Routing is inconsistent using actual conditions.
Invention content
The inventors found that above-mentioned exist in the prior art problem, and therefore at least one in described problem
A problem proposes a kind of new technical solution.
It is an object of the present invention to provide a kind of technical solutions for the emulation of network routing traffic.
According to the first aspect of the invention, a kind of network routing traffic emulation mode is provided, including：
The basic data now netted is obtained, the basic data includes IGP routings and topological data, BGP routings data, port
Data on flows, flux and flow direction Flow data, wherein, the flux and flow direction Flow data include：Source router, source interface, target
Address, flow;
According to the shadow network that basic data construction is now netted, the shadow network includes network topology and flow mould
Type, wherein, the network topology of the shadow network is constructed by the IGP topological datas, the discharge model of the shadow network
Including flow ingredient and the flow ingredient of network trunk end to end between network edge；
Based on the new IGP topologys that the shadow network is determined to the emulation adjustment of network topology and described new
New path matrix in IGP topologys；
Emulation adjustment based on the intermarginal flow of opposite side obtains new flow demand and corresponding with the new flow demand
New traffic matrix；
The new flow demand is loaded into the new network topology based on iterative constrained algorithm step by step, is obtained new
Relay traffic distribution.
Optionally, this method further includes：It is calculated with reference to access interface flow, flux and flow direction Flow data, BGP routings
Obtain between the network edge flow ingredient end to end；
By between network edge end to end flow be overlapped by IGP topologys to obtain the flow of the network trunk into
Point.
Optionally, described in the combination access interface flow, flux and flow direction Flow data, BGP routings are calculated
Flow ingredient includes end to end between network edge：
Destination address in the flux and flow direction Flow data with BGP routings is matched, is obtained one under corresponding BGP
Jump address and AS；
The flux and flow direction Flow data are converted to：Source router, source port, BGP next hop address, flux and flow direction ratio
Example；
The SNMP flows of access interface on every edge of table router in flux and flow direction ratio are divided, obtain every edge of table road
By device access interface to all directions flow；
Access interface based on every edge of table router is corresponded to the data on flows of all directions with reference to source router port
AS, according to the corresponding target AS in BGP route acquisition BGP next hop address, obtain the flow between networking AS-AS；
And/or
It is described by flow obtains the stream of the network trunk by what IGP topologys were overlapped end to end between network edge
Amount ingredient includes：
Based on the data on flows of the access interface per edge of table router to all directions, by BGP next hop address
Lookup is iterated in IGP routing tables, obtains outlet device；
According to IGP route topologicals by flow is loaded into what IGP shortest paths were passed through end to end between the network edge
On repeated link, then carry out dividing superposition if there is a plurality of equative route, obtain the flow ingredient of all repeated links, so as to
Obtain the flow ingredient of the network trunk.
Optionally, the new flow demand is loaded into the new network topology based on iterative constrained algorithm step by step
New relay traffic distribution is obtained to include：
The new flow demand is loaded by the practical routing procedure of flow, by the starting circuit near source to
The circuit that repeat circuit arrives connection destination node again carries out hierarchical loading；Based on IGP shortest path matrixes, divide direction calculating every
The flow discard level of repeated link is abandoned by its flow of the maximum hop count value in all IGP shortest paths by link
Rank；In simulation calculation, when network occurs congestion and generates packet loss, to generating the link of packet loss, by flow discard level
It is worth ascending sequence and carries out flow discarding calculating, after does not repeat to be loaded onto routing because of the flow that congestion abandons in routing front end
End.
Optionally, this method further includes：The flux and flow direction Flow data are corrected based on circuit flow.
Optionally, the flux and flow direction Flow data are corrected based on circuit flow including：
Proportionate relationship of the circuit flow in each logical direction is obtained according to the flux and flow direction Flow data；
The circuit flow for entering network is multiplied by oversampling circuit and flows into ratio of the flow in netting in each logical direction
Relationship corrected after the flux and flow direction Flow data.
Optionally, this method further includes：Flux and flow direction sampled data is sent out by edge router, side is received using harvester
The flux and flow direction sampled data that edge router is sent, obtains the flux and flow direction Flow data.
According to another aspect of the present invention, a kind of network routing traffic simulator is provided, including：
Basic data acquiring unit, for obtaining the basic data of existing net, the basic data includes IGP routings and topology
Data, BGP routings data, port flow data, flux and flow direction Flow data, wherein, the flux and flow direction Flow data include：
Source router, source interface, destination address, flow;
Shadow net structure unit, for the shadow network now netted according to basic data construction, the shadow network
Including network topology and discharge model, wherein, the network topology of the shadow network is constructed by the IGP topological datas, institute
The discharge model for stating shadow network includes flow ingredient and the flow ingredient of network trunk end to end between network edge；
Path matrix determination unit, for based on determining the new of the shadow network to the emulation adjustment of network topology
IGP topologys and the new path matrix in the new IGP topologys；
Traffic matrix determination unit, for the emulation adjustment based on the intermarginal flow of opposite side obtain new flow demand and
New traffic matrix corresponding with the new flow demand；
Flow demand loading unit, it is described for being loaded into the new flow demand based on iterative constrained algorithm step by step
In new network topology, new relay traffic distribution is obtained.
Optionally, shadow net structure unit combination access interface flow, flux and flow direction Flow data, BGP routings carry out
Flow ingredient end to end is calculated between the network edge；By between network edge end to end flow by IGP topologys into
Row superposition obtains the flow ingredient of the network trunk.
Optionally, flow demand loading unit is added the new flow demand by the practical routing procedure of flow
It carries, hierarchical loading is carried out to the circuit of connection destination node by the starting circuit near source to repeat circuit again；Based on IGP most
Short-circuit drive matrix divides the flow discard level of every repeated link of direction calculating, in all IGP shortest paths by link
Maximum hop count value be its flow discard level；In simulation calculation, when network occurs congestion and generates packet loss, generation is lost
The link of packet carries out flow by the ascending sequence of flow discard level value and abandons calculating, in routing front end because congestion abandons
Flow do not repeat to be loaded onto routing rear end.
Optionally, which further includes：Data on flows corrects unit, for being based on circuit flow to the flux and flow direction
Flow data are corrected.
Optionally, data on flows correction unit obtains circuit flow in each logic according to the flux and flow direction Flow data
Proportionate relationship on direction；The circuit flow for entering network is multiplied by oversampling circuit and flows into the flow in netting in each logical direction
On proportionate relationship corrected after the flux and flow direction Flow data.
An advantage of the present invention is that by iterative constrained algorithm step by step, calculating flow is classified based on network layer and is lost
Situation is abandoned, simulation result is made more to be consistent with real network operating condition, improves the accuracy of simulation result.
By referring to the drawings to the detailed description of exemplary embodiment of the present invention, other feature of the invention and its
Advantage will become apparent.
Description of the drawings
The attached drawing of a part for constitution instruction describes the embodiment of the present invention, and is used to solve together with the description
Release the principle of the present invention.
With reference to attached drawing, according to following detailed description, the present invention can be more clearly understood, wherein：
Fig. 1 shows the flow chart of one embodiment of the network according to the invention routing traffic emulation mode.
Fig. 2 shows the schematic diagrames of an example of shadow net structure process according to the present invention.
Fig. 3 shows the schematic diagram of an example of flow demand loading.
Fig. 4 show the routing in Fig. 3 adjust after flow demand loading schematic diagram.
Fig. 5 shows the interface to being presented by acquiring the partial-topology for the ChinaNet shadow networks for calculating generation.
Fig. 6 shows to check interface to the flow composition information of a repeat circuit.
Fig. 7 shows to interrupt the analogue simulation situation schematic diagram under scene in C2C extra large cables to ChinaNet networks.
Fig. 8 shows that ChinaNet network C 2C extra large cables interrupt simulation result report schematic diagram.
Fig. 9 shows the structure chart of one embodiment of the network according to the invention routing traffic simulator.
Figure 10 shows the structure chart of another embodiment of the network according to the invention routing traffic simulator.
Specific embodiment
Carry out the various exemplary embodiments of detailed description of the present invention now with reference to attached drawing.It should be noted that：Unless in addition have
Body illustrates that the unlimited system of component and the positioned opposite of step, numerical expression and the numerical value otherwise illustrated in these embodiments is originally
The range of invention.
Simultaneously, it should be appreciated that for ease of description, the size of the various pieces shown in attached drawing is not according to reality
Proportionate relationship draw.
It is illustrative to the description only actually of at least one exemplary embodiment below, is never used as to the present invention
And its application or any restrictions that use.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as authorizing part of specification.
In shown here and discussion all examples, any occurrence should be construed as merely illustrative, without
It is as limitation.Therefore, the other examples of exemplary embodiment can have different values.
It should be noted that：Similar label and letter represents similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, then in subsequent attached drawing does not need to that it is further discussed.
Fig. 1 shows the flow chart of one embodiment of the network according to the invention routing traffic emulation mode.
As shown in Figure 1, step 102, obtain the basic data now netted, basic data include IGP route and topological data,
BGP routings data, port flow data, flux and flow direction Flow data etc., wherein, flux and flow direction Flow data include：Source routing
Device, source interface, destination address, flow.
Step 104, the shadow network now netted according to basic data construction, shadow network include network topology and flow mould
Type, wherein, the network topology of shadow network is constructed by the IGP topological datas, and the discharge model of shadow network includes network
Flow ingredient and the flow ingredient of network trunk end to end between edge.For example, with reference to access interface flow, flux and flow direction
Flow data, BGP routings be calculated between the network edge flow ingredient end to end；It will be end-to-end between network edge
Flow be overlapped to obtain the flow ingredient of the network trunk by IGP topologys.
Step 106, based on the new IGP topologys that determining shadow network is adjusted to the emulation of network topology and described
New path matrix in new IGP topologys.
Step 108, the emulation adjustment based on the intermarginal flow of opposite side obtain new flow demand and with the new flow
The corresponding new traffic matrix of demand.
Step 110, the new flow demand is loaded by the new network topology based on iterative constrained algorithm step by step
On, obtain new relay traffic distribution.A kind of specific implementation includes：By new flow demand by flow practical routing procedure into
Row loading carries out hierarchical loading to the circuit of connection destination node again by the starting circuit near source to repeat circuit；It is based on
IGP shortest path matrixes divide the flow discard level of every repeated link of direction calculating, with all most short by the IGP of link
Maximum hop count value in path is its flow discard level；It is right when network occurs congestion and generates packet loss in simulation calculation
The link of packet loss is generated, carrying out flow by the ascending sequence of flow discard level value abandons calculating, in routing front end because gathering around
The flow that plug abandons does not repeat to be loaded onto routing rear end.
Fig. 2 shows the schematic diagrames of an example of shadow net structure process according to the present invention.
First, the existing net real time data needed for construction shadow network is obtained online by various acquisition means, including flow
Flow to Flow data, IGP routings and topological data, BGP routings data, port flow data.
（1）Port flow data：It is acquired by snmp protocol, obtains the link level traffic data of device port.
（2）IGP is route and topology：IGP syntoples are established with router in net, are interacted by IGP Routing Protocols, in real time
Obtain the whole network IGP route topologicals.
（3）BGP is route：BGP syntoples are established with router in net, are interacted by BGP Routing Protocols, obtains set in real time
Standby BGP is route.
（4）Flux and flow direction Flow data：By being configured in all edge routers, used by edge router
XFlow agreements send out flux and flow direction sampled data.The data sent using harvester receiving router, be filtered, summarize and
It preserves.The Flow raw informations of acquisition include：Source router, source interface, destination address, flow.
After collecting basic data, by the data configuration of the acquisition shadow network synchronous with existing net, including network topology
And discharge model.Network topology is directly constructed by IGP topological datas, and discharge model combines access interface flow, Flow first
Data, BGP routings obtain flow ingredient, then end-to-end flux is opened up by IGP end to end between network edge after being calculated
It flutters and is overlapped, obtain the flow ingredient of network trunk.Specific calculating process is as follows：
（1）Destination address in Flow data with BGP routings is matched, obtains its corresponding BGP next hop address
And AS
（2）Flow data are converted to：Source router, source port, BGP next hop address, flow proportional
（3）The SNMP flows of access interface on every edge of table router in above-mentioned flux and flow direction ratio are divided, are obtained every
The access interface of edge of table router is to the flow of all directions.
（4）Based on step（3）In obtained data on flows, obtain the corresponding AS in source router port with reference to webmaster data,
According to the corresponding target AS in BGP route acquisition BGP next hop address, the flow between networking AS-AS is obtained.
（5）Based on step（3）In obtained data on flows, BGP next hop address in IGP routing tables is iterated and is looked into
It looks for, obtains outlet device, and according to IGP route topologicals, flow between edge is loaded into the relaying chain that IGP shortest paths are passed through
On the road, it then carries out dividing superposition if there is a plurality of equative route, obtains the flow ingredient of all repeated links.
After the completion of shadow net structure, simulation operations, simulated failure or network adjustment operation are carried out on shadow network, is imitated
The variation that very above-mentioned variation brings network flow distribution, finds the link that congestion may occur and the flow of loss, and carry out
It is intuitive to present.Specific simulation process is as follows：
（1）Will to the emulation of network topology adjust substitute into IGP topology, such as interrupt certain repeated link, offline certain equipment,
Metric of certain link etc. is changed, new path matrix between edge is obtained by shortest path first in new IGP topologys.
（2）The adjustment of the intermarginal flow of opposite side is substituted into, obtains new traffic matrix.Adjustment mode may include to uninterrupted
Adjustment, to the adjustment of edge flowexit, to adjustment of BGP routings etc.
（3）New flow demand is loaded in new network topology：It is route with reference to BGP and IGP, by new target BGP
Next hop address is searched in new IGP routing tables, and according to new IGP route topologicals, flow between edge is loaded into IGP shortest paths
On the repeated link that diameter is passed through, new relay traffic distribution is obtained, and compare the situation of change of the flow distribution before and after emulation,
Find out the link that congestion may occur and the flow of loss.
In Traffic simulation calculating process, the present invention will pass through the accuracy of following innovative technology raising simulation result：
【Iterative constrained algorithm step by step】
The definition of " grade "：Priority → nearly source, the original no discardings of t0, pure change in topology do not consider bandwidth constraint.
It in Traffic simulation loading procedure, is loaded by the practical routing procedure of flow, by the starting electricity near source
The circuit that connection destination node is arrived on road to repeat circuit again carries out hierarchical loading calculating.Based on IGP shortest path matrixes, divide direction
The flow discard level of every repeated link is calculated, using the maximum hop count value in all IGP shortest paths by link as it
Flow discard level.In simulation calculation, when network occurs congestion and generates packet loss, to generating the link of packet loss, by flow
The ascending sequence of discard level value carries out flow and abandons calculating, in routing front end because the flow that congestion abandons is not repeated to add
It is loaded onto routing rear end.
Below by a specific flow demand loading example illustratively.
As shown in Figure 3, it is assumed that OD flow demands are：
DAC=1.2Gbps
DEC=0.2Gbps
Each circuit bandwidth is 1Gbps, and circuit Metric is identical；
To converting flow FEC, shortest path is：
To converting flow FAC, shortest path is：WithBy the principle that flow is divided equally, each path is held
Carry the flow of 0.6Gbps
Circuit flow distribution is as shown in Figure 3.
If circuit AD is interrupted, DACShortest path becomeDECShortest path it is constant.
In the case,
The flow demand of circuit AB carryings is 1.2Gbps, because flow demand is more than circuit bandwidth, need to abandon 0.2Gbps's
Flow, the flow ingredient of circuit AB carryings are：F′AC=1Gbps
The flow demand of circuit EB carryings is 0.2Gbps, and flow demand is less than circuit bandwidth, without abandoning flow, holds
The flow ingredient of load is：F′EC=DEC=0.2Gbps.
The flow demand of circuit BC carryings is F 'AC+F′EC=1.2Gbps because flow demand is more than circuit bandwidth, needs to abandon
Flow be：F’AC+F′EC-BabdBC=0.2Gbps.Flow abandons ratio
By the principle that equal proportion abandons, the flow ingredient carried on circuit BC is：
Altogether：F″AC+F″EC=1Gbps
Circuit flow distribution is as shown in Figure 4.
It is described below and changes in flow rate algorithm is fitted based on Flow ratios：
Since the flux and flow direction Flow data of acquisition are the data from the sample survey according to special ratios, the stream calculated accordingly can be made
It measures component ratio and generates a degree of error, and then influence the result of calculation of the whole network flow distribution and the standard of simulation result
Really.Since circuit flow is the non-data from the sample survey that is acquired by SNMP, the SNMP flows of the circuit to entering network, be multiplied by by
These circuits flow into proportionate relationships of the Flow in each logical direction in net, it will be able to accurately obtain the true of all directions
Flux and flow direction demand numerical value, and then the reality for the variation of the link flow after simulation calculation will be carried out by Flow being superimposed to link
On flow so that Traffic simulation result is closer to existing net actual conditions.
After being realized by two above core simulation algorithm by IP network piping system program, construction production network can be synchronized
Shadow network, and realize to network failure and adjustment operation analog simulation, for the network optimization, planning help is provided, raising
The O＆M of network is horizontal.
The present invention has been successfully applied in China Telecom's backbone network IP comprehensive network managements, helps backbone network maintenance management
Personnel carry out the emulation of network flow.
There are special server and backbone routers to establish IGP neighborhoods in network management system, receive backbone network IGP
LSP（Link state packet）, therefore the ISIS metric values of link between backbone router can be obtained, it calculates and has stored in real time
Whole IGP topologys and routing table.
There are special server and backbone network bgp router reflector to establish bgp neighbor relationship in network management system, receive backbone
Net equipment BGP route announcement information, therefore the bgp routing table of backbone router can be obtained.
Network management system acquisition server can acquire the link level traffic data for now netting all links, acquisition by snmp protocol
Granularity is 5 minutes.
Backbone routers are configured with the sampling of Flow data, are received and route using Flow acquisition servers in network management system
The Flow data that device is sent, and preserved and handled, and then obtain the flow direction distribution of backbone network access flow.
China Telecom ChinaNet backbone networks existing equipment 185, repeated link 2300, edge access peak flow
20Tbps, BGP route 470,000, and IGP route 6000.Network management system carries out emulation number using 4 PC-SERVER servers altogether
It is configured to according to acquisition and simulation calculation, every server:4*4Core2.4GHz CPU, 16G memories.The single simulation calculation time
It is 50 seconds or so.
Fig. 5 is the interface to being presented by acquiring the partial-topology for the ChinaNet shadow networks for calculating generation.Energy
Enough check the topological structure of network and actual flow distribution situation.Select certain circuit that can check flow composition information.
Fig. 6 is to check interface to the flow composition information of a repeat circuit.It is diverted into, flows out both direction and show respectively
Flow component ratio and uninterrupted are shown.
Fig. 7 is to interrupt the analogue simulation situation under scene in C2C extra large cables to ChinaNet networks.It can be clear on topological diagram
The flow distribution and congestion situation of each repeated link after emulating are presented clearly, and can check the details and flow of each link
Discarding situation.
Fig. 8 shows to interrupt simulation result report schematic diagram to ChinaNet network C 2C extra large cables.Fig. 8 is to Traffic simulation knot
The analysis report of fruit.The changes in flow rate situation of circuit before and after emulation is listed in report, to the circuit of congestion with special color
Prompting, and list flow of each circuit after emulation and abandon situation, and common packet loss and intelligent packet loss two ways point can be pressed
It does not list and is compared.
The relatively existing emulation technology by link level traffic and IGP topology inverse discharge models, the present invention have with
Lower advantage：
（1）Discharge model and Simulation result data are more accurate.By the method for link level traffic inverse discharge model, although
It can be optimized by certain algorithm, the essence solved equation still can not ensure the order of accuarcy of its data more.And this
Invention is by collecting practical flux and flow direction Flow sampled datas, in conjunction with the fitting correction of link level traffic, will more subject to
The actual flow situation that true reflection is now netted.
（2）It can realize the loading and emulation of BGP routing characteristics.The existing method by link flow inverse discharge model without
Body of laws shows the characteristic that BGP in network route and its effect in a network environment, can not also carry out corresponding analog simulation.The present invention
The discharge model and simulation calculation used, introduces the data of BGP routings, and the iterative relation for passing through BGP and IGP routings carries out
Discharge model calculates and emulation, is consistent with the network routing operating mechanism of reality, can more reflect the practical feelings of existing network operation
Condition, and the simulation calculation to BGP routing characteristics can be realized on this basis.
（3）Iterative constrained algorithm makes simulation result more be consistent with network practical operation situation step by step.Existing various streams
It measures in emulation tool, when carrying out Traffic simulation calculating, flow is not added and is distinctively loaded directly into all links, to being more than
The situation of link bandwidth is not handled by, and in real network operation is the flow that impossible generate super link bandwidth, routing
The flow of upstream loss can not be transmitted to downstream.The present invention is classified by iterative constrained algorithm step by step based on network layer
It calculates flow and abandons situation, simulation result is made more to be consistent with real network operating condition, improves the accuracy of simulation result.
Fig. 9 shows the structure chart of one embodiment of the network according to the invention routing traffic simulator.Such as Fig. 9 institutes
Show, which includes：Basic data acquiring unit 91, for obtaining the basic data of existing net, basis
Data include IGP routings and topological data, BGP routings data, port flow data, flux and flow direction Flow data, wherein, flow
Flow data are flowed to include：Source router, source interface, destination address, flow；Shadow net structure unit 92, for according to base
The shadow network that plinth data configuration is now netted, shadow network include network topology and discharge model, wherein, the network of shadow network is opened up
Thump cross IGP topological datas construction, the discharge model of shadow network includes between network edge flow ingredient and net end to end
The flow ingredient of network relaying；Path matrix determination unit 93, for determining shadow network based on to the emulation adjustment of network topology
New IGP topologys and the new path matrix in new IGP topologys；Traffic matrix determination unit 94, for being based on pair
The emulation adjustment of flow obtains new flow demand and new traffic matrix corresponding with new flow demand between edge；Stream
Amount demand loading unit 95, for new flow demand to be loaded into new network topology based on iterative constrained algorithm step by step,
Obtain new relay traffic distribution.
In one embodiment, shadow net structure unit combination access interface flow, flux and flow direction Flow data, BGP
Routing be calculated between network edge flow ingredient end to end；By flow is opened up by IGP end to end between network edge
It flutters and is overlapped the flow ingredient for obtaining network trunk.
In one embodiment, flow demand loading unit is carried out new flow demand by the practical routing procedure of flow
Loading carries out hierarchical loading to the circuit of connection destination node again by the starting circuit near source to repeat circuit；Based on IGP
Shortest path matrix divides the flow discard level of every repeated link of direction calculating, with all IGP shortest paths by link
In maximum hop count value be its flow discard level；In simulation calculation, when network occurs congestion and generates packet loss, to generating
The link of packet loss carries out flow by the ascending sequence of flow discard level value and abandons calculating, in routing front end because congestion is lost
The flow abandoned does not repeat to be loaded onto routing rear end.
Figure 10 shows the structure chart of another embodiment of the network according to the invention routing traffic simulator.Such as Figure 10
Shown, which further includes data on flows correction unit 101, for being based on circuit flow to flux and flow direction
Flow data are corrected.In one embodiment, data on flows correction unit 101 obtains electricity according to flux and flow direction Flow data
Proportionate relationship of the road flow in each logical direction；The circuit flow for entering network is multiplied by oversampling circuit and flows into the stream in netting
Measure the flux and flow direction Flow data after the proportionate relationship in each logical direction is corrected.
The disclosure for IP network manage system provide a kind of routing applied to Large IP Network based on measured data with
The method of Traffic simulation, with " the shadow network " for helping network management personnel's Fast Construction consistent with existing net discharge model, and
Analogue simulation adjustment is carried out thereon, and help is provided for the network planning, optimization and engineering construction.
So far, Large IP Network routing traffic emulation mode according to the present invention is described in detail.In order to avoid hiding
The design of the present invention is covered, does not describe some details known in the field.Those skilled in the art are as described above, complete
It is complete to can be appreciated how to implement technical solution disclosed herein.
The method and system of the present invention may be achieved in many ways.For example, can by software, hardware, firmware or
Software, hardware, firmware any combinations come realize the present invention method and system.The said sequence of the step of for the method
Merely to illustrate, the step of method of the invention, is not limited to sequence described in detail above, special unless otherwise
It does not mentionlet alone bright.In addition, in some embodiments, the present invention can be also embodied as recording program in the recording medium, these programs
Including being used to implement machine readable instructions according to the method for the present invention.Thus, the present invention also covering stores to perform basis
The recording medium of the program of the method for the present invention.
Although some specific embodiments of the present invention are described in detail by example, the skill of this field
Art personnel it should be understood that above example merely to illustrating, the range being not intended to be limiting of the invention.The skill of this field
Art personnel are it should be understood that can without departing from the scope and spirit of the present invention modify to above example.This hair
Bright range is defined by the following claims.
Claims (10)
1. a kind of network routing traffic emulation mode, which is characterized in that including：
The basic data now netted is obtained, the basic data includes Interior Gateway Protocol IGP routings and topological data, borde gateway
Agreement BGP routings data, port flow data and flux and flow direction Flow data, wherein, the flux and flow direction Flow data include：
Source router, source interface, destination address and flow；
According to the shadow network that basic data construction is now netted, the shadow network includes network topology and discharge model,
In, the network topology of the shadow network is route by the IGP and topological data construction, the discharge model of the shadow network
Including flow ingredient and the flow ingredient of network trunk end to end between network edge；
It is opened up based on the new IGP topologys that the shadow network is determined to the emulation adjustment of network topology and in the new IGP
The new path matrix flutterred；
Emulation adjustment based on the intermarginal flow of opposite side obtains new flow demand and corresponding with the new flow demand new
Traffic matrix；
The new flow demand is loaded by the practical routing procedure of flow, by the starting circuit near source to relaying
The circuit that circuit arrives connection destination node again carries out hierarchical loading；Based on IGP shortest path matrixes, divide direction calculating every relaying
The flow discard level of link, using the maximum hop count value in all IGP shortest paths by link as its flow discard level；
In simulation calculation, when network occurs congestion and generates packet loss, to generating the link of packet loss, by flow discard level value by small
Flow is carried out to big sequence and abandons calculating, in routing front end because the flow that congestion abandons does not repeat to be loaded onto routing rear end, is obtained
Obtain relay traffic distribution newly.
2. it according to the method described in claim 1, it is characterized in that, further includes：
Be calculated holding between the network edge with reference to port data on flows, flux and flow direction Flow data and BGP routing and arrive
The flow ingredient at end；
By between network edge end to end flow ingredient be overlapped by IGP topologys to obtain the flow of the network trunk into
Point.
3. according to the method described in claim 2, it is characterized in that,
Combination port data on flows, flux and flow direction Flow data and BGP routings be calculated between the network edge
Flow ingredient includes end to end：
Destination address in the flux and flow direction Flow data is matched with BGP routings, with obtaining corresponding BGP next hop
Location and autonomous system AS；
The flux and flow direction Flow data are converted to：Source router, source port, BGP next hop address, flux and flow direction ratio；
The SNMP flows of access interface on every edge of table router in flux and flow direction ratio are divided, obtain every edge of table router
Access interface to all directions flow；
Access interface based on every edge of table router to all directions data on flows, it is corresponding with reference to source router port
AS according to the corresponding target AS in BGP route acquisition BGP next hop address, obtains the flow between networking AS-AS；
And/or
It is described by flow ingredient obtains the stream of the network trunk by what IGP topologys were overlapped end to end between network edge
Amount ingredient includes：
Based on the data on flows of the access interface per edge of table router to all directions, by BGP next hop address in IGP
Lookup is iterated in routing table, obtains outlet device；
According to IGP route topologicals by flow is loaded into the relaying that IGP shortest paths are passed through end to end between the network edge
Chain road, then carries out dividing superposition if there is a plurality of equative route, the flow ingredient of all repeated links is obtained, so as to obtain
The flow ingredient of the network trunk.
4. it according to the method described in claim 1, it is characterized in that, further includes：
The flux and flow direction Flow data are corrected based on circuit flow.
5. according to the method described in claim 4, it is characterized in that, the circuit flow that is based on is to the flux and flow direction Flow numbers
According to be corrected including：
Proportionate relationship of the circuit flow in each logical direction is obtained according to the flux and flow direction Flow data；
The circuit flow for entering network is multiplied by oversampling circuit and flows into proportionate relationship of the flow in netting in each logical direction
The flux and flow direction Flow data after being corrected.
6. according to the method described in claim 1,4 or 5, which is characterized in that further include：
Flux and flow direction sampled data is sent out by edge router, the flux and flow direction that edge router is received using harvester is adopted
Sample data obtain the flux and flow direction Flow data.
7. a kind of network routing traffic simulator, which is characterized in that including：
Basic data acquiring unit, for obtaining the basic data of existing net, the basic data includes Interior Gateway Protocol IGP roads
By and topological data, Border Gateway Protocol (BGP) routing data, port flow data and flux and flow direction Flow data, wherein, it is described
Flux and flow direction Flow data include：Source router, source interface, destination address and flow；
Shadow net structure unit, for the shadow network now netted according to basic data construction, the shadow network includes
Network topology and discharge model, wherein, the network topology of the shadow network is route by the IGP and topological data construction,
The discharge model of the shadow network includes flow ingredient and the flow ingredient of network trunk end to end between network edge；
Path matrix determination unit, for determining that the new IGP of the shadow network is opened up based on to the emulation adjustment of network topology
It flutters and the new path matrix in the new IGP topologys；
Traffic matrix determination unit, for the emulation adjustment based on the intermarginal flow of opposite side obtain new flow demand and with institute
State the corresponding new traffic matrix of new flow demand；
Flow demand loading unit, for the new flow demand to be loaded by the practical routing procedure of flow, by most
Starting circuit close to source arrives the circuit progress hierarchical loading for connecting destination node to repeat circuit again；Based on IGP shortest paths
Matrix divides the flow discard level of every repeated link of direction calculating, with the maximum in all IGP shortest paths by link
Jumping figure value is its flow discard level；In simulation calculation, when network occurs congestion and generates packet loss, to generating the chain of packet loss
Road carries out flow by the ascending sequence of flow discard level value and abandons calculating, in the flow that routing front end is abandoned by congestion
It does not repeat to be loaded onto routing rear end, obtains new relay traffic distribution.
8. device according to claim 7, which is characterized in that the shadow net structure unit combination port flow number
Be calculated between the network edge flow ingredient end to end according to, flux and flow direction Flow data and BGP routings；By network
Flow ingredient is overlapped to obtain the flow ingredient of the network trunk by IGP topologys end to end between edge.
9. device according to claim 7, which is characterized in that further include：
Data on flows corrects unit, and the flux and flow direction Flow data are corrected for being based on circuit flow.
10. device according to claim 9, the data on flows correction unit is obtained according to the flux and flow direction Flow data
Obtain proportionate relationship of the circuit flow in each logical direction；The circuit flow for entering network is multiplied by oversampling circuit to flow into net
Proportionate relationship of the flow in each logical direction corrected after the flux and flow direction Flow data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310460068.3A CN104518899B (en) | 2013-09-30 | 2013-09-30 | Network routing traffic emulation mode and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310460068.3A CN104518899B (en) | 2013-09-30 | 2013-09-30 | Network routing traffic emulation mode and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104518899A CN104518899A (en) | 2015-04-15 |
| CN104518899B true CN104518899B (en) | 2018-06-26 |
Family
ID=52793673
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310460068.3A Active CN104518899B (en) | 2013-09-30 | 2013-09-30 | Network routing traffic emulation mode and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104518899B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105207953B (en) * | 2015-09-30 | 2019-02-05 | 华为技术有限公司 | A kind of generation method and device of customer flow |
| CN106254152B (en) * | 2016-09-19 | 2019-11-08 | 新华三技术有限公司 | A kind of flow control policy treating method and apparatus |
| US10523542B2 (en) | 2017-03-20 | 2019-12-31 | At&T Intellectual Property I, L.P. | Systems and methods for testing integrated cloud interoperability, adjacent network compatibility and service chain connectivity |
| CN107171899B (en) * | 2017-07-18 | 2019-12-03 | 江南大学 | A kind of high-throughput routing simulation method based on cloud platform |
| CN109981307A (en) * | 2017-12-27 | 2019-07-05 | 中国电信股份有限公司 | Method and system for network simulation |
| CN110661664B (en) * | 2019-09-27 | 2022-06-21 | 新华三信息安全技术有限公司 | Flow simulation method and device |
| CN111107011B (en) * | 2019-11-05 | 2022-10-28 | 厦门网宿有限公司 | Method for detecting and generating optimal path and network acceleration system |
| CN111211987B (en) * | 2019-11-29 | 2021-07-27 | 清华大学 | Method and system for dynamically adjusting flow in network, electronic equipment and storage medium |
| CN114095372A (en) * | 2021-10-21 | 2022-02-25 | 中盈优创资讯科技有限公司 | Offline calculation method and device based on flow and topological model |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159631A (en) * | 2007-11-16 | 2008-04-09 | 清华大学 | Autonomic system network routing convergence performance testing method |
| JP5108845B2 (en) * | 2009-08-25 | 2012-12-26 | 日本電信電話株式会社 | Simulation device, BGP simulation method and program thereof |
-
2013
- 2013-09-30 CN CN201310460068.3A patent/CN104518899B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159631A (en) * | 2007-11-16 | 2008-04-09 | 清华大学 | Autonomic system network routing convergence performance testing method |
| JP5108845B2 (en) * | 2009-08-25 | 2012-12-26 | 日本電信電話株式会社 | Simulation device, BGP simulation method and program thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104518899A (en) | 2015-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104518899B (en) | Network routing traffic emulation mode and device | |
| CN103618677B (en) | Network flow regulation method and system | |
| US9160651B2 (en) | Metric biasing for bandwidth aware tie breaking | |
| CN103873377B (en) | Network Status Mapping | |
| Molina et al. | Using software defined networking to manage and control IEC 61850-based systems | |
| TWI521924B (en) | Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism | |
| CN104702522B (en) | Computer implemented method, device, the controller of software defined network routing data | |
| CN108809857A (en) | A method of the traffic monitoring based on SDN and service quality securing strategy | |
| CN107710693A (en) | The method of opening relationships between multigroup label switched path and virtual network | |
| CN109905280B (en) | Simulation method and system for mobile satellite network | |
| CN111327525B (en) | Network routing method and device based on segmented routing | |
| CN107204920A (en) | A kind of quick heavy-route processing method, device and system | |
| CN106817299A (en) | The list item generation method and device and message forwarding method of software defined network | |
| CN106302012A (en) | A kind of PTN network simulation-optimization method and system | |
| CN106161053A (en) | A kind of SDN controller QoS manages system and method | |
| Monika et al. | Performance analysis of software defined network using intent monitor and reroute method on ONOS controller | |
| CN107046504A (en) | Method and controller for the traffic engineering in communication network | |
| Vdovin et al. | Network utilization optimizer for SD-WAN | |
| CN104917677A (en) | Data stream forwarding control method and system | |
| Banjar et al. | Analysing the performance of the OpenFlow standard for software-defined networking using the OMNeT++ network simulator | |
| Nedyalkov et al. | Modeling of the convergence time of an IP-based network with different traffic loads | |
| CN109981307A (en) | Method and system for network simulation | |
| CN103650453B (en) | The method communicated in path computation element communication protocol and network equipment | |
| Olenev et al. | Tools for analysis and tracking of deadlock-free routes in on-board SpaceWire networks | |
| CN107431656A (en) | Control device, communication system, control method and program |
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 |