AVAILABILITY ANALYSIS OF THE QUEUEING SYSTEM GI/PH/I WITH SERVER BREAKDOWNS

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.     

The M/M/1 queue with working vacations and vacation interruptions

In this paper, we study the M/M/1 queue with working vacations and vacation interruptions. The working vacation is introduced recently, during which the server can still provide service on the original ongoing work at a lower rate. Meanwhile, we introduce a new policy：, the server can come back from the vacation to the normal working level once some indices of the system, such as the number of customers, achieve a certain value in the vacation period. The server may come back from the vacation without completing the vacation. Such policy is called vacation interruption. We connect the above mentioned two policies and assume that if there are customers in the system after a service completion during the vacation period, the server will come back to the normal working level. In terms of the quasi birth and death process and matrix-geometric solution method, we obtain the distributions and the stochastic decomposition structures for the number of customers and the waiting time and provide some indices of systems.     

Optimal control of an M/G/1 retrial queue with vacations

In this note, we consider an M/G/1 retrial queue with server vacations, when retrial times, service times and vacation times are arbitrary distributed. The distribution of the number of customers in the system in stationary regime is obtained in terms of generating function. Next, we give heavy traffic approximation of such distribution. We show that the system size can be decomposed into two random variables, one of which corresponds to the system size of the ordinary M/G/1 FIFO queue without vacation. Such a stochastic decomposition property is useful for the computation of performance measures of interest. Finally, we solve simple problems of optimal control of vacation and retrial policies.     

Analysis of batch arrival queue with randomized vacation policy and an un-reliable server

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.     

Analysis of a Discrete-Time Geo/G/1 Queue in a Multi-Phase Service Environment with Disasters

This paper considers a discrete-time Geo/G/1 queue in a multi-phase service environment,where the system is subject to disastrous breakdowns, causing all present customers to leave the system simultaneously. At a failure epoch, the server abandons the service and the system undergoes a repair period. After the system is repaired, it jumps to operative phase i with probability qi, i = 1, 2 ···, n.Using the supplementary variable technique, we obtain the distribution for the stationary queue length at the arbitrary epoch, which are then used for the computation of other performance measures. In addition, we derive the expected length of a cycle time, the generating function of the sojourn time of an arbitrary customer, and the generating function of the server's working time in a cycle. We also give the relationship between the discrete-time queueing system to its continuous-time counterpart. Finally,some examples and numerical results are presented.     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS I： G/M（n）/1/K

In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M（n）/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirement is the Laplace-Stieltjes transform of the interarrival distribution as well as the state-dependent service rate and state-dependent vacation rate. In a subsequent companion paper, we study its dual system M（n）/G/1/K queue with statedependent vacations.     

Many-server queues with customer abandonment: A survey of diffusion and fluid approximations

The performance of a call center is sensitive to customer abandonment.In this survey paper,we focus on G/GI/ n + GI parallel-server queues that serve as a building block to model call center operations.Such a queue has a general arrival process(the G ),independent and identically distributed(iid) service times with a general distribution(the first GI),and iid patience times with a general distribution(the +GI).Following the square-root safety staffing rule,this queue can be operated in the quality- and efficiency-driven(QED) regime,which is characterized by large customer volume,the waiting times being a fraction of the service times,only a small fraction of customers abandoning the system,and high server utilization.Operational efficiency is the central target in a system whose staffing costs dominate other expenses.If a moderate fraction of customer abandonment is allowed,such a system should be operated in an overloaded regime known as the efficiency-driven (ED) regime.We survey recent results on the many-server queues that are operated in the QED and ED regimes.These results include the performance insensitivity to patience time distributions and diffusion and fluid approximate models as practical tools for performance analysis.     

Discrete-time Geo/G/1 retrial queues with general retrial time and Bernoulli vacation

