Correlation functions in the G/M/1 system

1980 ◽  
Vol 12 (02) ◽  
pp. 530-540 ◽  
Author(s):  
S. K. Srinivasan ◽  
C. Chudalaimuthu Pillai
Keyword(s):  
Correlation Functions ◽  
Queue Length ◽  
Recurrence Relations ◽  
Queueing System ◽  
Point Method ◽  
Correlation Structure ◽  
Set Up ◽  
Regeneration Point

The G/G/1 queueing system is studied by means of the regeneration point method, exploiting the concept of busy cycles. Recurrence relations are set-up for the distribution of the queue length at the arrival epochs. The same method is used to obtain the correlation structure of arrivals and departures for the G/M/1 queue.

Correlation functions in the G/M/1 system

1980 ◽  
Vol 12 (2) ◽  
pp. 530-540 ◽  
Author(s):  
S. K. Srinivasan ◽  
C. Chudalaimuthu Pillai
Keyword(s):  
Correlation Functions ◽  
Queue Length ◽  
Recurrence Relations ◽  
Queueing System ◽  
Point Method ◽  
Correlation Structure ◽  
Set Up ◽  
Regeneration Point

The G/G/1 queueing system is studied by means of the regeneration point method, exploiting the concept of busy cycles. Recurrence relations are set-up for the distribution of the queue length at the arrival epochs. The same method is used to obtain the correlation structure of arrivals and departures for the G/M/1 queue.

The BMAP/GI/1 queue with server set-up times and server vacations

1993 ◽  
Vol 25 (01) ◽  
pp. 235-254 ◽  
Author(s):  
Josep M. Ferrandiz
Keyword(s):  
Characteristic Function ◽  
Generating Function ◽  
Queue Length ◽  
Queueing System ◽  
Moment Generating Function ◽  
Server Vacations ◽  
Service Completion ◽  
Set Up ◽  
Vacation Period ◽  
Completion Times

Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP/GI/1 queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a customer finding an empty system. In the latter case we will talk of a server set-up time. The distribution of a set-up time or of a vacation period after a departure leaving a non-empty system behind is conditionally independent of the queue length and workload. Furthermore, the distribution of the server set-up times may be different from the distribution of vacations at service completion times. The results are particularized to the M/GI/1 queue and to the BMAP/GI/1 queue (without vacations).

The BMAP/GI/1 queue with server set-up times and server vacations

1993 ◽  
Vol 25 (1) ◽  
pp. 235-254 ◽  
Author(s):  
Josep M. Ferrandiz
Keyword(s):  
Characteristic Function ◽  
Generating Function ◽  
Queue Length ◽  
Queueing System ◽  
Moment Generating Function ◽  
Server Vacations ◽  
Service Completion ◽  
Set Up ◽  
Vacation Period ◽  
Completion Times

Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP/GI/1 queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a customer finding an empty system. In the latter case we will talk of a server set-up time. The distribution of a set-up time or of a vacation period after a departure leaving a non-empty system behind is conditionally independent of the queue length and workload. Furthermore, the distribution of the server set-up times may be different from the distribution of vacations at service completion times. The results are particularized to the M/GI/1 queue and to the BMAP/GI/1 queue (without vacations).

COMMUNICATION OF COMMON AND MARGINAL CHARACTERISTICS OF CONDITIONS IN A TWO-CHANNEL SYSTEM WITH SIMPLE STREAMLINES OF APPLICATIONS

2017 ◽  
pp. 7-19 ◽  
Author(s):  
Georgiy Aleksandrovich Popov
Keyword(s):  
Operating Systems ◽  
Queue Length ◽  
Recurrence Relations ◽  
Queuing Systems ◽  
Channel System ◽  
Current Period ◽  
Multichannel Systems ◽  
Incoming Call ◽  
Marginal Values ◽  
Time Required

The article deals with a two-channel queuing system with a Poisson incoming call flow, in which the application processing time on each of the devices is different. Such models are used, in particular, when describing the operation of the system for selecting service requests in a number of operating systems. A complex system characteristic was introduced at the time of service endings on at least one of the devices, including the queue length, the remaining service time on the occupied device, and the time since the beginning of the current period of employment. This characteristic determines the state of the system at any time. Recurrence relations are obtained that connect this characteristic with its marginal values when there is no queue in the system. The method of introducing additional events was chosen as one of the main methods for analyzing the model. The relationships presented in this article can be used for analysis of the average characteristics of this system, as well as in the process of its simulation. Summarizing the results of work on multichannel systems with an arbitrary number of servicing devices will significantly reduce the time required for simulating complex systems described by sets of multichannel queuing systems.

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.

Transient solutions for denumerable-state Markov processes

1994 ◽  
Vol 31 (03) ◽  
pp. 635-645
Author(s):  
Guang-Hui Hsu ◽  
Xue-Ming Yuan
Keyword(s):  
Markov Process ◽  
Markov Processes ◽  
Queue Length ◽  
Queueing System ◽  
Length Distribution ◽  
Initial Distribution ◽  
Numerical Results ◽  
Transient Solution ◽  
Queue Length Distribution ◽  
Transient Solutions

The algorithm for the transient solution for the denumerable state Markov process with an arbitrary initial distribution is given in this paper. The transient queue length distribution for a general Markovian queueing system can be obtained by this algorithm. As examples, some numerical results are presented.

Sign in / Sign up

Export Citation Format

Share Document