共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we extend the work of Chen and Zhang [12] and establish a new sufficient condition for the existence of the (conventional) diffusion approximation for multiclass queueing networks under priority service disciplines. This sufficient condition relates to the weak stability of the fluid networks and the stability of the high priority classes of the fluid networks that correspond to the queueing networks under consideration. Using this sufficient condition, we prove the existence of the diffusion approximation for the last-buffer-first-served reentrant lines. We also study a three-station network example, and observe that the diffusion approximation may not exist, even if the proposed limiting semimartingale reflected Brownian motion (SRBM) exists. 相似文献
2.
The diffusion approximation is proved for a class of queueing networks, known as re-entrant lines, under a first-buffer-first-served (FBFS) service discipline. The diffusion limit for the workload process is a semi-martingale reflecting Brownian motion on a nonnegative orthant. This approximation has recently been used by Dai, Yeh and Zhou [21] in estimating the performance measures of the re-entrant lines with a FBFS discipline.Supported in part by a grant from NSERC (Canada).Supported in part by a grant from NSERC (Canada); the research was done while the author was visiting the Faculty of Commerce and Business Administration, UBC, Canada. 相似文献
3.
Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse 总被引:3,自引:0,他引:3
Certain diffusion processes known as semimartingale reflecting Brownian motions (SRBMs) have been shown to approximate many
single class and some multiclass open queueing networks under conditions of heavy traffic. While it is known that not all
multiclass networks with feedback can be approximated in heavy traffic by SRBMs, one of the outstanding challenges in contemporary
research on queueing networks is to identify broad categories of networks that can be so approximated and to prove a heavy
traffic limit theorem justifying the approximation. In this paper, general sufficient conditions are given under which a heavy
traffic limit theorem holds for open multiclass queueing networks with head-of-the-line (HL) service disciplines, which, in
particular, require that service within each class is on a first-in-first-out (FIFO) basis. The two main conditions that need
to be verified are that (a) the reflection matrix for the SRBM is well defined and completely- S, and (b) a form of state space collapse holds. A result of Dai and Harrison shows that condition (a) holds for FIFO networks
of Kelly type and their proof is extended here to cover networks with the HLPPS (head-of-the-line proportional processor sharing)
service discipline. In a companion work, Bramson shows that a multiplicative form of state space collapse holds for these
two families of networks. These results, when combined with the main theorem of this paper, yield new heavy traffic limit
theorems for FIFO networks of Kelly type and networks with the HLPPS service discipline.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
4.
We present two multiclass queueing networks where the Brownian models proposed by Harrison and Nguyen [3,4] do not exist. If self-feedback is allowed, we can construct such an example with a two-station network. For a three-station network, we can construct such an example without self-feedback.Research supported in part by Texas Instruments Corporation Grant 90456-034. 相似文献
5.
证明一个满负荷交通极限定理以证实在抢占型优先服务机制下多类排队网络的扩散逼近,进而为该系统提供有效的随机动力学模型.所研究的排队网络典型地出现在现代通讯系统中高速集成服务分组数据网络,其中包含分组数据包的若干交通类型,每个类型涉及若干工作处理类(步骤),并且属于同一交通类型的工作在可能接受服务的每一个网站被赋予相同的优先权等级,更进一步地,在整个网络中,属于不同交通类型的分组数据包之间无交互路由. 相似文献
6.
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. 相似文献
7.
This paper is concerned with Brownian system models that arise as heavy traffic approximations for open queueing networks. The focus is on model formulation, and more specifically, on the formulation of Brownian models for networks with complex routing. We survey the current state of knowledge in this dynamic area of research, including important open problems. Brownian approximations culminate in estimates of complete distributions; we present numerical examples for which complete sojourn time distributions are estimated, and those estimates are compared against simulation. 相似文献
8.
A heavy traffic limit theorem for a class of open queueing networks with finite buffers 总被引:3,自引:0,他引:3
We consider a queueing network of d single server stations. Each station has a finite capacity waiting buffer, and all customers served at a station are homogeneous
in terms of service requirements and routing. The routing is assumed to be deterministic and hence feedforward. A server stops
working when the downstream buffer is full. We show that a properly normalized d-dimensional queue length process converges in distribution to a fd-dimensional semimartingale reflecting Brownian motion (RBM) in a d-dimensional box under a heavy traffic condition. The conventional continuous mapping approach does not apply here because
the solution to our Skorohod problem may not be unique. Our proof relies heavily on a uniform oscillation result for solutions
to a family of Skorohod problems. The oscillation result is proved in a general form that may be of independent interest.
It has the potential to be used as an important ingredient in establishing heavy traffic limit theorems for general finite
buffer networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
Consider an open network of single-server stations, each with a first-in-first-out discipline. The network may be populated
by various customer types, each with its own routing and service requirements. Routing may be either deterministic or stochastic,
and the interarrival and service time distributions may be arbitrary. In this paper a general method for steady-state performance
analysis is described and illustrated. This analytical method, called QNET, uses both first and second moment information,
and it is motivated by heavy traffic theory. However, our numerical examples show that QNET compares favorably with W. Whitt's
Queueing Network Analyzer (QNA) and with other approximation schemes, even under conditions of light or moderate loading.
In the QNET method one first replaces the original queueing network by what we call an approximating Brownian system model,
and then one computes the stationary distribution of the Brownian model. The second step amounts to solving a certain highly
structured partial differential equation problem; a promising general approach to the numerical solution of that PDE problem
is described by Harrison and Dai [8] in a companion paper. Thus far the numerical solution technique has been implemented
only for two-station networks, and it is clear that the computational burden will grow rapidly as the number of stations increases.
Thus we also describe and investigate a cruder approach to two-moment network analysis, called ΠNET, which is based on a product
form approximation, or decomposition approximation, to the stationary distribution of the Brownian system model.
In very broad terms, ΠNET is comparable to QNA in its level of sophistication, whereas QNET captures more subtle system interactions.
In our numerical examples the performance of ΠNET and QNA is similar; the performance of QNET is generally better, sometimes
much better. 相似文献
10.
Jian Kui Yang 《数学学报(英文版)》2011,27(12):2481-2492
This paper studies a multitype re-entrant line under smaller-buffer-first-served policy, which is an extension of first-buffer-first-served
re-entrant line. We prove a heavy traffic limit theorem. The key to the proof is to prove the uniform convergence of the corresponding
critical fluid model. 相似文献
11.
本文是在高负荷下非强占优先排除网络系统中给出了队长过程的扩散逼近 .证明了其队长过程的扩散极限是半鞅反射的布朗运动 . 相似文献
12.
高负荷下带重尾服务强占优先排队的扩散逼近 总被引:2,自引:0,他引:2
刘建民 《纯粹数学与应用数学》2010,26(4):559-566
考虑的排队系统是单服务台,顾客的初始到来是依泊松过程来到服务台,顾客的服务时间是重尾分布,服务的原则是强占优先服务.在高负荷条件下对此模型进行研究,获得了系统中的负荷过程,离去过程和队长过程的扩散逼近. 相似文献
13.
A sequence of shortest queueing systems is considered in this paper. We give weak convergence theorems for the queue length and waiting time processes when the sequence of traffic intensities associated with the sequence of shortest queueing systems approaches the critical value (=1) at appropriate rates.Research supported by the National Natural Science Foundation of China. 相似文献
14.
This paper studies the queue-length process in a closed Jackson-type queueing network with the large number N of homogeneous customers by methods of the theory of martingales and by the up- and down-crossing method. The network considered
here consists of a central node (hub), being an infinite-server queueing system with exponentially distributed service times,
and k single-server satellite stations (nodes) with generally distributed service times with rates depending on the value N. The service mechanism of these k satellite stations is autonomous, i.e., every satellite server j serves the customers only at random instants that form a strictly stationary and ergodic sequence of random variables. Assuming
that the first k-1 satellite stations operate in light usage regime the paper considers the cases where the kth satellite station is a bottleneck node. The approach of the paper is based both on development of the method from the paper
by Kogan and Liptser [16], where a Markovian version of this model has been studied, and on development of the up- and down-crossing
method.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
15.
本文研究了一类重入型网络在优先服务原则下的扩散近似,运用随机分析方法,证明了标准化队长过程的C-紧性.在优先服务原则下,给出了这类网络的标准化队长过程扩散近似存在的充分条件. 相似文献
16.
Yong Jiang Guo 《数学学报(英文版)》2012,28(2):379-404
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. 相似文献
17.
For a re-entrant line operating under the last-buffer-first-serve service policy, there have been two independent proofs of a heavy traffic limit theorem. The key to these proofs is to prove the uniform convergence of a critical fluid model. We give a new proof for the uniform convergence of the fluid model. 相似文献
18.
This paper proposes an algorithm, referred to as BNAfm (Brownian network analyzer with finite element method), for computing the stationary distribution of a semimartingale reflecting Brownian motion (SRBM) in a hypercube. The SRBM serves as an approximate model of queueing networks with finite buffers. Our BNAfm algorithm is based on the finite element method and an extension of a generic algorithm developed by Dai and Harrison [14]. It uses piecewise polynomials to form an approximate subspace of an infinite-dimensional functional space. The BNAfm algorithm is shown to produce good estimates for stationary probabilities, in addition to stationary moments. This is in contrast to the BNAsm algorithm (Brownian network analyzer with spectral method) of Dai and Harrison [14], which uses global polynomials to form the approximate subspace and which sometimes fails to produce meaningful estimates of these stationary probabilities. Extensive computational experiences from our implementation are reported, which may be useful for future numerical research on SRBMs. A three-station tandem network with finite buffers is presented to illustrate the effectiveness of the Brownian approximation model and our BNAfm algorithm. 相似文献
19.
In [15], a BNAfm (Brownian network analyzer with finite element method) algorithm was developed for computing the stationary distribution of a semimartingale reflecting Brownian motion (SRBM) in a hypercube. In this companion paper, that BNAfm algorithm is extended to computing the stationary distribution of an SRBM in an orthant, which is achieved by constructing a converging sequence of SRBMs in hypercubes. The SRBM in the orthant serves as an approximation model of queueing networks with infinite buffers. We show that the constructed sequence of SRBMs in the hypercubes converges weakly to the SRBM in the orthant as the hypercubes approach the orthant. Under the conjecture that the set of the stationary distributions of the SRBMs in the hypercubes is relatively compact, we prove that the sequence of the stationary distributions of the SRBMs in the hypercubes converges weakly to the stationary distribution of the SRBM in the orthant. A three-machine job shop example is presented to illustrate the effectiveness of the SRBM approximation model and our BNAfm algorithm. The BNAfm algorithm is shown to produce good estimates for stationary probabilities of queueing networks. 相似文献
20.
Tomonari Suzuki 《Proceedings of the American Mathematical Society》2008,136(11):4089-4093
If is a complete metric space and is a contraction mapping, then the conclusion of the Banach-Caccioppoli contraction principle is that the sequence of successive approximations of starting from any point of the space converges to a unique fixed point. In this paper, we obtain a sufficient and necessary condition of the above conclusion in terms of the so-called strong Leader mappings.