This paper analyses a multiple class single server M/M/1/K queue with finite capacity under preemptive service priority discipline. The Poisson process has been used to model the multiple classes of arrival streams. The service times have exponential distribution. Analytical expressions for the flow balanced equations have been derived using Markov chain. This paper presents an analytical solut...

Finite buffer, single server queues with general service times along with state dependent queues were shown to be robust with respect to the general flow processes in transportation & material handling systems (MHS). This paper examines the integration of multi-server and state dependent queues and the robustness properties in these queueing network models. It is also shown that the topological...

A performance model is developed and validated for a local area network (LAN) with a star topology. A collisionavoidance network access protocol, as implemented in Hubnet, is considered. The model is based on a single server queueing system with finite sources and with a single buffer. Packets arriving at a full buffer retry their access after a fixed time period. Results for an eight-node netw...

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

The paper studies a single-server queueing system with autonomous service and l priority classes. Arrival and departure processes are defined by marked point processes. There are l buffers corresponding to priority classes, and upon arrival a unit of the kth priority class occupies the place in the kth buffer. Let N , k = 1, 2, . . . , l denote the quota for the total kth buffer content. The va...

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...

The paper studies a single-server queueing system with autonomous service and l priority classes. Arrival and departure processes are governed by marked point processes. There are l buffers corresponding to priority classes, and upon arrival a unit of the kth priority class occupies a place in the kth buffer. Let N , k = 1, 2, . . . , l denote the quota for the total kth buffer content. The val...

This Paper analyses a queuing model in which two type of customer units, one of single service (Unit I) and the other of bulk service (Unit II). Unit I has only one exponential server, which server singly. In Unit II, there are ‘c’ exponential server which serves par alley by general bulk service rule. These two units are connected in series for service but separated by a buffer of finite size ...

We consider a finite capacity queueing system with one main server who is supported by a backup server. We assume Markovian arrivals, phase type services, and a threshold-type server backup policy with two pre-determined lower and upper thresholds. A request for a backup server is made whenever the buffer size (number of customers in the queue) hits the upper threshold and the backup server is ...

This paper presents a scalable caching algorithm of proxy server with the finite storage size minimizing client s buffer size and constant-bit-rate channel bandwidth. Under the general video traffic condition, it is observed that the amount of decreased client s buffer size and channel bandwidth after caching a video frame depends on the relative frame position in the time axis as well as the f...