This paper considers a discrete-time Geo/G/1 retrial queue where the retrial time has a general distribution and the server is subject to Bernoulli vacation policy.It is assumed that the server, after each service completion,begins a process of search in order to find the following customer to be served with a certain probability,or begins a single vacation process with complementary probability. This paper analyzes the Markov chain underlying the queueing system and obtain its ergodicity condition.The generating functions of the number of customers in the orbit and in the system are also obtained along with the marginal distributions of the orbit size when the server is idle,busy or on vacation.Finally,the author gives two stochastic decomposition laws,and as an application the author gives bounds for the proximity between the system size distributions of the model and the corresponding model without retrials.     

The bound of price of anarchy for multi-class and multi-criteria traffic equilibrium problem

In this paper,we use the variational method to study the efficiency loss of user equilibrium for the multi-class,multi-criterion traffic equilibrium with general tolls and a discrete set of value of time.By introducing three important parameters k₁k₂,k₃,we derive several bounds of price of anarchy for this problem when tolls are considered and not considered as part of the system cost,with the cost-based criterion.     

Product Form Solution of a Queuing-Inventory System with Lost Sales and Server Vacation

In this study, the authors consider an M/M/1 queuing system with attached inventory under an(s, S) control policy. The server takes multiple vacations whenever the inventory is depleted.It is assumed that the lead time and the vacation time follow exponential distributions. The authors formulate the model as a quasi-birth-and-dearth(QBD) process and derive the stability condition of the system. Then, the stationary distribution in product form for the joint process of the queue length,the invent...     

RANDOMIZED POLICY OF A POISSON INPUT QUEUE WITH J VACATIONS

<正>This paper studies the operating characteristics of an M/G/1 queuing system with a randomized control policy and at most J vacations.After all the customers are served in the queue exhaustively, the server immediately takes at most J vacations repeatedly until at least N customers are waiting for service in the queue upon returning from a vacation.If the number of arrivals does not reach N by the end of the J~(th) vacation,the server remains idle in the system until the number of arrivals in the queue reaches N.If the number of customers in the queue is exactly accumulated N since the server remains idle or returns from vacation,the server is activated for services with probability p and deactivated with probability(1-p).For such variant vacation model,other important system characteristics are derived,such as the expected number of customers,the expected length of the busy and idle period,and etc.Following the construction of the expected cost function per unit time,an efficient and fast procedure is developed for searching the joint optimum thresholds(N~*,J~*) that minimize the cost function.Some numerical examples are also presented.     

A comparative study of the inventory system with service facility and postponed demands

In this article, we present a continuous review （s,S） inventory system with a service facility consisting of finite buffer （capacity N ） and a single server. The customers arrive according to a Poisson process. The individual customer＇s unit demand is satisfied after a random time of service, which is assumed to be exponential. When the inventory level drops to s＇an order for Q（= S-s） items is placed. The lead time of reorder is assumed to be exponential distribution. An arriving customer, who finds the buffer is full, enters into the pool of infinite size or leaves the system according to a Bernolli trial. At the time of service completion, if the buffer size drops to a preassigned level L （1 〈 L 〈 N） or below and the inventory level is above s, we select the customers from the pool according to two different policy ： in first policy, with probability p （0 〈 p 〈 1） we select the customer from the head of the pool and we place the customer at the end of the buffer; in the second policy, with p （0 〈 p 〈 1） the customer from the pool is transferred to the buffer for immediate service and after completion of his service we provide service to the customer who is in the buffer with probability one. If at a service completion epoch the buffer turns out to be empty, there is at least one customer in the pool and the inventory level is positive, then the one ahead of all waiting in the pool gets transferred to the buffer, and his service starts immediately. The joint probability distribution of the number of customers in the pool, number of customers in the buffer and the inventory level is obtained in the steady-state case. Various stationary system performance measures are computed and total expected cost rate is calculated. A comparative result of two models is illustrate numerically.     

Spectral Properties and Positivity of Flows in Infinite Networks with Dynamic Boundary Control Nodes

