CN103825775A - Multi-hop wireless network available bandwidth real-time detection method for adaptively detecting packet length - Google Patents

Multi-hop wireless network available bandwidth real-time detection method for adaptively detecting packet length Download PDF

Info

Publication number
CN103825775A
CN103825775A CN201310752608.5A CN201310752608A CN103825775A CN 103825775 A CN103825775 A CN 103825775A CN 201310752608 A CN201310752608 A CN 201310752608A CN 103825775 A CN103825775 A CN 103825775A
Authority
CN
China
Prior art keywords
available bandwidth
bag
time
value
string
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
Application number
CN201310752608.5A
Other languages
Chinese (zh)
Other versions
CN103825775B (en
Inventor
章云
余荣
叶墩辉
康嘉文
谢胜利
陆川
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN201310752608.5A priority Critical patent/CN103825775B/en
Publication of CN103825775A publication Critical patent/CN103825775A/en
Application granted granted Critical
Publication of CN103825775B publication Critical patent/CN103825775B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a multi-hop wireless network available bandwidth real-time detection method for adaptively detecting a packet length. The method comprises: a source host sending a data packet string to a destination host, and determining the position of a tight link and a preestimated available bandwidth value B according to a time delay signal returned by a detected node; then resetting the survival time value of the packet string, at the same time, adjusting the length of the packet string, and after measuring each time, the detected node feeding received time delay information to the source host; and the source host adjusting the length of a data packet in the packet string according to feedback information, observing the time delay information returned by each packet string and obtaining actual available bandwidth through determination. The method provided by the invention improves the precision of the measuring value of wireless network available bandwidth, enhances the reliability of a multi-hop wireless network, reduces the network load and improves the network performance.

Description

The multi-hop wireless network available bandwidth real-time detection method that self-adaptive detection bag is long
Technical field
The present invention relates to the real-time testing mechanism of a kind of available bandwidth, be specifically related to the long jumping wireless network available bandwidth real-time detection method of self-adaptive detection bag.
Background technology
Along with extensive use and the rapid growth of the mankind to information service demand of wireless network, the service quality (QoS) that how to guarantee business in wireless network becomes a hot issue of research a few days ago, and obtaining of available bandwidth is an important prerequisite of guaranteed qos in wireless network (quality of service).Network measure is the basis of High Performance Protocol design, network equipment exploitation, the network planning and construction, network management and operation, is also the basis of the high-effect network application of exploitation simultaneously.Along with the continuous increase of the new business such as real time business and multimedia application, the service quality (QoS) of people to network is had higher requirement.Although network backbone bandwidth and access bandwidth are multiplied, network performance does not obtain lifting at double, and its main cause is the problem of network capacity design, Resource Allocation in Networks and application design.The object of network bandwidth measurement finds bottleneck link (the tight link in network accurately, the link of available bandwidth minimum) place, thereby for the network capacity planning of network-wide basis provides foundation, bandwidth measurement occupies critical role in network measure as can be seen here.
The method of measurement of the network bandwidth mainly contains initiatively to be measured and passive measurement, and initiatively method of measurement obtains network bandwidth measurement value by initiatively sending test pack, and passive measurement method obtains network bandwidth measurement data by analyzing the data flow existing in network.
Summary of the invention
The present invention is directed to the deficiencies in the prior art, provide a kind of self-adaptive detection bag long multi-hop wireless network available bandwidth real-time detection method.The present invention not only can realize the Real-Time Monitoring to wireless network bandwidth, can also improve the precision of the measured value of wireless network available bandwidth, improves multi-hop wireless network reliability, improves the performance of network.
Technical scheme of the present invention is: the multi-hop wireless network available bandwidth real-time detection method that self-adaptive detection bag is long, is characterized in that comprising the steps:
(1) send a string packet string by source host S to destination host D, the delay time signal returning according to tested node is determined the position of bottleneck link and the available bandwidth value B that is estimated.
(2) data of the bottleneck link position obtaining by step (1), reset the Life Cycle time value of packet string to bag string is navigated on bottleneck link, adjust the length of bag in bag string simultaneously, the available bandwidth value B being recorded by step (1), the exact value of prediction actual available bandwidth is at [B-m, B+m] between, m gets 10% ~ 20% of available bandwidth B, the adjustment for the first time of bag length is with reference to two bounds of actual available bandwidth value B ± m, utilize the bound of actual available bandwidth, determine the adjusting range that bag is long, higher limit take B+m as available bandwidth is given out a contract for a project or lower limit take B-m as available bandwidth is given out a contract for a project for the first time, two kinds of principles of giving out a contract for a project are identical, the long method of adjusting of bag need to be made and change, only need to change bag long, send the bag string after adjusting, and at the t of being often separated by 1time repeats to send once, sends k time, and k gets 3-5, to be averaging,
(3) after each measurement, the Delay of receiving is fed back to source host by measured node, source host is according to the length of packet in feedback information adjustment bag string and observe Delay that each bag string returns and judge that this measures whether success, when the scope that obtains the actual available bandwidth of measuring last time is [B-m, B+m], make (y by the long L of the known adjustment bag of step (2) j× B i top)=B+m, y in formula jrepresent adjustment factor corresponding when wrapping long L adjusts the j time, B i toprepresent the transmission rate of i node-routing maximum, send bag string measurement after adjusting, wrap when observing the time delay monotone increasing that string returns, be judged as successfully, otherwise, be judged as unsuccessful;
When being judged as successfully, readjust bag long also repeating step (2), (3) of bag string, add up the time delay d of k bag string k, D (d 1, d 2..., d k) be the variance of k bag string time delay of same L value, as D (d 1, d 2..., d kwhen)≤Δ d, obtain actual available bandwidth B *=(B i top) 2/ (n × L/t 1+ B 1 top);
When judgement is unsuccessful, the value of m is increased to Δ m on its original basis, Δ m=(5% ~ 10%) × m, concrete value is determined by network condition, when network condition is good, Δ m gets 10%, when network condition is poor, Δ m gets 5%, repeating step (2), (3), be still unsuccessful when judging, return to step (1) and remeasure.
Further, the bag in described bag string is all User Datagram Protoco (UDP) packet, and this bag is made up of two parts, and a part is measurement data bag, for locating bottleneck link; Another part is load data bag, for the measurement of available bandwidth, measurement data bag is distributed in load data bag both sides symmetrically, the Life Cycle time value of the measurement data bag of head increases successively from 1, be increased to and how much determine according to path node, the Life Cycle time value of the measurement data bag of afterbody is decremented to 1 successively.
Further, the Life Cycle time value that resets measurement data Bao Gebao in step (2), according to being to make Life Cycle time value be increased to gradually i from 1, is used t 1represent the time interval between bag string, t 2represent that a branch of bag ganged up first node-routing device and take time, B i toprepresent the maximum transmission rate of i node-routing device (i=1,2,3......), it is known, y jrepresent adjustment factor corresponding when wrapping long L adjusts the j time, wherein 0<y j<1, n and L represent respectively the length of load data bag number and each bag in a branch of bag string, according to t 1/ (t 1+ t 2) × B 1 top=(y j× B i top) ?(formula 1.1), t 2=n × L/B 1 top(formula 1.2), can obtain y by formula 1.1 and 1.2 j=t 1× (B 1 top) 2/ (t 1× B 1 top× B i top+ n × B i top× L) (formula 1.3), set after n, adjust L according to formula 1.3 and can make (y j× B i top)=B ± m, the numerical value that the L value obtaining in the time that equation is set up will be adjusted exactly.
Further, according to the Delay feeding back in step (3) and whether successful, judge that the concrete grammar of the scope of available bandwidth is:
Make (y when adjusting L j× B i top)=B+m, and the delay time signal obtaining is monotone increasing, measures successfully, judges that available bandwidth is less than (y j× B i top), in the time measuring next time, just increase L value and make (y j+1× B i top) reduce, thereby dwindling the scope of actual available bandwidth, concrete grammar is to utilize formula 1.3 to increase L value, makes (y j+1× B i top) be reduced to the median of the available bandwidth scope measuring last time;
In measuring in next time, time delay monotone increasing explanation available bandwidth is less than (y j+1× B i top), available bandwidth scope is at [B-m, (y j+1× B i top)];
When not changing, time delay in measurement next time illustrates that now available bandwidth is greater than (y i+1× B i top), now available bandwidth scope at [(y j+1× B i top), B+m].
In the time adjusting bag length for the first time, select to adjust L and make (y j× B i top)=B-m, when the delay time signal obtaining is not change, measures successfully, judges that available bandwidth is greater than (y j× B i top), measure next time and reduce L value, make (y j+1× B i top) increase, thereby dwindling the scope of actual available bandwidth, concrete grammar is to utilize formula 1.3 to reduce L value, makes (y j+1× B i top) increase to the median of the available bandwidth scope measuring last time;
Time delay monotone increasing in measuring next time, available bandwidth scope is at [B-m, (y j+1× B i top)];
In measuring next time, time delay does not change, and available bandwidth scope is at [(y j+1× B i top), B+m];
Each measurement is all long according to the front available bandwidth scope adjustment bag once measuring, and progressively utilizes dichotomy to dwindle the scope of available bandwidth.
Beneficial effect of the present invention is: the present invention has not only realized the Real-Time Monitoring to wireless network bandwidth, has also improved the precision of the measured value of wireless network available bandwidth, has improved multi-hop wireless network reliability, has improved the performance of network.
 
Accompanying drawing explanation
Fig. 1 is the specific implementation flow chart of multi-hop wireless network available bandwidth measurement of the present invention.
Fig. 2 be the present invention while specifically implementing at interval of t 1time sends the schematic diagram of detection packet string.
embodiment
Below in conjunction with accompanying drawing, the present invention will be further described, but embodiments of the present invention are not limited to this.
As shown in Figure 1, the step of the multi-hop wireless network available bandwidth real-time detection method of self-adaptive detection bag length is:
(1) send a string UDP by source host S to destination host D and wrap, the delay time signal returning according to tested node is determined the position of bottleneck link and the available bandwidth value B that is estimated.As shown in Figure 2, UDP bag is made up of two parts, and a part is measurement data bag, for locating bottleneck link; Another part is load data bag, for the measurement of available bandwidth.Measurement data bag is completely symmetrically distributed in load data bag both sides, and the ttl value of the measurement data bag of head increases successively from 1, is specifically increased to and how much is determined by path node, and path is known here.The ttl value of the measurement data bag of afterbody is decremented to 1 successively.When bag arrives a node, the ttl value of preparing the IP stem of wrapping while being forwarded to next node can first reduce 1.If TTL=0 detected, this coated abandoning, a node ICMP of transmission (Internet Control Message Protocol, Internet Control Message Protocol) wraps to source host simultaneously; If TTL ≠ 0 detected, this bag can continue to send.In order to reduce packet loss, measurement data bag number P is set in experiment t_num=40 measurement data bag numbers that are distributed in tail both sides, load data packet header are respectively 20, and the size of each bag is P t_len(its representative value is 60B), load data bag number P l_num=40, the size of each bag is P l_len(its representative value is 500B), the ttl value of load data bag is all set to maximum 255.Current measurement can be located bottleneck link in node R iand R i+1between and bottleneck node R iwith an available bandwidth value B who estimates.
(2) data of the bottleneck link position obtaining by step (1), reset life cycle (the being called for short TTL) value of UDP bag string to bag is gone here and there and navigated on bottleneck link, make it from 1 to be increased to gradually i, use t 1represent the time interval between bag string, t 2represent that a branch of bag ganged up first node-routing device and take time, B i toprepresent the maximum transmission rate of i node-routing device (i=1,2,3......), it is known, y jrepresent adjustment factor corresponding when wrapping long L adjusts the j time, wherein 0<y j<1, n and L represent respectively the length of load data bag number and each bag in a branch of bag string.According to t 1/ (t 1+ t 2) × B 1 top=(y j× B i top) ?(formula 1.1), t 2=n × L/B 1 top(formula 1.2).Can obtain y by formula 1.1 and 1.2 j=t 1× (B 1 top) 2/ (t 1× B 1 top× B i top+ n × B i top× L) (formula 1.3), set after n, adjust L according to formula 1.3 and can make (y j× B i top)=B ± m, the numerical value that the L value obtaining in the time that equation is set up will be adjusted exactly.Adjust the length of bag in bag string simultaneously.The available bandwidth value B being recorded by step (1), the exact value of prediction actual available bandwidth is between [B-m, B+m], and m gets 10% ~ 20% of available bandwidth B, and the long adjustment for the first time of bag need to be with reference to two bounds of actual available bandwidth value B ± m so.Utilize the bound of actual available bandwidth, can determine the adjusting range that bag is long.For the first time will the higher limit take B+m as available bandwidth give out a contract for a project (also can the lower limit take B-m as available bandwidth give out a contract for a project), only needing to change bag length can realize.Send the bag string after adjusting, and at the t of being often separated by 1time repeats to send once, sends k time (k gets 3-5) to be averaging.
(3) after each measurement, the Delay of receiving is fed back to source host by measured node, and then source host is according to the length of packet in feedback information adjustment bag string and observe Delay that each bag string returns and judge that this measures whether success.Such as the scope that obtains the actual available bandwidth of measuring last time is [B-m, B+m], make (y by the long L of the known adjustment bag of step (2) j× B i top)=B+m, y in formula jrepresent adjustment factor corresponding when wrapping long L adjusts the j time, B i toprepresent the transmission rate of i node-routing maximum, send bag string measurement after adjusting, if observe the time delay monotone increasing that bag string returns, be judged as successfully.Otherwise, be judged as unsuccessful;
According to the time delay feeding back and information whether successfully, judge the scope of available bandwidth.Adjust L and make (y j× B i top)=B+m, and the delay time signal obtaining is monotone increasing, measures successfully, judges that available bandwidth is less than (y j× B i top), in the time measuring next time, just increase so L value and make (y j+1× B i top) reduce, thereby dwindle the scope of actual available bandwidth.Concrete grammar is to utilize formula 1.3 to increase L value, makes (y j+1× B i top) be reduced to the median of the available bandwidth scope measuring last time.
In measuring in next time, time delay monotone increasing explanation available bandwidth is less than (y j+1× B i top), available bandwidth scope is at [B-m, (y j+1× B i top)];
When not changing, time delay in measurement next time illustrates that now available bandwidth is greater than (y i+1× B i top), now available bandwidth scope at [(y j+1× B i top), B+m].
Each measurement is all long according to the front available bandwidth scope adjustment bag once measuring, and progressively utilizes dichotomy to dwindle the scope of available bandwidth.In like manner, if selection is to adjust L to make (y in the time adjusting bag length for the first time j× B i top)=B-m, adjusts the long principle of bag identical, and method is done corresponding change.
(4), if be judged as successfully, readjust bag long also repeating step (2), (3) of bag string.Add up the time delay d of k bag string k, D (d 1, d 2..., d k) be the variance of k bag string time delay of same L value.As D (d 1, d 2..., d kwhen)≤Δ d, can obtain actual available bandwidth B *=(B i top) 2/ (n × L/t 1+ B 1 top).
(5) if judgement is unsuccessful, the value of m is increased to Δ m on its original basis, Δ m=(5% ~ 10%) × m, concrete value is determined by network condition.When network condition is good, Δ m gets 10%; When network condition is poor, Δ m gets 5%.Repeating step (2), (3).If judge to be still unsuccessful, return to step (1) and remeasure.
Above-described embodiments of the present invention, do not form limiting the scope of the present invention.Any modification of having done within spiritual principles of the present invention, be equal to and replace and improvement etc., within all should being included in claim protection range of the present invention.

Claims (4)

1. the long multi-hop wireless network available bandwidth real-time detection method of self-adaptive detection bag, is characterized in that comprising the steps:
(1) send a string packet string by source host S to destination host D, the delay time signal returning according to tested node is determined the position of bottleneck link and the available bandwidth value B that is estimated;
?(2) data of the bottleneck link position obtaining by step (1), reset the Life Cycle time value of packet string to bag string is navigated on bottleneck link, adjust the length of bag in bag string simultaneously, the available bandwidth value B being recorded by step (1), the exact value of prediction actual available bandwidth is at [B-m, B+m] between, m gets 10% ~ 20% of available bandwidth B, the adjustment for the first time of bag length is with reference to two bounds of actual available bandwidth value B ± m, utilize the bound of actual available bandwidth, determine the adjusting range that bag is long, higher limit take B+m as available bandwidth is given out a contract for a project or lower limit take B-m as available bandwidth is given out a contract for a project for the first time, two kinds of principles of giving out a contract for a project are identical, the long method of adjusting of bag need to be made and change, only need to change bag long, send the bag string after adjusting, and at the t of being often separated by 1time repeats to send once, sends k time, and k gets 3-5, to be averaging,
(3) after each measurement, the Delay of receiving is fed back to source host by measured node, source host is according to the length of packet in feedback information adjustment bag string and observe Delay that each bag string returns and judge that this measures whether success, when the scope that obtains the actual available bandwidth of measuring last time is [B-m, B+m], make (y by the long L of the known adjustment bag of step (2) j× B i top)=B+m, y in formula jrepresent adjustment factor corresponding when wrapping long L adjusts the j time, B i toprepresent the transmission rate of i node-routing maximum, send bag string measurement after adjusting, wrap when observing the time delay monotone increasing that string returns, be judged as successfully, otherwise, be judged as unsuccessful;
When being judged as successfully, readjust bag long also repeating step (2), (3) of bag string, add up the time delay d of k bag string k, D (d 1, d 2..., d k) be the variance of k bag string time delay of same L value, as D (d 1, d 2..., d kwhen)≤Δ d, obtain actual available bandwidth B *=(B i top) 2/ (n × L/t 1+ B 1 top);
When judgement is unsuccessful, the value of m is increased to Δ m on its original basis, Δ m=(5% ~ 10%) × m, concrete value is determined by network condition, when network condition is good, Δ m gets 10%, when network condition is poor, Δ m gets 5%, repeating step (2), (3), be still unsuccessful when judging, return to step (1) and remeasure.
2. the multi-hop wireless network available bandwidth real-time detection method long according to the self-adaptive detection bag described in claims 1, it is characterized in that: the bag in described bag string is all User Datagram Protoco (UDP) packet, this bag is made up of two parts, a part is measurement data bag, for locating bottleneck link; Another part is load data bag, for the measurement of available bandwidth, measurement data bag is distributed in load data bag both sides symmetrically, the Life Cycle time value of the measurement data bag of head increases successively from 1, be increased to and how much determine according to path node, the Life Cycle time value of the measurement data bag of afterbody is decremented to 1 successively.
3. the multi-hop wireless network available bandwidth real-time detection method long according to the self-adaptive detection bag described in claims 1, it is characterized in that: the Life Cycle time value that resets measurement data Bao Gebao in step (2), according to being to make Life Cycle time value be increased to gradually i from 1, is used t 1represent the time interval between bag string, t 2represent that a branch of bag ganged up first node-routing device and take time, B i toprepresent the maximum transmission rate of i node-routing device (i=1,2,3......), it is known, y jrepresent adjustment factor corresponding when wrapping long L adjusts the j time, wherein 0<y j<1, n and L represent respectively the length of load data bag number and each bag in a branch of bag string, according to t 1/ (t 1+ t 2) × B 1 top=(y j× B i top) ?(formula 1.1), t 2=n × L/B 1 top(formula 1.2), can obtain y by formula 1.1 and 1.2 j=t 1× (B 1 top) 2/ (t 1× B 1 top× B i top+ n × B i top× L) (formula 1.3), set after n, adjust L according to formula 1.3 and can make (y j× B i top)=B ± m, the numerical value that the L value obtaining in the time that equation is set up will be adjusted exactly.
4. the multi-hop wireless network available bandwidth real-time detection method long according to the self-adaptive detection bag described in claims 1, it is characterized in that: according to the Delay feeding back in step (3) and whether successful, judge that the concrete grammar of the scope of available bandwidth is:
Make (y when adjusting L j× B i top)=B+m, and the delay time signal obtaining is monotone increasing, measures successfully, judges that available bandwidth is less than (y j× B i top), in the time measuring next time, just increase L value and make (y j+1× B i top) reduce, thereby dwindling the scope of actual available bandwidth, concrete grammar is to utilize formula 1.3 to increase L value, makes (y j+1× B i top) be reduced to the median of the available bandwidth scope measuring last time;
In measuring in next time, time delay monotone increasing explanation available bandwidth is less than (y j+1× B i top), available bandwidth scope is at [B-m, (y j+1× B i top)];
When not changing, time delay in measurement next time illustrates that now available bandwidth is greater than (y i+1× B i top), now available bandwidth scope at [(y j+1× B i top), B+m];
In the time adjusting bag length for the first time, select to adjust L and make (y j× B i top)=B-m, when the delay time signal obtaining is not change, measures successfully, judges that available bandwidth is greater than (y j× B i top), measure next time and reduce L value, make (y j+1× B i top) increase, thereby dwindling the scope of actual available bandwidth, concrete grammar is to utilize formula 1.3 to reduce L value, makes (y j+1× B i top) increase to the median of the available bandwidth scope measuring last time;
Time delay monotone increasing in measuring next time, available bandwidth scope is at [B-m, (y j+1× B i top)];
In measuring next time, time delay does not change, and available bandwidth scope is at [(y j+1× B i top), B+m];
Each measurement is all long according to the front available bandwidth scope adjustment bag once measuring, and progressively utilizes dichotomy to dwindle the scope of available bandwidth.
CN201310752608.5A 2013-12-31 2013-12-31 The multi-hop wireless network available bandwidth real-time detection method of self-adaptive detection bag length Active CN103825775B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310752608.5A CN103825775B (en) 2013-12-31 2013-12-31 The multi-hop wireless network available bandwidth real-time detection method of self-adaptive detection bag length

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310752608.5A CN103825775B (en) 2013-12-31 2013-12-31 The multi-hop wireless network available bandwidth real-time detection method of self-adaptive detection bag length

Publications (2)

Publication Number Publication Date
CN103825775A true CN103825775A (en) 2014-05-28
CN103825775B CN103825775B (en) 2017-04-05

Family

ID=50760620

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310752608.5A Active CN103825775B (en) 2013-12-31 2013-12-31 The multi-hop wireless network available bandwidth real-time detection method of self-adaptive detection bag length

Country Status (1)

Country Link
CN (1) CN103825775B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104539486A (en) * 2015-01-15 2015-04-22 厦门大学 End-to-end available bandwidth estimating method based on TCP acknowledgement packet pair
CN105634842A (en) * 2014-10-29 2016-06-01 华为技术有限公司 Method and system for detecting bandwidth, and devices
CN106302016A (en) * 2016-08-18 2017-01-04 成都网优力软件有限公司 The method and system of low discharge quick obtaining network physical bandwidth
CN107332729A (en) * 2017-06-16 2017-11-07 西安万像电子科技有限公司 The measuring method and device of available bandwidth
CN107707382A (en) * 2017-08-15 2018-02-16 贵州白山云科技有限公司 A kind of intelligent dispatching method and device
CN108390799A (en) * 2018-03-23 2018-08-10 西安电子科技大学 The measurement method of quantum key distribution network end-to-end available key rate
CN109560995A (en) * 2019-01-11 2019-04-02 武汉虹旭信息技术有限责任公司 The long real-time detecting system of multi-hop wireless network available bandwidth self-adaptive detection packet
WO2020181696A1 (en) * 2019-03-08 2020-09-17 深圳市网心科技有限公司 Network bandwidth evaluation method, device and system, and storage medium
CN114401230A (en) * 2021-12-27 2022-04-26 鹏城实验室 Sending rate control method and device based on cross-data center network communication

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1770711A (en) * 2005-11-18 2006-05-10 史文勇 Method and system for measuring bottleneck bandwidth and remanent bandwidth

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1770711A (en) * 2005-11-18 2006-05-10 史文勇 Method and system for measuring bottleneck bandwidth and remanent bandwidth

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
NINGNING HU ET AL.: "Evaluation and Characterization of Available Bandwidth Probing Techniques", 《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 *
何莉等: "可用带宽测量和瓶颈链路定位技术研究", 《电信科学》 *
韦安明等: "IP网带宽测量技术研究与进展", 《电子学报》 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105634842B (en) * 2014-10-29 2019-01-11 华为技术有限公司 A kind of method, apparatus and system of detection bandwidth
CN105634842A (en) * 2014-10-29 2016-06-01 华为技术有限公司 Method and system for detecting bandwidth, and devices
CN104539486A (en) * 2015-01-15 2015-04-22 厦门大学 End-to-end available bandwidth estimating method based on TCP acknowledgement packet pair
CN106302016A (en) * 2016-08-18 2017-01-04 成都网优力软件有限公司 The method and system of low discharge quick obtaining network physical bandwidth
CN106302016B (en) * 2016-08-18 2019-09-10 成都网优力软件有限公司 The method and system of small flow quick obtaining network physical bandwidth
CN107332729A (en) * 2017-06-16 2017-11-07 西安万像电子科技有限公司 The measuring method and device of available bandwidth
CN107707382A (en) * 2017-08-15 2018-02-16 贵州白山云科技有限公司 A kind of intelligent dispatching method and device
CN108390799A (en) * 2018-03-23 2018-08-10 西安电子科技大学 The measurement method of quantum key distribution network end-to-end available key rate
CN108390799B (en) * 2018-03-23 2021-05-18 西安电子科技大学 Method for measuring end-to-end available key rate of quantum key distribution network
CN109560995A (en) * 2019-01-11 2019-04-02 武汉虹旭信息技术有限责任公司 The long real-time detecting system of multi-hop wireless network available bandwidth self-adaptive detection packet
WO2020181696A1 (en) * 2019-03-08 2020-09-17 深圳市网心科技有限公司 Network bandwidth evaluation method, device and system, and storage medium
CN114401230A (en) * 2021-12-27 2022-04-26 鹏城实验室 Sending rate control method and device based on cross-data center network communication
CN114401230B (en) * 2021-12-27 2023-10-20 鹏城实验室 Transmission rate control method and device based on cross-data center network communication

Also Published As

Publication number Publication date
CN103825775B (en) 2017-04-05

Similar Documents

Publication Publication Date Title
CN103825775A (en) Multi-hop wireless network available bandwidth real-time detection method for adaptively detecting packet length
US7099283B2 (en) Quality of service aware handoff trigger
US9094315B2 (en) Systems and methods for measuring available capacity and tight link capacity of IP paths from a single endpoint
CN102098301B (en) The adaptive data transmission method of multilink and system
CN102045219B (en) High-efficiency single-end available bandwidth measuring method
US20050232227A1 (en) Method and apparatus for characterizing an end-to-end path of a packet-based network
Chen et al. Ad hoc probe: path capacity probing in wireless ad hoc networks
EP3398296B1 (en) Performance measurement in a packet-switched communication network
CN104717108A (en) Network bottleneck bandwidth measurement method based on active measurement and packet gap model
CN103746875A (en) Dichotomy-based multi-hop wireless network available bandwidth self-adaptive detection method
JPWO2014098096A1 (en) Data transmission apparatus, data transmission method, and program thereof
CN104486163A (en) Single end available bandwidth measurement method and terminal adopting same
CN105591960B (en) The method and apparatus for adjusting tunnel load
Farshad et al. On the impact of 802.11 n frame aggregation on end-to-end available bandwidth estimation
CN103974295B (en) Linkage status detection device and its method of work
Zhong et al. Revisited: Bandwidth estimation methods for mobile networks
Sun et al. Senprobe: Path capacity estimation in wireless sensor networks
CN109560995A (en) The long real-time detecting system of multi-hop wireless network available bandwidth self-adaptive detection packet
JP2010193055A (en) Flow information transmitter, intermediate apparatus, flow information transmission method and program
Staehle et al. Measuring one-way delay in wireless mesh networks: an experimental investigation
Kapoor et al. CapProbe: a simple and accurate technique to measure path capacity
Chebrolu et al. Loss behavior analysis and its application in design of link quality metrics
Atzori et al. IP telephony over mobile ad hoc networks: Joint routing and playout buffering
Chen et al. Estimating link capacity in high speed networks
Şimşek et al. Using one-way-delay as QOS routing metric in Mobile Ad Hoc 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
GR01 Patent grant
GR01 Patent grant