Unit IV – Data link layer

Error detection

• Parity checking
• Checksum
• Cyclic redundancy check (CRC)
• Hamming code
Parity checking
Checksum
Cyclic redundancy check
Hamming code
Flow control

• Stop & wait protocol

Advantages
• Simple to implement: The protocol's design is straightforward, making it easy to understand and
implement in network systems.
• Reliable error detection: By requiring an acknowledgment for each packet, it effectively detects
and retransmits data that might be corrupted during transmission.
• Suitable for low-bandwidth connections: Due to its single-packet transmission nature, it can be
efficient in situations with high latency or low bandwidth.
• Good for small data transfers: When transferring small amounts of data, the wait time for
acknowledgments may not be significant.
Disadvantages
• Low efficiency: The need to wait for each acknowledgment before sending the next packet can lead
to significant delays and reduced network throughput, especially when transmitting large data
volumes.
• Poor utilization of bandwidth: Since only one packet is sent at a time, the network bandwidth is
not fully utilized.
• Potential for retransmission delays: If an acknowledgment is lost, the sender needs to retransmit
the previous packet, which can further increase transmission time.
• Not suitable for high-speed applications: For applications requiring high data transfer rates, the
Stop & wait ARQ protocol
Sliding window protocol
• Advantages
• Increased efficiency: By sending multiple packets before waiting for acknowledgements, the sliding
window protocol significantly improves network utilization and reduces latency compared to stop-and-
wait protocols.
• Reliable data delivery: With proper error detection and retransmission mechanisms, sliding window
protocols ensure reliable data delivery even in networks with occasional errors.
• Adaptability: The size of the sliding window can be adjusted based on network conditions to optimize
performance.
• Full-duplex communication: Allows for simultaneous sending and receiving of data, improving overall
throughput.
• Disadvantages
• Potential for retransmission overhead: In scenarios with high error rates, especially with the "Go-Back-
N" variant, a single lost packet can trigger the retransmission of multiple previously sent packets, leading
to wasted bandwidth.
• Complexity in implementation: Compared to simpler protocols like stop-and-wait, the sliding window
protocol requires more complex logic to manage the window size and tracking of acknowledgements.
• Window size management: Choosing an optimal window size can be challenging, as too small a window
limits efficiency while too large a window can lead to excessive buffering and potential retransmissions.
Go back n ARQ
• Advantages:
• Improved efficiency: Allows the sender to send multiple frames before receiving
acknowledgments, maximizing network utilization.
• Pipelining: Enables continuous data transmission within the window size without waiting for
individual acknowledgments.
• Simple implementation: Relatively easy to understand and implement compared to other
ARQ protocols.
• Suitable for low error rates: Performs well in networks with infrequent errors.
• Disadvantages:
• Excessive retransmissions: If an error occurs, the sender must retransmit all unacknowledged
frames, even if only one is corrupted, leading to potential bandwidth waste.
• Buffering requirements: Sender needs to store all unacknowledged frames in a buffer,
increasing memory usage.
• Inefficient in high error environments: Performance degrades significantly when error rates
are high due to frequent retransmissions.
• Potential for delay: Retransmitting multiple frames can introduce noticeable delays in data
Advantages
• Efficient retransmission of lost packets
• Sends SACKs for packets received out of order or lost
• Helps in reducing network delay
Disadvantages
• High complexity and difficult to implement
• Requires more overhead due to the usage of SACKs
• Requires more buffering on both the sender and receiver sides
• May increase packet waiting time
Point to point protocol
• Point-to-Point Protocol (PPP) is a standard way to connect two devices directly over
a network. It's used to exchange data between devices over various physical
mediums, such as phone lines, fiber optics, and dial-up links.
• PPP encapsulates network layer protocol information over point-to-point links
• It uses a Link Control Protocol (LCP) to set up, test, and configure the data link
connection
• It uses a family of Network Control Protocols (NCPs) to set up and configure
different network-layer protocols
• PPP is used to establish connections over various physical mediums, such as dial-up
links and Ethernet
• It's used to allow remote access service products and devices from different
vendors to interoperate
Services provided by PPP:-
• Link establishment: Initiating and managing a connection between
two devices.
• Data encapsulation: Wrapping network layer data into PPP frames for
transmission.
• Authentication: Verifying the identity of connecting devices using
protocols like PAP or CHAP.
• Network layer protocol support: Ability to carry different network
protocols like IP over a point-to-point link.
• Configuration negotiation: Determining link parameters like packet
size and compression settings through Link Control Protocol (LCP).
• Error detection and correction: Ensuring data integrity during
transmission.
• Flag field – PPP frame similar to HDLC frame, always begins and ends with standard HDLC flag.
It always has a value of 1 byte i.e., 01111110 binary value.
• Address field – Address field is basically broadcast address. In this, all 1’s simply indicates that
all of the stations are ready to accept frame. It has the value of 1 byte i.e., 11111111 binary
value. PPP on the other hand, does not provide or assign individual station addresses.
• Control field – This field basically uses format of U-frame i.e., Unnumbered frame in HDLC. In
HDLC, control field is required for various purposes but in PPP, this field is set to 1 byte i.e.,
00000011 binary value. This 1 byte is used for a connection-less data link.
• Protocol field – This field basically identifies network protocol of the datagram. It usually
identifies the kind of packet in the data field i.e., what exactly is being carried in data field.
This field is of 1 or 2 bytes and helps in identifies the PDU (Protocol Data Unit) that is being
encapsulated by PPP frame.
• Data field – It usually contains the upper layer datagram. Network layer datagram is
particularly encapsulated in this field for regular PPP data frames. Length of this field is not
constant rather it varies.
• FCS field – This field usually contains checksum simply for identification of errors. It can be
either 16 bits or 32 bits in size. It is also calculated over address, control, protocol, and even
information fields. Characters are added to frame for control and handling of errors.