| 講演名 | 2015-07-02 A Modified Excursion Detection Algorithm for Efficient Measurement of Available Bandwidth Along End-to-End Network Path Anup Kumar Paul(KDDI R&D LABS), Atsuo Tachibana(KDDI R&D LABS), Teruyuki Hasegawa(KDDI R&D LABS), |
|---|---|
| PDFダウンロードページ |  PDFダウンロードページへ |
| 抄録(和) | In this paper, we have developed a modified excursiondetection algorithm from the one way queuing delay facedby each packet in a train of packets along the end to end networkpath. Pathchirp's original excursion detection algorithm has beenmodified and our previous work NEXT has been extended forbetter estimation of the available bandwidth (AB). The mainprinciple is that, if a certain packet?s rate is below the AB alongthe network path, then no queuing delay occurs and vice versa. But due to the bursty arrival of cross traffics, a sudden increaseof queuing delays of packets (called excursion) occur for a shortperiod of time in the router even though the packet?s rate ismuch below the AB of the tight link. So, to detect these suddenincrease of queuing delays and to filter out them is the mainpurpose of the excursion detection algorithm. We have classifiedwhether a certain packet lies inside the excursion region or notbased on the queuing delay of it as well as all other previouspacket?s queuing delay. If a certain packet?s queuing delay is lessthan the average of the queuing delay faced by all other packetsbefore it, then this packet?s queuing delay is not considered insidethe excursion region as well as the corresponding rate is nottreated as the turning point (available bandwidth) of the queuingdelay signature. Simulation results reveal that, our extendedidea achieves better performance than Pathchirp and overcomesunderestimation problem in many cases. |
| 抄録(英) | In this paper, we have developed a modified excursiondetection algorithm from the one way queuing delay facedby each packet in a train of packets along the end to end networkpath. Pathchirp's original excursion detection algorithm has beenmodified and our previous work NEXT has been extended forbetter estimation of the available bandwidth (AB). The mainprinciple is that, if a certain packet?s rate is below the AB alongthe network path, then no queuing delay occurs and vice versa. But due to the bursty arrival of cross traffics, a sudden increaseof queuing delays of packets (called excursion) occur for a shortperiod of time in the router even though the packet?s rate ismuch below the AB of the tight link. So, to detect these suddenincrease of queuing delays and to filter out them is the mainpurpose of the excursion detection algorithm. We have classifiedwhether a certain packet lies inside the excursion region or notbased on the queuing delay of it as well as all other previouspacket?s queuing delay. If a certain packet?s queuing delay is lessthan the average of the queuing delay faced by all other packetsbefore it, then this packet?s queuing delay is not considered insidethe excursion region as well as the corresponding rate is nottreated as the turning point (available bandwidth) of the queuingdelay signature. Simulation results reveal that, our extendedidea achieves better performance than Pathchirp and overcomesunderestimation 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 |
| 資料番号 | CS2015-14 |
| 発行日 | 2015-06-25 (CS) |
| 研究会情報 | |
| 研究会 | CS |
|---|---|
| 開催期間 | 2015/7/2(から2日開催) |
| 開催地（和） | イーフ情報プラザ（久米島） |
| 開催地（英） | Eef Information Plaza (Kumejima Is.) |
| テーマ（和） | 次世代ネットワーク，アクセスネットワーク，ブロードバンドアクセス方式，電力線通信，無線通信方式，符号化方式，一般 |
| テーマ（英） | Next generation networks, access network, broadband access system, power-line communications, wireless communication systems, coding system, etc. |
| 委員長氏名（和） | 坪井 利憲(東京工科大) |
| 委員長氏名（英） | Toshinori Tsuboi(Tokyo Univ. of Tech.) |
| 副委員長氏名（和） | 横谷 哲也(三菱電機) |
| 副委員長氏名（英） | Tetsuya Yokotani(Mitsubishi Electric) |
| 幹事氏名（和） | 高橋 賢(広島市大) / 谷口 友宏(NTT) |
| 幹事氏名（英） | Satoshi Takahashi(Hiroshima City Univ.) / Tomohiro Taniguchi(NTT) |
| 幹事補佐氏名（和） | |
| 幹事補佐氏名（英） | |
| 講演論文情報詳細 | |
| 申込み研究会 | Technical Committee on Communication Systems |
|---|---|
| 本文の言語 | ENG |
| タイトル（和） | |
| サブタイトル（和） | |
| タイトル（英） | A Modified Excursion Detection Algorithm for Efficient Measurement of Available Bandwidth Along End-to-End Network Path |
| サブタイトル（和） | |
| キーワード(1)（和/英） | Available Bandwidth / Available Bandwidth |
| キーワード(2)（和/英） | Excursion Detection / Excursion Detection |
| キーワード(3)（和/英） | Probe Rate Model / Probe Rate Model |
| キーワード(4)（和/英） | Queuing Delay Signature / Queuing Delay Signature |
| キーワード(5)（和/英） | NEXT / NEXT |
| 第 1 著者 氏名（和/英） | Anup Kumar Paul / Anup Kumar Paul |
| 第 1 著者 所属（和/英） | KDDI R&D Laboratories Inc.(略称：KDDI R&D LABS) KDDI R&D Laboratories Inc.(略称：KDDI R&D LABS) |
| 第 2 著者 氏名（和/英） | Atsuo Tachibana / Atsuo Tachibana |
| 第 2 著者 所属（和/英） | KDDI R&D Laboratories Inc.(略称：KDDI R&D LABS) KDDI R&D Laboratories Inc.(略称：KDDI R&D LABS) |
| 第 3 著者 氏名（和/英） | Teruyuki Hasegawa / Teruyuki Hasegawa |
| 第 3 著者 所属（和/英） | KDDI R&D Laboratories Inc.(略称：KDDI R&D LABS) KDDI R&D Laboratories Inc.(略称：KDDI R&D LABS) |
| 発表年月日 | 2015-07-02 |
| 資料番号 | CS2015-14 |
| 巻番号（vol） | vol.115 |
| 号番号（no） | CS-123 |
| ページ範囲 | pp.27-32(CS), |
| ページ数 | 6 |
| 発行日 | 2015-06-25 (CS) |