具有多类顾客的单服务台流体逼近的收敛速度

本文研究了—个具有多类顾客到达的单服务台排队系统．在流体变换下,我们知道排队模型以概率1在紧集上一致收敛到相应的流体模型．在一致收敛拓扑下,如果到达过程,服务过程在流体变换下以指数速度收敛到相应的流体过程,我们证明了在流体变换下的排队系统中的各个参量以指数速度收敛到流体模型中相应的参量,这些参量包括队长过程,负荷过程,逗留时间过程,离去过程,闲期过程等．     

相依条件下滑动平均过程精确渐近性的一般规律

本文研究了相依条件下滑动平均过程完全收敛的精确渐近性问题. 利用正态分布逼近的方法及相关不等式, 获得了精确渐近性的一般规律, 推广了对数率和重对数率精确渐近性的已有结果.     

扩散过程在Holder范数下的局部 Strassen重对数律

在该文中,作者应用扩散过程在Holder范数下的大偏差得到了扩散过程在Holder范数下的局部Strassen重对数律. 并且还得到了重Ito积分的泛函重对数律.     

相依条件下滑动平均过程精确渐近性的一般规律（英文）

本文研究了相依条件下滑动平均过程完全收敛的精确渐近性问题.利用正态分布逼近的方法及相关不等式,获得了精确渐近性的一般规律,推广了对数率和重对数率精确渐近性的已有结果.     

一类生物复制网络度分布的重对数律

本文研究一类生物复制网络度分布的收敛速度.利用组合和概率论知识,借助于文[6]中的鞅,讨论了度分布的重对数律.     

关于ρ-混合序列对数律的收敛速度

本文研究了ρ-混合序列对数律的收敛速度，在较弱的矩条件下得到了与独立同分布实随机变量类似的结果，并获得了ρ－混合序列满意对数律的一个充分性结果；讨论了ρ－混合序列重对数律的收敛速度的问题，得到了一个重对数律的充分性条件。     

Brown运动在Hlder范数下的拟必然Strassen重对数律的收敛速率

本文研究了Brown运动的泛函极限问题.利用Brown运动在Hlder范数下关于容度的大偏差与小偏差,获得了Brown运动在Hlder范数下的Strassen型重对数律的拟必然收敛速率,推广了文[2]中的结果.     

带有反馈机制的单服务台排队系统的泛函重对数律

本文考虑了一个带有贝努里反馈机制的单服务台排队系统.我们将该系统的一些数量指标如队长过程,忙期过程,负荷过程的泛函重对数律的问题转化为一个反射布朗运动相关的问题,利用已有的布朗运动的重对数率的结果,刻画了队长过程,忙期过程,负荷过程的重对数律.     

随机删失下乘积限过程和累积失效率过程振动模的局部渐近性

在随机删失下研究了乘积限过程和累积失效率过程的振动模的局部性质 .给出了这两个过程的振动模的重对数律 ,并应用这些结果得到了几种核密度估计和Bahadur-Kiefer过程的精确收敛速度     

l~P-系数正则化Shannon采样学习算法收敛速度(英文)

研究l~P-系数正则化意义下Shannon采样学习算法的收敛速度估计问题.借助l~P-空间的凸性不等式给出了样本误差和正则化误差的上界估计,并给出了用K-泛函表示的逼近误差估计.将K-泛函的收敛速度估计转化为平移网络逼近问题,在此基础上给出了用概率表示的学习速度.     

Fluid approximation and its convergence Rate for GI/G/1 queue with vacations

A GI/G/1 queue with vacations is considered in this paper.We develop an approximating technique on max function of independent and identically distributed(i.i.d.) random variables,that is max{ηi,1 ≤ i ≤ n}.The approximating technique is used to obtain the fluid approximation for the queue length,workload and busy time processes.Furthermore,under uniform topology,if the scaled arrival process and the scaled service process converge to the corresponding fluid processes with an exponential rate,we prove by the...     

<Emphasis Type="Italic">V</Emphasis>-uniform ergodicity for state-dependent single class queueing networks

We consider single class queueing networks with state-dependent arrival and service rates. Under the uniform (in state) stability condition, it is shown that the queue length process is V-uniformly ergodic; that is, it has a transition probability kernel which converges to its limit geometrically quickly in the V-norm sense. Among several asymptotic properties of V-uniformly ergodic processes, we present a Strassen-type functional law of the iterated logarithm result.     

