Performance analysis of a discrete-time Geo/G/1 queue with randomized vacations and at most J vacations

This paper presents the analysis of a discrete-time Geo/G/1$\mathit{Geo}/G/1$ queue with randomized vacations. Using the probability decomposition theory and renewal process, two variants on this model, namely the late arrival system with delayed access (LAS-DA) and early arrival system (EAS), have been examined. For both the cases, recursive solution for queue length distributions at arbitrary, just before a potential arrival, pre-arrival, immediately after potential departure, and outside observer’s observation epochs are obtained. Further, various performance measures such as potential blocking probability, turned-on period, turned-off period, vacation period, expected length of the turned-on circle period, average queue length and sojourn time, etc. have been presented. It is hoped that the results obtained in this paper may provide useful information to designers of telecommunication systems, practitioners, and others.     

Online scheduling policies for multiclass call centers with impatient customers

We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s+M$\mathit{GI}/\mathit{GI}/s+M$ queue, we focus on developing scheduling policies that satisfy a target ratio constraint on the abandonment probabilities of premium customers to regular ones. The problem is inspired by a real call center application in which we want to reach some predefined preference between customer classes for any workload condition. The motivation for this constraint comes from the difficulty of predicting in a quite satisfying way the workload. In such a case, the traditional routing problem formulation with differentiated service levels for different customer classes would be useless. For this new problem formulation, we propose two families of online scheduling policies: queue joining and call selection policies. The principle of our policies is that we adjust their routing rules by dynamically changing their parameters. We then evaluate the performance of these policies through a numerical study. The policies are characterized by simplicity and ease of implementation.     

An M/G/1 queue with single working vacation and vacation interruption under Bernoulli schedule

This paper treats an M/G/1 queue with single working vacation and vacation interruption under Bernoulli schedule. Whenever the system becomes empty at a service completion instant, the server goes for a single working vacation. In the working vacation, a customer is served at a lower speed, and if there are customers in the queue at the instant of a service completion, the server is resumed to a regular busy period with probability p   (i.e., the vacation is interrupted) or continues the vacation with probability 1-p$1-p$. Using the matrix analytic method, we obtain the distribution for the stationary queue length at departure epochs. The joint distribution for the stationary queue length and service status at the arbitrary epoch is also obtained by using supplementary variable technique. We also develop a variety of stationary performance measures for this system and give a conditional stochastic decomposition result. Finally, several numerical examples are presented.     

Thirteen limit cycles for a class of Hamiltonian systems under seven-order perturbed terms

In this paper we study the existence, number and distribution of limit cycles of the perturbed Hamiltonian system:$\begin{array}{cc}\hfill & x^{\prime }=4y({\mathit{abx}}^2-{\mathit{by}}^2+1)+\epsilon x\left({\mathit{ux}}^n+{\mathit{vy}}^n-b\frac{\beta +1}{\mu +1}{x}^{\mu }{y}^{\beta }-{\mathit{ux}}^2-\lambda \right)\hfill \\ \hfill & y^{\prime }=4x({\mathit{ax}}^2-{\mathit{aby}}^2-1)+\epsilon y({\mathit{ux}}^n+{\mathit{vy}}^n+{\mathit{bx}}^{\mu }{y}^{\beta }-{\mathit{vy}}^2-\lambda )\hfill \end{array}$where μ + β = n, 0 < a < b < 1, 0 < ε ≪ 1, u, v, λ are the real parameters and n = 2k, k an integer positive.Applying the Abelian integral method [Blows TR, Perko LM. Bifurcation of limit cycles from centers and separatrix cycles of planar analytic systems. SIAM Rev 1994;36:341–76] in the case n = 6 we find that the system can have at least 13 limit cycles.Numerical explorations allow us to draw the distribution of limit cycles.     

The GI/M/1 queue with Bernoulli-schedule-controlled vacation and vacation interruption

Consider a GI/M/1 queue with multiple vacations. As soon as the system becomes empty, the server either begins an ordinary vacation with probability q  (0?q?1)$(0?q?1)$ or takes a working vacation with probability 1-q$1-q$. We assume the vacation interruption is controlled by Bernoulli. If the system is non-empty at a service completion instant in a working vacation period, the server can come back to the normal busy period with probability p  (0?p?1)$(0?p?1)$ or continue the vacation with probability 1-p$1-p$. Using the matrix-analytic method, we obtain the steady-state distributions for the queue length both at arrival and arbitrary epochs. The waiting time and sojourn time are also derived by different methods. Finally, some numerical examples are presented.     

Best quadrature formula on Sobolev class with Chebyshev weight

