講演抄録/キーワード |
講演名 |
2015-07-02 11:35
A Modified Excursion Detection Algorithm for Efficient Measurement of Available Bandwidth Along End-to-End Network Path ○Anup Kumar Paul・Atsuo Tachibana・Teruyuki Hasegawa(KDDI R&D LABS) CS2015-14 |
抄録 |
(和) |
In this paper, we have developed a modified excursion
detection algorithm from the one way queuing delay faced
by each packet in a train of packets along the end to end network
path. Pathchirp's original excursion detection algorithm has been
modified and our previous work NEXT has been extended for
better estimation of the available bandwidth (AB). The main
principle is that, if a certain packet?s rate is below the AB along
the network path, then no queuing delay occurs and vice versa.
But due to the bursty arrival of cross traffics, a sudden increase
of queuing delays of packets (called excursion) occur for a short
period of time in the router even though the packet?s rate is
much below the AB of the tight link. So, to detect these sudden
increase of queuing delays and to filter out them is the main
purpose of the excursion detection algorithm. We have classified
whether a certain packet lies inside the excursion region or not
based on the queuing delay of it as well as all other previous
packet?s queuing delay. If a certain packet?s queuing delay is less
than the average of the queuing delay faced by all other packets
before it, then this packet?s queuing delay is not considered inside
the excursion region as well as the corresponding rate is not
treated as the turning point (available bandwidth) of the queuing
delay signature. Simulation results reveal that, our extended
idea achieves better performance than Pathchirp and overcomes
underestimation problem in many cases. |
(英) |
In this paper, we have developed a modified excursion
detection algorithm from the one way queuing delay faced
by each packet in a train of packets along the end to end network
path. Pathchirp's original excursion detection algorithm has been
modified and our previous work NEXT has been extended for
better estimation of the available bandwidth (AB). The main
principle is that, if a certain packet?s rate is below the AB along
the network path, then no queuing delay occurs and vice versa.
But due to the bursty arrival of cross traffics, a sudden increase
of queuing delays of packets (called excursion) occur for a short
period of time in the router even though the packet?s rate is
much below the AB of the tight link. So, to detect these sudden
increase of queuing delays and to filter out them is the main
purpose of the excursion detection algorithm. We have classified
whether a certain packet lies inside the excursion region or not
based on the queuing delay of it as well as all other previous
packet?s queuing delay. If a certain packet?s queuing delay is less
than the average of the queuing delay faced by all other packets
before it, then this packet?s queuing delay is not considered inside
the excursion region as well as the corresponding rate is not
treated as the turning point (available bandwidth) of the queuing
delay signature. Simulation results reveal that, our extended
idea achieves better performance than Pathchirp and overcomes
underestimation problem in many cases. |
キーワード |
(和) |
Available Bandwidth / Excursion Detection / Probe Rate Model / Queuing Delay Signature / NEXT / / / |
(英) |
Available Bandwidth / Excursion Detection / Probe Rate Model / Queuing Delay Signature / NEXT / / / |
文献情報 |
信学技報, vol. 115, no. 123, CS2015-14, pp. 27-32, 2015年7月. |
資料番号 |
CS2015-14 |
発行日 |
2015-06-25 (CS) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
査読に ついて |
本技術報告は査読を経ていない技術報告であり,推敲を加えられていずれかの場に発表されることがあります. |
PDFダウンロード |
CS2015-14 |
|