{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:53Z","timestamp":1772163953783,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1145\/1005686.1005707","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T11:55:38Z","timestamp":1090324538000},"page":"155-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["ACCEL-RATE"],"prefix":"10.1145","author":[{"given":"Fang","family":"Hao","sequence":"first","affiliation":[{"name":"Bell Laboratories, Holmdel, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murali","family":"Kodialam","sequence":"additional","affiliation":[{"name":"Bell Laboratories, Holmdel, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. V.","family":"Lakshman","sequence":"additional","affiliation":[{"name":"Bell Laboratories, Holmdel, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of INFOCOM'2004","author":"Kodialam M."},{"key":"e_1_3_2_1_2_1","volume-title":"Springer-Verlag","author":"Aldous D.","year":"1987"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505232"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of INFOCOM'2003","author":"Moore D."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347555"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505212"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.832484"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347554"},{"key":"e_1_3_2_1_9_1","unstructured":"Feller W. An Introduction to Probability Theory and Its Applications Vol 1 John Wiley 1968.  Feller W. An Introduction to Probability Theory and Its Applications Vol 1 John Wiley 1968."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of INFOCOM'2001","author":"Feng W."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_12_1","volume-title":"McGraw Hill","author":"Heyman D.P.","year":"1982"},{"key":"e_1_3_2_1_13_1","volume-title":"End Research Meeting","author":"Jacobson","year":"2000"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752153"},{"key":"e_1_3_2_1_15_1","first-page":"942","volume-title":"Proceedings of INFOCOM'99","author":"Pan B.","year":"2000"},{"key":"e_1_3_2_1_16_1","volume-title":"John Wiley","author":"Rao C.R.","year":"1973"},{"key":"e_1_3_2_1_17_1","unstructured":"Knuth D.E. \"Sorting and Searching\" The Art of Computer Programming vol. 3 Addison-Wesley 1973.   Knuth D.E. \"Sorting and Searching\" The Art of Computer Programming vol. 3 Addison-Wesley 1973."},{"key":"e_1_3_2_1_18_1","unstructured":"Packet Length Distributions http:\/\/www.caida.org\/analysis\/AIX\/plen_hist\/.  Packet Length Distributions http:\/\/www.caida.org\/analysis\/AIX\/plen_hist\/."}],"event":{"name":"SIGMETRICS04: SIGMETRICS 2004 \/ PERFORMANCE 2004","location":"New York NY USA","acronym":"SIGMETRICS04","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the joint international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1005686.1005707","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1005686.1005707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:24:39Z","timestamp":1750249479000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1005686.1005707"}},"subtitle":["a faster mechanism for memory efficient per-flow traffic estimation"],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":18,"alternative-id":["10.1145\/1005686.1005707","10.1145\/1005686"],"URL":"https:\/\/doi.org\/10.1145\/1005686.1005707","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1012888.1005707","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2004,6]]},"assertion":[{"value":"2004-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}