{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:12:11Z","timestamp":1750824731569,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662556955"},{"type":"electronic","value":"9783662556962"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-55696-2_1","type":"book-chapter","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T07:02:19Z","timestamp":1502089339000},"page":"1-39","source":"Crossref","is-referenced-by-count":1,"title":["Lightweight Metric Computation for Distributed Massive Data Streams"],"prefix":"10.1007","author":[{"given":"Emmanuelle","family":"Anceaume","sequence":"first","affiliation":[]},{"given":"Yann","family":"Busnel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,8]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Lakhina, A., Crovella, M., Diot, C.: Mining anomalies using traffic feature distributions. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) (2005)","DOI":"10.1145\/1080091.1080118"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Qiu, T., Ge, Z., Pei, D., Wang, J., Xu, J.: What happened in my network: mining network events from router syslogs. In: Proceedings of the 10th ACM Conference on Internet Measurement (IMC) (2010)","DOI":"10.1145\/1879141.1879202"},{"issue":"2","key":"1_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TSMCA.2006.889480","volume":"37","author":"DS Yeung","year":"2007","unstructured":"Yeung, D.S.: Covariance-matrix modeling and detecting various flooding attacks. IEEE Trans. Syst. Man Cybernet. Part A 37(2), 157\u2013169 (2007)","journal-title":"IEEE Trans. Syst. Man Cybernet. Part A"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11423409_13","volume-title":"Privacy Enhancing Technologies","author":"Y Zhu","year":"2005","unstructured":"Zhu, Y., Fu, X., Graham, B., Bettati, R., Zhao, W.: On flow correlation attacks and countermeasures in mix networks. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 207\u2013225. Springer, Heidelberg (2005). doi: 10.1007\/11423409_13"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ganguly, S., Garafalakis, M., Rastogi, R., Sabnani, K.: Streaming algorithms for robust, real-time detection of ddos attacks. In: Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS) (2007)","DOI":"10.1109\/ICDCS.2007.142"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Jin, S., Yeung, D.: A covariance analysis model for ddos attack detection. In: 4th IEEE International Conference on Communications (ICC), vol. 4, pp. 1882\u20131886 (2004)","DOI":"10.1109\/ICC.2004.1312847"},{"key":"1_CR7","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-39564-7_14","volume-title":"Advanced Information Systems Engineering Workshops","author":"O Pinarer","year":"2016","unstructured":"Pinarer, O., Gripay, Y., Servigne, S., Ozgovde, A.: Energy enhancement of multi-application monitoring systems for smart buildings. In: Krogstie, J., Mouratidis, H., Su, J. (eds.) CAiSE 2016. LNBIP, vol. 249, pp. 131\u2013142. Springer, Cham (2016). doi: 10.1007\/978-3-319-39564-7_14"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Boubrima, A., Matigot, F., Bechkit, W., Rivano, H., Ruas, A.: Optimal deployment of wireless sensor networks for air pollution monitoring. In: 24th International Conference on Computer Communication and Networks (ICCCN), Las Vegas, USA, August 2015","DOI":"10.1109\/ICCCN.2015.7288443"},{"issue":"1","key":"1_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/JIOT.2014.2312291","volume":"1","author":"JA Stankovic","year":"2014","unstructured":"Stankovic, J.A.: Research directions for the internet of things. IEEE Internet Things J. 1(1), 3\u20139 (2014)","journal-title":"IEEE Internet Things J."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-17653-1_5","volume-title":"Principles of Distributed Systems","author":"E Anceaume","year":"2010","unstructured":"Anceaume, E., Busnel, Y., Gambs, S.: Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 64\u201378. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-17653-1_5"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45726-7_1","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Z Bar-Yossef","year":"2002","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 1\u201310. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45726-7_1"},{"issue":"2","key":"1_CR12","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct element problem. In: Proceedings of the Symposium on Principles of Databases (PODS) (2010)","DOI":"10.1145\/1807085.1807094"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC), pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"1_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"1_CR16","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A.: A near-optimal algorithm for computing the entropy of a stream. In. ACM-SIAM Symposium on Discrete Algorithms, pp. 328\u2013335 (2007)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Lall, A., Sekar, V., Ogihara, M., Xu, J., Zhang, H.: Data streaming algorithms for estimating entropy of network traffic. In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS). ACM (2006)","DOI":"10.1145\/1140277.1140295"},{"key":"1_CR18","first-page":"102","volume":"11","author":"E Anceaume","year":"2013","unstructured":"Anceaume, E., Busnel, Y., Gambs, S.: On the power of the adversary to solve the node sampling problem. Trans. Large-Scale Data Knowl. Centered Syst. (TLDKS) 11, 102\u2013126 (2013)","journal-title":"Trans. Large-Scale Data Knowl. Centered Syst. (TLDKS)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Busnel, Y.: An information divergence estimation over data streams. In: Proceedings of the 11th IEEE International Symposium on Network Computing and Applications (NCA) (2012)","DOI":"10.1109\/NCA.2012.16"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11672142_15","volume-title":"STACS 2006","author":"A Chakrabarti","year":"2006","unstructured":"Chakrabarti, A., Ba, K., Muthukrishnan, S.: Estimating entropy and entropy norm on data streams. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 196\u2013205. Springer, Heidelberg (2006). doi: 10.1007\/11672142_15"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Guha, S., McGregor, A., Venkatasubramanian, S.: Streaming and sublinear approximation of entropy and information distances. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 733\u2013742 (2006)","DOI":"10.1145\/1109557.1109637"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Rivetti, N., Busnel, Y., Querzoni, L.: Load-aware shedding in stream processing systems. In: Proceedings of the 10th ACM International Conference on Distributed Event-Based Systems (DEBS), Ivine, CA, USA, June 2016","DOI":"10.1145\/2933267.2933311"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Rivetti, N., Anceaume, E., Busnel, Y., Querzoni, L., Sericola, B.: Online scheduling for shuffle grouping in distributed stream processing systems. In: Proceedings of the 17th ACM\/IFIP\/USENIX 13th International Conference on Middleware (Middleware), Trento, Italie, December 2016","DOI":"10.1145\/2988336.2988347"},{"issue":"1","key":"1_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theor. Comput. Sci. 312(1), 3\u201315 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M.: Sketching probabilistic data streams. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 281\u2013292 (2007)","DOI":"10.1145\/1247480.1247513"},{"issue":"1\u20132","key":"1_CR26","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10994-008-5054-x","volume":"72","author":"S Guha","year":"2008","unstructured":"Guha, S., Indyk, P., Mcgregor, A.: Sketching information divergences. Mach. Learn. 72(1\u20132), 5\u201319 (2008)","journal-title":"Mach. Learn."},{"key":"1_CR27","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. In: Proceedings of the 19th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA) (2008)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Arackaparambil, C., Brody, J., Chakrabarti, A.: Functional monitoring without monotonicity. In: Proceedings of the 36th ACM International Colloquium on Automata, Languages and Programming (ICALP) (2009)","DOI":"10.1007\/978-3-642-02927-1_10"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 281\u2013291 (2001)","DOI":"10.1145\/378580.378687"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Haung, Z., Yi, K., Zhang, Q.: Randomized algorithms for tracking distributed count, frequencies and ranks. In: Proceedings of 31st ACM Symposium on Principles of Database Systems (PODS) (2012)","DOI":"10.1145\/2213556.2213596"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Liu, Z., Radunovi\u0107, B., Vojnovic, M.: Continuous distributed counting for non-monotonic streams. In: Proceedings of 31st ACM Symposium on Principles of Database Systems (PODS) (2012)","DOI":"10.1145\/2213556.2213597"},{"issue":"4","key":"1_CR32","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/TDSC.2005.50","volume":"2","author":"J Yuan","year":"2005","unstructured":"Yuan, J., Mills, K.: Monitoring the macroscopic effect of DDoS flooding attacks. IEEE Trans. Dependable Secure Comput. 2(4), 324\u2013335 (2005)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Basseville, M., Cardoso, J.F.: On entropies, divergences, and mean values. In: Proceedings of the IEEE International Symposium on Information Theory (1995)","DOI":"10.1109\/ISIT.1995.550317"},{"issue":"1","key":"1_CR34","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.2517-6161.1966.tb00626.x","volume":"28","author":"SM Ali","year":"1966","unstructured":"Ali, S.M., Silvey, S.D.: General class of coefficients of divergence of one distribution from another. J. Roy. Stat. Soc. Ser. B (Methodological) 28(1), 131\u2013142 (1966)","journal-title":"J. Roy. Stat. Soc. Ser. B (Methodological)"},{"key":"1_CR35","unstructured":"Csisz\u00e1r, I.: Information measures: a critical survey. In: Transactions of the Seventh Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, Dordrecht, D. Riedel, pp. 73\u201386 (1978)"},{"issue":"3","key":"1_CR36","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1143\/JPSJ.18.328","volume":"18","author":"T Morimoto","year":"1963","unstructured":"Morimoto, T.: Markov processes and the $$h$$ -theorem. J. Phys. Soc. Jpn. 18(3), 328\u2013331 (1963)","journal-title":"J. Phys. Soc. Jpn."},{"issue":"1","key":"1_CR37","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"1_CR38","first-page":"99","volume":"35","author":"A Bhattacharyya","year":"1943","unstructured":"Bhattacharyya, A.: On a measure of divergence between two statistical populations defined by their probability distributions. Bull. Calcutta Math. Soc. 35, 99\u2013109 (1943)","journal-title":"Bull. Calcutta Math. Soc."},{"key":"1_CR39","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019604","volume-title":"Data Streams: Algorithms and Applications","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. Now Publishers Inc., Hanover (2005)"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Busnel, Y., Rivetti, N.: Estimating the frequency of data items in massive distributed streams. In: Proceedings of the 4th IEEE Symposium on Network Cloud Computing and Applications (NCCA), pp. 59\u201366 (2015)","DOI":"10.1109\/NCCA.2015.19"},{"issue":"1","key":"1_CR41","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"1_CR42","unstructured":"The Internet Traffic Archive. Lawrence Berkeley National Laboratory. http:\/\/ita.ee.lbl.gov\/html\/traces.html"},{"issue":"3","key":"1_CR43","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1_CR44","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1515\/crll.1909.136.210","volume":"136","author":"E Hellinger","year":"1909","unstructured":"Hellinger, E.: Neue begr\u00fcndung der theorie quadratischer formen von unendlichvielen ver\u00e4nderlichen. J. Reine Angew. Math. 136, 210\u2013271 (1909)","journal-title":"J. Reine Angew. Math."},{"issue":"4","key":"1_CR45","doi-asserted-by":"crossref","first-page":"2032","DOI":"10.1214\/aos\/1176348385","volume":"19","author":"I Csisz\u00e1r","year":"1991","unstructured":"Csisz\u00e1r, I.: Why least squares and maximum entropy? an axiomatic approach to inference for linear inverse problems. Ann. Stat. 19(4), 2032\u20132066 (1991)","journal-title":"Ann. Stat."},{"issue":"1","key":"1_CR46","first-page":"183","volume":"58","author":"SI Amari","year":"2010","unstructured":"Amari, S.I., Cichocki, A.: Information geometry of divergence functions. Bull. Pol. Acad. Sci. Techn. Sci. 58(1), 183\u2013195 (2010)","journal-title":"Bull. Pol. Acad. Sci. Techn. Sci."},{"issue":"11","key":"1_CR47","doi-asserted-by":"crossref","first-page":"4925","DOI":"10.1109\/TIT.2009.2030485","volume":"55","author":"SI Amari","year":"2009","unstructured":"Amari, S.I.: $$\\alpha $$ -divergence is unique, belonging to both $$f$$ -divergence and bregman divergence classes. IEEE Trans. Inf. Theor. 55(11), 4925\u20134931 (2009)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1_CR48","unstructured":"Renyi, A.: On measures of information and entropy. In: Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability, pp. 547\u2013561 (1960)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XXXIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55696-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:48:37Z","timestamp":1750798117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55696-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662556955","9783662556962"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55696-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}