Ones Are Slower than Zeroes

Thinking about the implications of bit stuffing I wrote about in the SDLC post, I realized that long sequences of ones would be transmitted slower than long sequences of zeroes due to an extra bit being inserted after every fifth consecutive one. The theory would predict a 20% decrease in transmission speed.

Of course I wanted to test this phenomenon immediately. I connected two routers with a low-speed (64 kbps) link, and started a series of pings. Not surprisingly, the results confirmed the theory:

Internal-Core#ping 197.1.1.49 data 0000 size 1200 repeat 50
Sending 50, 1200-byte ICMP Echos to 197.1.1.49, timeout is 2 seconds:
Packet has data pattern 0x0000
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Success rate is 100 percent (50/50), round-trip min/avg/max = 608/608/632 ms

Internal-Core#ping 197.1.1.49 data FFFF size 1200 repeat 50
Sending 50, 1200-byte ICMP Echos to 197.1.1.49, timeout is 2 seconds:
Packet has data pattern 0xFFFF
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Success rate is 100 percent (50/50), round-trip min/avg/max = 724/724/728 ms

The results are almost too close to the predicted ones, but they are real :)

3 comments:

  1. It's an old trick.

    You can also correctly guess encapulation type of the first hop, after this - of second hop etc. Furthermore there were some utility for this.

    --
    mtve
  2. Well, if you want to guess hop-by-hop encapsulation, you have to ensure that the noise in the system (i.e. other packets) is minimized. Either you do the measurements when the network is idle or take very large samples.

    I should know how to do it properly; after all, I've attended an advanced digital signal processing class a long time ago, but it's all blurry now.
  3. I'm interested in how to check encapsulation hop-by-hop. Please write a blog if you can...

    Thanks in advance for this..
Add comment
Sidebar