排序方式: 共有16条查询结果,搜索用时 312 毫秒
1.
Richard F. Serfozo 《Queueing Systems》1989,5(1-3):5-36
A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367. 相似文献
2.
Richard F. Serfozo 《Stochastic Processes and their Applications》1985,20(2):281-294
This study shows that when a point process is partitioned into certain uniformly sparse subprocesses, then the subprocesses are asymptotically multivariate Poisson or compound Poisson. Bounds are given for the total-variation distance between the subprocesses and their limits. Several partitioning rules are considered including independent, Markovian, and batch assignments of points. 相似文献
3.
This is a study of thinnings of point processes and random measures on the real line that satisfy a weak law of large numbers. The thinning procedures have dependencies based on the order of the points or masses being thinned such that the thinned process is a composition of two random measures. It is shown that the thinned process (normalized by a certain function) converges in distribution if and only if the thinning process does. This result is used to characterize the convergence of thinned processes to infinitely divisible processes, such as a compound Poisson process, when the thinning is independent and nonhomogeneous, stationary, Markovian, or regenerative. Thinning by a sequence of independent identically distributed operations is also discussed. The results here contain Renyi's classical thinning theorem and many of its extensions. 相似文献
4.
Richard F. Serfozo 《Stochastic Processes and their Applications》1974,2(3):295-301
Limit theorems for large deviations of renewal processes are presented. One result is for a terminating renewal process with small probability of terminating. These theorems are analogous to the classical Cramer and Feller large deviation theorems for sums of independent random variables. 相似文献
5.
6.
7.
We consider queueing, fluid and inventory processes whose dynamics are determined by general point processes or random measures that represent inputs and outputs. The state of such a process (the queue length or inventory level) is regulated to stay in a finite or infinite interval – inputs or outputs are disregarded when they would lead to a state outside the interval. The sample paths of the process satisfy an integral equation; the paths have finite local variation and may have discontinuities. We establish the existence and uniqueness of the process based on a Skorohod equation. This leads to an explicit expression for the process on the doubly-infinite time axis. The expression is especially tractable when the process is stationary with stationary input–output measures. This representation is an extension of the classical Loynes representation of stationary waiting times in single-server queues with stationary inputs and services. We also describe several properties of stationary processes: Palm probabilities of the processes at jump times, Little laws for waiting times in the system, finiteness of moments and extensions to tandem and treelike networks. 相似文献
8.
This study concerns the equilibrium behavior of a general class of Markov network processes that includes a variety of queueing
networks and networks with interacting components or populations. The focus is on determining when these processes have product
form stationary distributions. The approach is to relate the marginal distributions of the process to the stationary distributions
of “node transition functions” that represent the nodes in isolation operating under certain fictitious environments. The
main result gives necessary and sufficient conditions on the node transition functions for the network process to have a product
form stationary distribution. This result yields a procedure for checking for a product form distribution and obtaining such
a distribution when it exits. An important subclass of networks are those in which the node transition rates have Poisson
arrival components. In this setting, we show that the network process has a product form distribution and is “biased locally
balanced” if and only if the network is “quasi-reversible” and certain traffic equations are satisfied. Another subclass of
networks are those with reversible routing. We weaken the known sufficient condition for such networks to be product form.
We also discuss modeling issues related to queueing networks including time reversals and reversals of the roles of arrivals
and departures. The study ends by describing how the results extend to networks with multi-class transitions.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
10.
Richard F. Serfozo 《Queueing Systems》1987,2(1):83-92
We study a multi-administration telecommunications network that is an abstraction of an international network. The nodes represent separate telecommunications administrations that are linked such that alternately-routed calls go through one tandem administration. The cost of the group of circuits between a pair of administrations is borne by them; and when a call between the pair is alternately routed through the tandem node, then the two administrations share the call revenue and pay transit fees to the tandem administration. The numbers of circuits between the administrations are selected to yield a least-cost network that provides a desired level of service, in terms of blocking probabilities, over an entire day. We address the problem of determining transit charges for the alternately-routed calls that are equitable for all of the administrations. Our approach is to derive such charges by equating the system-optimal circuit group sizes to certain hypothetical administration-optimal circuit group sizes. This approach may be of use in other system design problems involving cost sharing among several companies.This research was supported in part by Grant AFOSR 84-0367. 相似文献