Re: Optimizing cutting paths - The proof
Posted by
Tony Jeffree
on 2001-09-02 09:46:37 UTC
At 12:32 02/09/2001 +0000, you wrote:
To give an example of just how effective CRC error detection procedures can
be, the IEEE 802.3 standard (known colloquially as Ethernet - this is the
LAN technology most commonly used in modern computer installations) makes
use of a 32-bit CRC check in its transmitted data frames, which can carry
up to 1500 bytes of data, in order to meet a *worst-case* probability of
less than 1 in 13.3 billion that a data frame is delivered with an
undetected error. (And before somebody gets tempted into an argument over
the numbers, I had better point out that I am paraphrasing here part of the
2001 revision of IEEE Standard 802, the overall architecture standard for
LANs, which was developed by a working group for which I am currently the
Chairman.) The low-level protocols used to carry wide area data traffic in
"The Internet" use similar mechanisms and offer similar guarantees of
reliability - indeed, Ethernet is itself starting to be deployed as a wide
area carrier technology.
Regards,
Tony
> >I probably shouldn't pick this nit, but the protocols do not guarantee...And a non-trivial exercise it is too!
> >correct delivery to an absolute degree. They do guarantee that all
> >data that passes the CRC tests will be accurate to one part in 65,536
> >because the checksum is only 16-bits. Actually, the error could be
> >even more likely, if the error had a particular pattern to it related to
> >the simple way the checksum is calculated. But, it seems pretty reliable,
> >anyway.
> >
>
>Naturally, there are no real guarantees. The TCP/IP checksum is quite
>weak but the lower level protocols are likely to use relatively good CRC
>algorithms that will detect all single bit errors, all odd number of bit
>errors and most if not all double bit errors as well as error bursts of
>length less than the length of the CRC polynomial. The probability of
>errors propagating, end-to-end, undetected is very small. Their
>calculation is left as an exercise for the reader.
To give an example of just how effective CRC error detection procedures can
be, the IEEE 802.3 standard (known colloquially as Ethernet - this is the
LAN technology most commonly used in modern computer installations) makes
use of a 32-bit CRC check in its transmitted data frames, which can carry
up to 1500 bytes of data, in order to meet a *worst-case* probability of
less than 1 in 13.3 billion that a data frame is delivered with an
undetected error. (And before somebody gets tempted into an argument over
the numbers, I had better point out that I am paraphrasing here part of the
2001 revision of IEEE Standard 802, the overall architecture standard for
LANs, which was developed by a working group for which I am currently the
Chairman.) The low-level protocols used to carry wide area data traffic in
"The Internet" use similar mechanisms and offer similar guarantees of
reliability - indeed, Ethernet is itself starting to be deployed as a wide
area carrier technology.
Regards,
Tony
Discussion Thread
machines@n...
2001-08-30 15:11:00 UTC
Optimizing cutting paths - The proof
Alan Marconett KM6VV
2001-08-30 16:09:17 UTC
Re: [CAD_CAM_EDM_DRO] Optimizing cutting paths - The proof
machines@n...
2001-08-30 16:33:59 UTC
Re: Optimizing cutting paths - The proof
Alan Marconett KM6VV
2001-08-30 18:52:26 UTC
Re: Optimizing cutting paths - The proof
Chris L
2001-08-30 19:27:21 UTC
Re: [CAD_CAM_EDM_DRO] Optimizing cutting paths - The proof
Chris L
2001-08-30 19:30:35 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
Alan Marconett KM6VV
2001-08-30 20:43:47 UTC
Re: Optimizing cutting paths - The proof
machines@n...
2001-08-31 00:53:59 UTC
Re: Optimizing cutting paths - The proof
machines@n...
2001-08-31 00:59:19 UTC
Re: Optimizing cutting paths - The proof
Carlos Guillermo
2001-08-31 05:26:03 UTC
RE: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
Fred Smith
2001-08-31 05:39:41 UTC
Re: Optimizing cutting paths - The proof
machines@n...
2001-08-31 09:47:17 UTC
Re: Optimizing cutting paths - The proof
Alan Marconett KM6VV
2001-08-31 10:16:07 UTC
Re: Optimizing cutting paths - The proof
Alan Marconett KM6VV
2001-08-31 11:33:31 UTC
Re: Optimizing cutting paths - The proof
Chris Luebke
2001-08-31 12:23:54 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
machines@n...
2001-08-31 12:26:51 UTC
Re: Optimizing cutting paths - The proof
Alan Marconett KM6VV
2001-08-31 13:46:31 UTC
Re: Optimizing cutting paths - The proof
Alan Marconett KM6VV
2001-08-31 13:53:19 UTC
Re: Optimizing cutting paths - The proof
Fred Smith
2001-08-31 14:23:38 UTC
Re: Optimizing cutting paths - The proof
wanliker@a...
2001-08-31 15:07:19 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
wanliker@a...
2001-08-31 15:07:29 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
Peter Harrison
2001-09-01 16:26:06 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
Jon Elson
2001-09-01 17:35:37 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
Peter Harrison
2001-09-02 05:26:48 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
IMService
2001-09-02 06:19:28 UTC
Re:Re: Re: Optimizing cutting paths - The proof
Art Fenerty
2001-09-02 06:44:03 UTC
Re: [CAD_CAM_EDM_DRO] Re:Re: Re: Optimizing cutting paths - The proof
Tony Jeffree
2001-09-02 09:46:37 UTC
Re: Optimizing cutting paths - The proof
Fred Smith
2001-09-02 09:50:32 UTC
Re:Re: Re: Optimizing cutting paths - The proof
cncdxf@a...
2001-09-02 10:56:38 UTC
Re:Re: Re: Optimizing cutting paths - The proof
machines@n...
2001-09-02 11:31:28 UTC
Re:Re: Re: Optimizing cutting paths - The proof
cncdxf@a...
2001-09-02 13:26:21 UTC
Re:Re: Re: Optimizing cutting paths - The proof
Art Fenerty
2001-09-02 13:46:58 UTC
Re: [CAD_CAM_EDM_DRO] Re:Re: Re: Optimizing cutting paths - The proof
wanliker@a...
2001-09-02 14:09:54 UTC
Re: [CAD_CAM_EDM_DRO] Re:Re: Re: Optimizing cutting paths - The proof
wanliker@a...
2001-09-02 14:13:54 UTC
Re: [CAD_CAM_EDM_DRO] Re:Re: Re: Optimizing cutting paths - The proof
Gail & Bryan Harries
2001-09-02 14:41:43 UTC
RE: [CAD_CAM_EDM_DRO] Re:Re: Re: Optimizing cutting paths - The proof
Art Fenerty
2001-09-02 14:49:51 UTC
Re: [CAD_CAM_EDM_DRO] Re: Optimizing cutting paths - The proof
rab@r...
2001-09-02 15:00:12 UTC
Re:Re: Re: Optimizing cutting paths