带两类服务的一般休假M/GI/1型系统的随机分解

借助于建立在平稳点过程和Palm分布理论基础上的强度保守原理,讨论了一个具有一般休假策略的M/GI/1型排队系统.该模型允许闲期中顾客非泊松到达且顾客的服务可以被休假中断。我们得到了稳态下工作量和顾客离去前所见队长的随机分解.     

相型同步启动时间的M／M／c排队系统

本文研究带有同步启动时间的Ｍ／Ｍ／ｃ系统，其中启动时间是相型变量，给出了稳态和等待时间分布等结果。     

L^2-策略休假下可修的M_1+M_2/G^x(M/G)/1匹配排队系统分析

双输人匹配排队系统是通常排队系统的一种推广．本文对该系统考察了Ｌ２－策略休假和服务台可修的两个重要因素．其中假定系统有两个不同的Ｐｏｉｓｓｏｎ输入，两类顾客按１：１作成一批进行服务，服务台的寿命服从指数分布，服务时间，修理时间和休假时间都服从一般连续型分布，利用向量马氏过程方法，得到了该排队系统的一些重要的稳态排队论指标和可靠性指标．     

THE TRANSIENT SOLUTION FOR M/G/1 QUEUEWITH SERVER VACATIONS

1IntroductionDuringrecentseveraldecadesqueueingmodelswitllservervacationshavebeenstudiedin'anumberofpapers(seethecitedreferences).Inthesepaperstwoofthemostremarkableresultsconcernsthestochasticdecompositionpropertiesofqueuelengthandwaitingtimeatarandompointinequilibrium.Butthetransientpropertyoftilequeuelengthforanyqueueingsystemwithservervacationsisnotdiscussedyet.InthispaperwefirstlystlldytheproblemforM/G/1queuewithservervacations.Andthequeueingmodelsconsideredarethefollowing.Model1Conside…     

单重指数休假的 GI/M/1排队系统

近二十年,许多工作研究各种休假机制的排队系统.这里,休假(vacation)可解释为服务设备的损坏、维修、保养,亦可解释为从事其它辅助性工作.由于在系统设计与控制中表现出极大的灵活性,休假排队模型已在计算机系统、通讯网络及生产管理中得到重要应用.迄今,休假排队研究主要集中于各种服务和休假规则的 M/G/1模型的分解性质:将     

THE M/M/c QUEUE WITH PH SYNCHRONOUS VACATIONS

In this paper, we give a detailed analysis of the M/M/c queue with Phase Type synchronous vacations. Two models are considered. Firstly, the vacation strategy is a multiple synchronous vacation. Secondly, only a single vacation is taken each time. For model 1, we give the distributions of the stable queue length and the waiting time. Finally,it is shown that model 2 may be analyzed similarly to model 1.     

A NEW APPROACH FOR THE STUDY OF THE M X /G/1 QUEUE USING RENEWAL ARGUMENTS

The M ^X /G/1 queueing system as well as several of its variants have long ago been studied by considering the embedded discrete-time Markov chain at service completion epochs. Alternatively other approaches have been proposed such as the theory of regenerative processes, the supplementary variable method, properties of the busy period, etc. In this note we study the M ^X /G/1 queue via a simple new method that uses renewal arguments. This approach seems quite powerful and may become fruitful in the investigation of other queueing systems as well.     

VIRTUAL WAITING TIMES IN PRIORITY-M/G/1 QUEUES WITH VACARIONS

ＶＩＲＴＵＡＬＷＡＩＴＩＮＧＴＩＭＥＳＩＮＰＲＩＯＲＩＴＹ－Ｍ／Ｇ／１ＱＵＥＵＥＳＷＩＴＨＶＡＣＡＲＩＯＮＳＣＯＮＧ，ＴＡＮＧＤＡＣ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＵｎｉｖｅｒｓｉｔｙｏｆＡｍｓｔｅｒｄａｍ，ＰｌａｎｔａｇｅＭｕｉｄ...     

MULTIPLE SOLUTIONS OF SOME ELLIPTIC SYSTEMS WITH LINEAR COUPLINGS

