In this paper, using the stochastic decomposition and renewal theory we provide the direct method for analysis the departure process of single sever M/G/1 queueing system, and further discuss the departure process of ...In this paper, using the stochastic decomposition and renewal theory we provide the direct method for analysis the departure process of single sever M/G/1 queueing system, and further discuss the departure process of GI/G/1 queueing system. The method provided in this paper is new and concise, which make us see dearly the structure of the departure process of a single server queueing system.展开更多
By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its s...By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point.展开更多
We study a batch arrival MX/M/1 queue with multiple working vacation. The server serves customers at a lower rate rather than completely stopping service during the service period. Using a quasi upper triangular trans...We study a batch arrival MX/M/1 queue with multiple working vacation. The server serves customers at a lower rate rather than completely stopping service during the service period. Using a quasi upper triangular transition probability matrix of two-dimensional Markov chain and matrix analytic method, the probability generating function (PGF) of the stationary system length distribution is obtained, from which we obtain the stochastic decomposition structure of system length which indicates the relationship with that of the MX/M/1 queue without vacation. Some performance indices are derived by using the PGF of the stationary system length distribution. It is important that we obtain the Laplace Stieltjes transform (LST) of the stationary waiting time distribution. Further, we obtain the mean system length and the mean waiting time. Finally, numerical results for some special cases are presented to show the effects of system parameters.展开更多
In this paper, we study an M/M/1 queue with multiple working vacations under following Bernoulli control policy: at the instants of the completion of a service in vacation, the server will interrupt the vacation and e...In this paper, we study an M/M/1 queue with multiple working vacations under following Bernoulli control policy: at the instants of the completion of a service in vacation, the server will interrupt the vacation and enter regular busy period with probability 1 p (if there are customers in the queue) or continue the vacation with probability p. For this model, we drive the analytic expression of the stationary queue length and demonstrate stochastic decomposition structures of the stationary queue length and waiting time, also we obtain the additional queue length and the additional delay of this model. The results we got agree with the corresponding results for working vacation model with or without vacation interruption if we set p = 0 or p = 1, respectively.展开更多
We consider a variant of M/M/1 where customers arrive singly or in pairs. Each single and one member of each pair is called primary;the other member of each pair is called secondary. Each primary joins the queue upon ...We consider a variant of M/M/1 where customers arrive singly or in pairs. Each single and one member of each pair is called primary;the other member of each pair is called secondary. Each primary joins the queue upon arrival. Each secondary is delayed in a separate area, and joins the queue when “pushed” by the next arriving primary. Thus each secondary joins the queue followed immediately by the next primary. This arrival/delay mechanism appears to be new in queueing theory. Our goal is to obtain the steady-state probability density function (pdf) of the workload, and related quantities of interest. We utilize a typical sample path of the workload process as a physical guide, and simple level crossing theorems, to derive model equations for the steady-state pdf. A potential application is to the processing of electronic signals with error free components and components that require later confirmation before joining the queue. The confirmation is the arrival of the next signal.展开更多
In this paper, by considering the stochastic proces s of the busy period and the idle period, and introducing the unfinished work as a supplementary variable, a new vector Markov process was presented to study th e M...In this paper, by considering the stochastic proces s of the busy period and the idle period, and introducing the unfinished work as a supplementary variable, a new vector Markov process was presented to study th e M/G/1 queue again. Through establishing and solving the density evolution equa tions, the busy-period distribution, and the stationary distributions of waitin g time and queue length were obtained. In addition, the stability condition of th is queue system was given by means of an imbedded renewal process.展开更多
The existing models of servers work on the M/G/1 model which is in some ways predictable and offers us an opportunity to compare the various other server queuing models. Mathematical analysis on the M/G/1 model is ava...The existing models of servers work on the M/G/1 model which is in some ways predictable and offers us an opportunity to compare the various other server queuing models. Mathematical analysis on the M/G/1 model is available in detail. This paper presents some mathematical analysis which aims at reducing the mean service time of a multiple server model. The distribution of the Mean Service Time has been derived using Little’s Law and a C++ simulation code has been provided to enable a test run so that the QoS of a multi-server system can be improved by reducing the Mean Service Time.展开更多
In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodol...In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodology for applying these theorems for the benefit of service systems. The limit theorems studied here are dominant in the literature. Our contribution is primarily on the analysis leading to the application of these theorems in various problem situations for better operations. Relevant Examples are included to aid the application of the results studied in this work.展开更多
It is well known, in queueing theory, that the system performance is greatly influenced by scheduling policy. No universal optimum scheduling strategy exists in systems where individual customer service demands are no...It is well known, in queueing theory, that the system performance is greatly influenced by scheduling policy. No universal optimum scheduling strategy exists in systems where individual customer service demands are not known a priori. However, if the distribution of job times is known, then the residual time (expected time remaining for a job), based on the service it has already received, can be calculated. Our particular research contribution is in exploring the use of this function to enhance system performance by increasing the probability that a job will meet its deadline. In a detailed discrete event simulation, we have tested many different distributions with a wide range of C2 and shapes, as well as for single and dual processor system. Results of four distributions are reported here. We compare with RR and FCFS, and find that in all distributions studied our algorithm performs best. In the study of the use of two slow servers versus one fast server, we have discovered that they provide comparable performance, and in a few cases the double server system does better.展开更多
The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to m...The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to many IoT researchers as a replacement of those Aloha variants for channel access. However, previous works analyzed and evaluated the DQ algorithm without any consideration of the stability of its queues, assuming it is stable for any given number of nodes in the network. In this paper, we define the DQ stability condition in a single-channel M2M environment considering a traffic model of periodic and urgent frames from each node in the network. Besides, a steady-state evaluation of the algorithm’s performance metrics is also presented. In general, the DQ algorithm, when it is stable, was observed not to efficiently use the contention slots for the collision resolution. In a single-channel environment, the DQ algorithm is found to outperform the Aloha based algorithms only in an idle-to-saturation scenario.展开更多
文摘In this paper, using the stochastic decomposition and renewal theory we provide the direct method for analysis the departure process of single sever M/G/1 queueing system, and further discuss the departure process of GI/G/1 queueing system. The method provided in this paper is new and concise, which make us see dearly the structure of the departure process of a single server queueing system.
基金supported by the National Natural Science Foundation of China(11371303)Natural Science Foundation of Xinjiang(2012211A023)Science Foundation of Xinjiang University(XY110101)
文摘By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point.
文摘We study a batch arrival MX/M/1 queue with multiple working vacation. The server serves customers at a lower rate rather than completely stopping service during the service period. Using a quasi upper triangular transition probability matrix of two-dimensional Markov chain and matrix analytic method, the probability generating function (PGF) of the stationary system length distribution is obtained, from which we obtain the stochastic decomposition structure of system length which indicates the relationship with that of the MX/M/1 queue without vacation. Some performance indices are derived by using the PGF of the stationary system length distribution. It is important that we obtain the Laplace Stieltjes transform (LST) of the stationary waiting time distribution. Further, we obtain the mean system length and the mean waiting time. Finally, numerical results for some special cases are presented to show the effects of system parameters.
基金Foundation item： Supported by the National Science Foundation of China（60874083） Supported by the 2011 National Statistical Science Development Funds（2011LY014） Supported by the 2012 Soft Science Devel- opment Funds of Science and Technology Committee of Henan Province（122400450090）
文摘In this paper, we study an M/M/1 queue with multiple working vacations under following Bernoulli control policy: at the instants of the completion of a service in vacation, the server will interrupt the vacation and enter regular busy period with probability 1 p (if there are customers in the queue) or continue the vacation with probability p. For this model, we drive the analytic expression of the stationary queue length and demonstrate stochastic decomposition structures of the stationary queue length and waiting time, also we obtain the additional queue length and the additional delay of this model. The results we got agree with the corresponding results for working vacation model with or without vacation interruption if we set p = 0 or p = 1, respectively.
文摘We consider a variant of M/M/1 where customers arrive singly or in pairs. Each single and one member of each pair is called primary;the other member of each pair is called secondary. Each primary joins the queue upon arrival. Each secondary is delayed in a separate area, and joins the queue when “pushed” by the next arriving primary. Thus each secondary joins the queue followed immediately by the next primary. This arrival/delay mechanism appears to be new in queueing theory. Our goal is to obtain the steady-state probability density function (pdf) of the workload, and related quantities of interest. We utilize a typical sample path of the workload process as a physical guide, and simple level crossing theorems, to derive model equations for the steady-state pdf. A potential application is to the processing of electronic signals with error free components and components that require later confirmation before joining the queue. The confirmation is the arrival of the next signal.
基金Project supported by the National Natural Science Foundation of China(Grant No.70171059)
文摘In this paper, by considering the stochastic proces s of the busy period and the idle period, and introducing the unfinished work as a supplementary variable, a new vector Markov process was presented to study th e M/G/1 queue again. Through establishing and solving the density evolution equa tions, the busy-period distribution, and the stationary distributions of waitin g time and queue length were obtained. In addition, the stability condition of th is queue system was given by means of an imbedded renewal process.
文摘The existing models of servers work on the M/G/1 model which is in some ways predictable and offers us an opportunity to compare the various other server queuing models. Mathematical analysis on the M/G/1 model is available in detail. This paper presents some mathematical analysis which aims at reducing the mean service time of a multiple server model. The distribution of the Mean Service Time has been derived using Little’s Law and a C++ simulation code has been provided to enable a test run so that the QoS of a multi-server system can be improved by reducing the Mean Service Time.
文摘In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodology for applying these theorems for the benefit of service systems. The limit theorems studied here are dominant in the literature. Our contribution is primarily on the analysis leading to the application of these theorems in various problem situations for better operations. Relevant Examples are included to aid the application of the results studied in this work.
文摘It is well known, in queueing theory, that the system performance is greatly influenced by scheduling policy. No universal optimum scheduling strategy exists in systems where individual customer service demands are not known a priori. However, if the distribution of job times is known, then the residual time (expected time remaining for a job), based on the service it has already received, can be calculated. Our particular research contribution is in exploring the use of this function to enhance system performance by increasing the probability that a job will meet its deadline. In a detailed discrete event simulation, we have tested many different distributions with a wide range of C2 and shapes, as well as for single and dual processor system. Results of four distributions are reported here. We compare with RR and FCFS, and find that in all distributions studied our algorithm performs best. In the study of the use of two slow servers versus one fast server, we have discovered that they provide comparable performance, and in a few cases the double server system does better.
文摘The Distributed Queuing (DQ) algorithm is predicted as one of the solutions to the issues currently found in IoT networks over the use of Aloha based algorithms. Since recently, the algorithm has been of interest to many IoT researchers as a replacement of those Aloha variants for channel access. However, previous works analyzed and evaluated the DQ algorithm without any consideration of the stability of its queues, assuming it is stable for any given number of nodes in the network. In this paper, we define the DQ stability condition in a single-channel M2M environment considering a traffic model of periodic and urgent frames from each node in the network. Besides, a steady-state evaluation of the algorithm’s performance metrics is also presented. In general, the DQ algorithm, when it is stable, was observed not to efficiently use the contention slots for the collision resolution. In a single-channel environment, the DQ algorithm is found to outperform the Aloha based algorithms only in an idle-to-saturation scenario.
