Performance of checksums and CRC's over real data

@article{Stone1995PerformanceOC,
  title={Performance of checksums and CRC's over real data},
  author={Jonathan Stone and Michael B. Greenwald and Craig Partridge and James P. Hughes},
  journal={IEEE/ACM Trans. Netw.},
  year={1995},
  volume={6},
  pages={529-543}
}
Checksum and CRC algorithms have historically been studied under the assumption that the data fed to the algorithms was entirely random. This paper examines the behavior of checksums and CRCs over real data from various UNIXr file systems. We show that, when given real data in small to modest pieces (e.g., 48 bytes), all the checksum algorithms have skewed distributions. In one dramatic case, 0.01% of the check values appeared nearly 19% of the time. These results have implications for CRCs and… 

Error masking probability of 1's complement checksums

  • Changli JiaoL. Schwiebert
  • Computer Science
    Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495)
  • 2001
A method to generate the formula of error passing probability is presented, which achieves a better estimation of the probability, which is around 3 percent of the upper bound achievable with previous techniques when 1's complement checksum is used in TCP/UDP.

Profiling and reducing processing overheads in TCP/IP

This paper presents detailed measurements of processing overheads for the Ultrix 4.2a implementation of TCP/IP network software running on a DECstation 5000/200 and presents a scheme for improving throughput when sending large messages by avoiding most checksum computations in a relatively safe manner.

Cyclic Redundancy Checks and Error Detection

The need to improve the capabilities of error-detecting codes to handle higher quantities of data is explored by testing the error detection properties of CRC’s in a restricted domain.

The Effectiveness of Checksums for Embedded Networks

A study of error detection capabilities for random independent bit errors and burst errors reveals that XOR, two’s complement addition, and Adler checksums are suboptimal for typical application use.

Checksums and Error Control

Two related, but somewhat parallel disciplines, have developed to deal with the handling of erroneous data, both part of the general theme of ”Coding Theory” and collected under the generic title of “Error Control”.

The Effectiveness of Checksums for Embedded Control Networks

A study of error detection capabilities for random independent bit errors and burst errors reveals that XOR, two's complement addition, and Adler checksums are suboptimal for typical network use.

Fast CRCs (Extended Version)

This paper introduces such fast CRCs as well as an effective technique to implement them, and shows that even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.

Checksum Coverage and Delivery of Errored Content

—We examine how the overall reliability of network protocol stacks is affected by the use of error-detecting checksums and Cyclic Redundancy Checks at each protocol layer. How these checksums cover

A Memory Efficient Anti-Spoofing Method

This paper shows that implementing ITS using Bloom filters is simple, saves a substantial amount of router memory, and does not impose large strain on routers, and modify the basic method to allow for it to be incrementally deployed.
...

References

SHOWING 1-10 OF 22 REFERENCES

Performance of checksums and CRC's over real data

This paper examines the behavior of checksums and CRCs over time under the assumption that the data fed to the algorithms was entirely random.

Improving the efficiency of the OSI checksum calculation

Two different ways to use larger byte--sizes to improve the performance of the OSI checksum are proposed and some taken of checksums in common use, such as IP and XNS† are compared.

Computing the internet checksum

This memo discusses methods for efficiently computing the Internet checksum that is used by the standard Internet protocols IP, UDP, and TCP.An efficient checksum implementation is critical to good

TCP alternate checksum options

This memo is suggests a pair of TCP options to allow use of alternate data checksum algorithms in the TCP header, which is experimental, and not recommended for production use.

An Arithmetic Checksum for Serial Transmissions

An error-detection method for serial transmissions is presented that uses an integer arithmetic checksum that is a bit weaker at detection but is more efficient, thus representing a different and potentially useful choice in rhobust-benefit spectrum.

SEAL detects cell misordering

It is shown that 32 bit CRC used in SEAL provides robust detection of cell misordering, for any frame size up to 4 Gb, the probability of undetected misordering is 2/sup -32/.

Dynamics of Tcp Traac over Atm Networks

We investigate the performance of TCP connections over ATM networks without ATM-level congestion control, and compare it to the performance of TCP over packet-based networks. For simulations of

Concrete mathematics - a foundation for computer science

From the Publisher: This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid

Development of a transmission error model and an error control model

To choose a code for use in general purpose digital communication networks which employ automatic repeat request it is necessary to characterize the channels used by the communication network.

Performance of checksums and CRCs over real data

Examination of the behavior of checksums and CRCs over real data from various UNIX® file systems shows that, when given real data in small to modest pieces, all the checksum algorithms have skewed distributions.