







Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The data link layer in computer networks, focusing on framing, error detection and correction techniques. It covers unacknowledged and acknowledged services, framing methods, byte stuffing, bit stuffing, and error detection and correction techniques such as arq, fec, and h-arq. The hamming distance and singleton bound are also explained.
Typology: Study notes
1 / 13
This page cannot be seen from the preview
Don't miss anything!








Data Link Layer (I)
Lecture 4
Data Link Layer (I)
Provide a well-defined service interface Group bits (PHY) into frames (DL) Deal with transmission errorsDeal with transmission errors Regulate the flow of frames
Unacknowledged connectionlessservice Acknowledged connectionless serviceAcknowledged connectionless service Acknowledged connection-orientedservice
Character count Flag bytes with byte stuffing Starting and ending flags with bit stuffingstuffing
Tightly tied to the used of 8-bit characters
Use redundancy
ARQ: Error detection and retransmission
FEC: Error correction (forward error
FEC: Error correction (forward error correction)
H-ARQ: combination ARQ and FEC
Codewords (n bits): message (k bits) + checkbits (r bits) Hamming distance: the number of positions inwhich two codewords differ Hamming distance of the complete code (d_min):two codewords with the minimum Hammingdistance To
detect
t
errors, Hamming distance
of the code
:
(
t
+1)
To
correct
t
errors, Hamming distance
of the
code
: (
t
+1)
Each linear code has a generator matrixG. The output codeword of encoder isThe output codeword of encoder is
where s is the row vector of source information bits.