{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:30:55Z","timestamp":1725553855596},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343851"},{"type":"electronic","value":"9783540343868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758549_16","type":"book-chapter","created":{"date-parts":[[2006,5,10]],"date-time":"2006-05-10T00:50:25Z","timestamp":1147222225000},"page":"120-127","source":"Crossref","is-referenced-by-count":4,"title":["Estimating Original Flow Length from Sampled Flow Statistics"],"prefix":"10.1007","author":[{"given":"Weijiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbing","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Duffield, N.G., Lund, C., Thorup, M.: Properties and Prediction of Flow Statistics from Sampled Packet Streams. In: ACM SIGCOMM Internet Measurement Workshop 2002, November 2002, pp. 159\u2013171 (2002)","key":"16_CR1","DOI":"10.1145\/637201.637225"},{"key":"16_CR2","first-page":"325","volume":"13","author":"N.G. Duffield","year":"2005","unstructured":"Duffield, N.G., Lund, C., Thorup, M.: Estimating Flow Distributions from Sampled Flow Statistics. IEEE\/ACM Transation on Networking\u00a013, 325\u2013336 (2005)","journal-title":"IEEE\/ACM Transation on Networking"},{"doi-asserted-by":"crossref","unstructured":"Mori, T., Uchida, M., Kawahara, R.: Identifying Elephant Flows Through Periodically Sampled Packets. In: ACM SIGCOMM Internet Measurement Conference 2004, pp. 115\u2013120 (2004)","key":"16_CR3","DOI":"10.1145\/1028788.1028803"},{"doi-asserted-by":"crossref","unstructured":"Kamiyama, N.: Identifying High-Rate Flows With Less Memory. In: IEEE Infocom 2005, March 2005, pp. 2781\u20132785 (2005)","key":"16_CR4","DOI":"10.1109\/INFCOM.2005.1498562"},{"unstructured":"NLANR: Abilene-I data set, \n                    \n                      http:\/\/pma.nlanr.net\/Traces\/long\/bell1.html","key":"16_CR5"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758549_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T00:26:34Z","timestamp":1552523194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758549_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343851","9783540343868"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11758549_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}