Abstract
In connection with port scan and worm propagation in the Internet, we address in this paper the problem of estimating the ber of destinations communicating with a given source. We propose a computational and memory-efficient technique of finding the top-talker sources. The proposed algorithm is tested against actual data (NetFlow records from the interconnection IP backbone network of France Telecom).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Flajolet, P., Martin, G.N.: Probabilistic counting. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (1983)
Durand, M., Flajolet, P.: Loglog counting of large cardinalities. In: Proceedings of the 11th Annual European Symposium on Algorithms (September 2003)
Whang, K.Y., Vander-Zanden, B.T., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. In: IEEE transaction of Database Systems (June 1990)
Estan, C., Varghese, G.: New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice. In: Proceedings of ACM Transactions on Database Systems (August 2003)
Venkataraman, S., Song, D., Gibbons, P.B., Blum, A.: New streaming algorithms for fast detection of superspreaders. In: Proceedings of the 12th Annual Network & Distributed System Security Symposium (February 2005)
Zhao, Q., Kumar, A., Xu, J.: Joint data streaming and sampling techniques for detection of super sources and destinations. In: Proceedings of ACM Internet Measurement Conference (October 2005)
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, Springer, Heidelberg (2002)
Introduction to Cisco IOS NetFlow, http://www.cisco.com/application/pdf/en/us/guest/products/ps6601/c1244/cdccont_0900aecd80406232.pdf
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Truong, P., Guillemin, F. (2007). Estimating Local Cardinalities in a Multidimensional Multiset. In: Bandara, A.K., Burgess, M. (eds) Inter-Domain Management. AIMS 2007. Lecture Notes in Computer Science, vol 4543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72986-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-72986-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72985-3
Online ISBN: 978-3-540-72986-0
eBook Packages: Computer ScienceComputer Science (R0)