Asymptotic analysis for loss probability of queues with finite <Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1 type structure

This paper discusses the asymptotic behavior of the loss probability for general queues with finite GI/M/1 type structure such as GI/M/c/K, SM/M/1/K and GI/MSP/1/K queues. We find an explicit expression for the asymptotic behavior of the loss probability as K tends to infinity. With the result, it is shown that the loss probability tends to 0 at a geometric rate. This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).     

Continuity theorems for the M/M/1/n queueing system

In this paper continuity theorems are established for the number of losses during a busy period of the M/M/1/n queue. We consider an M/GI/1/n queueing system where the service time probability distribution, slightly different in a certain sense from the exponential distribution, is approximated by that exponential distribution. Continuity theorems are obtained in the form of one or two-sided stochastic inequalities. The paper shows how the bounds of these inequalities are changed if further assumptions, associated with specific properties of the service time distribution (precisely described in the paper), are made. Specifically, some parametric families of service time distributions are discussed, and the paper establishes uniform estimates (given for all possible values of the parameter) and local estimates (where the parameter is fixed and takes only the given value). The analysis of the paper is based on the level crossing approach and some characterization properties of the exponential distribution. Dedicated to Vladimir Mikhailovich Zolotarev, Victor Makarovich Kruglov, and to the memory of Vladimir Vyacheslavovich Kalashnikov.     

Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System

In this paper for the M(n)/M(n)/s+GI system, i.e. for a s-server queueing system where the calls in the queue may leave the system due to impatience, we present new asymptotic results for the intensities of calls leaving the system due to impatience and a Markovian system approximation where these results are applied. Furthermore, we present a new proof for the formulae of the conditional density of the virtual waiting time distributions, recently given by Movaghar for the less general M(n)/M/s+GI system. Also we obtain new explicit expressions for refined virtual waiting time characteristics as a byproduct.     

Fast formula of a reliability ofm-consecutive-k-out-of-n:F system with cyclek

