{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:17Z","timestamp":1750307717688,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,21]],"date-time":"2009-06-21T00:00:00Z","timestamp":1245542400000},"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":[[2009,6,21]]},"DOI":"10.1145\/1582379.1582520","type":"proceedings-article","created":{"date-parts":[[2009,8,4]],"date-time":"2009-08-04T13:38:06Z","timestamp":1249393086000},"page":"649-654","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Memory-efficient segment-based packet-combining schemes in face of deadlines"],"prefix":"10.1145","author":[{"given":"Andreas","family":"Willig","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Berlin"}]}],"member":"320","published-online":{"date-parts":[[2009,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1098918.1098930"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1182807.1182829"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.1994.582838"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.58745"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665076"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013676531988"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"e_1_3_2_1_8_1","volume-title":"Cambridge University Press","author":"Norris J. R.","year":"1997","unstructured":"J. R. Norris . Markov Chains . Cambridge University Press , Cambridge, UK , 1997 . J. R. Norris. Markov Chains. Cambridge University Press, Cambridge, UK, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.79277"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/VETECF.2004.1400415"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2008.4638522"}],"event":{"name":"IWCMC '09: 2009 International Wireless Communications and Mobile Computing Conference","sponsor":["ACM Association for Computing Machinery","Wiley-Blackwell","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGCOMM ACM Special Interest Group on Data Communication","SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Leipzig Germany","acronym":"IWCMC '09"},"container-title":["Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582379.1582520","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1582379.1582520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:24Z","timestamp":1750253424000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582379.1582520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,21]]},"references-count":11,"alternative-id":["10.1145\/1582379.1582520","10.1145\/1582379"],"URL":"https:\/\/doi.org\/10.1145\/1582379.1582520","relation":{},"subject":[],"published":{"date-parts":[[2009,6,21]]},"assertion":[{"value":"2009-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}