{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T02:10:28Z","timestamp":1739931028120,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926658"},{"type":"electronic","value":"9783540926665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-92666-5_25","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T10:24:44Z","timestamp":1268043884000},"page":"285-290","source":"Crossref","is-referenced-by-count":0,"title":["Improving TCP\u2019s Robustness to Packet Reordering"],"prefix":"10.1007","author":[{"given":"Arnd","family":"Hannemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lennart","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/90.811445","volume":"7","author":"J. C. R. Bennett","year":"1999","unstructured":"J. C. R. Bennett, C. Partridge, and N. Shectman. Packet reordering is not pathological network behavior, IEEE\/ACM Transactions on Networking, 7(6):789\u2013798, 1999.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Bhandarkar, A. L. N. Reddy, M. Allman, and E. Blanton. Improving the robustness of TCP to non-congestion events, RFC 4653, August 2006.","DOI":"10.17487\/rfc4653"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"E. Blanton, M. Allman, K. Fall, and L. Wang, A conservative selective acknowledgment (SACK)-based loss recovery algorithm for TCP. RFC 3517, April 2003.","DOI":"10.17487\/rfc3517"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"S. Bohacek, J. P. Hespanha, J. Lee, C. Lim, and K. Obraczka. TCP-PR: TCP for persistent packet reordering. In Proc. of the 23rd Int. Conf. on Distributed, Computing Systems (ICDCS\u2019 03), page 222, Washington, DC, USA, 2003. IEEE Computer Society.","DOI":"10.1109\/ICDCS.2003.1203469"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Matthew Mathis and Jamshid Mahdavi. Forward acknowledgement: Refining TCP congestion control. In Proc. of the Special Interest Group on Data Communication (SIGCOMM\u2019 96), pages 281\u2013291, 8 1996.","DOI":"10.1145\/248157.248181"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"A. Morton, L. Ciavattone, G. Ramachandran, S. Shalunov, and J. Perser. Packet reordering metrics. RFC 4737, November 2006.","DOI":"10.17487\/rfc4737"},{"issue":"l","key":"25_CR7","first-page":"59","volume":"2","author":"N. H. Vaidya","year":"2001","unstructured":"Nitin H. Vaidya, Milten N. Mehta, Charles E. Perkins, and Gabriel Montenegro. Delayed duplicate acknowledgements: a TCP-unaware approach to improve performance of TCP over wireless. Wireless Communications and Mobile Computing, 2(l): 59\u201370, 12 2001.","journal-title":"Wireless Communications and Mobile Computing"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"M. Zhang, B. Karp, S. Floyd, and L. Peterson. RR-TCP: A reordering-robust TCP with DSACK. In Proc. of the 11th IEEE Int. Conf. on Networking Protocols (ICNP\u2019 03), pages 95\u2013106, 2003.","DOI":"10.1109\/ICNP.2003.1249760"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Alexander Zimmermann, Daniel Schaffrath, Martin Wenig, Arnd Hannemann, Mesut G\u00fcne\u015f, and Sadeq Ali Makram. Performance evaluation of a hybrid testbed for wireless mesh networks. In Proc. of the 4th IEEE Int. Conf. on Mobile Ad-hoc and Sensor Systems (MASS\u201907). IEEE Computer Society Press, 2007.","DOI":"10.1109\/MOBHOC.2007.4428596"}],"container-title":["Informatik aktuell","Kommunikation in Verteilten Systemen (KiVS)"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92666-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T01:49:24Z","timestamp":1739929764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92666-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540926658","9783540926665"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92666-5_25","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[2009]]}}}