cancel
Showing results for
Did you mean:
cancel
1951
Views
0
2
Replies

## Ethernet-II FCS calculation   Enthusiast

Hi

The frame length of an Ethernet-II frame isn't specified in the frame itself, but determined by the IFG (Inter Frame Gap) in 10Base-T. Does a store and forward switch now have to go through the whole frame again to check the FCS? Or can it calculate the FCS while receiving the frame and somehow know not to include the FCS field itself for the calculation?

Regards Marcel

1 Accepted Solution

Accepted Solutions    Hall of Fame Cisco Employee

Marcel,

In Ethernet, FCS is based on a Cyclical Redundancy Check, or CRC computation. Without going too deep into maths, CRC is the remainder after dividing two polynomials - the first polynomial is the data to be protected, the second polynomial is the specific parameter of the CRC mechanism in use, and after dividing them, the remainder is the CRC value. As with dividing two ordinary integers, this remainder is what was "missing" in the first polynomial to make it an "integer" multiple of the second polynomial. If this remainder is "added" to the first polynomial, then the next time CRC is computed over the first polynomial (now with the remainder added), the new computed remainder will be zero, as the first polynomial now becomes an "integer" multiple of the second polynomial.

This is used to verify FCS efficiently. A switch does not need to wait for an entire frame to come in, then compute the CRC over all the contents except the FCS field, and compare the result with the FCS field. Instead, the switch can simply compute the CRC value as the frame comes in, and at the end, when an entire frame is received and the CRC was computed over the entire frame data including its FCS field, the CRC result must be zero. If it is different, an error has occurred.

Best regards,
Peter

2 Replies 2    Hall of Fame Cisco Employee

Marcel,

In Ethernet, FCS is based on a Cyclical Redundancy Check, or CRC computation. Without going too deep into maths, CRC is the remainder after dividing two polynomials - the first polynomial is the data to be protected, the second polynomial is the specific parameter of the CRC mechanism in use, and after dividing them, the remainder is the CRC value. As with dividing two ordinary integers, this remainder is what was "missing" in the first polynomial to make it an "integer" multiple of the second polynomial. If this remainder is "added" to the first polynomial, then the next time CRC is computed over the first polynomial (now with the remainder added), the new computed remainder will be zero, as the first polynomial now becomes an "integer" multiple of the second polynomial.

This is used to verify FCS efficiently. A switch does not need to wait for an entire frame to come in, then compute the CRC over all the contents except the FCS field, and compare the result with the FCS field. Instead, the switch can simply compute the CRC value as the frame comes in, and at the end, when an entire frame is received and the CRC was computed over the entire frame data including its FCS field, the CRC result must be zero. If it is different, an error has occurred.

Best regards,
Peter   Enthusiast

Hi Peter

Thank you for the explanation. It now makes sense to me.

Regards Marcel Getting Started

Find answers to your questions by entering keywords or phrases in the Search bar above. New here? Use these resources to familiarize yourself with the community: 