A probability-guaranteed adaptive timeout algorithm for high-speed network flow detection

被引:3
作者
Wang, JF [1 ]
Li, L
Sun, FC
Zhou, MT
机构
[1] Chinese Acad Sci, Inst Software, Lab Gen Software, Beijing 100080, Peoples R China
[2] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[3] Univ Elect Sci & Technol China, Coll Comp Sci & Engn, Chengdu 610054, Peoples R China
关键词
passive network measurement; flow termination decision; flow compression;
D O I
10.1016/j.comnet.2004.11.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Collecting network traffic is becoming a more challenging task in passive network measurement due to the rapid growth of link speed. Flow-based network traffic capture and storage provides an efficient way for high-speed network measurement. The paper concentrates on the flow detection issue which is also the premise for further flow-based traffic analysis and modeling in such challenging environment. Based on the statistical investigation of the correlations between flow size and the maximum packet interarrival time within a flow, we obtain the empirical conditional distribution functions for some popular TCP protocol-based application flows, and then propose a Probability-Guaranteed Adaptive Timeout algorithm (PGAT) for flow termination decision. The assessment criteria for flow termination decision algorithm is systematically developed. Comparisons onflow generation ratio,flow intact ratio, and meanflow extra retaining time metrics indicate that the PGAT algorithm can obtain more attractive performance than other related works. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:215 / 233
页数:19
相关论文
共 21 条
[1]  
Barakat C, 2002, IMW 2002: PROCEEDINGS OF THE SECOND INTERNET MEASUREMENT WORKSHOP, P35, DOI 10.1145/637201.637206
[2]   Modeling Internet backbone traffic at the flow level [J].
Barakat, C ;
Thiran, P ;
Iannaccone, G ;
Diot, C ;
Owezarski, P .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2003, 51 (08) :2111-2124
[3]  
BENFREDJ S, 2001, P ACM SIGCOMM 2001 A
[4]   Understanding Internet traffic streams: Dragonflies and tortoises [J].
Brownlee, N ;
Claffy, KC .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (10) :110-117
[5]   A PARAMETERIZABLE METHODOLOGY FOR INTERNET TRAFFIC FLOW PROFILING [J].
CLAFFY, KC ;
BRAUN, HW ;
POLYZOS, GC .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (08) :1481-1494
[6]  
CLEARY JG, 2001, P PASS ACT MEAS WORK
[7]  
ESTAN C, 2001, P 1 ACM SIGCOMM WORK, P267
[8]  
ESTAN C, 2001, P ACM SIGCOMM INT ME
[9]  
FRALEIGH C, 2001, P PASS ACT MEAS WORK
[10]  
Iannaccone G, 2001, IMW 2001: PROCEEDINGS OF THE FIRST ACM SIGCOMM INTERNET MEASUREMENT WORKSHOP, P267