With results on the infinite servers queue systems with Poisson arrivals - M｜G｜∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and di...With results on the infinite servers queue systems with Poisson arrivals - M｜G｜∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and distribution function study. These queue systems are adequate to the study of many population processes, and this quality is brought in here. The results presented are mainly on unemployment periods length and their number in a certain time interval. Also, some questions regarding the practical applications of the outlined formulas are briefly discussed.展开更多
A transition diagram is used to describe the behavior of systems. Birth-death equations were derived from transition diagram depicting the state of the birth-death processes. Queue models and characteristics of queue ...A transition diagram is used to describe the behavior of systems. Birth-death equations were derived from transition diagram depicting the state of the birth-death processes. Queue models and characteristics of queue models are also derivable from birth-death processes. These queue models consist of mathematical formulas and relationships that can be used to determine the operating characteristics （performance measures） for a waiting line. Schematic and transition diagrams of different single server queue models were shown. Relationships between birth-death processes, waiting lines （queues） and transition diagrams were given. While M/M/I/K queue model states was limited by K customers and had （K＋I） states, M/M/1/1 queue model had only two states. M/G/1/∝/∝ and M/M/1/∝/∝ shared similar characteristics. Many ideal queuing situations employ M/M/1 queueing model.展开更多
This paper studies a single server discrete-time Erlang loss system with Bernoulli arrival process and no waiting space. The server in the system is assumed to provide two different types of services, namely essential...This paper studies a single server discrete-time Erlang loss system with Bernoulli arrival process and no waiting space. The server in the system is assumed to provide two different types of services, namely essential and optional services, to the customer. During the operation of the system, the arrival of the catastrophe will break the system down and simultaneously induce customer to leave the system immediately. Using a new type discrete supplementary variable technique, the authors obtain some performance characteristics of the queueing system, including the steady-state availability and failure frequency of the system, the steady-state probabilities for the server being idle, busy, breakdown and the loss probability of the system etc. Finally, by the numerical examples, the authors study the influence of the system parameters on several performance measures.展开更多
The authors discuss a discrete-time Geo/G/1 retrial queue with J-vacation policy and general retrial times.As soon as the orbit is empty,the server takes a vacation.However,the server is allowed to take a maximum numb...The authors discuss a discrete-time Geo/G/1 retrial queue with J-vacation policy and general retrial times.As soon as the orbit is empty,the server takes a vacation.However,the server is allowed to take a maximum number J of vacations,if the system remains empty after the end of a vacation.If there is at least one customer in the orbit at the end of a vacation,the server begins to serve the new arrivals or the arriving customers from the orbit.For this model,the authors focus on the steady-state analysis for the considered queueing system.Firstly,the authors obtain the generating functions of the number of customers in the orbit and in the system.Then,the authors obtain the closed-form expressions of some performance measures of the system and also give a stochastic decomposition result for the system size.Besides,the relationship between this discrete-time model and the corresponding continuous-time model is also investigated.Finally,some numerical results are provided.展开更多
This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually...This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually independent and geometrically distributed. The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch. The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system. Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival, arbitrary and outside observer＇s ob- servation epochs for partial-batch rejection policy. The blocking probability of the first, an arbitrary- and the last-job in a batch have been discussed. The analysis of actual waiting-time distributions measured in slots of the first, an arbitrary- and the last-job in an accepted batch, and other performance measures along with some numerical results have also been investigated.展开更多
In the existing literature of Repairable Queueing Systems (RQS), i.e., queueing systems with server breakdowns, it is almost all assumed that interarrival times of successive customers are independent, identically exp...In the existing literature of Repairable Queueing Systems (RQS), i.e., queueing systems with server breakdowns, it is almost all assumed that interarrival times of successive customers are independent, identically exponentially distributed. In this paper, we deal with more generic system GI/PH/1 with server's exponential uptime and phase-type repair time. With matrix analysis theory, we establish the equilibrium condition and the characteristics of the system, derive the transient and stationary availability behavior of the system.展开更多
This paper examines an M[x]/G/1 queueing system with an unreliable server and a delayed repair, in which the server operates a randomized vacation policy with multiple vacations. Whenever the system is empty, the serv...This paper examines an M[x]/G/1 queueing system with an unreliable server and a delayed repair, in which the server operates a randomized vacation policy with multiple vacations. Whenever the system is empty, the server immediately takes a,vacation. If there is at least one customer found waiting in the queue upon returning from a vacation, the server will be immediately activated for service. Otherwise, if no customers are waiting for service at the end of a vacation, the server either remains idle with probability p or leaves for another vacation with probability 1 -p. Whenever one or more customers arrive when the server is idle, the server immediately starts providing service for the arrivals. The server may also meet an unpredictable breakdown and the repair may be delayed. For such a system the authors derive the distributions of some important system characteristics, such as the system size distribution at a random epoch and at a departure epoch, the system size distribution at the busy period initiation epoch, and the distribution of the idle period and the busy period. The authors perform a numerical analysis for changes in the system characteristics, along with changes in specific values of the system parameters. A cost effectiveness maximization model is constructed to explain the benefits of such a queueing system.展开更多
文摘With results on the infinite servers queue systems with Poisson arrivals - M｜G｜∞ queues - busy period, it is displayed an application of those queue systems in the unemployment periods time length parameters and distribution function study. These queue systems are adequate to the study of many population processes, and this quality is brought in here. The results presented are mainly on unemployment periods length and their number in a certain time interval. Also, some questions regarding the practical applications of the outlined formulas are briefly discussed.
文摘A transition diagram is used to describe the behavior of systems. Birth-death equations were derived from transition diagram depicting the state of the birth-death processes. Queue models and characteristics of queue models are also derivable from birth-death processes. These queue models consist of mathematical formulas and relationships that can be used to determine the operating characteristics （performance measures） for a waiting line. Schematic and transition diagrams of different single server queue models were shown. Relationships between birth-death processes, waiting lines （queues） and transition diagrams were given. While M/M/I/K queue model states was limited by K customers and had （K＋I） states, M/M/1/1 queue model had only two states. M/G/1/∝/∝ and M/M/1/∝/∝ shared similar characteristics. Many ideal queuing situations employ M/M/1 queueing model.
基金supported by the National Natural Science Foundation of China under Grant No.70871084Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001the Scientific Research Fund of Sichuan Provincial Education Department under Grant No.10ZA136
文摘This paper studies a single server discrete-time Erlang loss system with Bernoulli arrival process and no waiting space. The server in the system is assumed to provide two different types of services, namely essential and optional services, to the customer. During the operation of the system, the arrival of the catastrophe will break the system down and simultaneously induce customer to leave the system immediately. Using a new type discrete supplementary variable technique, the authors obtain some performance characteristics of the queueing system, including the steady-state availability and failure frequency of the system, the steady-state probabilities for the server being idle, busy, breakdown and the loss probability of the system etc. Finally, by the numerical examples, the authors study the influence of the system parameters on several performance measures.
基金supported by the National Natural Science Foundation of China under Grant No.71071133
文摘The authors discuss a discrete-time Geo/G/1 retrial queue with J-vacation policy and general retrial times.As soon as the orbit is empty,the server takes a vacation.However,the server is allowed to take a maximum number J of vacations,if the system remains empty after the end of a vacation.If there is at least one customer in the orbit at the end of a vacation,the server begins to serve the new arrivals or the arriving customers from the orbit.For this model,the authors focus on the steady-state analysis for the considered queueing system.Firstly,the authors obtain the generating functions of the number of customers in the orbit and in the system.Then,the authors obtain the closed-form expressions of some performance measures of the system and also give a stochastic decomposition result for the system size.Besides,the relationship between this discrete-time model and the corresponding continuous-time model is also investigated.Finally,some numerical results are provided.
文摘This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually independent and geometrically distributed. The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch. The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system. Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival, arbitrary and outside observer＇s ob- servation epochs for partial-batch rejection policy. The blocking probability of the first, an arbitrary- and the last-job in a batch have been discussed. The analysis of actual waiting-time distributions measured in slots of the first, an arbitrary- and the last-job in an accepted batch, and other performance measures along with some numerical results have also been investigated.
文摘In the existing literature of Repairable Queueing Systems (RQS), i.e., queueing systems with server breakdowns, it is almost all assumed that interarrival times of successive customers are independent, identically exponentially distributed. In this paper, we deal with more generic system GI/PH/1 with server's exponential uptime and phase-type repair time. With matrix analysis theory, we establish the equilibrium condition and the characteristics of the system, derive the transient and stationary availability behavior of the system.
文摘This paper examines an M[x]/G/1 queueing system with an unreliable server and a delayed repair, in which the server operates a randomized vacation policy with multiple vacations. Whenever the system is empty, the server immediately takes a,vacation. If there is at least one customer found waiting in the queue upon returning from a vacation, the server will be immediately activated for service. Otherwise, if no customers are waiting for service at the end of a vacation, the server either remains idle with probability p or leaves for another vacation with probability 1 -p. Whenever one or more customers arrive when the server is idle, the server immediately starts providing service for the arrivals. The server may also meet an unpredictable breakdown and the repair may be delayed. For such a system the authors derive the distributions of some important system characteristics, such as the system size distribution at a random epoch and at a departure epoch, the system size distribution at the busy period initiation epoch, and the distribution of the idle period and the busy period. The authors perform a numerical analysis for changes in the system characteristics, along with changes in specific values of the system parameters. A cost effectiveness maximization model is constructed to explain the benefits of such a queueing system.
