scispace - formally typeset
Journal ArticleDOI

The Distribution of Queuing Network States at Input and Output Instants

Kenneth C. Sevcik, +1 more
- 01 Apr 1981 - 
- Vol. 28, Iss: 2, pp 358-371
Reads0
Chats0
TLDR
In this paper, the authors studied the relation between the distribution of the system state embedded at those moments and the steady-state (or random point) distribution, and showed that if a job class belongs to an open subchain, the state distributions at input pomts, output points, and random points are identical, and if the job classes belong to a closed sub chain, the distribution at input and output points ts the same as the steady state distribution of a network with one less job in that subchain.
Abstract
Queuing networks are studied at selected points in the steady state, namely, at the moments when jobs of a given class arrive into a given node (either from the outside or from other nodes) and at the moments when jobs of a given class leave a given node (either for the outside or for other nodes). The processes defined by these points are known to be, in general, non-Potsson, interdependent, and serially correlated; therefore the relation between the distribution of the system state embedded at those moments and the steady-state (or random point) distribution is not obvious a priori. For a large class of networks having product-form equihbrium distribnttons it is shown that (a) if the given job class belongs to an open subchain, the state distributions at input pomts, output points, and random points are identical, and (b) if the job class belongs to a closed subchain, the distribution at input and output points ts the same as the steady-state distribution of a network with one less job in that subchain.

read more

Citations
More filters
Journal ArticleDOI

Flexible manufacturing systems: a review of analytical models

TL;DR: A number of directions in which models require extension are outlined, in particular the representation of such aspects of FMS operation as the tool delivery systems, the blocking phenomenon, the transient behavior and the differences between flexible machining systems and flexible assembly systems.
Journal ArticleDOI

Routing in circuit-switched networks: optimization, shadow prices and decentralization

TL;DR: It is shown that there exist implicit shadow prices associated with each route and with each link of the network, and that the equations defining these prices have a local or decentralized character.
Journal ArticleDOI

Linearizer: a heuristic algorithm for queueing network models of computing systems

TL;DR: A new algorithm is presented for the approximate analysis of closed, product-form queueing networks with single-server and delay (infinite-server) queues that has the accuracy, speed, small memory requirements, and simplicity necessary for inclusion in a general network analysis package.
Journal ArticleDOI

Computer Performance Evaluation Methodology

TL;DR: This survey of the major quantitative methods used in computer performance evaluation, focusing on post-1970 developments and emphasizing trends and challenges, divides the methods into three main areas, namely performance measurement, analytic performance modeling, and simulation performance modeling.
Journal ArticleDOI

Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers

TL;DR: In this paper, the authors consider closed networks of interconnected service centers with multiple types of customers and multiple classes, whose stationary state probabilities at arbitrary times have a product form, where a customer can change its class but not its type as it traverses the network.
References
More filters
Journal ArticleDOI

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

TL;DR: Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper.
Journal ArticleDOI

Mean-Value Analysis of Closed Multichain Queuing Networks

TL;DR: It is shown that mean queue sizes, mean waiting times, and throughputs in closed multiple-chain queuing networks which have product-form solution can be computed recursively without computing product terms and normalization constants.
Journal ArticleDOI

Networks of Waiting Lines

TL;DR: What is perhaps the simplest theoretical question related to this class of problems, and derives expressions for certain steady-state parameters for discrete, statistically varying flows through complex networks.
Journal ArticleDOI

A use of complex probabilities in the theory of stochastic processes

David Cox
TL;DR: In this paper, the authors generalized Erlang's idea of extending to cover all distributions with rational Laplace transforms; this involves the formal use of complex transition probabilities and properties of the method are considered.
Journal ArticleDOI

Closed Queuing Systems with Exponential Servers

TL;DR: It is found that the distribution of customers in the closed queuing system is regulated by the stage or stages with the slowest effective service rate, which means that closed systems are shown to be stochastically equivalent to open systems in which the number of customers cannot exceed N.
Related Papers (5)