Using best interpolation function based on a given function information, we present a best quadrature rule of function on Sobolev class KW^r[-1,1]${\mathit{KW}}^r[-1,1]$ with Chebyshev weight. The given function information means that the values of a function f∈KW^r[-1,1]$f\in {\mathit{KW}}^r[-1,1]$ and its derivatives up to r-1$r-1$ order at a set of nodes x$\mathbf{x}$ are given. Error bounds are obtained, and the method is illustrated by some examples.     

New approach for the existence of pseudo almost periodic solutions for some second order differential equation with piecewise constant argument

The following equation d²/dt²(x(t)+px(t-1))=qx(2[(t+1)/2])+f(t)${\mathrm{d}}^2/\mathrm{d}{t}^2(x(t)+\mathit{px}(t-1))=\mathit{qx}(2[(t+1)/2])+f(t)$ is considered and necessary and sufficient conditions are given in order to ensure the existence and uniqueness of pseudo almost periodic solutions.     

Analysis of two queues in parallel with jockeying and restricted capacities

In this paper, we present two parallel queues with jockeying and restricted capacities. Each exponential server has its own queue, and jockeying among the queues is permitted. The capacity of each queue is restricted to L   including the one being served. Customers arrive according to a Poisson process and on arrival; they join the shortest feasible queue. Moreover, if one queue is empty and in the other queue, more than one customer is waiting, then the customer who has to receive after the customer being served in that queue is transferred to the empty queue. This will prevent one server from being idle while the customers are waiting in the other queue. Using the matrix-analytical technique, we derive formulas in matrix form for the steady-state probabilities and formulas for other performance measures. Finally, we compare our new model with some of Markovian queueing systems such as Conolly’s model [B.W. Conolly, The autostrada queueing problems, J. Appl. Prob. 21 (1984) 394–403], M/M/2$M/M/2$ queue and two of independent M/M/1$M/M/1$ queues for the steady state solution.     

A 3-manifold group which is not four dimensional linear

We give examples of closed orientable graph 3-manifolds having a fundamental group which is not a subgroup of GL(4,F)$\mathit{GL}(4,\mathbb{F})$ for any field F$\mathbb{F}$. This answers a question in the Kirby problem list from 1977 which is credited to the late William Thurston.     

Normal subgroups of profinite groups of non-negative deficiency

The principal goal of the paper is to show that the existence of a finitely generated normal subgroup of infinite index in a profinite group G of non-negative deficiency gives rather strong consequences for the structure of G. To make this precise we introduce the notion of p-deficiency (p a prime) for a profinite group G. We prove that if the p-deficiency of G is positive and N is a finitely generated normal subgroup such that the p  -Sylow subgroup of G/N$G/N$ is infinite and p divides the order of N   then we have _cdp(G)=2${\mathrm{cd}}_p(G)=2$, _cdp(N)=1${\mathrm{cd}}_p(N)=1$ and _vcdp(G/N)=1${\mathrm{vcd}}_p(G/N)=1$ for the cohomological p-dimensions; moreover either the p  -Sylow subgroup of G/N$G/N$ is virtually cyclic or the p-Sylow subgroup of N is cyclic. If G is a profinite Poincaré duality group of dimension 3 at a prime p   (PD³${\mathit{PD}}^3$-group at p) we show that for N and p as above either N   is PD¹${\mathit{PD}}^1$ at p   and G/N$G/N$ is virtually PD²${\mathit{PD}}^2$ at p or N   is PD²${\mathit{PD}}^2$ at p   and G/N$G/N$ is virtually PD¹${\mathit{PD}}^1$ at p.     

Regularity of the solutions to the liquid crystal equations with small rough data

In [30], the author has proved the existence of Koch–Tataru [12] type solution to the incompressible nematic liquid crystal flow with initial data (_u0,_d0)$(u_0,d_0)$ in BMO⁻¹×BMO${\mathit{BMO}}^{-1}\times \mathit{BMO}$. In this paper, we shall present that the solution in [30] has arbitrary spatial regularity. Furthermore, we shall give the decay estimates for any space derivative.     

Description of extended eigenvalues and extended eigenvectors of integration operators on the Wiener algebra

In the present paper we consider the Volterra integration operator V   on the Wiener algebra W(D)$W(\mathbb{D})$ of analytic functions on the unit disc D$\mathbb{D}$ of the complex plane C$\mathbb{C}$. A complex number λ$\lambda$ is called an extended eigenvalue of V if there exists a nonzero operator A   satisfying the equation AV=λVA$\mathit{AV}=\lambda \mathit{VA}$. We prove that the set of all extended eigenvalues of V   is precisely the set C?{0}$\mathbb{C}?\{0\}$, and describe in terms of Duhamel operators and composition operators the set of corresponding extended eigenvectors of V$V$. The similar result for some weighted shift operator on _?p${?}_p$ spaces is also obtained.