In this paper we study transport processes on infinite networks with dynamic boundary control nodes. These flows can be modeled by operator semigroups on a suitable Banach space. Using functional analytical and graph theoretical methods, we investigate its spectral properties of the system and positivity of the semigroup under appropriate assumptions on the network.     

PERIODIC SOLUTIONS AND GLOBAL ASYMPTOTIC STABILITY OF A DELAYED DISCRETE PREDATOR-PREY SYSTEM WITH HOLLING II TYPE FUNCTIONAL RESPONSE

In this paper, we study the existence and global asymptotic stability of positive periodic solutions of a delayed periodic predator-prey system with Hoffing Ⅱ type functional response. By use of the continuation theorem of coincidence degree theory and the method of Lyapunov function, some sufficient conditions are obtained.     

UNIFORM PERSISTENCE AND GLOBAL ATTRACTIVITY FOR NONAUTONOMOUS COMPETITIVE SYSTEMS WITH DISPERSION

In this paper, we consider a nonautonomous competitive model with dispersion and a finite number of discrete delays. The system, which consists of two Lotka-Volterra patches, has two competitors: one can disperse between the two patches, but the other is confined to one patch and cannot disperse. Our purpose is to demonstrate that the dispersion rates have no effect on the uniform persistence of the solutions of the system. Furthermore, we establish the conditions under which the system admits a positive periodic solution which attracts all solutions.     

PERMANENCE AND PERIODIC SOLUTION IN AN INTEGRODIFFERENTIAL SYSTEM WITH DISCRETE DIFFUSION

Dynamical characteristics of an integrodifferential modelling competitive sys-tem with diffusion are investigated.In particular,we derive sufficient conditions for the permanence of species,existence of an attracting periodic solution to the periodic system.The results of Wang Ke in 1994 and 1998 are improved and extended.     

COMPLEX ECO-ECONOMY SYSTEM

In the past there were a lot of researches on the topic of economic growth. Nevertheless, the environment has been a bit abstracted by standard economics. Scarce natural resources and our choices to protect them or exploit them jointly determine the economic and environmental systems. In this paper we describe a model with a particular focus on the relationship among income, pollution, and non-renewable resources. We want to combine both economic and environmental sectors. The system dynamics approach is used in analyzing these complex relationships. This paper gives an insight into the possibilities for replacing non-renewable resources with more renewable ones. Next, we present the simulation runs of the model that are conducted with the help of existing system dynamics modeling tools. Only the relationships simulated so far between the variables ought to be put under yet more cautious examination.     

ANALYSIS AND COMPUTATIONAL ALGORITHM FOR QUEUES WITH STATE-DEPENDENT VACATIONS Ⅱ:M(n)/G/1/K

We study a single-server queueing system with state-dependent arrivals and general service-distribution.or simply M(n)/G/1/K.where the server follows an N policy and takes multiple vacationswhen the system is empty.We provide a recursive algorithm using the supplementary variable tech-nique to munerically compute the stationary queue length distribution of the system.The only inputrequirements are the Laplace-Stieltjes transforms of the service time distribution and the vacation timedistribution.and the state-dependent arrival rate.The computational complexity of the algorithm isO(K~3).     

Exponential Stability of a Reparable System with Two Types of Repair Facilities

The exponential stability of a reparable system with two types of repair facilities is discussed in this paper. We present that the c0-semigroup generated by the system operator is quasi-compact and irreducible. It is known that 0 is a simple eigenvalue of the system operator. In combination with this, we obtain that the time-dependent solution exponentially converges to the steady-state solution, which is the positive eigenfuction corresponding to the simple eigenvalue 0.     

A workload-based nonlinear approach for predicting available computing resources

Performance degradation or system resource exhaustion can be attributed to inadequate computing resources as a result of software aging. In the real world, the workload of a web server varies with time, which will cause a nonlinear aging phenomenon. The nonlinear property often makes analysis and modelling difficult. Workload is one of the important factors in-fluencing the speed of aging. This paper quantitatively analyzes the workload-aging relation and proposes a framework for aging control u...