[{"draft":"","doc_id":"RFC0815","title":" IP datagram reassembly algorithms ","authors":["D.D. Clark"],"format":["ASCII","HTML"],"page_count":"8","pub_status":"UNKNOWN","status":"UNKNOWN","source":"Legacy","abstract":" This RFC describes an alternate approach of dealing with reassembly which reduces the bookkeeping problem to a minimum, and requires only one buffer for storage equal in size to the final datagram being reassembled, which can reassemble a datagram from any number of fragments arriving in any order with any possible pattern of overlap and duplication, and which is appropriate for almost any sort of operating system.  ","pub_date":"July 1982","keywords":["  "],"obsoletes":[""],"obsoleted_by":[""],"updates":[""],"updated_by":[""],"see_also":[""],"doi":"10.17487\/RFC0815","errata_url":null}]