Traffic analysis of a local area network with a star topology

Mehmet-Ali, Mustafa; Hayes, Jeremiah F.; Elhakeem, A.K.

doi:10.1109/26.2790

Cited by 29 publications

(10 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The assumption of a finite number of customers is of special interest to practice, as in real situations the number of subscribers is finite. In particular, the described finite single server retrial queue and its variants are useful in modeling magnetic disk memory systems (Ohmura and Takahashi, 1985), a star-like local area networks (Janssens, 1997;Mehmet-Ali et al, 1988), a local area networks with nonpersistent CSMA/CD protocol (Li and Yang, 1995), telephone networks (Kornyshev, 1969), etc.…”

Section: Introductionmentioning

confidence: 99%

A Finite Source Retrial Queue: Number of Retrials

Dragieva

2013

Communications in Statistics - Theory and Methods

View full text Add to dashboard Cite

We consider a single-server queuing system with a finite number of sources, where customers are not allowed to queue; instead of that, they make repeated attempts, or retrials, in order to enter service after some time. This queuing system and its variants are widely used to model disk memory systems, star-like local area networks, and other communication systems. The article extends previous works on this topic and deals with the number of retrials, produced by a tagged customer, until he finds the server available. An algorithm for determination of all moments of this number is obtained, and the results of numerical experiments are presented.

show abstract

Section: Introductionmentioning

confidence: 99%

A Finite Source Retrial Queue: Number of Retrials

Dragieva

2013

Communications in Statistics - Theory and Methods

View full text Add to dashboard Cite

show abstract

“…Retrial queues with quasi-random input are recent interest in modelling magnetic disk memory systems [23], cellular mobile networks [28], computer networks [15], and local-area networks with nonpersistent CSMA/CD protocols [21], with star topology [16,22], with random access protocols [17], and with multiple-access protocols [18].…”

Section: Introductionmentioning

confidence: 99%

Heterogeneous Finite-Source Retrial Queues

Almási

Bolch

Sztrik

2004

Journal of Mathematical Sciences

View full text Add to dashboard Cite

In this paper we investigate a single server retrial queue with a finite number of heterogeneous sources of calls. It is assumed when a given source is idle it will generate a primary call after an exponentially distributed time. If the server is free at the time of the request's arrival then the call starts to be served. The service time is also exponentially distributed. During the service time the source cannot generate a new primary call. After service the source moves into free state and can generate a new call again. If the server is busy at the time of the arrival of a primary call, then the source starts generating so called repeated calls with exponentially distributed times until it finds the server free. As before, after service the source becomes free and can generate a new primary call again. We assume that the primary calls, repeated attempts and service times are mutually independent. This queueing system and its variants could be used to model magnetic disk memory systems, local area networks with CSMA/CD protocols and collision avoidance local area networks. The novelty of this model is the heterogeneity of the calls, which means that each call is characterized by its own arrival, repeated and service rates. The aim of the paper is to give the usual steady-state performance measures of the system. To do so, an efficient software tool, MOSEL ( Modeling, Specification and Evaluation Language ) developed at the University of Erlangen, Germany, is used to formulate and solve the problem. Several sample numerical results illustrate the power of the tool showing the effect of different parameters on the system measures.

show abstract

“…In order to approximate such systems we need finite-source (also called quasi-random input or closed) queueing models. These models arise in various practical areas as local area networks (Janssens 1997;Li and Yang 1995;Mehmet-Ali et al 1988), cellular mobile networks (Artalejo and Gómez-Corral 2007;Tran-Gia and Mandjes 1997;Van Do et al 2014 (Ohmura and Takahashi 1985), bufferless optical networks (Overby 2005;Zukerman et al 2004), mobile networks that provide packet radio service (Dahmouni et al 2005).…”

Section: Introductionmentioning

confidence: 99%

Steady state analysis of the M/G/1//N queue with orbit of blocked customers

Dragieva

2015

Ann Oper Res

View full text Add to dashboard Cite

This article considers a finite-source queueing model of M/G/1 type in which a customer, arriving at a moment of a busy server, is not allowed either to queue or to do repetitions. Instead, for an exponentially distributed time interval he is blocked in the orbit of inactive customers. We carry out a steady state analysis of the system and compare it with the corresponding system with retrials. Optimization problems are considered and formulas for the Laplace-Stieltjes transform of the busy period length are obtained.

show abstract

Traffic analysis of a local area network with a star topology

Cited by 29 publications

References 7 publications

A Finite Source Retrial Queue: Number of Retrials

A Finite Source Retrial Queue: Number of Retrials

Heterogeneous Finite-Source Retrial Queues

Steady state analysis of the M/G/1//N queue with orbit of blocked customers

Contact Info

Product

Resources

About