Delay analysis of the Go-Back-N ARQ protocol over a time-varying channel

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present an analytical technique, based on the use of probability generating functions, to analyze the throughput performance and the transmitter buffer behavior of a Go-Back-N ARQ system, with the notable complication that the errors in the channel are correlated in time. We model the transmitter buffer as a discrete-time queue with infinite storage capacity and independent and identically distributed packet arrivals. Arriving packets are stored in the queue until they are successfully transmitted over the channel. The probability of an erroneous transmission is modulated by a general Markov chain with M states, rather than assuming stationary channel errors. We find explicit expressions for the probability generating functions of the buffer content and packet delay. From these functions moments and tail probabilities can be derived. Numerical results illustrate the impact of the error process on the system performance. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

De Turck, K., & Wittevrongel, S. (2005). Delay analysis of the Go-Back-N ARQ protocol over a time-varying channel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3670 LNCS, pp. 124–138). Springer Verlag. https://doi.org/10.1007/11549970_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free