New Results About Weakly Equivalent MAP 2 and MAP 3 Processes

In Ramírez-Cobo et?al.?(J Appl Probab 47(3):630?C649, 2010b), weakly equivalent second order Markovian arrival processes (noted MAP ₂s) are introduced and partially characterized. In this work we look into weak equivalence in detail and provide a complete characterization of weakly equivalent MAP ₂s. The analogous problem for the MAP ₃ case is partially solved.     

A MAP/G/1 Queue with Negative Customers

In this paper, we consider a MAP/G/1 queue with MAP arrivals of negative customers, where there are two types of service times and two classes of removal rules: the RCA and RCH, as introduced in section 2. We provide an approach for analyzing the system. This approach is based on the classical supplementary variable method, combined with the matrix-analytic method and the censoring technique. By using this approach, we are able to relate the boundary conditions of the system of differential equations to a Markov chain of GI/G/1 type or a Markov renewal process of GI/G/1 type. This leads to a solution of the boundary equations, which is crucial for solving the system of differential equations. We also provide expressions for the distributions of stationary queue length and virtual sojourn time, and the Laplace transform of the busy period. Moreover, we provide an analysis for the asymptotics of the stationary queue length of the MAP/G/1 queues with and without negative customers.     

MAP 1, MAP2 /M/c retrial queue with guard channels and its application to cellular networks

In this paper, we investigate the impact of retrial phenomenon on loss probabilities and compare loss probabilities of several channel allocation schemes giving higher priority to hand-off calls in the cellular mobile wireless network. In general, two channel allocation schemes giving higher priority to hand-off calls are known; one is the scheme with the guard channels for hand-off calls and the other is the scheme with the priority queue for hand-off calls. For mathematical unified model for both schemes, we consider theMAP ₁,MAP ₂ /M/c/b, ∞ retrial queue with infinite retrial group, geometric loss, guard channels and finite priority queue for hand-off class. We approximate the joint distribution of two queue lengths by Neuts' method and also obtain waiting time distribution for hand-off calls. From these results, we obtain the loss probabilities, the mean waiting time and the mean queue lengths. We give numerical examples to show the impact of the repeated attempt and to compare loss probabilities of channel allocation schemes.     

Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process

We analyze the behavior of a multi-class single-server delay-loss system Σ_i^xMAP_i/PH/1/m with a superposition of independent Markovian Arrival Processes as arrival stream and phase-type distributed service times. Considering the underlying finite Markov chain with its quasi-birth-and-death structure with two boundary sets, we derive a new representation of its steady-state vector by a linear combination of two matrix-geometric terms. Furthermore, we state efficient procedures to calculate the performance characteristics of this delay-loss system.     

MAP/PH/1 queue with working vacations,vacation interruptions and N policy

In this paper we study a MAP/PH/1 queueing model in which the server is subject to taking vacations and offering services at a lower rate during those times. The service is returned to normal rate whenever the vacation gets over or when the queue length hits a specific threshold value. This model is analyzed in steady state using matrix analytic methods. An illustrative numerical example is discussed.     

A Regularly Preemptive Model and its Approximations

A regularly preemptive model D,MAP/D ₁,D ₂/1 is studied. Priority customers have constant inter-arrival times and constant service times. On the other hand, ordinary customers' arrivals follow a Markovian Arrival Process (MAP) with constant service times. Although this model can be formulated by using the piecewise Markov process, there remain some difficult problems on numerical calculations. In order to solve these problems, a novel approximation model MAP/MR/1 with Markov renewal services is proposed. These two queueing processes become different due to the existence of idle periods. Thus, a MAP/MR/1 queue with a general boundary condition is introduced. It is a model with the exceptional first service in each busy period. In particular, two special models are studied: one is a warm-up queue and the other is a cool-down queue. It can be proved that the waiting time of ordinary customers for the regular preemption model is stochastically smaller than the waiting time of the former model. On the other hand, it is stochastically larger than the waiting time of the latter model.     

Spatial No-Waiting Stations with Moving Customers

We analyze spatial MAP/G/∞-, spatial MAP/G/c/0¹ and spatial Cox/G/∞-stations with group arrivals over some Polish space X (with Borel σ-algebra X), including the aspect of customer motion in space. For models with MAP-input, characteristic differential equations are set up that describe the dynamics of phase dependent random functions Q _r;ij (u,t;S′), where Q _r;ij (u,t;S′) is the probability to observe, at time u≤t, the number r of those customers in some source set S′∈X, who will be in a destination set S∈X at time t. For Cox/G/∞-stations, i.e., infinite server stations with doubly stochastic input, the arrival intensities as well as service times may depend on some general stochastic process (J′ _t ) _t≥0 with countable state space. For that case we obtain explicit expressions for space–time distributions as well as stationary and non-stationary characteristics.     

Analysis of the MAP/G/1/N queue with multiple vacations

This paper deals with a batch service queue and multiple vacations. The system consists of a single server and a waiting room of finite capacity. Arrival of customers follows a Markovian arrival process (MAP). The server is unavailable for occasional intervals of time called vacations, and when it is available, customers are served in batches of maximum size ‘b’ with a minimum threshold value ‘a’. We obtain the queue length distributions at various epochs along with some key performance measures. Finally, some numerical results have been presented.     

Analysis of MAP/PH1,PH2/1 queue with vacations and optional secondary services

