Queueing system with queue length dependent service times and its application to cell discarding scheme in ATM networks

1996 ◽  
Vol 143 (1) ◽  
pp. 5 ◽  
Author(s):  
B.D. Choi ◽  
D.I. Choi
Keyword(s):  
Queue Length ◽  
Queueing System ◽  
Atm Networks ◽  
Service Times

A non-exponential queueing system with independent arrivals and batch servicing

1990 ◽  
Vol 27 (02) ◽  
pp. 401-408
Author(s):  
Nico M. Van Dijk ◽  
Eric Smeitink
Keyword(s):  
Queue Length ◽  
Queueing System ◽  
Length Distribution ◽  
Service Systems ◽  
Batch Service ◽  
Repair System ◽  
Theoretical Interest ◽  
Form Expression ◽  
Queue Length Distribution ◽  
Service Times

We study a queueing system with a finite number of input sources. Jobs are individually generated by a source but wait to be served in batches, during which the input of that source is stopped. The service speed of a server depends on the mode of other sources and thus includes interdependencies. The input and service times are allowed to be generally distributed. A classical example is a machine repair system where the machines are subject to shocks causing cumulative damage. A product-form expression is obtained for the steady state joint queue length distribution and shown to be insensitive (i.e. to depend on only mean input and service times). The result is of both practical and theoretical interest as an extension of more standard batch service systems.

A non-exponential queueing system with independent arrivals and batch servicing

1990 ◽  
Vol 27 (2) ◽  
pp. 401-408
Author(s):  
Nico M. Van Dijk ◽  
Eric Smeitink
Keyword(s):  
Queue Length ◽  
Queueing System ◽  
Length Distribution ◽  
Service Systems ◽  
Batch Service ◽  
Repair System ◽  
Theoretical Interest ◽  
Form Expression ◽  
Queue Length Distribution ◽  
Service Times

We study a queueing system with a finite number of input sources. Jobs are individually generated by a source but wait to be served in batches, during which the input of that source is stopped. The service speed of a server depends on the mode of other sources and thus includes interdependencies. The input and service times are allowed to be generally distributed. A classical example is a machine repair system where the machines are subject to shocks causing cumulative damage. A product-form expression is obtained for the steady state joint queue length distribution and shown to be insensitive (i.e. to depend on only mean input and service times). The result is of both practical and theoretical interest as an extension of more standard batch service systems.

scholarly journals A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks

1999 ◽  
Vol 12 (1) ◽  
pp. 35-62 ◽  
Author(s):  
Doo Il Choi ◽  
Charles Knessl ◽  
Charles Tier
Keyword(s):  
Service Time ◽  
Queue Length ◽  
Queueing System ◽  
Arrival Process ◽  
Tail Probabilities ◽  
Asymptotic Results ◽  
Time Service ◽  
Service Times ◽  
General Service ◽  
Stationary Probabilities

A queueing system (M/G1,G2/1/K) is considered in which the service time of a customer entering service depends on whether the queue length, N(t), is above or below a threshold L. The arrival process is Poisson, and the general service times S1 and S2 depend on whether the queue length at the time service is initiated is <L or ≥L, respectively. Balance equations are given for the stationary probabilities of the Markov process (N(t),X(t)), where X(t) is the remaining service time of the customer currently in service. Exact solutions for the stationary probabilities are constructed for both infinite and finite capacity systems. Asymptotic approximations of the solutions are given, which yield simple formulas for performance measures such as loss rates and tail probabilities. The numerical accuracy of the asymptotic results is tested.

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 An analysis of steady-state distribution in M/M/1 queueing system with balking based on concept of statistical mechanics

2019 ◽  
Author(s):  
IKUO ARIZONO ◽  
Yasuhiko Takemoto
Keyword(s):  
Steady State ◽  
Statistical Mechanics ◽  
Queue Length ◽  
Queueing System ◽  
Analysis Model ◽  
Steady State Distribution ◽  
Steady State Analysis ◽  
Extended Analysis ◽  
The Moment ◽  
State Analysis

The phenomenon of balking has been considered frequently in the steady-state analysis of the M/M/1 queueing system. Balking means the phenomenon that a customer who arrives at a queueing system leaves without joining a queue, since he/she is disgusted with the waiting queue length at the moment of his/her arrival. In the traditional studies for the steady-state analysis of the M/M/1 queueing system with balking, it has been typically assumed that the arrival rates obey an inverse proportional function for the waiting queue length. In this study, based on the concept of the statistical mechanics, we have a challenge to extend the traditional steady-state analysis model for the M/M/1 queueing system with balking. As the result, we have defined an extended analysis model for the M/M/1 queueing system under the consideration of the change in the directivity strength of balking. In addition, the procedure for estimating the strength of balking in this analysis model using the observed data in the M/M/1 queueing system has been also constructed.

Analysis of the M x/G/1 queue by N-policy and multiple vacations

1994 ◽  
Vol 31 (02) ◽  
pp. 476-496
Author(s):  
Ho Woo Lee ◽  
Soon Seok Lee ◽  
Jeong Ok Park ◽  
K. C. Chae
Keyword(s):  
Performance Measures ◽  
Queue Length ◽  
Time Distribution ◽  
Queueing System ◽  
Random Variables ◽  
System Size ◽  
The Other ◽  
Waiting Time Distribution ◽  
Multiple Vacations ◽  
Linear Cost

We consider an Mx /G/1 queueing system with N-policy and multiple vacations. As soon as the system empties, the server leaves for a vacation of random length V. When he returns, if the queue length is greater than or equal to a predetermined value N(threshold), the server immediately begins to serve the customers. If he finds less than N customers, he leaves for another vacation and so on until he finally finds at least N customers. We obtain the system size distribution and show that the system size decomposes into three random variables one of which is the system size of ordinary Mx /G/1 queue. The interpretation of the other random variables will be provided. We also derive the queue waiting time distribution and other performance measures. Finally we derive a condition under which the optimal stationary operating policy is achieved under a linear cost structure.

Tandem Conveyor Queues

1989 ◽  
Vol 3 (4) ◽  
pp. 517-536
Author(s):  
F. Baccelli ◽  
E.G. Coffman ◽  
E.N. Gilbert
Keyword(s):  
Boundary Value Problem ◽  
Joint Distribution ◽  
Queueing System ◽  
The Other ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Special Cases ◽  
A Cell ◽  
Service Times ◽  
Input Position

This paper analyzes a queueing system in which a constant-speed conveyor brings new items for service and carries away served items. The conveyor is a sequence of cells each able to hold at most one item. At each integer time, a new cell appears at the queue's input position. This cell holds an item requiring service with probability a, holds a passerby requiring no service with probability b, and is empty with probability (1– a – b). Service times are integers synchronized with the arrival of cells at the input, and they are geometrically distributed with parameter μ. Items requiring service are placed in an unbounded queue to await service. Served items are put in a second unbounded queue to await replacement on the conveyor in cells at the input position. Two models are considered. In one, a served item can only be placed into a cell that was empty on arrival; in the other, the served item can be placed into a cell that was either empty or contained an item requiring service (in the latter case unloading and loading at the input position can take place in the same time unit). The stationary joint distribution of the numbers of items in the two queues is studied for both models. It is verified that, in general, this distribution does not have a product form. Explicit results are worked out for special cases, e.g., when b = 0, and when all service times are one time unit (μ = 1). It is shown how the analysis of the general problem can be reduced to the solution of a Riemann boundary-value problem.

Sign in / Sign up

Export Citation Format

Share Document