Improved Flow Sampling Algorithm on Resource Constraints

Wei An-ming; Wang Hong-bo; Lin Yu; Cheng Shi-duan

doi:10.3724/SP.J.1146.2006.00326

Volume 29 Issue 6

Jan. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2007 > 29(6): 1343-1347

Wei An-ming, Wang Hong-bo, Lin Yu, Cheng Shi-duan. Improved Flow Sampling Algorithm on Resource Constraints[J]. Journal of Electronics & Information Technology, 2007, 29(6): 1343-1347. doi: 10.3724/SP.J.1146.2006.00326

Citation:

Wei An-ming, Wang Hong-bo, Lin Yu, Cheng Shi-duan. Improved Flow Sampling Algorithm on Resource Constraints[J]. Journal of Electronics & Information Technology, 2007, 29(6): 1343-1347. doi: 10.3724/SP.J.1146.2006.00326

Citation:

PDF( 271 KB)

Improved Flow Sampling Algorithm on Resource Constraints

doi: 10.3724/SP.J.1146.2006.00326

Received Date: 2006-03-20
Rev Recd Date: 2007-03-12
Publish Date: 2007-06-19

Abstract

Abstract

This paper analyzes the relationship between the Sampling Rate (SR) and Sampling Loss Rate of Elephant Flows (SLREF) of hardflow. Then two improved algorithms are proposed to reduce the ratio of SLREF to SR(rd ). The relative error and the parameters setting are discussed with various sampling buffer sizes and various measurement periods. Compared to the hardflow, the results show that rd of the two improved algorithms decrease 1.4 and 6.6 respectively when SR is low (e.g. 4.5%). Furthermore, all rd incline to zero when SR is large (e.g. 11.3%).

FullText(HTML)