Scribd
Upload
159 views1 page

Assignment 3

This document contains 9 questions about data link layer protocols and techniques including framing methods, byte stuffing, bit stuffing, Hamming codes, checksums, and cyclic redundancy checks (CRCs). Specifically, it asks about: 1) Framing methods and byte sequences for flag bytes, byte count, and bit stuffing. 2) Output after byte stuffing a data fragment. 3) Maximum overhead of byte-stuffing. 4) Whether ending each frame with a flag byte is wasteful. 5) Output after bit stuffing a bit string. 6) Number of check bits needed for a Hamming code to detect and correct single-bit errors.

Uploaded by

muse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
159 views1 page

Assignment 3

This document contains 9 questions about data link layer protocols and techniques including framing methods, byte stuffing, bit stuffing, Hamming codes, checksums, and cyclic redundancy checks (CRCs). Specifically, it asks about: 1) Framing methods and byte sequences for flag bytes, byte count, and bit stuffing. 2) Output after byte stuffing a data fragment. 3) Maximum overhead of byte-stuffing. 4) Whether ending each frame with a flag byte is wasteful. 5) Output after bit stuffing a bit string. 6) Number of check bits needed for a Hamming code to detect and correct single-bit errors.

Uploaded by

muse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ADVANCED COMPUTER NETWORKS

Assignment 3: Data Link Layers

Assigned on: 29 March 2017


Due by: 04 April 2017 for Communication and Computer

Taken from: A S Tannenbaum "Computer Networks" Prentice Hall of India Publication, 2002.

1. The following character encoding is used in a data link protocol:


A: 01000111 B: 11100011 FLAG: 01111110 ESC: 11100000
Show the bit sequence transmitted (in binary) for the four-character frame A B ESC
FLAG when each of the following framing methods is used:
(a) Byte count.
(b) Flag bytes with byte stuffing.
(c) Starting and ending flag bytes with bit stuffing.
2. The following data fragment occurs in the middle of a data stream for which the byte
stuffing algorithm described in the text is used: A B ESC C ESC FLAG FLAG D. What
is the output after stuffing?
3. What is the maximum overhead in byte-stuffing algorithm?
4. One of your classmates, Scrooge, has pointed out that it is wasteful to end each frame
with a flag byte and then begin the next one with a second flag byte. One flag byte could
do the job as well, and a byte saved is a byte earned. Do you agree?
5. A bit string, 0111101111101111110, needs to be transmitted at the data link layer.
What is the string actually transmitted after bit stuffing?
6. Sixteen-bit messages are transmitted using a Hamming code. How many check bits
are needed to ensure that the receiver can detect and correct single-bit errors? Show
the bit pattern transmitted for the message 1101001100110101. Assume that even parity
is used in the Hamming code.
7. Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum
(4-bit word). What is the value of the checksum?
8. What is the remainder obtained by dividing x 7 + x 5 + 1 by the generator polynomial
x 3 + 1?
9. A bit stream 10011101 is transmitted using the standard CRC method described in the
text. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Suppose
that the third bit from the left is inverted during transmission. Show that this
error is detected at the receiver’s end. Give an example of bit errors in the bit string
transmitted that will not be detected by the receiver.

You might also like