Asymptotic behavior of the loss probability for an M/G/1/N queue with vacations

In this paper, asymptotic properties of the loss probability are considered for an M/G/1/N queue with server vacations and exhaustive service discipline, denoted by an M/G/1/N-(V, E)-queue. Exact asymptotic rates of the loss probability are obtained for the cases in which the traffic intensity is smaller than, equal to and greater than one, respectively. When the vacation time is zero, the model considered degenerates to the standard M/G/1/N queue. For this standard queueing model, our analysis provides new or extended asymptotic results for the loss probability. In terms of the duality relationship between the M/G/1/N and GI/M/1/N queues, we also provide asymptotic properties for the standard GI/M/1/N model.     

Asymptotic behaviour of nonlinear difference equations

In this paper, we investigate the growth/decay rate of solutions of a class of nonlinear Volterra difference equations. Our results can be applied for the case when the characteristic equation of an associated linear difference equation has complex dominant eigenvalue with higher than one multiplicity. Illustrative examples are given for describing the asymptotic behaviour of solutions in a class of linear difference equations and in several discrete nonlinear population models.     

Asymptotic behaviour and exponential stability for a transmission problem in thermoelasticity

We show that the solution of a semilinear transmission problem between an elastic and a thermoelastic material, decays exponentially to zero. That is, denoting by ?(t) the sum of the first, second and third order energy associated with the system, we show that there exist positive constants C and γsatisfying ?(t) ? C?(0)e^?γt Moreover, the existence of absorbing sets is achieved in the non‐homogeneous case. Copyright © 2002 John Wiley & Sons, Ltd.     

Asymptotic behaviour of the energy for electromagnetic systems with memory

Some linear evolution problems arising in the theory of hereditary electromagnetism are considered here. Making use of suitable Liapunov functionals, existence of solutions as well as asymptotic behaviour, are determined for rigid conductors with electric memory. In particular, we show the polynomially decay of the solutions, when the memory kernel decays exponentially or polynomially. Copyright © 2004 John Wiley & Sons, Ltd.     

具有局部阻尼的热弹性问题的渐近行为和指数稳定性

一个关于具有局部阻尼的半线性热弹性问题,是材料科学中最重要的数学模型之一．这个问题的解的存在性和齐次问题解的指数衰竭于零的性质被得到了．进而,也得到了对非齐次问题吸收集的存在性．结果显示了所研究的系统是渐近稳定的．     

M/G/1排队论系统的渐近稳定性

通过M/G/1算子的谱分析得到了M/G/1排队论系统的渐近稳定性.首先,将系统方程转化为某一合适Banach空间上的抽象Cauchy闻题,从而引入M/G/1算子.其次,分析了M/G/1算子的谱分布,得到了0是M/G/1算子的简单本征值且M/G/1算子的谱分布在左半平面的结果.最后,利用谱分析结果和算子半群理论得到了M/...     

M/G/1/K queues withN-policy and setup times

A steady-state analysis is given for M/G/1/K queues with combinedN-policy and setup times before service periods. The queue length distributions and the mean waiting times are obtained for the exhaustive service system, the gated service system, the E-limited service system, and the G-limited service system. Numerical examples are also provided.     

M/G/1重试排队系统的渐近稳定性

用算子半群理论研究了带有重试排队的M/G/1系统.通过解算子方程和预解方程,证明了0是系统算子的本征值,且为虚轴上唯一的谱点.从而得出了当时间趋于无穷时系统时间依赖解收敛于稳态解的结论.     

A simple method for computing state probabilities of theM/G/1 andGI/M/1 finite waiting space queues

This paper presents a simple method for computing steady state probabilities at arbitrary and departure epochs of theM/G/1/K queue. The method is recursive and works efficiently for all service time distributions. The only input required for exact evaluation of state probabilities is the Laplace transform of the probability density function of service time. Results for theGI/M/1/K –1 queue have also been obtained from those ofM/G/1/K queue.     

Loss probability in an overloaded discrete-time GI/G/1/K system with very large K

We present a simple semi-explicit formula for estimating the loss probability in a discrete-time GI/G/1/K system (with large K) which is operating under an overload condition. The method relaxes the lower boundary and then studies the upper boundary only. The idea is extended to the GI^X/G/1/K system.     

Asymptotic analysis of the loss probability in theGI/PH/1/K queue

We obtain an asymptotic behavior of the loss probability for theGI/PH/1/K queue asK tends to infinity when the traffic intensityρ is strictly less than one. It is shown that the loss probability tends to 0 at a geometric rate and that the decay rate is related to the matrix generating function describing the service completions during an interarrival time.     

Asymptotic Behavior of Loss Probability in GI/M/1/K Queue as K Tends to Infinity

We obtain an asymptotic behavior of the loss probability for the GI/M/1/K queue as K for cases of <1, >1 and =1.     

The age of the arrival process in the G/M/1 and M/G/1 queues

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit expressions for the conditional density functions, as well as some stochastic orders, in all three cases are given. Moreover, we show that this independence property, which we prove by elementary arguments, also leads to an alternative proof for the fact that given a busy server, the number of customers in the queue follows a geometric distribution. We conclude with a derivation for the Laplace Stieltjes Transform (LST) of the age of the inter-arrival time in the M/G/1 queue.     

Computational analysis of single-server bulk-arrival queues: GIX/M/1

This paper deals with numerical computations for the bulk-arrival queueing modelGI ^X/M/1. First an algorithm is developed to find the roots inside the unit circle of the characteristic equation for this model. These roots are then used to calculate both the moments and the steady-state distribution of the number of customers in the system at a pre-arrival epoch. These results are used to compute the distribution of the same random variable at post-departure and random epochs. Unifying the method used by Easton [7], we have extended its application to the special cases where the interarrival time distribution is deterministic or uniform, and to cases whereX has a given arbitrary distribution. We also improved on the various root-finding methods used by several previous authors so that high values of the parameters, in particular large batch sizes, can be investigated as well.     

Second-order properties of the loss probability inM/M/s/s +c systems

The Erlang loss function, which gives the steady state loss probability in anM/M/s/s system, has been extensively studied in the literature. In this paper, we look at the similar loss probability inM/M/s/s + c systems and an extension of it to nonintegral number of servers and queue capacity. We study its monotonicity properties. We show that the loss probability is convex in the queue capacity, and that it is convex in the traffic intensity if is below some ^* and concave if is greater that ^*, for a broad range of number of servers and queue capacities. We prove that the one-server loss system is the onlyM/M/s/s +c system for which the loss probability is concave in the traffic intensity in all its range.Research supported by Grant BD/645/90-RM from Junta Nacional de Investigação Científica e Tecnológica.On leave from: Departamento de Matemática, Instituto Superior Técnico, Av. Rovisco Pais, 1096 Lisboa Codex, Portugal.     

A duality relation for busy cycles inGI/G/1 queues

Using a generalization of the classical ballot theorem, Niu and Cooper [7] established a duality relation between the joint distribution of several variables associated with the busy cycle inM/G/1 (with a modified first service) and the corresponding joint distribution of several related variables in its dualGI/M/1. In this note, we generalize this duality relation toGI/G/1 queues with modified first services; this clarifies the original result, and shows that the generalized ballot theorem is superfluous for the duality relation.