MONITORING LARGE FLOWS IN NETWORK

摘要

In order to provide high quality networkmanagement, traffic scheduling and network security, weneed the per flow traffic information. However, in a highspeednet link, the flows number is so large that it isinfeasible to gather and process all flows’ informationaccurately and efficiently. Several studies showed that asmall percentage of flows account for most of the totalnetwork throughput. Therefore, monitoring just the highspeedflows is an efficient and practical method in trafficcontrol. Before being able to monitor large flows, theymust be distinguished first. Several papers have studiedthe problem of finding large flows, but the methods areeither too complicated or request relatively too muchmemory and computation resources. In this paper, wepresent and analyze a simple but efficient algorithm tofigure out the elephant flows. The proposed method onlyneed few counters and can figure out nearly all thepredefined large flows.