Strong approximations for a Kumar-Seidman network under a priority service discipline

In this paper,we derive the strong approximations for a four-class two station multi-class queuing network（Kumar-Seidman network） under a priority service discipline.Within a group,jobs are served in the order of arrival,that is,a first-in-first-out disciple,and among groups,jobs are served under a pre-emptiveresume priority disciple.We show that if the input data（i.e.,the arrival and service processe） satisfy an approximation（such as the functional law-of-iterated logarithm approximation or the strong approximation）,the output data（the departure processes） and the performance measures（such as the queue length,the work load and the sojourn time process） satisfy a similar approximation.     

On the stability of open networks: A unified approach by stochastic dominance

Using stochastic dominance, in this paper we provide a new characterization of point processes. This characterization leads to a unified proof for various stability results of open Jackson networks where service times are i.i.d. with a general distribution, external interarrivai times are i.i.d. with a general distribution and the routing is Bernoulli. We show that if the traffic condition is satisfied, i.e., the input rate is smaller than the service rate at each queue, then the queue length process (the number of customers at each queue) is tight. Under the traffic condition, the pth moment of the queue length process is bounded for allt if the p+lth moment of the service times at all queues are finite. If, furthermore, the moment generating functions of the service times at all queues exist, then all the moments of the queue length process are bounded for allt. When the interarrivai times are unbounded and non-lattice (resp. spreadout), the queue lengths and the remaining service times converge in distribution (resp. in total variation) to a steady state. Also, the moments converge if the corresponding moment conditions are satisfied.     

Heavy traffic limit theorems for a queue with Poisson ON/OFF long-range dependent sources and general service time distribution

In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service times) can be generally distributed. In this paper, we establish heavy traffic limit theorems to provide suitable approximations for the system under first-in first-out (FIFO) and work-conserving service discipline, which state that, when the lengths of both ON- and OFF-periods are lightly tailed, the sequences of the scaled queue length and workload processes converge weakly to short-range dependent reflecting Gaussian processes, and when the lengths of ON- and/or OFF-periods are heavily tailed with infinite variance, the sequences converge weakly to either reflecting fractional Brownian motions (FBMs) or certain type of longrange dependent reflecting Gaussian processes depending on the choice of scaling as the number of superposed sources tends to infinity. Moreover, the sequences exhibit a state space collapse-like property when the number of sources is large enough, which is a kind of extension of the well-known Little??s law for M/M/1 queueing system. Theory to justify the approximations is based on appropriate heavy traffic conditions which essentially mean that the service rate closely approaches the arrival rate when the number of input sources tends to infinity.     

On the fluid approximation for a multiclass queue under non-preemptive SBP service discipline

A multi-class single server queue under non-preemptive static buffer priority (SBP) service discipline is considered in this paper. Using a bounding technique, we obtain the fluid approximation for the queue length and busy time processes. Furthermore, we prove that the convergence rate of the fluid approximation for the queue length and busy time processes is exponential for large N. Additionally, a sufficient condition for stability is obtained.     

Waiting time in a multi-server cutoff-priority gueue, and its application to an urban ambulance service

We consider a priority queue in steady state with N servers, two classes of customers, and a cutoff service discipline. Low priority arrivals are "cut off" (refused immediate service) and placed in a queue whenever N1 or more servers are busy, in order to keep N-N1 servers free for high priority arrivals. A Poisson arrival process for each class, and a common exponential service rate, are assumed. Two models are considered: one where high priority customers queue for service and one where they are lost if all servers are busy at an arrival epoch. Results are obtained for the probability of n servers busy, the expected low priority waiting time, and (in the case where high priority customers do not queue) the complete low priority waiting time distribution. The results are applied to determine the number of ambulances required in an urban fleet which serves both emergency calls and low priority patients transfers.     

The GI/M/1 queue with exponential vacations

In this paper, we give a detailed analysis of the GI/M/1 queue with exhaustive service and multiple exponential vacation. We express the transition matrix of the imbedded Markov chain as a block-Jacobi form and give a matrix-geometric solution. The probability distribution of the queue length at arrival epochs is derived and is shown to decompose into the distribution of the sum of two independent random variables. In addition, we discuss the limiting behavior of the continuous time queue length processes and obtain the probability distributions for the waiting time and the busy period.