RTT Estimation with Sampled Flow Data

Qi SU; Jian GONG; Xiaoyan HU

doi:10.1587/transcom.E98.B.1848

RTT Estimation with Sampled Flow Data

Qi SU, Jian GONG, Xiaoyan HU

Full Text Views

0

Share
Cite this

Summary :

Round-trip time (RTT) is an important performance metric. Traditional RTT estimation methods usually depend on the cooperation of other networks and particular active or passive measurement platforms, whose global deployments are costly and difficult. Thus a new RTT estimation algorithm, ME algorithm, is introduced. It can estimate the RTT of two hosts communicating through border routers by using TCP CUBIC bulk flow data from those routhers without the use of extra facilities, which makes the RTT estimation in large-scale high-speed networks more effective. In addition, a simpler and more accurate algorithm — AE algorithm — is presented and used when the link has large bandwidth and low packet loss rate. The two proposed algorithms suit sampled flow data because only duration and total packet number of a TCP CUBIC bulk flow are inputs to their calculations. Experimental results show that both algorithms work excellently in real situations. Moreover, they have the potential to be adapted to other TCP versions with slight modification as their basic idea is independent of the TCP congestion control mechanism.

Publication: IEICE TRANSACTIONS on Communications Vol.E98-B No.9 pp.1848-1857

Publication Date: 2015/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E98.B.1848

Type of Manuscript: PAPER

Category: Network Management/Operation

Authors

Qi SU
  Southeast University,the Jiangsu Provincial Key Laboratory of Computer Network Technology
Jian GONG
  Southeast University,the Jiangsu Provincial Key Laboratory of Computer Network Technology
Xiaoyan HU
  Southeast University,the Jiangsu Provincial Key Laboratory of Computer Network Technology

Keyword

RTT estimation, sampled flow data, network measurement, network management, Markov chain

Cite this

Copy

Qi SU, Jian GONG, Xiaoyan HU, "RTT Estimation with Sampled Flow Data" in IEICE TRANSACTIONS on Communications, vol. E98-B, no. 9, pp. 1848-1857, September 2015, doi: 10.1587/transcom.E98.B.1848.
Abstract: Round-trip time (RTT) is an important performance metric. Traditional RTT estimation methods usually depend on the cooperation of other networks and particular active or passive measurement platforms, whose global deployments are costly and difficult. Thus a new RTT estimation algorithm, ME algorithm, is introduced. It can estimate the RTT of two hosts communicating through border routers by using TCP CUBIC bulk flow data from those routhers without the use of extra facilities, which makes the RTT estimation in large-scale high-speed networks more effective. In addition, a simpler and more accurate algorithm — AE algorithm — is presented and used when the link has large bandwidth and low packet loss rate. The two proposed algorithms suit sampled flow data because only duration and total packet number of a TCP CUBIC bulk flow are inputs to their calculations. Experimental results show that both algorithms work excellently in real situations. Moreover, they have the potential to be adapted to other TCP versions with slight modification as their basic idea is independent of the TCP congestion control mechanism.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.1848/_p

Copy

@ARTICLE{e98-b_9_1848,
author={Qi SU, Jian GONG, Xiaoyan HU, },
journal={IEICE TRANSACTIONS on Communications},
title={RTT Estimation with Sampled Flow Data},
year={2015},
volume={E98-B},
number={9},
pages={1848-1857},
abstract={Round-trip time (RTT) is an important performance metric. Traditional RTT estimation methods usually depend on the cooperation of other networks and particular active or passive measurement platforms, whose global deployments are costly and difficult. Thus a new RTT estimation algorithm, ME algorithm, is introduced. It can estimate the RTT of two hosts communicating through border routers by using TCP CUBIC bulk flow data from those routhers without the use of extra facilities, which makes the RTT estimation in large-scale high-speed networks more effective. In addition, a simpler and more accurate algorithm — AE algorithm — is presented and used when the link has large bandwidth and low packet loss rate. The two proposed algorithms suit sampled flow data because only duration and total packet number of a TCP CUBIC bulk flow are inputs to their calculations. Experimental results show that both algorithms work excellently in real situations. Moreover, they have the potential to be adapted to other TCP versions with slight modification as their basic idea is independent of the TCP congestion control mechanism.},
keywords={},
doi={10.1587/transcom.E98.B.1848},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - RTT Estimation with Sampled Flow Data
T2 - IEICE TRANSACTIONS on Communications
SP - 1848
EP - 1857
AU - Qi SU
AU - Jian GONG
AU - Xiaoyan HU
PY - 2015
DO - 10.1587/transcom.E98.B.1848
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2015
AB - Round-trip time (RTT) is an important performance metric. Traditional RTT estimation methods usually depend on the cooperation of other networks and particular active or passive measurement platforms, whose global deployments are costly and difficult. Thus a new RTT estimation algorithm, ME algorithm, is introduced. It can estimate the RTT of two hosts communicating through border routers by using TCP CUBIC bulk flow data from those routhers without the use of extra facilities, which makes the RTT estimation in large-scale high-speed networks more effective. In addition, a simpler and more accurate algorithm — AE algorithm — is presented and used when the link has large bandwidth and low packet loss rate. The two proposed algorithms suit sampled flow data because only duration and total packet number of a TCP CUBIC bulk flow are inputs to their calculations. Experimental results show that both algorithms work excellently in real situations. Moreover, they have the potential to be adapted to other TCP versions with slight modification as their basic idea is independent of the TCP congestion control mechanism.
ER -