Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
New directions in traffic measurement and accounting
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Identifying Long-Term High-Bandwidth Flows at a Router
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Finding Frequent Items in Data Streams
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A simple algorithm for finding frequent elements in streams and bags
ACM Transactions on Database Systems (TODS)
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Bitmap algorithms for counting active flows on high speed links
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Space-code bloom filter for efficient traffic flow measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
| Hi-index | 0.00 |
Long flows identification and characteristics analysis play more and more important role in modern traffic analysis because long flows take main traffic payload of network. Based on the flows length distribution and long flows characteristics of the Internet, this paper presents a novel long flows’ counting and information maintenance algorithm called Multi-granularity Counting Bloom Filter (MGCBF). Using a little fix memory, the MGCBF maintains the counters for all incoming flows with small error probability, and keeps information of long flows whose length are bigger than an optional threshold set by users. This paper builds up an architecture for long flows’ information statistics based on this algorithm. And the space used, calculation complexity and error probability of this architecture are also discussed at following. The experiment applied this architecture on the CERNET TRACEs, which indicates that the MGCBF algorithm can reduce the resource usage in counting flows and flows information maintenance dramatically with losing little measurement’s accuracy.