In this paper we study a queueing model in which the customers arrive according to a Markovian arrival process (MAP). There is a single server who offers services on a first-come-first-served basis. With a certain probability a customer may require an optional secondary service. The secondary service is provided by the same server either immediately (if no one is waiting to receive service in the first stage) or waits until the number waiting for such services hits a pre-determined threshold. The model is studied as a QBD-process using matrix-analytic methods and some illustrative examples are discussed.     

Solving Ck/Cm/1/N queues by using characteristic roots in matrix analytic methods

In this paper, we study a C_k/C_m/1/N open queueing system with finite capacity. We investigate the property which shows that a product of the Laplace Stieltjes Transforms of interarrival and service times distributions satisfies an equation of a simple form. According to this equation, we present that the stationary probabilities on the unboundary states can be written as a linear combination of vector product-forms. Each component of these products is expressed in terms of roots of an associated characteristic polynomial. As a result, we carry out an algorithm for solving stationary probabilities in C_k/C_m/1/N systems, which is independent of N, hence greatly reducing the computational complexity.     

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].     

I2-convergence and I2-cauchy double sequences

In this article, we prove a decomposition theorem for I₂-convergent double sequences and introduce the notions of I₂-Cauchy and I^*₂)-Cauchy double sequence, and then study their certain properties. Finally, we introduce the notions of regularly (I₂,I)-convergence and (I₂,I)-Cauchy double sequence.     

A maximum principle in Rn + 1

In this paper we establish maximum principles of the Cauchy problem for hyperbolic equations in $\text{R}$³ and $\text{R}$^{n + 1}(n ? 2). Our maximum principles generalize the results of Weinberger [5], and Sather [3, 4] for a class of equations such that the coefficients can be allowed to depend upon t, as well, in {x₁, x₂, t}-space and {x₁, x₂,…, x_n, t}-space. Throughout this paper, the influence of the work of Douglis [1] is apparent. See [2].     

Units in totally complex S3 fields

Let B be a totally complex number field, Galois over the rational field Q, with Galois group S₃, the symmetric group on three elements. The group of units of B has torsion free rank 2. In this paper, we determine the various inequivalent representations that occur of S₃ acting on the group of units and determine arithmetic criteria for deciding which representation occurs for a particular field. As a result, we can give a relatively simple computational procedure for determining a pair of fundamental units of B given a fundamental unit in a cubic subfield.     

Decomposition of an M/D/r·k queue with FIFO into k Ek/D/r queues with FIFO

It is observed that the queuing system M/D/r·k with FIFO has the same waiting time distribution as the queuing system E_k/D/r with FIFO. Using this simple equivalence we can apply numerical methods and tables for M/Dn to solve E_k/D/r.     

Characterization of the odd graphs Ok by parameters

In this note, we settle a problem of N. Biggs [4, p.80] by showing that for each k, no distance regular graph non-isomorphic to the odd graph O_k can have the same parameters as O_k. A related characterization of certain graphs associated with the Johnson scheme J(2k+1, k) is also given.     

An Algorithmic Approach for Sensitivity Analysis of Perturbed Quasi-Birth-and-Death Processes

In this paper, we present an algorithmic approach for sensitivity analysis of stationary and transient performance measures of a perturbed continuous-time level-dependent quasi-birth-and-death (QBD) process with infinitely-many levels. By developing a new LU-type RG-factorization using the censoring technique, we obtain the maximal negative inverse of the infinitesimal generator of the QBD process. The derivatives of the stationary performance measures of the QBD process can then be expressed and computed in terms of the maximal negative inverse, overcoming the computational difficulty arising from the use of group inverses of infinite size in the current literature (see Cao and Chen [11]). We also use a stochastic integral functional to study the transient performance measure of the QBD process and show how to use the algorithmic approach for its sensitivity analysis. As an example, a perturbed MAP/PH/1 queue is also analyzed.     

Bounds for increasing multi-state consecutive k-out-of-r-from-n: F system with equal components probabilities

The consecutive k-out-of-r-from-n: F system was generalized to multi-state case. This system consists of n linearly ordered components which are at state below j if and only if at least k_j components out of any r consecutive are in state below j. In this paper we suggest bounds of increasing multi-state consecutive-k-out-of-r-from-n: F system (k₁ ? k₂ ? ? ? k_M) by applying second order Boole–Bonferroni bounds and applying Hunter–Worsley upper bound. Also numerical results are given. The programs in V.B.6 of the algorithms are available upon request from the authors.     

On the homeomorphism of continuous mappings

Denote by C(X) the partially ordered (PO) set of all continuous epimorphisms of a space X under the natural identification of homeomorphic epimorphisms. The following homeomorphism theorem for bicompacta is implicitly contained in Magill’s 1968 paper: two bicompacta X and Y are homeomorphic if and only if the PO sets C(X) and C(Y) are isomorphic. In the present paper, Magill’s theorem is extended to the category of mappings in which the role of bicompacta is played by perfect mappings. The results are obtained in two versions, namely, in the category TOP _Z (of triangular commutative diagrams) and in the category MAP (of quadrangular commutative diagrams).     

The Monotonicity of Period Function for Codimension Four Quadratic System Q4

In this paper, we study the codimension four quadratic system Q₄ : ?=−iz+4z²+2∣z∣²+(b+ic)z?², where b and c are real constants, i²=−1, z=x+iy, ∣b+ic∣=2. It is proved that the period function of periodic trajectories for Q₄ is monotone. The content of this paper can be viewed as a contribution to the proof of Chicone's conjecture (cf. MR: 94h:58072).