CN103269295A - Path capacity measuring method based on packet pair - Google Patents
Path capacity measuring method based on packet pair Download PDFInfo
- Publication number
- CN103269295A CN103269295A CN201310159036XA CN201310159036A CN103269295A CN 103269295 A CN103269295 A CN 103269295A CN 201310159036X A CN201310159036X A CN 201310159036XA CN 201310159036 A CN201310159036 A CN 201310159036A CN 103269295 A CN103269295 A CN 103269295A
- Authority
- CN
- China
- Prior art keywords
- path capacity
- distribution time
- time window
- destination
- detection packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a path capacity measuring method based on a packet pair. When the up link path capacity is measured, the detection packet pair is transmitted from a source site to a destination site, the destination site processes arriving and spreading time of the detection packet pair, and the up link path capacity is further calculated. When the down link path capacity is measured, a detection packet can be transmitted from the destination site to the source site, and the same mode is adopted to calculate the down link path capacity. The detection packet transmitted from the destination site to the source site can be an ACK response packet, the detection packet contains up link path capacity information, and therefore the up link path capacity and the down link path capacity can be measured at a time.
Description
Technical field
The invention belongs to network communication field, particularly a kind of method of measurement based on the right up-downgoing path capacity of bag.
Background technology
Path capacity, weighing bottle neck bandwidth (Bottleneck Bandwidth) again, the basic index as the largest data transfer ability on the network end-to-end link has determined transmission performance end to end in network application.Therefore the estimation (measurement) of path capacity has application prospect quite widely.
Conventional path capacity measurement model is to send detection packet at the source in path end to destination, by time interval of destination record detection packet or the time of advent characteristic quantity come the measuring route capacity.According to the send mode of detection packet, the path capacity algorithm for estimating can be divided into the variable packet length technology (Variable Packet Size, VPS) and detection packet to (Packet Pair, PP) two class technology.Owing to being influenced by two layers of store-and-forward unit, the VPS technology produces a certain amount of error, so to the improvement of the algorithm for estimating of path capacity with optimize and mainly be based on detection packet to (PP) technology.
Accurately, fast, the path capacity Measurement Algorithm of low expense is the composition basis of a lot of network applications.The VPS technology is because the inherent shortcoming on the model can not guarantee the accuracy that path capacity is measured.And the PP technology will obtain path capacity accurately, and key is that link measurement samples collection is carried out statistical analysis.Existing algorithm for estimating can not satisfy demands of applications at aspects such as accuracy, detection time and detection amount expenses.
Summary of the invention
The shortcoming of prior art the object of the present invention is to provide a kind of method of measurement based on the right path capacity of bag in view of the above, is used for solving prior art in the problem of aspects such as accuracy, detection time and detection amount expense.
Reach other relevant purposes for achieving the above object, the invention provides a kind of method of measurement based on the right path capacity of bag, it comprises that to send detection packet by the source end to destination right, and destination calculates according to detection packet and scatter the time window sequence the right time of advent; Try to achieve the distribution time series according to scattering the time window sequence again; At last by scattering the path capacity of time series calculating from the source end to destination.
Preferably, thus can be earlier divide by a certain stroll time window length the distribution time samples that arrives detection packet in the above-mentioned path capacity method of measurement and obtain scattering the time window sequence.
Preferably, can also carry out obtaining scattering time series after the median filter to the distribution time window sequence in the above-mentioned path capacity method of measurement.
Preferably, can also define and give up the factor, and calculate the path capacity from the source end to destination again after the distribution time series in the above-mentioned path capacity method of measurement given up.
Preferably, in the above-mentioned path capacity method of measurement, behind the path capacity that records from the source end to destination, can record the path capacity from destination to the source end again with carrying the ACK technology.
Method of measurement based on the right path capacity of bag of the present invention has adopted the PP technology, does not have the intrinsic error of VPS technology; Adopt new statistics, analysis and computational methods that detection packet is handled the distribution time samples collection that arrives, calculate path capacity, the accuracy height, required time is few, calculates, to measure expense little.
Description of drawings
Fig. 1 is the schematic diagram of PP Detection Techniques.
Fig. 2 flow chart in accordance with a preferred embodiment of the present invention.
Fig. 3 is respectively 1M and 10M(bps to the uplink and downlink path capacity according to a preferred embodiment of the invention) measured value that carries out 50 actual measurements.
Fig. 4 is respectively 15M and 30M(bps to the uplink and downlink path capacity according to a preferred embodiment of the invention) measured value that carries out 50 actual measurements.
Embodiment
Below by specific instantiation explanation embodiments of the present invention, those skilled in the art can understand other advantages of the present invention and effect easily by the disclosed content of this specification.The present invention can also be implemented or be used by other different embodiment, and the every details in this specification also can be based on different viewpoints and application, carries out various modifications or change under the spirit of the present invention not deviating from.
Referring to Fig. 1, what Fig. 1 showed is detection packet is measured end-to-end path capacity to (technology) schematic diagram.End to end path definition by from the source end to destination grouping node (equipment that possesses the storage forwarding capability, the router for example) sequence of process.Suppose that the path of process is constant and unique when measuring, so on the path zero background traffic (Cross Traffic, in the time of CT), the maximum data throughput that the IP layer can reach is defined as path capacity.If total jumping figure (Hop) of node is H on the end-to-end path, U
iBe the i hop node at link capacity or the transfer rate of source end on the destination direction, U
0Be the link capacity of source end, then as shown in Equation (1), up path capacity U is the link capacity minimum value of end node on the destination direction in source on the path.In like manner, we define D
iBe that i jumps link capacity or the transfer rate of destination to the extreme direction of source, D
H+1Be the link capacity of destination, then as shown in Equation (2), downlink path capacity D is the link capacity minimum value of destination node to the extreme direction of source in the path.
For the convenience that illustrates, hereinafter only discuss earlier and measure the up path capacity C.
Still referring to Fig. 1, wherein the detection packet of mark 1 and 1 ' expression equal in length is right, mark 2,3,4 represent respectively link nodes (such as, can be store-and-forward unit).As shown in the figure, here suppose that node 2 is identical with the link capacity of node 4, be 3C, the link capacity of node 3 is C, here suppose that each link nodes is that queuing policy is first in first out (FIFO), bag to 1 and 1 ' sent to destination from the source end in the mode of (back-to-back) back-to-back, finish so once transmission and just finish the one-shot measurement sampling.Note bag 1 and 1 ' length be L, right distribution time (Dispersion Time) Δ of definition bag is: the path link nodes receive bag 1 ' last bit begin to receive the time interval that bag 1 last bit ends (here hypothesis be give out a contract for a project 1 earlier ' after give out a contract for a project 1), i.e. the distribution time is bag 1 and bag 1 ' poor at the time of reception at certain link nodes place.As shown in Figure 1, bag is to sending in back-to-back mode at the source end, the distribution time Δ=L/3C of Gu Bao when leaving source end node 2, the distribution time of leaving node 3 is Δ=L/C, owing to depend on the node of link capacity minimum in the path in the distribution time of destination node 4, so be Δ=L/C in the distribution time of destination node 4.When total jumping figure of node on the path is H and background traffic when being zero, bag is C to jumping link capacity through i
iLink nodes the time, the bag to the distribution time Δ before this hop node
InWith the distribution time Δ that leaves after this hop node
OutSatisfy formula (3)
Δ
out=max{Δ
in,L/C
i} (3)
If hypothesis bag is through in the path during every jumping link nodes, background traffic is zero, then wrap to the distribution time at destination be Δ
R:
C is path capacity end to end in the formula (4).In the time of advent that destination can record each detection packet, calculate bag according to this at the distribution time of destination Δ
RTherefore can come the measuring route capacity according to formula (5):
With reference now to Fig. 2,, Fig. 2 is the basic flow sheet according to measuring route capacity method of the present invention.In step 1, sending regular length from the source end is that n the detection packet of L is right, does not consider under the situation of packet loss in the transmission course, gathers n sample set S={ Δ that wraps the distribution time at destination so
1, Δ
2... the .. Δ
n, from S set, mark off subclass S
i={ Δ
i, Δ
I+1... the .. Δ
I+l-1, and | S
i|=l, S
iBe defined as the distribution time window, l is defined as and scatters time window length.Can mark off a length from stroll time samples S set so is that l scatters time window sequence D={ S
1, S
2... S
i... S
N-l+1, }.
According to preferred embodiment of the present invention, in measuring sampling step 1, L=1024 byte, n=50, l=16.What deserves to be explained is that those skilled in the art can select other suitable value for use as required to parameter L, n, l.Such as, for L, can select random length for use, preferably but not necessarily, value is the MTU(Maximum Transmission Unit MTU in path), i.e. L=1500(unit: byte).But for particular platform, the windows in this preferred embodiment for example, owing to there is high-speed channel, it is 1024 that L can be set.For n, can be the arbitrary integer more than or equal to 1, but in order to improve certainty of measurement, preferably but not necessarily, value is more than or equal to 50.For l, can select arbitrary integer between 1 to n (when value equaled n, expression was not divided sample set S) for use, preferably but not necessarily, value is more than or equal to 16.
In the practical application, there is noise in link, for reducing noise to the influence of measurement result, can introduce the noise filtering step sample set S is handled.In noise filtering step 2, this preferred embodiment is to stroll time window S
iFilter, those skilled in the art can select the filter algorithm of any appropriate according to actual conditions or needs for use.In this preferred embodiment, select the median filter algorithm for use.Median filter algorithm computational process is as follows:
Calculate and scatter time window S
iThe intermediate value Δ
Mid:
Δ
mid=median S
i=median{Δ
i,Δ
i+1,......Δ
i+l-1} (6)
With the intermediate value Δ
MidFor datum quantity obtains S set
i',
According to stroll time window sequence D and formula (6), can calculate the stroll time window sequence S after the median filter
f={ S
1', S
2' ... S
i' ... S
I+l-1'.
In statistical analysis step 3, the distribution time window S that obtains according to noise filtering step 2
i', adopt following formula (8) to calculate the stroll time
:
According to scattering time window sequence S
fAnd formula (7), (8) can calculate the stroll time series
Again will
Substitution formula (5) is replaced Δ wherein
R, just can be in the hope of path capacity.
But in order further to improve certainty of measurement, this preferred embodiment by
Calculate
Before, it has been carried out further selection optimization, concrete selection mode is as follows:
Right
Resequence
Here hypothesis is scattered time series
Normal Distribution is so use sample average to estimate population mean.The factor is given up in definition
Sequence length is h=n-l+1=35, in sequence
Two ends give up, give up length and be
Distribution time series after giving up so
For:
The time estimated value of then finally taking a walk is
Again will at last
Substitution formula (5) can must path capacity final estimated value, i.e. formula (11):
Those skilled in the art can also do other variation to this preferred embodiment, such as, in the not high occasion of required precision, can omit noise filtering step 2; Perhaps in noise filtering rapid 2, select other noise filtering mode for use; Not right in statistical analysis step 3
Select direct substitution formula (5) to calculate path capacity; Also can be right
Adopt other selection mode; Perhaps also adopt the selection mode as this preferred embodiment, but select other numerical value etc. for use to giving up the factor.All these variations all do not depart from design of the present invention.
After recording the up path capacity with above-described embodiment, can also measure the downlink path capacity with identical principle, step.Preferably, can utilize and carry ACK technology one-shot measurement and go out the up-downgoing path capacity.
Carrying ACK(Ackownlegement namely replys) technology refers to that when destination received the detection packet of source end, the packet situation identical with length sent to the source end as the ACK response packet, this packet carries corresponding ACK sequence number as answer logo.Destination receive a detection packet to the time, send response packet to wrap right mode to the source end.When sending the ACK response packet, need the source end up path path capacity value that destination estimates is write ACK response packet load field, send to the source end together.The source end estimates the downlink path path capacity according to the response packet that receives to utilizing identical principle and measuring algorithm for estimating.Utilize above-mentioned measurement algorithm for estimating and carry the ACK technology, just can estimate up-downgoing path path capacity by one-shot measurement.
What Fig. 3 showed is to utilize the preferred embodiment of the present invention uplink and downlink path capacity to be respectively the end value of 50 gained of path measurements of 1M and 10M, as can be seen from Figure 3, this preferred embodiment is that accuracy is fine as a result for the path measurements of 1M, 10M to path capacity.
What Fig. 4 showed is to utilize the preferred embodiment of the present invention uplink and downlink path capacity to be respectively the end value of 50 gained of path measurements of 15M and 30M, as can be seen from Figure 4, the accuracy of a path measurements that preferential path capacity of embodiment is 15M and 30M is also better.
In sum, the invention provides a kind of method of new measuring route capacity, the accuracy height, required time is few, and the expense of calculating, measuring is little.So the present invention has effectively overcome various shortcoming of the prior art and the tool high industrial utilization.
Above-described embodiment is illustrative principle of the present invention and effect thereof only, but not is used for restriction the present invention.Any person skilled in the art scholar all can be under spirit of the present invention and category, and above-described embodiment is modified or changed.Therefore, those skilled in the art must be contained by claim of the present invention not breaking away from all equivalence modifications of finishing under disclosed spirit and the technological thought or changing.
Claims (10)
1. the method for measurement based on the right path capacity of bag is characterized in that, comprises the steps:
Steps A, it is right to receive first detection packet that sends from the source end by destination, according to described first detection packet the distribution time samples collection that arrives is calculated and scatters the time window sequence;
Step B filters described distribution time window sequence and obtains scattering time series;
Step C calculates the distribution time according to described distribution time series, again according to scattering the path capacity of Time Calculation from described source end to described destination.
2. path capacity method of measurement according to claim 1, it is characterized in that, in steps A, described destination is according to scattering time window length, obtain described distribution time window sequence after described first detection packet divided the distribution time samples collection that arrives, described distribution time window length is more than or equal to 16 and smaller or equal to the arbitrary integer of described distribution time samples collection length.
3. path capacity method of measurement according to claim 1 is characterized in that, is calculated by described distribution time series and scatters time method:
Note is scattered time series
Wherein l is described distribution time window length, and n is the distribution time samples collection length of described detection packet to arriving, and then scatters the time
4. path capacity method of measurement according to claim 1 is characterized in that, described first detection packet centering, and detection packet length value is the MTU in path.
5. path capacity method of measurement according to claim 1 is characterized in that, what described distribution time window sequence was filtered employing is the median filter mode, and described median filter mode comprises:
Remember that each scatters time window S in the described distribution time window sequence
iIn each element be Δ
i, S
iIntermediate value be Δ
Mid, described destination is l according to scattering time window length, then:
Δ
mid=medianS
i=median{Δ
1,Δ
2,Δ
3.......Δ
l}
With the intermediate value Δ
MidFor benchmark filters described distribution time window S
iObtain S
i',
Stroll time window sequence after median filter is S
f:
S
f={S′
1,S′
2,S′
3.....S′
i+l-1}
6. path capacity method of measurement according to claim 1 is characterized in that, among the step C, before described distribution time series calculating path capacity, also comprises described distribution time series is selected.
7. path capacity method of measurement according to claim 5 is characterized in that, the mode that described distribution time series is selected is:
Factor-alpha is given up in definition,
Sequence length is h=n-l+1, in sequence
Two ends give up, give up length and be
The final distribution time
For:
8. path capacity method of measurement according to claim 6 is characterized in that, the described factor of giving up is smaller or equal to 0.1.
9. according to the described path capacity method of measurement of any one claim of claim 1 to 8, it is characterized in that, also comprise the path capacity of measurement from described destination to described source end, the path capacity of wherein measuring from described destination to described source end comprises the steps:
Step D1, it is right to receive first detection packet that sends from the source end by destination, according to described first detection packet the distribution time samples collection that arrives is calculated and scatters the time window sequence;
Step D2 filters described distribution time window sequence and obtains scattering time series;
Step D3 is according to the path capacity of described distribution time series calculating from described source end to described destination.
10. path capacity method of measurement according to claim 9 is characterized in that, described second batch of detection packet comprises the path capacity information from described source end to described destination to being the ACK response packet in the described ACK response packet.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310159036.XA CN103269295B (en) | 2013-05-02 | 2013-05-02 | Based on bag to the measuring method of path capacity |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310159036.XA CN103269295B (en) | 2013-05-02 | 2013-05-02 | Based on bag to the measuring method of path capacity |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103269295A true CN103269295A (en) | 2013-08-28 |
CN103269295B CN103269295B (en) | 2016-08-24 |
Family
ID=49012904
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310159036.XA Active CN103269295B (en) | 2013-05-02 | 2013-05-02 | Based on bag to the measuring method of path capacity |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103269295B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113067750A (en) * | 2021-03-24 | 2021-07-02 | 北京字节跳动网络技术有限公司 | Bandwidth measuring method and device and electronic device |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1545277A (en) * | 2003-11-19 | 2004-11-10 | 北京邮电大学 | An end-to-end network bottleneck bandwidth measuring method |
CN101110714A (en) * | 2007-08-20 | 2008-01-23 | 电子科技大学 | Network route band width measuring method based on steady sampling sequence |
US20090016238A1 (en) * | 2006-09-08 | 2009-01-15 | Sun Yat-Sen University | Method for measuring the available bandwidths of a link and a network |
-
2013
- 2013-05-02 CN CN201310159036.XA patent/CN103269295B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1545277A (en) * | 2003-11-19 | 2004-11-10 | 北京邮电大学 | An end-to-end network bottleneck bandwidth measuring method |
US20090016238A1 (en) * | 2006-09-08 | 2009-01-15 | Sun Yat-Sen University | Method for measuring the available bandwidths of a link and a network |
CN101110714A (en) * | 2007-08-20 | 2008-01-23 | 电子科技大学 | Network route band width measuring method based on steady sampling sequence |
Non-Patent Citations (1)
Title |
---|
何晓桃等: "基于包对测量的路径容量估计方法改进", 《小型微型计算机系统》 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113067750A (en) * | 2021-03-24 | 2021-07-02 | 北京字节跳动网络技术有限公司 | Bandwidth measuring method and device and electronic device |
Also Published As
Publication number | Publication date |
---|---|
CN103269295B (en) | 2016-08-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN100442730C (en) | Detecting method for network link band width based on hop-by-hop time stamp label | |
CN103782534B (en) | Avoid the method and its device of network congestion | |
Navratil et al. | ABwE: A practical approach to available bandwidth estimation | |
CN105610820B (en) | A kind of jamming control method and device based on MPTCP | |
CN101272290B (en) | Measuring method, measuring apparatus for route congestion state in IP network | |
CN103647670B (en) | A kind of data center network flow analysis method based on sketch | |
CN102045219B (en) | High-efficiency single-end available bandwidth measuring method | |
CN104335526B (en) | Method and node for the improved estimation of the available path capacity of data transfer path | |
CN110730469B (en) | Method for predicting bandwidth based on extended Kalman wireless network and congestion control thereof | |
CN103312632B (en) | A kind of method of measuring available bandwidth | |
CN101964727A (en) | Method and device for measuring available bandwidth by using mixed messages | |
CN104486163A (en) | Single end available bandwidth measurement method and terminal adopting same | |
CN102801586B (en) | Method and device for automatically testing quality of service (QoS) granularity and precision | |
CN102739508B (en) | A kind of method and system of express network data transmission | |
CN103269295A (en) | Path capacity measuring method based on packet pair | |
CN108011763A (en) | Communications data network investment construction appraisal procedure | |
CN107426048A (en) | A kind of single-end available bandwidth measuring, device and transmitting terminal | |
JP6460099B2 (en) | Packet transmission apparatus, packet transmission system, and packet transmission method | |
CN102624614B (en) | Stable congestion control method of high-speed network | |
CN108055147A (en) | Communications data network service feature analysis method | |
EP3085021B1 (en) | Probing a network | |
Xu et al. | A bandwidth adaptive method for estimating end-to-end available bandwidth | |
CN106850437A (en) | A kind of complex network method for routing based on gravitational field | |
CN116527585B (en) | Congestion control method for stream length perception | |
Benson et al. | On the effects of aggregation on reliability in sensor networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
TR01 | Transfer of patent right |
Effective date of registration: 20230425 Address after: No. 18 Xiaoqi Village, Lianwei Town, Xinjian District, Nanchang City, Jiangxi Province, 330000 Patentee after: Jiangxi Pogu Agricultural Technology Co.,Ltd. Address before: 200433 No. 335, National Road, Shanghai, Yangpu District Patentee before: AVCON INFORMATION TECHNOLOGY Co.,Ltd. |
|
TR01 | Transfer of patent right |