Module 3 — Computer Networks (DLL) 5-Mark Answers
1. Framing in Data Link Layer
Definition:
Framing is the process of dividing the continuous bit stream received from the network layer into
small manageable units called frames, so the receiver can identify the beginning and end of each
data unit.
Need for Framing
Synchronization between sender and receiver
Error detection per frame
Flow control handling
Addressing (source & destination MAC)
Frame Structure
| Header | Payload/Data | Trailer |
Header → Address, control info
Trailer → Error detection bits (CRC)
Framing Techniques
1. Character Count Method – Header specifies frame length.
2. Byte Stuffing – Special flag bytes indicate frame boundaries.
3. Bit Stuffing – Extra bit inserted after 5 consecutive 1s.
4. Physical Layer Coding Violation – Uses illegal signal patterns.
Conclusion:
Framing enables reliable and organized transmission at the data link layer.
2. Stop and Wait Protocol
Definition:
Stop-and-Wait is a flow control protocol in which the sender transmits one frame and waits for an
acknowledgment before sending the next frame.
Working
1. Sender sends frame with sequence number.
2. Receiver checks errors.
3. If correct → sends ACK.
4. Sender receives ACK → sends next frame.
5. If timeout occurs → frame retransmitted.
Sequence Numbers
Uses 1-bit sequence number (0 and 1).
Prevents duplicate frame acceptance.
Advantages
Simple implementation
Reliable transmission
Disadvantages
Poor channel utilization
High delay in long-distance links
Conclusion:
Suitable for low-speed communication but inefficient for modern high-speed networks.
3. Selective Repeat ARQ
Definition:
Selective Repeat Automatic Repeat Request is an error control protocol where only erroneous or lost
frames are retransmitted instead of all frames.
Working
1. Sender transmits multiple frames within window size.
2. Receiver acknowledges each correct frame individually.
3. Receiver buffers out-of-order frames.
4. Sender retransmits only missing frames.
Key Features
Uses sliding window technique
Window size ≤ half of sequence number range
Requires buffers at both sender and receiver
Advantages
Efficient bandwidth usage
Reduces unnecessary retransmissions
Disadvantages
Complex logic
Requires more memory
Conclusion:
Selective Repeat provides higher efficiency than Go-Back-N and Stop-Wait protocols.
4. Error Control and Flow Control in DLL
Error Control
Ensures that frames are delivered correctly and in order despite transmission errors.
Methods
Error detection codes (CRC, checksum)
Retransmission (ARQ protocols)
Sequence numbering
Flow Control
Controls transmission speed so sender does not overwhelm receiver.
Methods
Stop-and-Wait
Sliding Window
Difference
Error Control Flow Control
Ensures accuracy Ensures speed matching
Handles corrupted frames Handles buffer overflow
Uses ARQ Uses window mechanisms
Conclusion:
Both mechanisms together guarantee reliable and efficient communication.
5. Error Control Techniques in DLL
Error control techniques detect and correct transmission errors.
Techniques
1. Parity Check – Adds one parity bit for error detection.
2. Checksum – Sum of data units transmitted.
3. CRC (Cyclic Redundancy Check) – Polynomial division method.
4. Hamming Code – Corrects single-bit errors.
5. ARQ Protocols
o Stop & Wait
o Go-Back-N
o Selective Repeat
Purpose
Detect corrupted frames
Request retransmission
Maintain data integrity
Conclusion:
Error control ensures reliable communication over noisy channels.
6. Flow Control Methods in DLL
Flow control ensures sender transmits data at a rate acceptable to receiver.
Methods
1. Stop-and-Wait Flow Control
Sender sends one frame
Waits for ACK
Simple but slow
2. Sliding Window Flow Control
Sender can send multiple frames before ACK
Window size determines number of frames
Improves efficiency
Advantages of Sliding Window
Higher throughput
Better channel utilization
Conclusion:
Sliding window is widely used due to efficiency compared to stop-and-wait.
7. Numerical Procedure — Hamming Code
Definition:
Hamming code is an error detection and correction technique that can correct single-bit errors.
Steps
1. Determine number of parity bits (r)
Condition:
2^r ≥ m + r + 1
2. Place parity bits at positions
1, 2, 4, 8, 16…
3. Fill data bits in remaining positions.
4. Calculate parity bits (even/odd).
5. Transmit codeword.
At Receiver
Recalculate parity bits
Binary result gives error position
Flip that bit
Example Result Interpretation
Error bits = 0110 → decimal 6 → error at bit 6.
8. Numerical Procedure — CRC
Definition:
CRC is an error detection method that uses polynomial division to detect errors in transmitted
frames.
Steps
1. Let dataword = D
Generator polynomial = G
2. Append (n−1) zeros to D (n = bits in G).
3. Perform mod-2 division of D by G.
4. Remainder = CRC bits.
5. Append remainder to data → transmitted frame.
Receiver
Divide received frame by G
Remainder = 0 → No error
Remainder ≠ 0 → Error detected
Advantages
Detects burst errors
Highly reliable
Widely used in networks