SR ARQ packet delay statistics on markov channels in the presence of variable arrival rate (original) (raw)
Related papers
Exact statistics of ARQ packet delivery delay over Markov channels with finite round-trip delay
2003
In this paper the packet delay statistics of a fully reliable Selective-Repeat ARQ scheme is investigated. It is assumed that the sender continuously transmits packets whose error process is characterized by means of a two-state Discrete Time Markov Channel. At the receiver these packets are checked for errors and ACK/NACK messages (assumed error-free) are sent back to the sender accordingly. The feedback message is known at the transmitter ¢ channel slots (round-trip delay) after the packet transmission started. An appropriate Markov model has been developed in order to find the exact statistics of the delays experienced by ARQ packets after their first transmission.
Analysis of SR ARQ Delays Using Data-bundling over Markov Channels
Data-bundling is a useful technique that decreases the delivery delay of packet streams when they are transmitted over noisy channels and are subject to retransmission-based error control. In this paper, we investigate the packet delay statistics for a fully reliable selective repeat automatic repeat request (SR ARQ) where a data-bundling mechanism is employed. In more detail, we discuss a model for data-bundling to analyze the SR ARQ mechanism over wireless channels based on Markov chains. We evaluate various channel error distributions and analyze the buffer occupancy to check if the data-bundling mechanism provides efficient results. We further analyze the queueing, delivery and overall delay statistics at link layer. We found that using data-bundling can improve the delay performance of the SR ARQ mechanism, especially when bursty channels with heavily correlated errors are considered. Thus, this technique can bring useful improvements for real-time services, multimedia, and other delay-sensitive applications over wireless networks.
Delay analysis of the stop-and-wait ARQ protocol over a correlated error channel
Proceedings of the Second …, 2004
In this paper, we present the analysis of the Stop-and-Wait ARQ (Automatic Repeat reQuest) protocol with the notable complication that the transmission errors occur in a bursty, correlated manner. Fixed-length packets of data are sent from transmitter to receiver over an error-prone channel. The receiver notifies the transmitter whether a packet was received correctly or not by returning a feedback message over the backward channel. If necessary, the packet is retransmitted until it is received correctly, after which the transmission of another packet starts. For the Stop-and-Wait protocol, no other packets are transmitted while the transmitter waits for a feedback message.
Queueing analysis of the stop-and-wait ARQ protocol in a wireless environment
Proc. COST279 Eight …, 2003
This paper presents an analytical approach for analyzing the queue length and the packet delay in the transmitter buffer of a system working under a stop-and-wait retransmission protocol. The buffer at the transmitter side is modelled as a discrete-time queue with an infinite storage capacity. The numbers of packets entering the buffer during consecutive slots are assumed to be independent and identically distributed (i.i.d.) random variables. The information packets are sent through an unreliable and nonstationary channel, which is modelled by means of a two-state Markov chain. An explicit formula is derived for the probability generating function (pgf) of the system contents. This pgf can then be used to derive several queue-length characteristics as well as the mean packet delay. By means of some numerical examples the effect of error correlation on the system performance is illustrated. Finally, the obtained analytical results are compared with the appropriate simulations according to the described model.
Receiver buffer behavior for the selective-repeat ARQ protocol
Computer Networks and ISDN Systems, 1990
In this paper, we formulate and analyze a model of the resequencing buffer at the receiver's side for the Selective Repeat protocol over a general class of transmission channels. Thanks to its efficiency, Selective Repeat is a ubiquitous error control mechanism in many different settings, in particular in wireless protocols such as WiMax and WiFi.
IEEE Transactions on Vehicular Technology, 2003
In this paper, we consider a point-to-point wireless transmission where link layer ARQ is used to counteract channel impairments. In particular, we refer, as an example, to a 3G cellular system, where a dedicated channel is used between a mobile terminal and its serving base station. Our aim is to find accurate and fast heuristics for the characterization of link layer and higher level (e.g., application level) packet delay. Existing methods to obtain such statistics are often based on recursive computations or largesized matrix manipulations. For these reasons, they are too complex to be successfully applied in a mobile terminal due to memory, delay, and energy constraints. In this paper, we first present an analytical framework to compute link-layer packet delivery delay statistics as a function of the packet error rate; then we extend the model in order to find the statistics related to higher level packets (i.e., to aggregates of link layer packets). Both in-order and out-oforder delivery of link-layer packets to higher levels are considered. The goodness of the channel model considered in the analysis is proved by means of accurate channel simulation results. The obtained statistics are then characterized by highlighting their properties as a function of the round-trip time and the error rate at the link layer. Finally, fast and accurate heuristics are derived directly from the analysis. These heuristics are very simple (piecewise linear functions), so they can be effectively used in a mobile terminal to obtain accurate delay statistics estimates with little computational effort.
IEEE Transactions on Vehicular Technology, 2014
This correspondence deals with the modelling and analysis of the resequencing delay in Time Division Duplexing communication systems which adopt the Selective Repeat Automatic Repeat-reQuest error control strategy. Under the assumption that packet mis-ordering at the receiving end is induced by channel errors, the correspondence proposes an analytical approach based on the Absorbing Markov Chain theory in order to accurately predict the impact of the resequencing delay on the quality of the provided services. Numerical results, derived by means of computer simulations, are also given in order to validate the proposed analytical model. Index Terms-SR-ARQ Schemes, Resequencing Delay, Absorbing Markov Chain. [15]. This correspondence specifically focuses on packet misordering caused by channel errors as assumed in [12]-[15]. In particular, in [12] authors investigate the packet resequencing delay by providing an analytical framework based on the theory of G/M/1 queueing systems with service vacation. In [13] the in-sequence delivery delay is evaluated by considering a
Advances in Science, Technology and Engineering Systems Journal
Stop and Wait (SW) ARQ, Go Back N (GBN) ARQ, and Selective Repeat (SR) ARQ are the main ARQ (Automatic-Repeat-reQuest) protocols used to ensure reliable delivery of digital data at correct sequence. These protocols are implemented at the DLC (Data Link Control) sub layer of Data Link Layer (DLL) of OSI (Open System Interconnection) network model. The main task of such protocols is controlling errors and providing smooth and reliable transmission between communicating nodes. This is mostly done by using acknowledgements and timeouts to satisfy reliable data transmission over unreliable channels. This paper completes measuring the performance of SR ARQ protocol. We study and analyze the service time distribution of SR ARQ protocol used in digital data transmission over unreliable channels. Stochastic Process and Markov Chains have been used to study the proposed network model. Closed and analytic expressions of the Probability Generating Function (PGF) of service time are calculated considering two different situations (short and long messages). Moreover, expressions for first and second moments of the service time are derived. ARQ protocols are basically applied on shortwave radio to provide reliable delivery of signals and in peer-to-peer protocols that provide reliable data transmission. The obtained results can be applied in simulations of similar communication systems and may be adopted in approximating some relevant systems.
Resequencing delay and buffer occupancy under the selective-repeat ARQ
IEEE Transactions on Information Theory, 1989
Consider a communication network that regulates retransmissions of erroneous packets by a selective-repeat (SR) automatic repeat request (ARQ) protocol. Packets are assigned consecutive integers, and the transmitter continuously transmits them in order until a negative acknowledgment or a time-out is observed. The receiver, upon receipt of a packet, checks for errors and returns positive/negative acknowledgment (ACK/NACK) accordingly. Only packets for which either NACK or time-out have been observed are retransmitted. Under SR ARQ, the receiver accepts packets that are out of order and must store them temporarily if it has to deliver them in sequence. The resequencing buffer requirements and the resulting packet delay constitute major factors in overall system considerations. We derive the distributions of the buffer occupancy and the resequencing delay at the receiver under a heavy traffic situation. This enables the network designer to determine how much buffer capacity at the receiver will guarantee certain specified performance measures.