Technology and engineering · 1982

RFC 815: IP datagram reassembly algorithms

by D.D. Clark

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.

Anyone can see what's on the shelves. Open a book with a free account, and stay in touch with its book club.

First published
1982
Status
Unknown
Pages
8
Copyright
✓ Free to read · Copied in full, as published

Where it comes from

RFC Editor · IETF Datatracker · IETF Trust Legal Provisions

Copied in full and unchanged from the RFC Editor, with the RFC's own notices. © IETF Trust and the persons identified as the document authors. The IETF Trust allows copying and distributing an RFC in full and without modification, so Micwyn shows it exactly as published and makes no study guide, audio or other version of it.

Discuss a passage

Select any passage in the reader and press Discuss to talk about it in public.

Join free to discuss a passage

Ask Micwyn about this book

Join (free) to ask about a PDF
Try asking

If you like this one