{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:07:36Z","timestamp":1746418056785},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2005.1498484","type":"proceedings-article","created":{"date-parts":[[2005,8,24]],"date-time":"2005-08-24T10:00:58Z","timestamp":1124877658000},"page":"2080-2090","source":"Crossref","is-referenced-by-count":4,"title":["Fast, mernory-efficient traffic estimation by coincidence counting"],"prefix":"10.1109","volume":"3","author":[{"family":"Fang Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Kodialam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.V.","family":"Lakshman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Hui Mang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","article-title":"CHOKe a stateless active queue management scheme for approximating fair bandwidth allocation","author":"pan","year":"2000","journal-title":"Proceedings of INFOCOM'99"},{"key":"11","article-title":"Stochastic fair blue: A queue management algorithm for enforcing fairness","author":"feng","year":"0","journal-title":"Proceedings of INFOCOM'2001"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752153"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.2307\/2534036"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1012888.1005699"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.832484"},{"journal-title":"Probability Approximations via the Poisson Clumping Heuristic","year":"1987","author":"aldous","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863972"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354591"},{"key":"4","article-title":"ACCELRATE: A faster mechanism for memory efficient per-flow traffic estimation","author":"hao","year":"0","journal-title":"Proc ACM SIGMETRICS 2004"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1145\/347057.347555","article-title":"Trajectory sampling for direct traffic observation","author":"duffield","year":"0","journal-title":"Proceedings of ACM SIGCOMM 2000"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505232"}],"event":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","location":"Miami, FL, USA"},"container-title":["Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9990\/32101\/01498484.pdf?arnumber=1498484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T18:47:43Z","timestamp":1497638863000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1498484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/infcom.2005.1498484","relation":{},"subject":[]}}