Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Brownlee, N., Mills, C., Ruth, G.: Traffic Flow Measurement: Architecture. RFC 2722 (October 1999)
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)
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)
Estan, C., Varghese, G.: New Directions in Traffic Measurement and Accounting. In: Proceedings of the ACM SIGCOMM 2002, Pittsburgh, P.A., USA (August 2002)
Bloom, B.: Space/Time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
Cohen, S., Matias, Y.: Spectral Bloom Filters. In: Proceedings of the ACM SIGMOD 2003, San Diego, C.A., USA (June 2003)
Kumar, A., Xu, J., et al.: Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement. In: IEEE Infocom 2004, Hongkong, China (March 2004)
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)
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)
Estan, C., Varghese, G., Fisk, M.: Bitmap Algorithms For Counting Active Flows On High Speed Links. In: Proceedings of the ACM IMW (2003)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mingzhong, Z., Jian, G., Wei, D. (2006). A New Algorithm for Long Flows Statistics—MGCBF. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758549_15
Download citation
DOI: https://doi.org/10.1007/11758549_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34385-1
Online ISBN: 978-3-540-34386-8
eBook Packages: Computer ScienceComputer Science (R0)