Analysis of GI/M/n/n queueing system with ordered entry and no waiting line

This paper deals with a multi-server, finite-capacity queuing system with recurrent input and no waiting line. The interarrival times are arbitrarily distributed whereas service times are exponentially distributed. Moreover, the servers are heterogeneous and independent of each other. Arriving customers choose the server with the lowest index number among the empty servers. When all servers are busy at a time of an arrival, that arrival must leave the system without being served. The semi-Markov process method is used to describe this model and embedded Markov chain of the process is obtained. Furthermore, the Laplace–Stieltjes transform of the distribution of interoverflow times is derived which is the main objective of the paper. Finally, it is offered a new formulation for the loss probability which provides more efficient and rapid calculation is proposed.     

Dimension of the crown Skn

In 1941, Dushnik and Miller introduced the concept of the dimension of a poset (X, P) as the minimum number of linear extensions of P whose intersection is exactly P. Although Dilworth has given a formula for the dimension of distributive lattices, the general problem of determining the dimension of a poset is quite difficult. An equally difficult problem is to classify those posets which are dimension irreducible, i.e., those posets for which the removal of any point lowers the dimension. In this paper, we construct for each n≥3, k≥0, a poset, called a crown and denoted S^k_n, for which the dimension is given by the formula $\text{2?(n+k)}\text{(k+2)}$. Furthermore, for each t≥3, we show that there are infinitely many crowns which are irreducible and have dimension t. We then demonstrate a method of combining a collection of irreducible crowns to form an irreducible poset whose dimension is the sum of the crowns in the collection. Finally, we construct some infinite crowns possessing combinatorial properties similar to finite crowns.     

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.     

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.     

Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations

This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prearrival epochs. The loss probabilities of the first-, an arbitrary- and the last-customer in a batch, and other performance measures along with numerical aspects have been discussed. The analysis of actual waiting time of these customers in an accepted batch is also carried out.     

Analyzing the finite buffer batch arrival queue under Markovian service process: GIX/MSP/1/N

We consider a batch arrival finite buffer single server queue with inter-batch arrival times are generally distributed and arrivals occur in batches of random size. The service process is correlated and its structure is presented through Markovian service process (MSP). The model is analyzed for two possible customer rejection strategies: partial batch rejection and total batch rejection policy. We obtain steady-state distribution at pre-arrival and arbitrary epochs along with some important performance measures, like probabilities of blocking the first, an arbitrary, and the last customer of a batch, average number of customers in the system, and the mean waiting times in the system. Some numerical results have been presented graphically to show the effect of model parameters on the performance measures. The model has potential application in the area of computer networks, telecommunication systems, manufacturing system design, etc.      

Approximation of M/M/s/K retrial queue with nonpersistent customers

We consider the M/M/s/K retrial queues in which a customer who is blocked to enter the service facility may leave the system with a probability that depends on the number of attempts of the customer to enter the service facility. Approximation formulae for the distributions of the number of customers in service facility, waiting time in the system and the number of retrials made by a customer during its waiting time are derived. Approximation results are compared with the simulation.     

Automorphisms of Chevalley groups of types Al, Dl, El over local rings without 1/2

In this paper, we prove that every automorphism of a Chevalley group of type B _l , l ≥ 2, over a commutative local ring with 1/2 is standard, i.e., it is a composition of ring, inner, and central automorphisms.     

M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL

Multilevel processor-sharing (MLPS) disciplines were originally introduced by Kleinrock (in computer applications 1976) but they were forgotten for years. However, due to an application related to the service differentiation between short and long TCP flows in the Internet, they have recently gained new interest. In this paper we show that, if the service time distribution belongs to class IMRL, the mean delay in the M/G/1 queue is reduced when replacing the PS discipline with any MLPS discipline for which the internal disciplines belong to {FB, PS}. This is a generalization of our earlier result where we restricted ourselves to the service time distribution class DHR, which is a subset of class IMRL.     

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.     

Existence of Dλ-cycles and Dλ-paths

A cycle of C of a graph G is called a D_λ-cycle if every component of G ? V(C) has order less than λ. A D_λ-path is defined analogously. In particular, a D₁-cycle is a hamiltonian cycle and a D₁-path is a hamiltonian path. Necessary conditions and sufficient conditions are derived for graphs to have a D_λ-cycle or D_λ-path. The results are generalizations of theorems in hamiltonian graph theory. Extensions of notions such as vertex degree and adjacency of vertices to subgraphs of order greater than 1 arise in a natural way.     

The Lyapunov matrix equation SA+A1S=S1B1BS

