A matrix-geometric approximation for tandem queues with blocking and repeated attempts

Our interest is in the study of the MAP/PH/1/1→·/PH/1/K+1 queue with blocking and repeated attempts. The main feature of its infinitesimal generator is the spatial heterogeneity caused by the transitions due to successful repeated attempts. We develop an algorithmic solution by making a simplifying approximation which yields an infinitesimal generator which is spatially homogeneous and has a modified matrix-geometric stationary vector. The essential tool in our analysis is the general theory on quasi-birth-and-death processes.     

A heuristic technique for the transient behavior of Markovian queueing systems

Through an examination of numerical solutions to Markovian queueing systems, it has been shown that the expected queue length eventually approaches its equilibrium value in an approximately exponential manner. Based on this observation a heuristic is proposed for approximating the transient expected queue length for Markovian systems by scaling the numerical solution of an M/M/1 system.     

Shortest expected delay routing for Erlang servers

The queueing problem with Poisson arrivals and two identical parallel Erlang servers is analyzed for the case of shortest expected delay routing. This problem may be represented as a random walk on the integer grid in the first quadrant of the plane. An important aspect of the random walk is that it is possible to make large jumps in the direction of the boundaries. This feature gives rise to complicated boundary behavior. Generating function approaches to analyze this type of random walk seem to be extremely complicated and have not been successful yet. The approach presented in this paper directly solves the equilibrium equations. It is shown that the equilibrium distribution of the random walk can be written as an infinite linear combination of products. This linear combination is constructed in a compensation procedure. The starting solutions for this procedure are found by solving the shortest expected delay problem with instantaneous jockeying. The results can be used for an efficient computation of performance criteria, such as the waiting time distribution and the moments of the waiting time and the queue lengths.     

Discrete NT-policy single server queue with Markovian arrival process and phase type service

We consider a discrete time single server queueing system in which arrivals are governed by the Markovian arrival process. During a service period, all customers are served exhaustively. The server goes on vacation as soon as he/she completes service and the system is empty. Termination of the vacation period is controlled by two threshold parameters N and T, i.e. the server terminates his/her vacation as soon as the number waiting reaches N or the waiting time of the leading customer reaches T units. The steady state probability vector is shown to be of matrix-geometric type. The average queue length and the probability that the server is on vacation (or idle) are obtained. We also derive the steady state distribution of the waiting time at arrivals and show that the vacation period distribution is of phase type.     

Robust$${\cal {H}}_{\infty}$$ Stabilization of Stochastic Hybrid Systems with Wiener Process

This paper deals with the class of uncertain continuous-time linear stochastic hybrid systems with Wiener process. The uncertainties that we are considering are of the norm-bounded type. The robust stochastic stabilization problem is treated. LMIs based sufficient conditions are developed to design the state feedback controller that robustly and stochastically stabilizes the studied class of systems and at the same time rejects a disturbance of desired level. The minimum disturbance rejection is also determined. A numerical example is provided to show the validity of the proposed results.     

A stochastic system with MMPP input and an access function

In classical studies of loss systems with restricted availability, the utilization was suggested of a probabilistic loss function, defining the conditional probability of an incoming call being rejected, as a function of the number of occupations in the destination group of servers. This paper gives an exact analysis of stochastic processes of practical relevance, associated with a system with MMPP (Markov Modulated Poisson Process) input, finite queueing capacity and a general loss function, assuming exponential service times. In addition to the process defining the state of the system at any instant, the analysis of the overflow point process (associated with the rejected arriving customers), the accepted point process (associated with the accepted arriving customers), and of the departure process will be presented. Together with the exact analysis of this system, based on the matrix analytical methodology of Neuts, (1981), we will derive expressions for calculating some key-parameters of pertinent associated processes, which may also be used for their approximate modelling. Also, examples of applications and of blocking probability calculations in specific models of this class will be presented.     

Stability of neutral stochastic functional differential equations with Markovian switching driven by G-Brownian motion

Little seems to be known about stability results on the neutral stochastic function differential equations with Markovian switching driven by G-Brownian (G-NSFDEwMSs). This paper aims at investigating the pth moment exponential stability for G-NSFDEwMSs to fill this gap. Some sufficient conditions on the pth moment exponential stability of the trivial solution are derived by employing the Razumikhin-type method, stochastic analysis, and algebraic inequality technique. Moreover, an example is provided to illustrate the effectiveness of the obtained results.     

����˿͹����Ŷ�ϵͳ����Ϣ����

The discriminatory processor sharing queues with multiple classes of customers (abbreviated as DPS queues) are an important but difficult research direction in queueing theory, and it has many important practical applications in the fields of, such as, computer networks, manufacturing systems, transportation networks, and so forth. Recently, researchers have carried out some key work for the DPS queues. They gave the generating function of the steady-state joint queue lengths, which leads to the first two moments of the steady-state joint queue lengths. However, using the generating function to provide explicit expressions for the steady-state joint queue lengths has been a difficult and challenging problem for many years. Based on this, this paper applies the maximum entropy principle in the information theory to providing an approximate expression with high precision, and this approximate expression can have the same first three moments as those of its exact expression. On the other hand, this paper gives efficiently numerical computation by means of this approximate expression, and analyzes how the key variables of this approximate expression depend on the original parameters of this queueing system in terms of some numerical experiments. Therefore, this approximate expression has important theoretical significance to promote practical applications of the DPS queues. At the same time, not only do the methodology and results given in this paper provide a new line in the study of DPS queues, but they also provide the theoretical basis and technical support for how to apply the information theory to the study of queueing systems, queueing networks and more generally, stochastic models.