常微分方程形式的M/M/1排队模型的一个注

讨论动态Ｍ／Ｍ／１排队模型，运用半群理论证明了该模型存在唯一的正解，并研究了相应算子的谱特征．     

M／G／1排队系统算子生成正压缩C0-半群的不可约性

M／G／1排队系统已有大量文献研究．通过增补变量法，该系统可由一组积分微分方程描述，并且系统算子在L^1空间中生成正的压缩C0-半群．文中将进一步讨论该半群的性质，证明该半群是不可约的．     

半群的子半群上的同余扩张(英)

设ρ是个群S上的一个同余．如果S／ρ是矩形带,则称ρ是矩形带同余。本文刻画了半群上的最小矩形带同余．设T是半群S的子半群,本文给出了T上每个矩形带同余能扩张成S上矩形带同余的充分必要条件。     

具有可利用服务员的M/G/1排队模型

本文考虑了具有可利用服务员的M／G／1有有限容量的排队模型．当工作量超过k(k是常数或者随机变量),可利用服务员参与工作,一直到工作量少于或等于k．可利用服务员的速率依赖于目前工作量．应用Level-crossing方法,获得了工作量的平稳分布．应用Kolmogorov向后微分方程方法,构造更新方程以获得忙期的Laplace变换．     

C0-半群理论在动态M／C／1排队系统中的应用

考察了动态M／G／1排队系统问题．利用泛函分析中的C0-半群理论给出了系统非负解的存在唯一性．     

E*-酉范畴逆半群的结构

本文通过定义本原逆半群在集合上的部分作用及其整体化,给出了E*-酉范畴逆半群的结构．     

U-纯正半群

型彬半群是正则半群类中纯正半群的一个自然推广．这类半群最先由E1-Qallali和Fountain研究．本文定义了U-纯正半群．这类半群是纯正半群和型W半群二者在U-半富足半群类中的一个共同推广．首先我们确定了U-纯正半群上包含在关系HU中的最小允许同余．借此,证明了半群S为U-纯正半群,当且仅当S可以表示为一个Hall半群和一个V—ample半群的织积．这一结果不仅推广了关于纯正半群结构的著名Hall—Yamada定理,而且推广了E1-Qallali和Fountain建立的型W半群的结构定理．     

部分服务台同步单重休假的M/M/c排队系统

本文研究只允许一部分服务台进入休假状态的M／M／c排队系统，在同步单重休假策略下，给出了稳态指标分布，证明了已知服务台全忙条件下的随机分解结果．     

纯整Ehresmann半群的若干刻划

本文介绍纯整Ehresmann半群．纯整Ehresmann半群是一类特殊的U-半富足半群，我们给出了这类半群的若干刻划，并讨论了一些特殊的纯整Ehresmann半群．     

二机系统调度在一类线性摄动下具有鲁棒性的一个充要条件

用实数集R上一个含幺Abelian半群的性质研究了n／2／F／Cmax调度在一类线性摄动下具有鲁棒性的条件．由最优鲁棒调动的定义,证明了标称系统的最优鲁棒调度与标称系统的越-韩最优调度是等价的．     

Asymptotic behavior of the loss probability for an M/G/1/N queue with vacations

In this paper, asymptotic properties of the loss probability are considered for an M/G/1/N queue with server vacations and exhaustive service discipline, denoted by an M/G/1/N-(V, E)-queue. Exact asymptotic rates of the loss probability are obtained for the cases in which the traffic intensity is smaller than, equal to and greater than one, respectively. When the vacation time is zero, the model considered degenerates to the standard M/G/1/N queue. For this standard queueing model, our analysis provides new or extended asymptotic results for the loss probability. In terms of the duality relationship between the M/G/1/N and GI/M/1/N queues, we also provide asymptotic properties for the standard GI/M/1/N model.     

GI／G／1单重休假随机服务系统的马氏骨架方法

文献[1]引入一类具有广泛应用前景的随机过程-Markov骨架过程。借助Markov骨架过程的方法研究GI/G/1单重休假服务系统队长，及t时刻到达顾客等待时间的瞬时概率分布。     

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.     

M/G/1重试排队系统的渐近稳定性

用算子半群理论研究了带有重试排队的M/G/1系统.通过解算子方程和预解方程,证明了0是系统算子的本征值,且为虚轴上唯一的谱点.从而得出了当时间趋于无穷时系统时间依赖解收敛于稳态解的结论.     

关于M/M/n排队模型的动态解及稳定性

文章讨论动态 M/M/n排队模型 ,运用算子半群理论证明了该模型动态正解的存在唯一性 .并进一步表明零点是系统的一个本征值 ,相应的本征函数为系统的一个定态正解 ,系统的动态正解强稳定到定态解     

Age-based Markovian approximation of the G/M/1 queue

We extend the approach of Koole et al. (2012) [15] and Legros et al. (2018) [20] for the G/M/1 queue. The idea is to provide a Markovian approximation where a state represents the oldest customer's wait. This modeling is made possible by creating states with negative wait, representing an estimate of the time at which a new customer would arrive when the system is empty. We apply this method for performance evaluation and routing optimization. Finally, we further extend the model to the G/M/1+G queue.     

AnM/M/c queue with impatient customers

This paper considers theM/M/c queue in which a customer leaves when its service has not begun within a fixed interval after its arrival. The loss probability can be expressed in a simple formula involving the waiting time probabilities in the standardM/M/c queue. The purpose of this paper is to give a probabilistic derivation of this formula and to outline a possible use of this general formula in theM/M/c retrial queue with impatient customers. This research was supported by the INTAS 96-0828 research project and was presented at the First International Workshop on Retrial Queues, Universidad Complutense de Madrid, Madrid, September 22–24, 1998.     

M/MGk,B/1算子的预解集

本文证明了M/Gk,B/1算子的预解集含于除原点外的虚轴.     

M/M/1算子的特征值及其应用(英文)

讨论 Ｍ／Ｍ／１算子的谱特征,证明０是 Ｍ／Ｍ／１算子的几何重数为 １的特征值,并且对应的特征向量是正的,作为应用给出了排队论中四个指标：系统中顾客的平均逗留时间,顾客的平均等待时间,顾客总数及等待的顾客总数的计算方法．     

Busy period analysis of the state dependent M/M/1/K queue

In this paper, we study the transient behavior of a state dependent M/M/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. For two special cases called the threshold policy and the static policy we determine simple expressions for their joint transform.