The matrix equation $\text{SA+A}{}^1\text{S=S}{}^1\text{B}{}^1\text{BS}$ is studied, under the assumption that (A, B¹) is controllable, but allowing nonhermitian S. An inequality is given relating the dimensions of the eigenspaces of A and of the null space of S. In particular, if B has rank 1 and S is nonsingular, then S is hermitian, and the inertias of A and S are equal. Other inertial results are obtained, the role of the controllability of (A¹, B¹S¹) is studied, and a class of D-stable matrices is determined.     

AnM/M/s-consistent diffusion model for theGI/G/s queue

This paper develops a diffusion-approximation model for a stableGI/G/s queue: The queue-length process in theGI/G/s queue is approximated by a diffusion process on the nonnegative real line. Some heuristics on the state space and the infinitesimal parameters of the approximating diffusion process are introduced to obtain an approximation formula for the steady-state queue-length distribution. It is shown that the formula is consistent with the exact results for theM/M/s andM/G/ queues. The accuracy of the approximations for principal congestion measures are numerically examined for some particular cases.     

A Dunford-Pettis theorem for L1H∞⊥

The spaces in the title are associated to a fixed representing measure m for a fixed character on a uniform algebra. It is proved that the set of representing measures for that character which are absolutely continuous with respect to m is weakly relatively compact if and only if each m-negligible closed set in the maximal ideal space of L^∞ is contained in an m-negligible peak set for H^∞. J. Chaumat's characterization of weakly relatively compact subsets in $\text{L}{}^1\text{H}{}^{\mathrm{\infty \perp }}$ therefore remains true, and $\text{L}{}^1\text{H}{}^{\mathrm{\infty \perp }}$ is complete, under the first conditions. In this paper we also give a direct proof. From this we obtain that $\text{L}{}^1\text{H}{}^{\mathrm{\infty \perp }}$ has the Dunford-Pettis property.     

The isometries of LP(Ω, X)

Let (Ω, ∑, μ) be a finite measure space and X a separable Banach space. We characterize the linear isometries of $\text{L}{}^{\mathrm{p}}\text{(Ω, X)}$ onto itself for 1 ? p < ∞, p ≠ 2 under the condition that X is not the l^p-direct sum of two nonzero spaces (for the same p). It is shown that T is such an isometry if and only if (Tf)(·) = S(·)h(·)(Φ(f))(·), where Φ is a set isomorphism of ∑ onto itself, S is a strongly measurable operator-valued map such that S(t) is a.e. an isometry of X onto itself, and h is a scalar function which is related to Φ. It is further shown that for a big class of measure spaces (perhaps all nontrivial ones) the condition on X is also a necessary condition for the above conclusion to hold. In the case when X is a Hilbert space the injective isometries of $\text{L}{}^{\mathrm{p}}\text{(Ω, X)}$ are also characterized. They have the same form as above, except that Φ and S(t) are not necessarily onto.     

Automorphisms of elementary adjoint Chevalley groups of types Al, Dl, and El over local rings with 1/2

It is proved that every automorphism of an elementary adjoint Chevalley group of type A _l , D _l , or E _l over a local commutative ring with 1/2 is a composition of a ring automorphism and conjugation by some matrix from the normalizer of that Chevalley group in GL(V) (V is an adjoint representation space).     

An optimal age maintenance for an M/G/1 queueing system

This paper discusses an optimal age maintenance scheme for a queueing system. Customers arrive at the system according to a Poisson process. They form a single queue and are served by a server with general service distribution. The system fails after a random time and corrective maintenance is performed at the failure. A preventive maintenance is also performed if the system is empty at age T where ‘age’ refers to the elapsed time since the previous maintenance was completed. If the system is not empty at age T, the system is used until it fails. At the failure, the customers in the system are lost and the arriving customers during the maintenance are also lost. By renewal theory, we study the optimal value of T which minimizes the average number of lost customers over an infinite time horizon.     

On the finite-source G/M/r queue

The aim of the present paper is to give the main characteristics of the finite-source $\text{G}\text{/}\text{M}\text{/r}$ queue in equilibrium. Here unit i stays in the source for a random time having general distribution function F_i(x) with density f_i(x). The service times of all units are assumed to be identically and exponentially distributed random variables with means 1/μ. It is shown that the solution to this $\text{G}\text{/}\text{M}\text{/r}$ model is similar in most important respects to that for the M/M/r model.     

Asymptotic behaviour of the loss probability of theM/G/1/K andG/M/1/K queues

This paper investigates the asymptotic behaviour of the loss probability of theM / G/1/K and G/M/1/K queues as the buffer size increases. It is shown that the loss probability approaches its limiting value, which depends on the offered load, with an exponential decay in essentially all cases. The value of the decay rate can be easily computed from the main queue parameters. Moreover, the close relation existing between the loss behaviour of the two examined queueing systems is highlighted and a duality concept is introduced. Finally some numerical examples are given to illustrate on the usefulness of the asymptotic approximation.