Robustness of Q-ary collision resolution algorithms in random access systems

Houdt, Benny Van; Blondia, Chris

doi:10.1016/j.peva.2004.01.002

Cited by 7 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RAP are inherently unstable, so stabilization procedures must be seriously considered before being used in practical implementations. The stabilization procedure for RAP is implemented by combining two types of protocols or algorithms, channel access algorithms (CAA) and contention resolution algorithms (CRA) [14]. According to [15], they can also be characterized as global and local strategies, respectively.…”

Section: Related Workmentioning

confidence: 99%

“…Most of the proposed analytical models assume a perfect channel with no errors, negligible propagation delay, and no capture effect when a collision occurs. Also, an instantaneous ternary (E/S/C, E:empty, S:success, C:collision) or binary (C/No C, S/No S) feedback is quite often assumed [14]. With respect to the arrival process, for tractability, the standard approach is to assume a Poisson (Bernoulli) arrival process for infinite (finite) number of devices.…”

Section: Related Workmentioning

confidence: 99%

“…With respect to the arrival process, for tractability, the standard approach is to assume a Poisson (Bernoulli) arrival process for infinite (finite) number of devices. However, some studies propose different arrival processes, such as D-BMAP [14].…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Performance evaluation of framed slotted ALOHA with reservation packets and succesive interference cancelation for M2M networks

2019

View full text Add to dashboard Cite

Random access protocols like ALOHA have been considered for machine-to-machine (M2M) communication in future networks for their simplicity of operation. This paper evaluates the performance of a Frame Slotted-ALOHA protocol that uses reservation and data packets (FSA-RDP), in a scenario where a controller collects data packets transmitted by a finite number of M2M devices. In FSA-RDP, frames of variable duration are divided in two parts, the reservation and data subframes. During the reservation subframe, active devices send short reservation packets to the controller. The controller assigns reserved slots in the data subframe to those devices that succeeded with the reservation. At devices, the FIFO service discipline and two queue management schemes, tail drop and push-out, have been considered. When the queue size is of one packet, we develop a discrete-time Markov chain to evaluate the protocol performance, including the cumulative distribution function of the delay of data packets that are successfully transmitted. Analytical results are validated by extensive simulations. The simulation model is also used to evaluate the system performance when larger queues are used. In addition, we study the impact that implementing Successive Interference Cancellation (SIC) at the controller has on the system performance. We also evaluate the performance of implementing SIC at the controller together with Irregular Repetition Slotted ALOHA (IRSA) to send the reservation packets. Numerical results show that the protocol efficiency of FSA-RDP is between one and two orders of magnitude larger than the efficiency of conventional Frame Slotted ALOHA, when a perfect channel is assumed. In more realistic channel environments, the use of SIC brings an important performance boost.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Performance evaluation of framed slotted ALOHA with reservation packets and succesive interference cancelation for M2M networks

2019

View full text Add to dashboard Cite

show abstract

“…Typical applications of tree-like processes include single server queues with a LIFO service discipline [36,27,14,13]. In [29,34,31] tree-like processes were used to analyze a set of well-known random access algorithms, called tree or splitting algorithms. Some recent work also indicates that tree-like processes can be used to study priority queues [32].…”

Section: Introductionmentioning

confidence: 99%

Transient analysis of tree-Like processes and its application to random access systems

Velthoven

Houdt

Blondia

2006

SIGMETRICS Perform. Eval. Rev.

Self Cite

View full text Add to dashboard Cite

A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed to the standard tree-like process, such a process marks part of the time epochs by following a set of Markovian rules. Our interest lies in obtaining the system state at the n -th marked time epoch as well as the mean time at which this n -th marking occurs. The methodology transforms the transient problem into a stationary one by applying a discrete Erlangization and constructing a reset Markov chain. A fast algorithm, with limited memory usage, that exploits the block structure of the reset Markov chain is developed and is based, among others, on Sylvester matrix equations and fast Fourier transforms. The theory of tree-like processes generalizes the well-known paradigm of Quasi-Birth-Death Markov chains and has various applications. We demonstrate our approach on the celebrated Capetanakis-Tsybakov-Mikhailov (CTM) random access protocol yielding new insights on its initial behavior both in normal and overload conditions.

show abstract

“…This class of arrival processes is known to lend itself very well to modeling bursty and correlated arrival processes commonly arising in computer and communication applications [4,16,20,31,25]. Recently, Van Houdt and Blondia [30] studied the impact of introducing D-BMAPs arrivals on the stability of CTMV type random access systems with blocked and grouped access. In [29] Van Houdt and Blondia demonstrated that the basic binary CTMV algorithm with free access (see Section 2 for a description) can be studied, using matrix analytical methods, by constructing a tree structured Markov chain of the Quasi-Birth-Death (QBD) type (see Section 4).…”

mentioning

confidence: 99%

Throughput of Q-Ary Splitting Algorithms for Contention Resolution in Communication Networks

Blondia¹,

Houdt²

2004

Communications in Information and Systems

Self Cite

View full text Add to dashboard Cite

The throughput characteristics of contention-based random access channels which use Q-ary splitting algorithms (where Q is the number of groups into which colliding users are split) are analyzed. The algorithms considered are of the Capetanakis-Tsybakov-Mikhailov-Vvedenskaya (CTMV) type and are studied for infinite populations of identical users generating packets according to a discrete time batch Markovian arrival process (D-BMAP). D-BMAPs are a class of tractable Markovian arrival processes, which, in general, are non-renewal. Free channel-access is assumed in combination with Q-ary collision resolution algorithms that exploit either binary or ternary feedback. For the resulting schemes, tree structured Quasi-Birth-Death (QBD) Markov chains are constructed and their stability is determined. The maximum achievable throughput is determined for a variety of arrival processes and splitting factors Q. It is concluded that binary (Q = 2) and ternary (Q = 3) algorithms should be preferred above other splitting factors Q as the throughput for Q > 3 quickly degrades when subject to bursty arrival streams. If packets arrivals are correlated and bursty, higher throughput rates can be achieved by making use of biased coins.

show abstract

Robustness of Q-ary collision resolution algorithms in random access systems

Cited by 7 publications

References 24 publications

Performance evaluation of framed slotted ALOHA with reservation packets and succesive interference cancelation for M2M networks

Performance evaluation of framed slotted ALOHA with reservation packets and succesive interference cancelation for M2M networks

Transient analysis of tree-Like processes and its application to random access systems

Throughput of Q-Ary Splitting Algorithms for Contention Resolution in Communication Networks

Contact Info

Product

Resources

About