In this paper,we study the existence of nontrivial solutions to the elliptic system{-Δu =λv + Fu(x,u,v),x ∈ Ω,-Δv=λu+Fv(x,u,v),x ∈ Ω,u =v =0,x ∈ (e)Ω,where Ω (C...     

服务台休假的GI/Geom/1离散时间排队

本文研究了具有位相型休假、位相型启动和单重几何休假的离散时间排队,假定 顾客到达间隔服从一般分布,服务时间服从几何分布,运用矩阵解析方法我们得到了这 些排队系统中顾客在到达时刻稳态队长分布及其随机分解.     

SOME NEW DISCRETE INEQUALITIES OF OPIAL WITH TWO SEQUENCES

In this paper, we establish some new discrete inequalities of Opial-type with two sequences by making use of some classical inequalities. These results contain as special cases improvements of results given in the literature, and these improvements are new even in the important discrete case.     

与两个更新过程有关的某些联合分布

本文讨论的两个时偶问题涉及来一个泊松过程与一个更新过程穿越时间和更新数的联合分布．利用向量马氏过程方法得到了这些联合分布的变换，给出了一个与分布均值有关量的数值结果．     

M/G/1/MLPS compared to M/G/1/PS

Multilevel processor sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the processor sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing.     

ANALYSIS OF M/G/1 STOCHASTIC CLEARING SYSTEMS

In this paper, we consider M/G/1 queuing systems governed by a stochastic clearing mechanism, called “disaster,” which removes all workload in the system whenever it occurs to the system. The clearing mechanism of disasters can be applied to computer systems in the presence of a virus as a clearing operation of all stored messages present in the system. We present the system size distribution and the sojourn time distribution.     

带负顾客和非空竭服务随机休假的M~([x])/G/1可修排队系统

研究了带负顾客和非空竭服务随机休假的M~([X])/G/1可修排队系统.负顾客不仅仅移除一个正在接受服务的正顾客,而且还使得服务器损坏而立即进行修理.通过构造一个具有吸收态的马尔可夫链求得了系统稳态存在的充分必要条件.利用补充变量法求得了系统的排队指标和可靠性指标.最后我们还给出了一个数值实例.     

TWO MEROMORPHIC FUNCTIONS SHARE SOME PAIRS OF SMALL FUNCTIONS WITH TRUNCATED MULTIPLICITIES

Using the techniques proposed in [3], we prove that two nonconstant meromorphic functions f and g on C must be linked by a quasi-Mbius transformation if they share some pairs of small functions with more precise truncated multiplicities, which improve and extend the results of Duc Quang Si.     

两类分数阶微分方程的边值问题

本文研究了两类非线性项含有未知函数导数的分数阶微分方程的边值问题.利用分数阶微积分的性质及Banach不动点定理,获得了解的存在唯一性等有关结果,推广了已有文献的结论.     

M/G/1排队系统的性能灵敏度分析

非Markov型排除系统经常被用来作为某些实际工程问题（如通讯网络）的研究模型,对于一般的M／G／1排队系统,本文通过研究其嵌入Markov链,讨论了系统的稳态性能灵敏度分析问题,并给出用嵌入Markov链的势能表示的稳态性能灵敏度公式,由于嵌入Markov链要比描述其系统状态的半Markov过程简单得多,故本文的结果对M／G／1排队系统的性能灵敏度仿真计算及系统的优化,都将带来极大的方便。     

带负顾客启动期N策略的Geom/Geom/1工作休假排队

将带RCH抵消策略的负顾客、启动期和N策略引入离散时间排队.休假策略为空竭服务多重工作休假.负顾客一对一抵消队首正在接受服务的正顾客,若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.利用拟生灭过程和矩阵几何解方法,给出了稳态队长分布及其随机分解.通过数值例子表现了启动率和负顾客到达率对稳态队长的影响.     

The age of the arrival process in the G/M/1 and M/G/1 queues

This paper shows that in the G/M/1 queueing model, conditioning on a busy server, the age of the inter-arrival time and the number of customers in the queue are independent. The same is the case when the age is replaced by the residual inter-arrival time or by its total value. Explicit expressions for the conditional density functions, as well as some stochastic orders, in all three cases are given. Moreover, we show that this independence property, which we prove by elementary arguments, also leads to an alternative proof for the fact that given a busy server, the number of customers in the queue follows a geometric distribution. We conclude with a derivation for the Laplace Stieltjes Transform (LST) of the age of the inter-arrival time in the M/G/1 queue.