{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:33:20Z","timestamp":1725532400613},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013980"},{"type":"electronic","value":"9783642013997"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01399-7_7","type":"book-chapter","created":{"date-parts":[[2009,5,6]],"date-time":"2009-05-06T05:18:41Z","timestamp":1241587121000},"page":"79-91","source":"Crossref","is-referenced-by-count":7,"title":["Counting Flows over Sliding Windows in High Speed Networks"],"prefix":"10.1007","author":[{"given":"Josep","family":"Sanju\u00e0s-Cuxart","sequence":"first","affiliation":[]},{"given":"Pere","family":"Barlet-Ros","sequence":"additional","affiliation":[]},{"given":"Josep","family":"Sol\u00e9-Pareta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high speed links. In: Proc. of ACM SIGCOMM Internet Measurement Conf. (October 2003)","DOI":"10.1145\/948205.948225"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Fusy, E., Giroire, F.: Estimating the number of Active Flows in a Data Stream over a Sliding Window. In: Proc. of SIAM Workshop on Analytic Algorithmics and Combinatorics (January 2007)","DOI":"10.1137\/1.9781611972979.9"},{"key":"7_CR3","unstructured":"Kim, H., O\u2019Hallaron, D.: Counting network flows in real time. In: Proc. of IEEE GLOBECOM (December 2003)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Fang, W., Peterson, L.: Inter-AS traffic patterns and their implications. In: Proc. of IEEE GLOBECOM (December 1999)","DOI":"10.1109\/GLOCOM.1999.832484"},{"key":"7_CR5","unstructured":"Cisco Systems: NetFlow services and applications. White Paper (2000)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Barlet-Ros, P., Iannaccone, G., Sanju\u00e0s-Cuxart, J., Amores-L\u00f3pez, D., Sol\u00e9-Pareta, J.: Load shedding in network monitoring applications. In: Proc. of USENIX Annual Technical Conf. (June 2007)","DOI":"10.1007\/978-3-540-72606-7_95"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Duffield, N., Lund, C., Thorup, M.: Properties and prediction of flow statistics from sampled packet streams. In: Proc. of ACM SIGCOMM Internet Measurement Workshop (November 2002)","DOI":"10.1145\/637201.637225"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Whang, K.Y., Vander-Zanden, B.T., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst.\u00a015(2) (June 1990)","DOI":"10.1145\/78922.78925"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Durand, M., Flajolet, P.: Loglog Counting of Large Cardinalities. In: Proc. of Annual European Symposium on Algorithms (September 2003)","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Giroire, F.: Order statistics and estimating cardinalities of massive data sets. In: Proc. of Intl. Conf. on Analysis of Algorithms (June 2005)","DOI":"10.46298\/dmtcs.3353"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic. In: Proc. of Intl. Conf. on Extending Database Technology: Advances in Database Technology (March 2008)","DOI":"10.1145\/1353343.1353418"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. of ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (June 2002)","DOI":"10.1145\/543613.543615"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Golab, L., \u00d6zsu, T.M.: Issues in data stream management. SIGMOD Record\u00a032 (June 2003)","DOI":"10.1145\/776985.776986"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Cranor, C., Johnson, T., Spataschek, O., Shkapenyuk, V.: Gigascope: A stream database for network applications. In: Proc. of ACM SIGMOD (June 2003)","DOI":"10.1145\/872757.872838"},{"key":"7_CR15","unstructured":"Iannaccone, G.: Fast prototyping of network data mining applications. In: Proc. of Passive and Active Measurement Conf. (March 2006)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Reiss, F., Hellerstein, J.M.: Declarative network monitoring with an underprovisioned query processor. In: Proc. of IEEE Intl. Conf. on Data Engineering (April 2006)","DOI":"10.1109\/ICDE.2006.46"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms And Applications. Now Publishers Inc. (2005)","DOI":"10.1561\/0400000002"},{"key":"7_CR18","unstructured":"Hayes, B.: The Britney Spears Problem, http:\/\/www.americanscientist.org\/issues\/pub\/the-britney-spears-problem"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. In: Proc. of ACM-SIAM Symp. on Discrete Algorithms (January 2002)","DOI":"10.1137\/S0097539701398363"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci.\u00a018 (April 1979)","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"7_CR21","unstructured":"Jacobson, V., Leres, C., McCanne, S. (libpcap) Lawrence Berkeley Laboratory, Berkeley, CA. Initial public release (June 1994), http:\/\/www.tcpdump.org"},{"key":"7_CR22","unstructured":"Endace: DAG network monitoring cards, http:\/\/www.endace.com"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Golab, L., DeHaan, D., Demaine, E., Lopez-Ortiz, A., Munro, J.: Identifying frequent items in sliding windows over on-line packet streams. In: Proc. of ACM SIGCOMM Internet Measurement Conf. (October 2003)","DOI":"10.1145\/948205.948227"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Sanju\u00e0s-Cuxart, J., Barlet-Ros, P., Sol\u00e9-Pareta, J.: Counting network flows over sliding windows in high-speed networks. UPC Technical Report, http:\/\/loadshedding.ccaba.upc.edu\/papers\/counting-network-flows.techrep2008.pdf","DOI":"10.1007\/978-3-642-01399-7_7"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01399-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:20:58Z","timestamp":1633393258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01399-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013980","9783642013997"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01399-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}