A New Algorithm for Long Flows Statistics—MGCBF

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3994)


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.


Error Probability Flow Information Flow Number Flow Identification Bloom Filter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Brownlee, N., Mills, C., Ruth, G.: Traffic Flow Measurement: Architecture. RFC 2722 (October 1999)Google Scholar
  2. 2.
    Smitha, Kim, I., Reddy, A.L.N.: Identifying Long Term High Rate Flows At A Router. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds.) HiPC 2001. LNCS, vol. 2228, p. 361. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Shaikh, A., Rexford, J., Shin, K.G.: Load-Sensitive Routing of Long-Lived IP Flows. In: Proceedings of the ACM SIGCOMM 1999, Cambridge, M.A., USA (August 1999)Google Scholar
  4. 4.
    Estan, C., Varghese, G.: New Directions in Traffic Measurement and Accounting. In: Proceedings of the ACM SIGCOMM 2002, Pittsburgh, P.A., USA (August 2002)Google Scholar
  5. 5.
    Bloom, B.: Space/Time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)zbMATHCrossRefGoogle Scholar
  6. 6.
    Cohen, S., Matias, Y.: Spectral Bloom Filters. In: Proceedings of the ACM SIGMOD 2003, San Diego, C.A., USA (June 2003)Google Scholar
  7. 7.
    Kumar, A., Xu, J., et al.: Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement. In: IEEE Infocom 2004, Hongkong, China (March 2004)Google Scholar
  8. 8.
    Karp, R.M., Shenker, S., Papadimitriou, C.H.: A Simple Algorithm For Finding Frequent Elements In Streams And Bags. ACM Transactions on Database Systems (TODS) 28, 51–55 (2003)CrossRefGoogle Scholar
  9. 9.
    Charikar, M., Chen, K., Farach-Colton, M.: Finding Frequent Items In Data Streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, p. 693. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
    Estan, C., Varghese, G., Fisk, M.: Bitmap Algorithms For Counting Active Flows On High Speed Links. In: Proceedings of the ACM IMW (2003)Google Scholar
  11. 11.
    Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. IEEE/ACM Transactions on Networking 8(3), 281–293 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringSoutheast UnivercityNanjingChina

Personalised recommendations