When the CRC and TCP checksum disagree

  title={When the CRC and TCP checksum disagree},
  author={Jonathan Stone and C. Partridge},
Traces of Internet packets from the past two years show that between 1 packet in 1,100 and 1 packet in 32,000 fails the TCP checksum, even on links where link-level CRCs should catch all but 1 in 4 billion errors. For certain situations, the rate of checksum failures can be even higher: in one hour-long test we observed a checksum failure of 1 packet in 400. We investigate why so many errors are observed, when link-level CRCs should catch nearly all of them. We have collected nearly 500,000… Expand
Error masking probability of 1's complement checksums
  • Changli Jiao, L. 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. Expand
Potential Error Control Redundancy in iSCSI over IP
This overview addresses potential error control redundancy that may be inherent in running iSCS wide area IP networks. In effect the iSCSI standard recommends the use of a 32 bit error control CRC onExpand
MUST, SHOULD, DON'T CARE: TCP Conformance in the Wild
A non-negligible set of hosts and paths that do not adhere to even basic protocol requirements are uncovered, highlighting that conformance to even fundamental protocol requirements should not be taken for granted but instead checked regularly. Expand
Techniques for the Detection of Faulty Packet Header Modifications
This work selects a solution for implementation into the Linux TCP stack and uses it to examine real-world Internet paths to discover various instances of in-path modifications and extract lessons learned from them to help drive future design efforts. Expand
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 coverExpand
Measuring packet reordering
This paper describes a new set of active measurement techniques that can reliably estimate one-way end-to-end reordering rates to and from arbitrary TCP-based servers and shows how they can be used to measure the time-domain distribution of the reordering process along a given path. Expand
Path-quality monitoring in the presence of adversaries
This paper designs and analyzes path-quality monitoring protocols that reliably raise an alarm when the packet-loss rate and delay exceed a threshold, even when an adversary tries to bias monitoring results by selectively delaying, dropping, modifying, injecting, or preferentially treating packets. Expand
Statistical analysis of malformed packets and their origins in the modern internet
The goal is to determine the reason that these packets appear on the network and evaluate what proportion of such packets could cause actual damage and examine and divide the unusual packets obtained during experiments into several categories based on their type and possible cause. Expand
Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols
A lightweight path-quality monitoring protocol that reliably raises an alarm when the packet-loss rate exceed a threshold, even when an adversary tries to bias monitoring results by selectively delaying, dropping, modifying, injecting, or preferentially treating packets is designed and analyzed. Expand
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. Expand


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. Expand
TCP checksum function design
The focus in this paper is on checksum functions for protocols such as TCP where the required reliable delivery is achieved by retransmission. Expand
End-to-end Internet packet dynamics
The prevalence of unusual network events such as out-of-order delivery and packet corruption are characterized and a robust receiver-based algorithm for estimating "bottleneck bandwidth" is discussed that addresses deficiencies discovered in techniques based on "packet pair". Expand
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 goodExpand
The BSD Packet Filter: A New Architecture for User-level Packet Capture
The BSD Packet Filter (BPF) uses a new, register-based filter evaluator that is up to 20 times faster than the original design, and uses a straighforward buffering strategy that makes its overall performance up to 100 times better than Sun's NIT running on the same hardware. Expand
Compressing TCP/IP Headers for Low-Speed Serial Links
This RFC describes a method for compressing the headers of TCP/IP datagrams to improve performance over low speed serial links. The motivation, implementation and performance of the method areExpand
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/. Expand
IP Router Alert Option
A new IP Option type that alerts transit routers to more closely examine the contents of an IP packet is described, useful for new protocols that are addressed to a destination but require relatively complex processing in routers along the path. Expand
Computation of the Internet Checksum via Incremental Update
This memo describes an updated technique for incremental computation of the standard Internet checksum. It updates the method described in RFC 1141.
IPv6 Router Alert Option
This memo describes a new IPv6 Hop-by-Hop Option type that alerts transit routers to more closely examine the contents of an IP datagram. This option is useful for situations where a datagramExpand