We consider a discrete-time G e o / 1 ∞ system in which customer that finishes its first essential service may opt to abandon the system, receive second optional or go at head of queue order another service. study Markov chain underlying considered queueing and ergodicity condition. Using generating function approach distribution number customers as well their respective means are given. The bu...

In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...

Objective: In this study we consider a two-state retrial queueing system with feedback having two identical parallel servers. Transient state probabilities for exact number of arrivals and departures from the will be obtained when both, one or none servers is busy. Numerical graphical solutions also obtained. Methods: The difference-differential equations governing are solved recursively, Lapla...

The paper is devoted to the analysis of queueing systems in the context of the network and communications theory. We investigate a theorem on the law of the iterated logarithm for a queue of jobs in an open multiserver queueing network and its applications to the mathematical models of the generalized Internet system and a multiserver computer system.

Queueing Theory deals with problems where some restricted resource should be shared between competitive flow of requests. In this paper we use Queueing Theory methods to perform a quantitative analysis of a single-level single-mediator multi-agent system. In the system, several agents, coordinated by the mediator process user queries. We adopt matrix analytic methods to compute performance char...

This paper studies a fluid queueing system that has a single server, a single finite buffer, and which applies a strict priority discipline to multiple arriving streams of different classes. The arriving streams are modeled by statistically independent, identically distributed random processes. A proof is presented for the highly intuitive result that, in such a queueing system, a higher priori...

This work describes an application of queueing network to model the insect population. The interarrival time and service time are both exponentially distributed. Preliminary results have been obtained to show the development of the insect population. Future work for the model’s potential development and uses are also discussed. Index Terms – Discrete event system; Queueing system; Olive fly; Po...