{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T06:03:29Z","timestamp":1749621809432},"reference-count":0,"publisher":"RFC Editor","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.17487\/rfc6675","type":"report","created":{"date-parts":[[2015,4,12]],"date-time":"2015-04-12T00:46:27Z","timestamp":1428799587000},"source":"Crossref","is-referenced-by-count":20,"title":["A Conservative Loss Recovery Algorithm Based on Selective Acknowledgment (SACK) for TCP"],"prefix":"10.17487","author":[{"given":"E.","family":"Blanton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Allman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Jarvinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Kojo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Nishida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7045","published-online":{"date-parts":[[2012,8]]},"container-title":[],"original-title":[],"deposited":{"date-parts":[[2015,4,12]],"date-time":"2015-04-12T00:47:28Z","timestamp":1428799648000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rfc-editor.org\/info\/rfc6675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.17487\/rfc6675","relation":{},"subject":[],"published":{"date-parts":[[2012,8]]}}}