Anm-consecutive-k-out-of-n:F system is a system ofn linearly arranged components which fails if and only if at leastm non-overlapping sequences ofk components fail, when there arek distinct components with failure probabilitiesq _i fori=1,...,k and where the failure probability of thej-th component (j=rk+i (1 ≤i ≤k) isq _j =q _i , we call this system by anm-consecutive-k-out-of-n:F system with cycle (or period)k. In this paper we give a formula of the failure probability ofm-consecutive-k-out-of-n:F system with cyclek via the failure probability of consecutive-k-out-of-n:F system.     

Consecutive customer losses in oscillating GIX/M//n systems with state dependent services rates

We address the probability that k or more Consecutive Customer Losses take place during a busy period of a queue, the so-called k-CCL probability, for oscillating GI ^X /M//n systems with state dependent services rates, also denoted as GI ^X /M(m)−M(m)//n systems, in which the service rates oscillate between two forms according to the evolution of the number of customers in the system. We derive an efficient algorithm to compute k-CCL probabilities in these systems starting with an arbitrary number of customers in the system that involves solving a linear system of equations. The results derived are illustrated for specific sets of parameters.     

Asymptotic analysis of the M/G/1 queue with a time‐dependent arrival rate

We consider the M/G/1 queue with an arrival rate λ that depends weakly upon time, as λ = λ(εt) where ε is a small parameter. In the asymptotic limit ε → 0, we construct approximations to the probability p _n(t)that η customers are present at time t. We show that the asymptotics are different for several ranges of the (slow) time scale Τ= εt. We employ singular perturbation techniques and relate the various time scales by asymptotic matching. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the Transient Behavior of the M/M/1 and M/M/1/M Queues

This paper gives a transient analysis of the classic M/M/1 and M/M/1/K queues. Our results are asymptotic as time and queue length become simultaneously large for the infinite capacity queue, and as the system’s storage capacity K becomes large for the finite capacity queue. We give asymptotic expansions for p_n(t), which is the probability that the system contains n customers at time t. We treat several cases of initial conditions and different traffic intensities. The results are based on (i) asymptotic expansion of an exact integral representation for p_n(t) and (ii) applying the ray method to a scaled form of the forward Kolmogorov equation which describes the time evolution of p_n(t).     

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.     

Exact Convergence Rate for the Distributions of GI/M/c/K Queue as K Tends to Infinity

We obtain the exact convergence rate of the stationary distribution ^(K) of the embedded Markov chain in GI/M/c/K queue to the stationary distribution of the embedded Markov chain in GI/M/c queue as K. Similar result for the time-stationary distributions of queue size is also included. These generalize Choi and Kim's results of the case c=1 by nontrivial ways. Our results also strengthen the Simonot's results [5].     

New transformations for elliptic hypergeometric series on the root system A n

Recently, Kajihara gave a Bailey-type transformation relating basic hypergeometric series on the root system A _n , with different dimensions n. We give, with a new, elementary proof, an elliptic extension of this transformation. We also obtain further Bailey-type transformations as consequences of our result, some of which are new also in the case of basic and classical hypergeometric series. 2000 Mathematics Subject Classification Primary—33D67; Secondary—11F50     

D n -normal semigroups of transformations

Given a subgroup G of the symmetric group S _n on n letters, a semigroup S of transformations of X _n is G-normal if G _S =G, where G _S consists of all permutations h∈S _n such that h ⁻¹ fh∈S for all f∈S. A semigroup S is G-normax if it is a maximal semigroup in the set of all G-normal semigroups. In 1996, I. Levi showed that the alternating group A _n can not serve as the group G _S for any semigroup of total transformations of X _n . In 2000 and 2001, I. Levi, D.B. McAlister and R.B. McFadden described all A _n -normal semigroups of partial transformations of X _n . Also, in 1994, I. Levi and R.B. McFadden described all S _n -normal semigroups. In this paper, we show that the dihedral group D _n may serve as the group G _S for semigroups of transformations of X _n . We characterize a large class of D _n -normax semigroups and describe certain D _n -normal semigroups.     

Extension ofUV n -valued mappings

A new method for extending upper semicontinuousUV ⁿ -valued mappings is introduced. Any upper semicontinuousUV ⁿ -valued mapping Ψ:A→Y of a closed subsetA of a separable metric spaceX into ann-connected, locallyn-connected complete metric spaceY satisfying the property of disjoint (n+1)-disks is proved to be extendable to an upper semicontinuousUV ⁿ -valued mapping Ψ′:X→Y such that Ψ′|a=Ψ. As an application, some results aboutn-soft mappings are obtained. Translated fromMatematicheskie Zametki, Vol. 66, No. 3, pp. 351–363, September, 1999.     

q-Bernstein polynomials and their iterates

Let B_n( f,q;x), n=1,2,… be q-Bernstein polynomials of a function f : [0,1]→C. The polynomials B_n( f,1;x) are classical Bernstein polynomials. For q≠1 the properties of q-Bernstein polynomials differ essentially from those in the classical case. This paper deals with approximating properties of q-Bernstein polynomials in the case q>1 with respect to both n and q. Some estimates on the rate of convergence are given. In particular, it is proved that for a function f analytic in {z: |z|<q+} the rate of convergence of {B_n( f,q;x)} to f(x) in the norm of C[0,1] has the order q⁻ⁿ (versus 1/n for the classical Bernstein polynomials). Also iterates of q-Bernstein polynomials {B_n^j_n( f,q;x)}, where both n→∞ and j_n→∞, are studied. It is shown that for q(0,1) the asymptotic behavior of such iterates is quite different from the classical case. In particular, the limit does not depend on the rate of j_n→∞.     

Exchange Rings Satisfying the <Emphasis Type="Italic">n</Emphasis>-Stable Range Condition,II

This is a continuation of the paper [14]. It is shown that any finite subdirect product of exchange rings satisfying the n-stable range condition is still an exchange ring satisfying the n-stable range condition. Furthermore, we give necessary and sufficient conditions on matrices over an exchange ring R, under which R satisfies the n-stable range condition. This generalizes the corresponding results for unit-regular rings and the stable range one condition.2000 Mathematics Subject Classification: 19B10, 16E50This work was supported by the National Natural Science Foundation of China (Grant No. 19801012) and the Ministry of Education of China.     

Morava K-Theories of p-Groups with Cyclic Maximal Subgroups and Other Related Groups

Let P be a non-Abelian finite p-group, p odd, with cyclic maximal subgroups, and let K(n)^*(–) denote the nth Morava K-theory at p. In this paper we determine the algebras K(n)^*(BP) and K(n)^*(BG) for all groups G with Sylow p-subgroups isomorphic to P, giving further evidence for the fact that Morava K-theory as an invariant of finite groups, is finer than ordinary modp cohomology. Mathematics Subject Classifications (2000): 55N20, 55N22.     

Uniformly non-l n (1) Musielak-Orlicz sequence spaces

We give a necessary and sufficient condition for the uniformly non-l _n ⁽¹⁾ property of Musielak-Orlicz sequence spacesl ^Φ generated by a sequence Φ=(ϕ_n:n⩾l) of finite Orlicz functions such that for eachn∈ℕ. As a result, forn ₀⩾2, there exist spacesl ^Φ which are only uniformly non-l _n ⁽¹⁾ forn⩾n ₀. Moreover we obtain a characterization of uniformly non-l _n ⁽¹⁾ and reflexive Orlicz sequence spaces over a wide class of purely atomic measures and of uniformly non-l _n ⁽¹⁾ Nakano sequence spaces. This extends a result of Luxemburg in [19]. Submitted in memory of Professor W. Orlicz     

Approximations for the delay probability in the M/G/s queue

This paper develops approximations for the delay probability in an M/G/s queue. For M/G/s queues, it has been well known that the delay probability in the M/M/s queue, i.e., the Erlang delay formula, is usually a good approximation for other service-time distributions. By using an excellent approximation for the mean waiting time in the M/G/s queue, we provide more accurate approximations of the delay probability for small values of s. To test the quality of our approximations, we compare them with the exact value and the Erlang delay formula for some particular cases.     

Three Cases of Light-Traffic Insensitivity of the Loss Probability in a GI/G/m/0 Loss System to the Shape of the Service Time Distribution

A GI/G/m/0 loss system is considered. Three cases of light-traffic insensitivity of the loss probability to the shape of the service time distribution, given its first moment, are investigated in a triangle array setting.     

Asymptotics in the MAP/G/1 Queue with Critical Load

When the offered load ρ is 1, we investigate the asymptotic behavior of the stationary measure for the MAP/G/1 queue and the asymptotic behavior of the loss probability for the finite buffer MAP/G/1/K + 1 queue. Unlike Baiocchi [Stochastic Models 10(1994):867–893], we assume neither the time reversibility of the MAP nor the exponential moment condition for the service time distribution. Our result generalizes the result of Baiocchi for the critical case ρ = 1 and solves the problem conjectured by Kim et al. [Operations Research Letters 36(2008):127–132].