Analyse sensorielle quasi-ordres et représentations simpliciales
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary...
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary...
A cold-standby redundant system with two identical units and one repair facility is considered. Units can be in three states> good (I), degraded (II), and failed (III). We suppose that only the following state-transitions of a unit are possible: . The repair of a unit of the type can be interpreted as a preventive maintenance. Its realization depends on the states of both units. Several characteristics of the system (probabilities, distribution functions or their Laplace-Stieltjes transforms...
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered....
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that...
We analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis is then refined to obtain a canonical path analysis. The construction of the flow and of the canonical paths is based on related path constructions in a paper of Cordovil and Moreira (1993) on block matroids. The estimates of the congestion measure imply a polynomial bound on the mixing time. The canonical paths for spanning trees also yield polynomial...
In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when units are accumulated in the system and off when the system is empty. We model this system by an M/M/1 queue with server breakdowns and startup time under the policy. The arrival rate varies according to the server’s status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according to a Poisson...
In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when N units are accumulated in the system and off when the system is empty. We model this system by an M[x]/M/1 queue with server breakdowns and startup time under the N policy. The arrival rate varies according to the server's status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according to a...