On the applicability of the number of collisions in p-persistent CSMA/CD protocols

Gómez‐Corral, Antonio

doi:10.1016/j.cor.2009.09.006

Cited by 9 publications

(5 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…wireless networks. Therefore, retrial queueing models are considered to be more appropriate than standard queueing models in modelling and performance analysis of these protocols [35,67]. The readers are referred to the book by Kurose and Ross for a detailed explanation on protocols for local area networks [83].…”

Section: Local Area Networkmentioning

confidence: 99%

Retrial Queueing Models: A Survey on Theory and Applications

Phung-Duc¹

2019

Preprint

View full text Add to dashboard Cite

Retrial phenomenon naturally arises in various systems such as call centers, cellular networks and random access protocols in local area networks. This paper gives a comprehensive survey on theory and applications of retrial queues in these systems. We investigate the state of the art of the theoretical researches including exact solutions, stability, asymptotic analyses and multidimensional models. We present an overview on retrial models arising from real world applications. Some open problems and promising research directions are also discussed.

show abstract

Section: Local Area Networkmentioning

confidence: 99%

Retrial Queueing Models: A Survey on Theory and Applications

Phung-Duc¹

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…In many communications involving data transmission from diverse sources there can be conflict for a limited number of channels or other facilities. Recent results on retrial queues with collisions can be found in, for example Ali and Wei (2015), Balsamo et al (2013), Choi et al (1992), Gómez-Corral (2010), Kim (2010), Kumar et al (2010a, b), and Peng et al (2014).…”

Section: Introductionmentioning

confidence: 99%

Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs

et al. 2019

View full text Add to dashboard Cite

The aim of the present paper is to investigate the steady-state distribution of response and waiting time in a finite-source M / M / 1 retrial queuing system with collision of customers where the server is subjects to random breakdowns and repairs depending on whether it is idle or busy. An asymptotic method is applied under the condition that the number of sources tends to infinity, the primary request generation rate, retrial rate tend to zero while service rate, failure rates, repair rate are fixed. As the result of the analysis it is shown that the steady-state probability distribution of the number of transitions/retrials of the customer into the orbit is geometric with a given parameter, and the normalized sojourn time of the customer in the system follows a generalized exponential distribution. It is also proved that the limiting distributions of the normalized sojourn time of the customer in the system and the normalized sojourn/waiting time of the customer in the orbit coincide. The novelty of this investigation is the introduction of failure and repair of the server. Approximations of prelimit distributions obtained with the help of stochastic simulation by asymptotic one are considered and several illustrative examples show the accuracy and range of applicability of the proposed asymptotic method.

show abstract

“…A comparison between retrial queues and their standard counter parts with classical waiting line is released in [3]. Retrial queues have been widely used as mathematical models of different communication systems: shared bus local area networks operating under transmission protocols like CSMA/CD (Carrier Sense Multiple Access with Collision Detection), cellular mobile networks, IP networks [9], [1], [6].…”

Section: Introductionmentioning

confidence: 99%

On the performance of the M1,M2/G1,G2/1 retrial queue with pre-emptive resume policy

Boutarfa

Djellab

2015

YUGOSLAV J OPERATION

View full text Add to dashboard Cite

Priority mechanism is an invaluable scheduling method that allows customers to receive different quality of service. Service priority is clearly today a main feature of the operation of any manufacturing system. We are interested by an M1,M2/G1,G2/1 priority retrial queue with pre-emptive resume policy. For model in question, we discuss the problem of ergodicity and, by using the method of supplementary variables, find the partial generating functions of the steady state system state distribution. Moreover, some pertinent performance measures are obtained and numerical study is also performed.

show abstract

On the applicability of the number of collisions in p-persistent CSMA/CD protocols

Cited by 9 publications

References 35 publications

Retrial Queueing Models: A Survey on Theory and Applications

Retrial Queueing Models: A Survey on Theory and Applications

Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs

On the performance of the M1,M2/G1,G2/1 retrial queue with pre-emptive resume policy

Contact Info

Product

Resources

About