SUMMARY. A simple series form is obtained for the transient state probabilities of a single server Markovian queue with finite waiting space whence all particular cases concerning infinite waiting space and steady-state situations can be derived straight away. Also the coefficients in the series satisfy iterative recurrence relations which enable fast and accurate numerical computations.

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

conclusions according to the results, there was a direct correlation between access to physical space in ed and waiting time. in addition, improving the physical access did not necessarily result in shorter waiting time. therefore, to improve triage process, improvement of waiting time indices, and modifying forms of work process in ed are recommended. results the correlation between the waitin...

We study the convergence of finite-capacity open queueing systems to their infinite-capacity counterparts as the capacity increases. Convergence of the transient behavior is easily established in great generality provided that the finite-capacity system can be identified with the infinitecapacity system up to the first time that the capacity is exceeded. Convergence of steady-state distribution...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

Infinite words on a finite non-empty alphabet have been investigated in various respects. We will consider here two important strategies in approaching such words; one of them proceeds from particular to general, while the other proceeds from general to particular. As we shall see, the respective hierarchies don’t interfer. There is between them an empty space waiting for investigation.

In this paper, we discuss the waiting-time distribution for a finite-space, single-server queueing system, in which customers arrive singly following Poisson process and server operates under (a,b)-bulk service rule. The system has finite-buffer capacity ‘N’ excluding batch service. service-time of batches follows general distribution, is independent arrival process. We first develop an alterna...

in this article we review an algebraic definition of the gyrogroup and a simplified version of the gyrovector space with two fundamental examples on the open ball of finite-dimensional euclidean space, which are the einstein and möbius gyrovector spaces. we introduce the structure of gyrovector space and the gyroline on the open convex cone of positive definite matrices and see its interest...