Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

Siegmund Duality for Continuous Time Markov Chains on ℤ<Stack><Subscript>+</Subscript><Superscript>d</Superscript></Stack>

For the continuous time Markov chain with transition function P(t) on Z₊^d, we give the necessary and sufficient conditions for the existence of its Siegmund dual with transition function P(t). If Q, the q-matrix of P(t), is uniformly bounded, we show that the Siegmund dual relation can be expressed directly in terms of q-matrices, and a sufficient condition under which the Q-function is the Siegmund dual of some Q-function is also given.     

Monotonicity in high‐order curvilinear finite element arbitrary Lagrangian–Eulerian remap

The remap phase in arbitrary Lagrangian–Eulerian (ALE) hydrodynamics involves the transfer of field quantities defined on a post‐Lagrangian mesh to some new mesh, usually generated by a mesh optimization algorithm. This problem is often posed in terms of transporting (or advecting) some state variable from the old mesh to the new mesh over a fictitious time interval. It is imperative that this remap process be monotonic, that is, not generate any new extrema in the field variables. It is well known that the only linear methods that are guaranteed to be monotonic for such problems are first‐order accurate; however, much work has been performed in developing non‐linear methods, which blend both high and low (first) order solutions to achieve monotonicity and preserve high‐order accuracy when the field is sufficiently smooth. In this paper, we present a set of methods for enforcing monotonicity targeting high‐order discontinuous Galerkin methods for advection equations in the context of high‐order curvilinear ALE hydrodynamics. Published 2014. This article is a U.S. Government work and is in the public domain in the USA.     

GRADIENT ESTIMATES AND ENTROPY FORMULAE FOR WEIGHTED p-HEAT EQUATIONS ON SMOOTH METRIC MEASURE SPACES

Let （M,g, e^-fdv） be a smooth metric measure space. In this paper, we con- sider two nonlinear weighted p-heat equations. Firstly, we derive a Li-Yau type gradient estimates for the positive solutions to the following nonlinear weighted p-heat equationand f is a smooth function on M under the assumptionthat the m-dimensional nonnegative Bakry-Emery Ricci curvature. Secondly, we show an entropy monotonicity formula with nonnegative m-dimensional Bakry-Emery Ricci curva- ture which is a generalization to the results of Kotschwar and Ni [9], Li [7].     

与 Cauchy 微分中值定理相关的几个问题

根据Cauchy微分中值定理表达式的结构引入辅助函数 F（x ,c）＝ f （x）- f （c）g（x）- g（c）（a＜ c＜ b）,通过讨论其可导性,得到相关的几个不等式,由此得出Cauchy微分中值定理存在唯一“中值点”的一个条件,并给出其逆定理的一个较弱表述。     

Inequalities for the Gaussian hypergeometric function

we study the monotonicity of certain combinations of the Gaussian hypergeometric functions F(-1/2,1/2;1;1- xc) and F(-1/2- δ,1/2 + δ;1;1- xd) on(0,1) for given 0 c 5d/6 ∞ andδ∈(-1/2,1/2),and find the largest value δ1 = δ1(c,d) such that inequality F(-1/2,1/2;1;1- xc) F(-1/2- δ,1/2 + δ;1;1- xd) holds for all x ∈(0,1). Besides,we also consider the Gaussian hypergeometric functions F(a- 1- δ,1- a + δ;1;1- x3) and F(a- 1,1- a;1;1- x2) for given a ∈ [1/29,1) and δ∈(a- 1,a),and obtain the analogous results.