Piggybacking (data transmission)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In two-way communication, wherever a frame is received, the receiver waits and does not send the control frame (acknowledgement or ACK) back to the sender immediately.

The receiver waits until its network layer passes in the next data packet; the delayed acknowledgement is then attached to this outgoing data frame.

This technique of temporarily delaying the acknowledgement so that it can be hooked with next outgoing data frame is known as piggybacking.

Working Principle[edit]

Piggybacking data is a bit different from Sliding Window Protocol used in the OSI model. In the data frame itself, we incorporate one additional field for acknowledgment (called ACK).

Whenever party A wants to send data to party B, it will carry additional ACK information in the PUSH as well.

For example, if A has received 5 bytes from B, which sequence number starts from 12340 (through 12344), A will place "ACK 12345" as well in the current PUSH packet to inform B it has received the bytes up to sequence number 12344 and expects to see 12345 next time. (ACK number is the next sequence number of the data to be PUSHed by the other party.)

Three rules govern the piggybacking data transfer.

  • If station A wants to send both data and an acknowledgment, it keeps both fields there.
  • If station A wants to send just the acknowledgment, then a separate ACK frame is sent.
  • If station A wants to send just the data, then the last acknowledgment field is sent along with the data. Station B simply ignores this duplicate ACK frame upon receiving .

Advantages and Disadvantages[edit]

Advantages : Improves the efficiency, better use of available channel bandwidth.[1] Disadvantages : The receiver can jam the service if it has nothing to send. This can be solved by enabling a counter (Receiver timeout) when a data frame is received. If the count ends and there is no data frame to send, the receiver will send an ACK control frame; the sender also adds a counter (Emitter timeout), if the counter ends without receiving confirmation, the sender assumes packet loss, and sends the frame again.

References[edit]

  1. ^ Tanenbaum, Andrew & Wetherall, David. Computer Networks, 5th Edition, Pearson Education Limited, , 2014, p 226.