Fast Incremental CRC Updates for IP over ATM Networks

Abstract

In response to the increasing network speeds, many operations in IP routers and similar devices are being made more efficient. With the advances in other areas of packet processing, the verification and regeneration of cyclic redundancy check (CRC) codes of the data link layer is likely to become a bottleneck in the near future. In this paper, we present a mechanism to defer CRC verification without compromising reliability. This opens the possibility of incremental updates of the CRC. We introduce a new high-speed technique and present efficient implementations, speeding up CRC processing by a factor of 15. Although the paper and analysis focuses on IP over ATM, the scheme applies to a much wider set of network protocols.

Documents

• PDF (6 pages, 76 kBytes)
• Related documents (CiteSeer/ResearchIndex)
• An extended version is available as Washington University Computer Science Technical Report WUCS-01-08 (8 pages, 92 kBytes), April 2001
• Source code (local copy)
• A CRC Tutorial with background information and further pointers is also available
• Part of the FPX project
• My paper with Andreas Döring on Fast and Flexible CRC Calculation was inspired by this work

BibTeX entry

@InProceedings{braun01fast,
  Author =       {Florian Braun and Marcel Waldvogel},
  Title =        {Fast Incremental {CRC} Updates for {IP} over {ATM}
                  networks},
  BookTitle =    {2001 {IEEE} Workshop on High
                  Performance Switching and Routing (HPSR 2001)},
  Address =      {Dallas, TX, USA},
  Year =         2001,
  Month =        may,
  Pages =        {48--52}
}

@TechReport{braun01fast-techreport,
  Author =       {Florian Braun and Marcel Waldvogel},
  Title =        {Fast Incremental {CRC} Updates for {IP} over {ATM}
                  networks},
  Institution =  {Washington University in St.\ Louis},
  Number =       {WUCS-01-08},
  Year =         2001,
  Month =        apr
}