0% found this document useful (0 votes)
0 views

Elementary data link layer protocols

The document discusses elementary data link layer protocols, focusing on framing, error control, and flow control. It describes the Simplex and Simplex Stop and Wait protocols for unidirectional data transmission, detailing their operational procedures. Additionally, it covers error detection and correction methods, specifically Hamming code, which adds parity bits to detect and correct errors in transmitted data.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
0 views

Elementary data link layer protocols

The document discusses elementary data link layer protocols, focusing on framing, error control, and flow control. It describes the Simplex and Simplex Stop and Wait protocols for unidirectional data transmission, detailing their operational procedures. Additionally, it covers error detection and correction methods, specifically Hamming code, which adds parity bits to detect and correct errors in transmitted data.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1)Elementary data link layer protocols

Protocols in the data link layer are designed so that this layer can perform its
basic functions: framing, error control and flow control. Framing is the process
of dividing bit - streams from physical layer into data frames whose size ranges
from a few hundred to a few thousand bytes.

A protocol refers to a defined set of guidelines and regulations that control the
communication between different devices in a network. These guidelines
specify the way in which data is formatted, timed, sequenced, and checked for
errors during transmission

Simplex Protocol

The Simplex protocol is hypothetical protocol designed for unidirectional data


transmission over an ideal channel, i.e. a channel through which transmission
can never go wrong. It has distinct procedures for sender and receiver. The
sender simply sends all its data available onto the channel as soon as they are
available its buffer. The receiver is assumed to process all incoming data
instantly. It is hypothetical since it does not handle flow control or error control.
In this protocol, infinite buffer space is available, and no errors are occurring
that is no damage frames and no lost frames.

Simplex Stop and Wait protocol

In this protocol we assume that data is transmitted in one direction only. No


error occurs; the receiver can only process the received information at finite
rate. These assumptions imply that the transmitter cannot send frames at rate
faster than the receiver can process them. The main purpose here is how to
prevent the sender from flooding the receiver. The general solution for this
problem is to have the receiver send some sort of feedback to sender, the
process is as follows −

Step1 − The receiver send the acknowledgement frame back to the sender
telling the sender that the last received frame has been processed and passed to
the host.
Step 2 − Permission to send the next frame is granted.
Step 3 − The sender after sending the sent frame has to wait for an acknowledge
frame from the receiver before sending another frame.

This protocol is called Simplex Stop and wait protocol, the sender sends one
frame and waits for feedback from the receiver. When the ACK arrives, the
sender sends the next frame.
2)Error Detection and Correction in Data link
Layer
Error Detection and Correction

1. Receive the Data:


o Upon receiving the transmitted data, recompute the parity bits.
2. Calculate the Error Syndrome:
o Compare the received parity bits with the recalculated ones.
o Combine the results to form an error syndrome, which
indicates the position of the erroneous bit (if any).
3. Correct the Error:
o If the error syndrome is 0, no errors occurred.
o If the syndrome points to a specific position, flip the bit at that
position to correct the error

What is Hamming code?


Hamming code is an error correction system that can detect and correct errors
when data is stored or transmitted. It requires adding additional parity bits with
the data. It is commonly used in error correction code (ECC) RAM. It's named
after its inventor, Richard W. Hamming.

Whenever data is transmitted or stored, it's possible that the data may become
corrupted. This can take the form of bit flips, where a binary 1 becomes a 0 or
vice versa. Error correcting codes seek to find when an error is introduced into
some data. This is done by adding parity bits, or redundant information, to the
data.

Hamming code uses a block parity mechanism. The data is divided into blocks,
and parity is added to the block. Hamming code can correct single-bit errors and
detect the presence of two-bit errors in a data block.

You need to write Hamming code algorithm Algorithm will share by


tomorrow morning

You might also like