Analysis of the interaction between linear cyclic error correcting codes and self-synchronous payload scramblers

In order to protect public network data transmission from potential Layer 1 attacks by malicious users, self-synchronous scramblers have come into widespread use. Such networks include those using ATM, packet over SONET (POS), and the new generic framing procedure (GFP). Unfortunately, feedback taps inherent in self-synchronous descramblers cause multiplication of transmission errors, which in turn degrades the performance of most linear cyclic error detection/correction codes. This paper analyzes this scrambler/code interaction with respect to the resulting probability of undetectable errors and transmission error correction capability. The theoretical criteria are derived for a linear cyclic code to maintain its error detection and correction performance in the presence of the scramblers. A novel approach for improving the error correction capabilities is also presented.

[1]  A.W. Moore,et al.  Optical network packet error rate due to physical layer coding , 2005, Journal of Lightwave Technology.

[2]  Craig Partridge,et al.  When the CRC and TCP checksum disagree , 2000, SIGCOMM.

[3]  Philip Koopman,et al.  32-bit cyclic redundancy codes for Internet applications , 2002, Proceedings International Conference on Dependable Systems and Networks.

[4]  Andrew G. Malis,et al.  PPP over SONET/SDH , 1994, RFC.

[5]  Craig Partridge,et al.  When the CRC and TCP checksum disagree , 2000, SIGCOMM 2000.

[6]  S. S. Gorshe,et al.  Transparent generic framing procedure (GFP): a protocol for efficient transport of block-coded data through SONET/SDH networks , 2002, IEEE Commun. Mag..

[7]  Jack K. Wolf,et al.  Special hardware for computing the probability of undetected error for certain binary CRC codes and test results , 1994, IEEE Trans. Commun..

[8]  Shu Lin,et al.  Error detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE Standard 802.3 , 1989, IEEE Trans. Commun..

[9]  J. Crowcroft,et al.  SEAL detects cell misordering , 1992, IEEE Network.

[10]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[11]  Jürg Ganz,et al.  Optimum cycle redundancy-check codes with 16-bit redundancy , 1990, IEEE Trans. Commun..

[12]  Steven S. Gorshe,et al.  CRC-16 polynomials optimized for applications using self-synchronous scramblers , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[13]  Martin Herrmann,et al.  Optimization of cyclic redundancy-check codes with 24 and 32 parity bits , 1993, IEEE Trans. Commun..