D. D. Clark, "IP datagram reassembly algorithms," RFC 815, July 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Improving End-to-End Performance of TCP Using Link-Layer.. - Wong, Leung (1999) (2 citations) (Correct)
....with the packet length and may be unacceptably high for large IP datagrams. However, using a small MSS increases the relative overhead of the TCP IP headers. As a compromise, large IP datagrams are fragmented over the wireless link. Since IP provides a fragmentation and reassembly mechanism [11][12], we choose to perform fragmentation of IP datagrams at the base station and mobile host, with a 1024bit Maximum Transfer Unit (MTU) in IP. While not considered here, header compression can further reduce overhead and improve efficiency. TCP throughput and TCP end to end delay are the measures ....
D.D. Clark, "IP Datagram Reassembly Algorithms", IETF RFC 815, Jul. 1982.
Fragmentation Considered Harmful - Kent, Mogul (1987) (82 citations) (Correct)
....of matching the protocol and identification fields of incoming fragments with those of fragments already held, and coalescing the data into complete datagrams. Fragments must be discarded if their TTL expires while they are held for reassembly. For more details of the reassembly algorithm, see [5]. Higher level protocols such as TCP (Transmission Control Protocol) 20] use IP as a basis to implement a reliable connection between two client processes. Portions of the data stream known as segments are sent in individual IP datagrams, along with control information used by the cooperating ....
David D. Clark. IP Datagram Reassembly Algorithms. RFC 815, Network Information Center, SRI International, July, 1982.
Reconsidering Fragmentation and Reassembly - Girish Chandranmenon (1998) (2 citations) (Correct)
....the packet size of the link to be traversed, and the destination coalesces the pieces (fragments) Fragments can be further fragmented, and fragments can take different routes to the destination. One implementation (used by the Internet Protocol[Pos81] and OSI[OSI] of this scheme is the following [Cla82]: each packet is given an identifier, which is copied to each of its fragments; each fragment also carries an offset field (indicating where the fragment starts in the original packet) and a fragment length. If all fragments arrive at the receiver, the common identifier allows the receiver to ....
D. D. Clark. IP Datagram Reassembly Algorithms. RFC 815, July 1982.
Accommodating Fragmentation in Deterministic Packet Marking.. - Belenky, Ansari (Correct)
No context found.
D. D. Clark, "IP datagram reassembly algorithms," RFC 815, July 1982.
Network Working Group G. Ziemba Request for Comments: 1858.. - Status Of This (Correct)
No context found.
Clark, D., "IP Datagram Reassembly Algorithms", RFC 815, MIT Laboratory for Computer Science/Computer Systems and
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC