The Impact of Datagram Partition and Checksuming on Datagram Latency
Nikola Zogović
Abstract
Nikola Zogović
Abstract
In this paper we present a technique for datagram division into several parts, with one header per datagram, and checksum for every part. The proposed technique is evaluated in terms of improvements in datagram error rate and datagram latency. We show that, with small datagram length enlargement, datagram error rate and datagram latency can be significantly reduced (i.e. with one per cent control overhead we can reduce, approximately 5 times, latency and error rate of datagram parts in 1000 bytes long datagram).
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we present a technique for datagram division into several parts, with one header per datagram, and checksum for every part. The proposed technique is evaluated in terms of improvements in datagram error rate and datagram latency. We show that, with small datagram length enlargement, datagram error rate and datagram latency can be significantly reduced (i.e. with one per cent control overhead we can reduce, approximately 5 times, latency and error rate of datagram parts in 1000 bytes long datagram).
Key concepts: Datagram, User Datagram Protocol, Checksum, Computer science, Computer network, Operating system, Internet protocol suite, The Internet