Title :
Estimating the number of active flows from sampled packets
Author_Institution :
Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
Abstract :
A flow is active during a measurement period if it sends at least one packet. It is essential to control resource consumption in network monitoring by traffic sampling, so most high-end routers provide sampling network traffic function. The number of original flow is an important metrics to many network applications such as congestion control and network security. In this paper, we present a EUF algorithm that can accurately infer the number of original flow from the sampled packet traffic. Using the EUF algorithm, the number of unsampled flows can be estimated by an iteration method based on random sampling, and then the number of original flows can be precisely estimated according to both the number of the sampled flows and the unsampled flow. The EUF algorithm is also compared with the EM algorithm using multiple traffic traces collected from a Tier-1 ISP backbone networks. The result shows that the EUF algorithm is superior to EM and can provide highly accurate estimation on the number of the original flow.
Keywords :
computer network performance evaluation; iterative methods; random processes; resource allocation; sampling methods; telecommunication congestion control; telecommunication network routing; telecommunication traffic; EUF algorithm; Tier-1 ISP backbone networks; active flows; congestion control; high-end routers; iteration method; network applications; network monitoring; network security; random sampling; resource consumption; sampled packet traffic; sampling network traffic function; unsampled flow; Algorithm design and analysis; Computational complexity; Educational institutions; Estimation; IP networks; Intrusion detection; Monitoring;
Conference_Titel :
Network Operations and Management Symposium (NOMS), 2012 IEEE
Conference_Location :
Maui, HI
Print_ISBN :
978-1-4673-0267-8
Electronic_ISBN :
1542-1201
DOI :
10.1109/NOMS.2012.6211984