{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T19:20:07Z","timestamp":1746040807186},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2004.1354587","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:02Z","timestamp":1103794442000},"page":"1762-1773","source":"Crossref","is-referenced-by-count":97,"title":["Space-code bloom filter for efficient per-flow traffic measurement"],"prefix":"10.1109","volume":"3","author":[{"given":"A.","family":"Kumar","sequence":"first","affiliation":[]},{"family":"Jun Xu","sequence":"additional","affiliation":[]},{"family":"Jia Wang","sequence":"additional","affiliation":[]},{"given":"O.","family":"Spatschek","sequence":"additional","affiliation":[]},{"family":"Li Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"13","article-title":"An approach to alleviate link overload as observed on an IP backbone","author":"iyer","year":"2003","journal-title":"Proc IEEE Infocom 96 San Francisco"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2003.1248656"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872838"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/90.700888"},{"key":"3","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","article-title":"Finding frequent items in data streams","author":"charikar","year":"2002","journal-title":"ICALP Lecture Notes in Computer Science Springer-Verlag Heidelberg Germany"},{"year":"0","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"journal-title":"Mathematical Statistics Basic Ideas and Selected Topics","year":"2001","author":"bickel","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/872785.872787"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"8","article-title":"Frequency estimation of internet packet streams with limited space","author":"demaine","year":"2002","journal-title":"European Symposium on Algorithms (ESA) Lecture Notes in Computer Science Springer-Verlag Heidelberg Germany"}],"event":{"name":"IEEE INFOCOM 2004","acronym":"INFCOM-04","location":"Hong Kong, PR China"},"container-title":["IEEE INFOCOM 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9369\/29752\/01354587.pdf?arnumber=1354587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T13:42:57Z","timestamp":1497620577000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1354587\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/infcom.2004.1354587","relation":{},"subject":[]}}