{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:02:05Z","timestamp":1761580925510},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642244025"},{"type":"electronic","value":"9783642244032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24403-2_17","type":"book-chapter","created":{"date-parts":[[2011,10,17]],"date-time":"2011-10-17T11:56:27Z","timestamp":1318852587000},"page":"201-213","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Universal Sketch for Origin-Destination Network Measurements"],"prefix":"10.1007","author":[{"given":"Haiquan","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Lall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences\u00a058(1), 137\u2013143 (1999)","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Broder, A.: On the resemblance and containment of documents. In: Proceedings of the Compression and Complexity of Sequences (1997)","key":"17_CR2"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci.\u00a018(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Cohen, E., Kaplan, H.: Bottom-k sketches: better and more efficient estimation of aggregates. In: SIGMETRICS (2007)","key":"17_CR4","DOI":"10.1145\/1254882.1254926"},{"doi-asserted-by":"crossref","unstructured":"Cohen, E., Kaplan, H.: Summarizing data using bottom-k sketches. In: PODC (2007)","key":"17_CR5","DOI":"10.1145\/1281100.1281133"},{"doi-asserted-by":"crossref","unstructured":"Duffield, N., Grossglauser, M.: Trajectory sampling for direct traffic observation. IEEE Transaction of Networking, 280\u2013292 (June 2001)","key":"17_CR6","DOI":"10.1109\/90.929851"},{"doi-asserted-by":"crossref","unstructured":"Duffield, N., Lund, C., Thorup, M.: Estimating flow distribution from sampled flow statistics. In: Proc. ACM SIGCOMM (August 2003)","key":"17_CR7","DOI":"10.1145\/863955.863992"},{"doi-asserted-by":"crossref","unstructured":"Duffield, N.G., Lund, C., Thorup, M.: Flow sampling under hard resource constraints. In: Sigmetrics (2004)","key":"17_CR8","DOI":"10.1145\/1005686.1005699"},{"doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting. In: Proc. ACM SIGCOMM (2002)","key":"17_CR9","DOI":"10.1145\/633025.633056"},{"doi-asserted-by":"crossref","unstructured":"Feinstein, L., Schnackenberg, D., Balupari, R., Kindred, D.: Statistical approaches to DDoS attack detection and response. In: Proceedings ofthe DARPA Information Survivability Conference and Exposition (2003)","key":"17_CR10","DOI":"10.1109\/DISCEX.2003.1194894"},{"doi-asserted-by":"crossref","unstructured":"Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., True, F.: Deriving traffic demands for operational IP networks: Methodology and experience. IEEE Transaction on Networking (June 2001)","key":"17_CR11","DOI":"10.1145\/347059.347554"},{"doi-asserted-by":"crossref","unstructured":"Gunnar, A., Johansson, M., Telkamp, T.: Traffic matrix estimation on a large ip backbone-a comparison on real data. In: USENIX\/ACM SIGCOMM IMC (2004)","key":"17_CR12","DOI":"10.1145\/1028788.1028807"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/1147954.1147955","volume":"53","author":"P. Indyk","year":"2006","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM\u00a053(3), 307\u2013323 (2006)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Krishnamurthy, B., Sen, S., Zhang, Y., Chen, Y.: Sketch-based change detection: Methods, evaluation, and applications. In: IMC (2003)","key":"17_CR14","DOI":"10.1145\/948205.948236"},{"doi-asserted-by":"crossref","unstructured":"Kumar, A., Sung, M., Xu, J., Zegura, E.: Data streaming algorithms for efficient and accurate estimation of flow size distribution. In: Proc. ACM SIGMETRICS (June 2005)","key":"17_CR15","DOI":"10.1145\/1005686.1005709"},{"doi-asserted-by":"crossref","unstructured":"Kumar, A., Xu, J.: Sketch guided sampling-using on-line estimates of flow size for adaptive data collection. In: Proc. IEEE INFOCOM (March 2006)","key":"17_CR16","DOI":"10.1109\/INFOCOM.2006.326"},{"doi-asserted-by":"crossref","unstructured":"Lakhina, A., Crovella, M., Diot, C.: Mining anomalies using traffic feature distributions. In: SIGCOMM (2005)","key":"17_CR17","DOI":"10.1145\/1080091.1080118"},{"doi-asserted-by":"crossref","unstructured":"Li, P.: Improving compressed counting. In: UAI (2009)","key":"17_CR18","DOI":"10.1137\/1.9781611973068.46"},{"doi-asserted-by":"crossref","unstructured":"Li, P., Church, K.W.: Using sketches to estimate associations. In: Human Language Technology and Empirical Methods in Natural Language Processing, HLT (2005)","key":"17_CR19","DOI":"10.3115\/1220575.1220664"},{"doi-asserted-by":"crossref","unstructured":"Li, P., Church, K.W., Hastie, T.: Conditional random sampling: A sketch-based sampling technique for sparse data. In: NIPS (2006)","key":"17_CR20","DOI":"10.7551\/mitpress\/7503.003.0114"},{"unstructured":"Li, P., Church, K.W., Hastie, T.: One sketch for all: Theory and application of conditional random sampling. In: NIPS (2008)","key":"17_CR21"},{"unstructured":"Li, P., Zhang, C.-H.: A new algorithm for compressed counting with applications in shannon entropy estimation in dynamic data. In: COLT (2011)","key":"17_CR22"},{"doi-asserted-by":"crossref","unstructured":"Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrix estimation:existing techniques and new directions. In: SIGCOMM (2002)","key":"17_CR23","DOI":"10.1145\/633025.633041"},{"doi-asserted-by":"crossref","unstructured":"Nucci, A., Cruz, R., Taft, N., Diot, C.: Design of igp link weight changes for estimation of traffic matrices. In: Proc. IEEE INFOCOM (March 2004)","key":"17_CR24","DOI":"10.1109\/INFCOM.2004.1354656"},{"doi-asserted-by":"crossref","unstructured":"Papagiannaki, K., Taft, N., Lakhina, A.: A distributed approach to measure traffic matrices. In: Proc. ACM\/SIGCOMM IMC (October 2004)","key":"17_CR25","DOI":"10.1145\/1028788.1028808"},{"issue":"12","key":"17_CR26","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/12.641938","volume":"46","author":"M.V. Ramakrishna","year":"1997","unstructured":"Ramakrishna, M.V., Fu, E., Bahcekapili, E.: Efficient hardware hashing functions for high performance computers. IEEE Trans. Computers\u00a046(12), 1378\u20131381 (1997)","journal-title":"IEEE Trans. Computers"},{"unstructured":"Sekar, V., Reiter, M.K., Willinger, W., Zhang, H., Kompella, R.R., Andersen, D.G.: csamp: A system for network-wide flow monitoring. In: NSDI (2008)","key":"17_CR27"},{"doi-asserted-by":"crossref","unstructured":"Vardi, Y.: Internet tomography: estimating source-destination traffic intensities from link data. Journal of American Statistics Association, 365-377 (1996)","key":"17_CR28","DOI":"10.1080\/01621459.1996.10476697"},{"doi-asserted-by":"crossref","unstructured":"Wagner, A., Plattner, B.: Entropy Based Worm and Anomaly Detection in Fast IP Networks. In: Proceedings of IEEE International Workshop on Enabling Technologies, Infrastructures for Collaborative Enterprises (2005)","key":"17_CR29","DOI":"10.1109\/WETICE.2005.35"},{"doi-asserted-by":"crossref","unstructured":"Xu, K., Zhang, Z.-L., Bhattacharya, S.: Profiling internet backbone traffic: Behavior models and applications. In: SIGCOMM (2005)","key":"17_CR30","DOI":"10.1145\/1080091.1080112"},{"doi-asserted-by":"crossref","unstructured":"Zhang, Y., Roughan, M., Duffield, N., Greenberg, A.: Fast accurate computation of large-scale ip traffic matrices from link loads. In: Proc. ACM SIGMETRICS (June 2003)","key":"17_CR31","DOI":"10.1145\/781027.781053"},{"doi-asserted-by":"crossref","unstructured":"Zhang, Y., Roughan, M., Lund, C., Donoho, D.: An information-theoretic approach to traffic matrix estimation. In: Proc. ACM SIGCOMM (August 2003)","key":"17_CR32","DOI":"10.1145\/863955.863990"},{"doi-asserted-by":"crossref","unstructured":"Zhao, H., Lall, A., Ogihara, M., Spatscheck, O., Wang, J., Xu, J.: A data streaming algorithm for estimating entropies of OD flows. In: IMC (2007)","key":"17_CR33","DOI":"10.1145\/1298306.1298345"},{"doi-asserted-by":"crossref","unstructured":"Zhao, Q., Kumar, A., Wang, J., Xu, J.: Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices. In: SIGMETRICS (June 2005)","key":"17_CR34","DOI":"10.1145\/1064212.1064258"}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24403-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T20:02:38Z","timestamp":1713038558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24403-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642244025","9783642244032"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24403-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}