In a data communications system, what is a “killer packet”?
There are many types of data communications systems, which, in lieu of using a self-clocking code, rely on there being enough one-zero and zero-one transitions in the data itself to provide a frequency reference. Long strings of ones or zeros can make such a system fail temporarily while it tries to recover timing, so the designers use what are called “data scramblers” (pseudorandom number generators) to randomize the data.
This works really well when the payload is, for example, a set of multiplexed audio (telephone) channels. However, in these days of purely digital packet-based (e.g., Internet) traffic, it is possible for the payload of a packet to match relatively long sequences in the data scrambler, producing long strings of ones or zeros even after scrambling.
In fact, if one knows the characteristics of the scrambler being used — and this is usually specified in the relevant public standard — it is possible to deliberately design a “killer packet” that will achieve this. Even though the alignment of the packet with the scrambler is still random, sending enough of them will disrupt a typical network within a few seconds (or less).
|Keep up-to-date with our FREE Weekly Newsletter!||
Don't miss out on upcoming issues of Circuit Cellar.
Note: We’ve made the May 2020 issue of Circuit Cellar available as a free sample issue. In it, you’ll find a rich variety of the kinds of articles and information that exemplify a typical issue of the current magazine.
|Would you like to write for Circuit Cellar? We are always accepting articles/posts from the technical community. Get in touch with us and let's discuss your ideas.|