具有非抢占优先站点的轮询系统顾客队长

本文讨论轮询系统在系统平稳条件下,对于具有一个非抢占的优先权站点且采用穷尽服务方式下的轮询系统进行理论分析,给出服务员轮询到每个站点时该站点的队长及数学期望。     

批到达离散时间轮询系统中顾客等待时间及队长

本对批到达离散时间轮询系统进行研究,在门限服务原则下,推出了原客等待时间和轮询周期的概率母函数,利用Markov链理论,得出了队列队长均值。     

排队系统平稳等待时间的性质

讨论了M/G/1排队系统平稳等待时间的随机序关系及利用Mathematica 4.0软件探讨了爱尔朗排队系统Er/M/1（r≤6）的平稳等待时间的分布。     

GI／G／1排队系统的队长和等待时间的瞬时分布

本是[1，2]的继续,在本中利用马氏骨架过程给出了GI／G／1排队系统的队长的瞬时分布的另一新的计算方法和等待时间的计算方法。     

多重休假GI／G／1排队系统的非统计平衡理论

文献[1]引入了一类具有广泛应用前景的随机过程-Markov骨架过程，文献[2]研究了GI/G/1排队系统，本文对其进行了拓展，研究了多重休假GI/G/1排队模型。求出了此模型的到达过程，等待时间及队长的概率分布。     

M/M/C休假排队系统-综述

本文介绍了带有各种休假策略的Ｍ／Ｍ／Ｃ休假排队的研究方法及结果,在所有服务台全的条件下,我们证明了系统的稳态队长和稳态等待时间可分解成两个独立随机变量和和,其中一个随机变量愉是相应的经典Ｍ／Ｍ／Ｃ排队的稳态队长与稳态等待时间。     

多服务台非强占优先排队系统的弱收敛定理

多服务台非强占优先排队系统的弱收敛定理汪荣鑫，龙卫江（西安交通大学数学系，西安７１００４９）ＷＥＡＫＣＯＮＶＥＲＧＥＮＣＥＴＨＥＯＲＥＭＳＦＯＲＭＵＬＴＩＳＥＲＶＥＲＱＵＥＵＥＩＮＧＳＹＳＴＥＭＩＮＮＯＮＰＲＥＥＭＰＴＩＶＥＰＲＩＯＲＩＴＹＤＩＳＣＩ...     

服务中断的带优先反馈排队系统弱极限定理

利用了概率论中的弱极限定理,研究了服务中断的带优先反馈排队系统弱极限定理,得到了队长,虚等待时间及逗留时间的弱极限定理.     

具有负顾客到达的M/G/1可修排队系统

本文考虑一个具有负顾客到达的M／G／1可修捧队系统．所有顾客(包括正顾客和负顾客)的到达都是泊松过程,服务器是可修的．Harrison和Pitel研究过具有负顾客到达的M／G／1捧队系统．这里我们推广到有可修服务器情形,系统的稳态解最后可以通过Fredholm积分方程解出．     

在修后逐出规则下服务台可修的离散时间Geometric/G/1排队系统

本文讨论在实行修后逐出规则下服务台可修的离散时间Ｇｅｏｍｅｔｒｉｃ／Ｇ／１系统和忙期第一顾客受特殊接待的单重休假系统，给出了两系统的各种稳态指标，针对第一个系统，给出了部分可靠性指标．     

Waiting Time Variability in some Single-Server Queueing Systems

This paper considers the range of values of the coefficient of variation of waiting time in some general single-server queueing systems. It is shown that in M/G/1 systems with given ρ, the square of this coefficient increases linearly with m₁m₃/m²₂, where m_i is the ith moment of the service distribution. This implies always a lower bound, and for some widely used distributions an upper bound as well. A few ranges are illustrated and compared to those implied in two GI/M/1 systems. The usefulness of knowing such ranges for modelling purposes is explained.     

Waiting Time in a Two Station Series Queueing System: The Effect of Dependent Interarrival Times

An analysis taking into account the dependencies in the departure process from the first station of the M/E _k /1→./M/1 system is conducted. Arrivals to the second station are approximated as a general independent distribution, and the waiting times in this station are compared to those found through computer simulation.     

Queueing Models with Multiple Waiting Lines

This paper discusses analytic solution methods for queueing models with multiple waiting lines. The methods are briefly illustrated, using key models like the 2×2 switch, the shortest queue and the cyclic polling system.     

The Virtual Waiting Time for the Batch Arrival Queueing Systems

Abstract

In the article the G ^η I/G/1-type batch arrival system with infinite waiting-room is considered. The explicit formulae for the distribution of the virtual waiting time at any fixed moment t and as t → ∞ are obtained. The study is based on generalization of Korolyuk's method for semi-markov random walks.     

Virtual Waiting Time in a System with Markov-Modulated Input

Mathematical Notes -     

On the Analysis of the Virtual Waiting Time in Open Queueing Networks

The model of an open queueing network in heavy traffic has been developed. These models are mathematical models of computer networks in heavy traffic. A limit theorem has been presented for the virtual waiting time of a customer in heavy traffic in open queueing networks. Finally, we present an application of the theorem—a reliability model from computer network practice.     

Markovian Controllable Queueing Systems with Hysteretic Policies: Busy Period and Waiting Time Analysis

We study Markovian queueing systems in which the service rate varies whenever the queue length changes. More specifically we consider controllable queues operating under the so-called hysteretic policy which provides a rather versatile class of operating rules for increasing and decreasing service rate at the arrival and service completion times. The objective of this paper is to investigate algorithmically the busy period and the waiting time distributions. Our analysis supplements the classical work of Yadin and Naor (1967) who focused on the steady-state probabilities of the system state. AMS 2000 Subject Classification 60K25, 90B22     

有一般服务运作和休假时间的排队系统

考虑一个有一般服务运作和休假时间的M／M／1排队系统。这时服务是非空竭的,也就是说服务员可能在系统有顾客的情形下进入休假,服务员的运作时间和休假时间都为一般分布,且相互独立,使用补充变量的方法,求解出系统稳态队长的母函数,在求解过程中遇到的未知函数po(x),可利用第一类Fredholm积分方程的数值解来确定,最后给出了系统稳态平均队长。