Performance of checksums and CRCs over real data

Authors:
Craig Partridge;Jim Hughes;Jonathan Stone
Affiliations:
Bolt Beranek and Newman, Inc.;Network Systems Corporation;Stanford University
Venue:
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Year:
1995

Citing 3
Cited 8

Fletcher's error detection algorithm: how to implement it efficiently and how toavoid the most common pitfalls

ACM SIGCOMM Computer Communication Review
Improving the efficiency of the OSI checksum calculation

ACM SIGCOMM Computer Communication Review
Reliability of Adaptation Layers

Proceedings of the IFIP WG6.1/WG6.4 Third International Workshop on Protocols for High-Speed Networks III

Profiling and reducing processing overheads in TCP/IP

IEEE/ACM Transactions on Networking (TON)
Performance of checksums and CRC's over real data

IEEE/ACM Transactions on Networking (TON)
The transport layer: tutorial and survey

ACM Computing Surveys (CSUR)
Flow labelled IP over ATM: design and rationale

ACM SIGCOMM Computer Communication Review
Coding of checksum components for increasing the control reliability of data transmission for military applications

WSEAS TRANSACTIONS on COMMUNICATIONS
Coding of checksum components for increasing the control reliability of data transmission for military applications

WSEAS Transactions on Information Science and Applications
Effectiveness data transmission error detection using check sum control for military application

MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Performance increase of error control operation on data transmission

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 UNIX® 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 checksums when applied to real data. They also cause a spectacular failure rate for the both TCP and Fletcher's checksums when trying to detect certain types of packet splices.