A finite capacity single-server queue with customer loss

1986 ◽  
Vol 2 (1) ◽  
pp. 97-121 ◽  
Author(s):  
C. Knessl ◽  
B. J. Matkowsky ◽  
Z. Schuss ◽  
C. Tier
Keyword(s):  
Single Server ◽  
Finite Capacity ◽  
Single Server Queue ◽  
Server Queue

scholarly journals Geo/Geo/1/N Queue with In-Immune and Immune Service Killing Discipline

2012 ◽  
Vol 23 (1) ◽  
pp. 129-148
Author(s):  
Madhu Jain Madhu Jain
Keyword(s):  
Performance Measures ◽  
Generating Functions ◽  
Relaxation Method ◽  
Single Server ◽  
Finite Capacity ◽  
Single Server Queue ◽  
Stationary Probability Distribution ◽  
Negative Customers ◽  
Server Queue ◽  
Successive Over Relaxation

The present investigation studies a discrete time single server queue with both positive and negative arrival streams in accordance with removal of the customer from the end (RCE)-in immune and immune service killing policy. This study is a generalization of the queue with negative customers, wherein only positive customers need a service and negative customers arriving to the system can kill the already present positive customers from any where in the queue, otherwise get lost. The concept of both in-immune and immune service killing are taken into consideration. According to the in-immune killing policy, the negative customer is allowed to kill the most recent positive customer inspite of whether it is in service or not, while the immune service killing discipline suggests that the customer currently being served is immune from killing by the negative arrival. We analyze a queue with geometric arrivals of both positive and negative customers for a finite capacity system. The stationary probability distribution and other performance measures are derived in terms of the generating functions. The results so obtained are validated by the numerical method based on successive over relaxation method (SOR). We have also employed the neurro fuzzy approach for exhibiting the approximate results for various performance measures.

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

scholarly journals New Approach for Finding Basic Performance Measures of Single Server Queue

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Siew Khew Koh ◽  
Ah Hin Pooi ◽  
Yi Fei Tan
Keyword(s):  
Stationary State ◽  
Queue Length ◽  
Length Distribution ◽  
Cumulative Distribution ◽  
System Capacity ◽  
Interarrival Time ◽  
Single Server ◽  
Single Server Queue ◽  
Queue Length Distribution ◽  
Server Queue

Consider the single server queue in which the system capacity is infinite and the customers are served on a first come, first served basis. Suppose the probability density functionf(t)and the cumulative distribution functionF(t)of the interarrival time are such that the ratef(t)/1-F(t)tends to a constant ast→∞, and the rate computed from the distribution of the service time tends to another constant. When the queue is in a stationary state, we derive a set of equations for the probabilities of the queue length and the states of the arrival and service processes. Solving the equations, we obtain approximate results for the stationary probabilities which can be used to obtain the stationary queue length distribution and waiting time distribution of a customer who arrives when the queue is in the stationary state.

Loss Probability of a Burst Arrival Finite Queue with Synchronized Service

1992 ◽  
Vol 6 (2) ◽  
pp. 201-216 ◽  
Author(s):  
Masakiyo Miyazawa
Keyword(s):  
Markov Chain ◽  
Loss Probability ◽  
Buffer Size ◽  
Embedded Markov Chain ◽  
Main Concern ◽  
Single Server ◽  
Finite Buffer ◽  
Single Server Queue ◽  
Server Queue ◽  
Computation Algorithm

We are concerned with a burst arrival single-server queue, where arrivals of cells in a burst are synchronized with a constant service time. The main concern is with the loss probability of cells for the queue with a finite buffer. We analyze an embedded Markov chain at departure instants of cells and get a kind of lumpability for its state space. Based on these results, this paper proposes a computation algorithm for its stationary distribution and the loss probability. Closed formulas are obtained for the first two moments of the numbers of cells and active bursts when the buffer size is infinite.

Sign in / Sign up

Export Citation Format

Share Document