{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:21Z","timestamp":1750307421819,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T00:00:00Z","timestamp":1270771200000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2010,4,9]]},"abstract":"<jats:p>We provide a detailed analysis of the Lossy Difference Aggregator, a recently developed data structure for measuring latency in a router environment where packet losses can occur. Our analysis provides stronger performance bounds than those given originally, and leads us to a model for how to optimize the parameters for the data structure when the loss rate is not known in advance by using competitive analysis.<\/jats:p>","DOI":"10.1145\/1764873.1764875","type":"journal-article","created":{"date-parts":[[2010,4,12]],"date-time":"2010-04-12T18:13:20Z","timestamp":1271096000000},"page":"4-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["An improved analysis of the lossy difference aggregator"],"prefix":"10.1145","volume":"40","author":[{"given":"Hilary","family":"Finucane","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge , MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,4,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882836"},{"key":"e_1_2_1_2_1","volume-title":"The Art of Computer Programming, Volume 1: Fundamental Algorithms","author":"Knuth Knuth D. E.","year":"1997","unstructured":"Knuth D. E. Knuth . The Art of Computer Programming, Volume 1: Fundamental Algorithms ( 3 rd Edition). Addison-Wesley , 1997 . Knuth D. E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition). Addison-Wesley, 1997.","edition":"3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592599"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_2_1_5_1","first-page":"746","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Mitzenmacher M.","year":"2008","unstructured":"M. Mitzenmacher and S. Vadhan . Why simple hash functions work: exploiting the entropy in a data stream . In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 746 -- 755 , 2008 . M. Mitzenmacher and S. Vadhan. Why simple hash functions work: exploiting the entropy in a data stream. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 746--755, 2008."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1764873.1764875","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1764873.1764875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:44Z","timestamp":1750246784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1764873.1764875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,9]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4,9]]}},"alternative-id":["10.1145\/1764873.1764875"],"URL":"https:\/\/doi.org\/10.1145\/1764873.1764875","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2010,4,9]]},"assertion":[{"value":"2010-04-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}