Coverage and the use of cyclic redundancy codes in ultra-dependable systems

@article{Paulitsch2005CoverageAT,
  title={Coverage and the use of cyclic redundancy codes in ultra-dependable systems},
  author={M. Paulitsch and Jennifer Morris and B. Hall and K. Driscoll and Elizabeth Latronico and P. Koopman},
  journal={2005 International Conference on Dependable Systems and Networks (DSN'05)},
  year={2005},
  pages={346-355}
}
A cyclic redundancy code (CRC), when used properly, can be an effective and relatively inexpensive method to detect data corruption across communication channels. However, some systems use CRCs in ways that violate common assumptions made in analyzing CRC effectiveness, resulting in an overly optimistic prediction of system dependability. CRCs detect errors with some finite probability, which depends on factors including the strength of the particular code used, the bit-error rate, and the… Expand
Analysis Of The Effectiveness Of Error Detection In Data Transmission Using Polynomial Code Method
TLDR
This research investigates the effectiveness of error detection methods in data transmission used several years ago when the authors had to do with small amount of data transfer and data storages compared with the huge amounts of data they deal with nowadays. Expand
Selection of Cyclic Redundancy Code and Checksum Algorithms to Ensure Critical Data Integrity
TLDR
Key findings include: (1) significant differences exist in effectiveness between error-code approaches, with CRCs being generally superior to checksums in a wide variety of contexts; (2) common practices and published standards may provide suboptimal information, requiring diligence in selecting practices to adopt in new standards and new systems. Expand
Assessment on Undetectable Burst Errors in Tandem CRCs
  • Meng-Lai Yin, B. Orenstein
  • Computer Science
  • 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)
  • 2006
This paper addresses the conditional probability for undetectable burst errors when using two CRC (cyclic redundancy check) codes in tandem, given that non-guaranteed-detectable burst errors haveExpand
Effect of jitter-reducing encoders on CAN error detection mechanisms
TLDR
An experimental campaign was carried out to evaluate the benefits the adoption of CRC-based encoding schemes provides over plain CAN, and results confirm that, for realistic error models, the probability of having residual errors decreases by about two orders of magnitude at most payload lengths, which implies that much higher reliability can be obtained from conventional CAN controllers. Expand
A Diversity-Based Approach for Communication Integrity in Critical Embedded Systems
TLDR
A fault-tolerant approach to cope with accidental communication data corruption in critical embedded systems by diversifying either the error detection function or the data payload and describes basic theoretical concepts of the second proposal. Expand
The TTA's Approach to Resilience after Transient Upsets
TLDR
A secondary fault hypothesis for the Time-Triggered Architecture is discussed that addresses the transient upset of multiple components and a new clique resolving algorithm is presented based on the TTA's integrated diagnosis and startup service. Expand
Communication Integrity in Networks for Critical Control Systems
The paper proposes a solution to the problem posed by the inclusion of complex interstage nodes into communication networks. Thus nodes are prone to exhibit failure modes that may lead to repetitiveExpand
A Multi-function Error Detection Policy to Enhance Communication Integrity in Critical Embedded Systems
TLDR
This work investigates a new error detection policy aiming at enhancing the system safety level particularly communication integrity in the presence of permanent errors (single and multiple) which is based rather on a set of different error detection functions. Expand
Achieving fault tolerance via robust partitioning and N-Modular Redundancy
This thesis describes the design and performance results for the P-NMR fault tolerant avionics system architecture being developed at Draper Laboratory. The two key principles of the architecture areExpand
A comparison of cross- and single-layer retransmission optimisations for 802.11
TLDR
This thesis presents two new and novel schemes, one that is based on cross layer design and the other using the traditional single layer approach, based upon the same principle of compartmentalising corruption. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 58 REFERENCES
Cyclic redundancy code (CRC) polynomial selection for embedded networks
TLDR
A polynomial selection process for embedded network applications is described and a set of good general-purpose polynomials are proposed that provide good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits. Expand
Multi-Bit Error Vulnerabilities in the Controller Area Network Protocol
TLDR
Simulations of the widely used Controller Area Network (CAN) protocol indicate that an interaction between bit stuffing and use of a cyclic redundancy code (CRC) can create a vulnerability to undetected multi-bit errors. Expand
A lower bound on the undetected error probability and strictly optimal codes
TLDR
The probability that a q-ary block code of length n and size M fails to detect an error is studied, and a lower bound on this undetected error probability is derived in terms of q, n, and M. Expand
32-bit cyclic redundancy codes for Internet applications
  • P. Koopman
  • Computer Science
  • Proceedings International Conference on Dependable Systems and Networks
  • 2002
TLDR
A new class of polynomials is identified that provides HD=6 up to nearly 16K bit and HD=4 up to 114K bit message lengths, providing the best achievable design point that maximizes error detection for both legacy and new applications, including potentially iSCSI and application-implemented error checks. Expand
On the monotonic property of the probability of undetected error for a shortened code
The monotonic property of the probability of undetected error is considered when a shortened code of a linear code over GF(q) is used for error detection on a q-ary symmetric channel. Some conditionsExpand
Performance of checksums and CRC's over real data
TLDR
It is shown that for fragmentation-and-reassembly error models, the checksum contribution of each fragment are, in effect, colored by the fragment's offset in the splice, explaining the performance of Fletcher's sum on nonuniform data. Expand
On the undetected error probability of linear block codes on channels with memory
TLDR
This paper addresses the problem of determining the undetected error probability, P/sub u/ (/spl epsiv/), for linear (n,k) block codes on channels with memory, by presenting two techniques based upon a trellis diagram of a channel model such as the Gilbert-Elliott or Fritchman channel models. Expand
Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
TLDR
Using this method implemented on a high-speed special-purpose processor, several classes of cyclic redundancy-check (CRC) codes with 24 and 32 parity bits are investigated and the d/sub min/ profiles of the resulting codes are presented and compared with recent suggestions. Expand
Analysis of the Train Communication Network Protocol Error Detection Capabilities
The Train Communication Network (TCN) has been adopted as an international standard for use in critical transportation applications on trains. This paper discusses the results of a general review ofExpand
Concerning a bound on undetected error probability (Corresp.)
TLDR
In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Expand
...
1
2
3
4
5
...