The TTA's Approach to Resilience after Transient Upsets
Real-Time Systems
Survivable multicast communication in bus-based networks
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Multicast survivability in hierarchical broadcast networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Roll your own test bed for embedded real-time protocols: a haskell experience
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
| Hi-index | 0.00 |
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 message length being checked. Common assumptions also include a passive network inter-stage, explicit data words, memoryless channels, and random independent symbol errors. In this paper we identify some examples of CRC usage that compromise ultra-dependable system design goals, and recommend alternate ways to improve system dependability via architectural approaches rather than error detection coding approaches.