Delay Performance Analysis of the NAK-based SR-ARQ Protocol with the Reverse Acknowledgment (RA) Scheme 


Vol. 33,  No. 11, pp. 989-997, Nov.  2008


PDF
  Abstract

The reverse acknowledgment (RA) scheme supports a fast loss recovery for negative acknowledgment (NAK)-based selective repeat automatic repeat request (SR-ARQ) by detecting a retransmission failure quickly before a retransmission timer expires. In this paper, we evaluate the performance of a NAK-based SR-ARQ protocol with the RA scheme and compare it with the conventional NAK-based SR-ARQ protocol. Particularly, we propose a simple analysis model for the transport delay of the NAK-based SR-ARQ protocol considering the traffic condition, the retransmission persistence, the timer-based retransmissions and the RA scheme's behavior. Both NAK-based SR-ARQ protocols with and without the RA scheme are implemented by using the OPNET simulator. We verified the analysis model's accuracy through the simulation results. Also, we evaluate the performance of the NAK-based SR-ARQ protocol with the RA scheme based on analysis and simulation results.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Han and J. Lee, "Delay Performance Analysis of the NAK-based SR-ARQ Protocol with the Reverse Acknowledgment (RA) Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 11, pp. 989-997, 2008. DOI: .

[ACM Style]

Jechan Han and Jaiyong Lee. 2008. Delay Performance Analysis of the NAK-based SR-ARQ Protocol with the Reverse Acknowledgment (RA) Scheme. The Journal of Korean Institute of Communications and Information Sciences, 33, 11, (2008), 989-997. DOI: .

[KICS Style]

Jechan Han and Jaiyong Lee, "Delay Performance Analysis of the NAK-based SR-ARQ Protocol with the Reverse Acknowledgment (RA) Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 11, pp. 989-997, 11. 2008.