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.展开更多
This paper considers the Geom/G/1 queueing model with feedback according to a late arrival system with delayed access （LASDA）. Using recursive method, this paper studies the transient property of the queue size from...This paper considers the Geom/G/1 queueing model with feedback according to a late arrival system with delayed access （LASDA）. Using recursive method, this paper studies the transient property of the queue size from the initial state N（0＋） = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n＋ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n-, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered （being different from the relations given in M/G/I queueing system）. The model discussed in this paper can be widely applied in all kinds of communications and computer network.展开更多
基金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. 70871084the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No 200806360001the Scientific Research Fund of Southwestern University of Finance and Economics
文摘This paper considers the Geom/G/1 queueing model with feedback according to a late arrival system with delayed access （LASDA）. Using recursive method, this paper studies the transient property of the queue size from the initial state N（0＋） = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n＋ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n-, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered （being different from the relations given in M/G/I queueing system）. The model discussed in this paper can be widely applied in all kinds of communications and computer network.
