The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The Journal of the Operational Research Society
A unified view of product-form approximation techniques for general closed queuing networks. Perform Eval 18: 205—224. Brandwajn A (1985). ... A product-form approximation method for general closed queuing networks with several classes of customers. Perform Eval 24: 165-188. Cox DR (1955). ...
This paper is an attempt to cast in a unified framework several approximation techniques based on equivalence (aggregation) and decompositon that have been applied for the solution of queueing networks ... decomposable or possesses a product-form solution. ... As an example, consider the problem of finding a product-form queueing network model in which the marginal queue distributions of each station is identical to that of a given arbitrary general closed queueing ...doi:10.1016/0166-5316(85)90011-2 fatcat:qervuhub2rcsnobojxoctgmeci
A unified view of product-form approximation techniques for general closed queuing networks. Perform Eval 18: 205—224. Brandwajn A (1985). ... .° It provides a unified view of different approximation techniques based on the use of a product-form solution, namely the aggregation technique’*'* and Marie’s method ...doi:10.1057/palgrave.jors.2600885 fatcat:vikcltfbsbhjrm2rfiksq5auay
The Journal of the Operational Research Society
A unified view of product-form approximation techniques for general closed queueing networks. Perf Eval 18: 205-224. Baynat B and Dallery Y (2000). ... An approximation method for general closed queueing networks with fork/join mechanisms. J Opl Res Soc 51: 198-208. ) Kant K (1992). Introduction to Computer System Performance Evaluation. ...
Journal of Aircraft
., “A Unified View of Product-Form Approx- imation Techniques for General Closed Queueing Networks,” Performance Evaluation, Vol. 18, No. 3, 1993, pp. 205-224. 4Bruell, S. ... ., “The Influence of Service Time Variability in a Closed Network of Queues,” Performance Evaluation, Vol. 6, No. 3, 1986, pp. 219-234. '7Dallery, Y., “Approximate Analysis of General Open Queueing Net ...doi:10.2514/2.2870 fatcat:kblkvlmbubdyfmi6p4kb3zjmam
In this paper, we develop a unified framework for approximating open and closed queueing networks under any general blocking protocol by extending and generalizing the approximation algorithm for open ... The unified framework presents a highly useful set of tools of analysis for queueing-system designers to use in evaluating the performance under numerous design alternatives. ... We are also indebted to Sid Jagabandhu for his help with modeling some of the blocking systems. ...doi:10.1287/ijoc.12.4.299.11878 fatcat:k26ioodjinfslkiw6oliwswexq
This paper proposes an interpolation-matching framework that allows a unified view of approximate solution techniques for closed product-form queuing networks. ... Depending upon the interpolating functional form and the matching populations selected, a large versatile family of new approximations can be generated. ... The authors would like to thank Francesco Schiavoni for his contribution to this work and the reviewers for their helpful comments. ...doi:10.1109/tc.2002.1146708 fatcat:klh4vcbobjaefcxxuceent7ga4
The purpose of this paper is to provide a bibliography of material concerned with modeling of production and transfer lines using queueing networks. ... This, it is hoped, will be of use to researchers of queueing networks and also manufacturing system designers. A number of suggestions are also given for further research. ... Into this category fall the papers Neuts A number of closed-form results have been developed for two-station production lines. ...doi:10.1016/0377-2217(95)00378-9 fatcat:uvpoa2iiunbt3brs3sk4wdoojq
The results derived in this arti- cle can be used as a starting point for studying more general forms of product form networks. ... Previous to much of this research, Koenigsberg [ 1958] showed that cyclic networks of queues had product form solutions, and Jackson  established this fact for a larger class of networks. ...doi:10.1145/158439.158906 fatcat:he2aaygf7bepzlydqau2wsmuoe
Purpose The use of queueing network models was stimulated by the appearance (1975) of the exact product form solution of a class of open, closed and mixed queueing networks obeying the local balance principle ... Findings Numerical experiments show the extent to which a decomposition-based approximation, under fixed or state-dependent arrival rates, may be suitable for the approximate analysis of the queueing network ... More recently, (Jia and Heragu, 2009) have provided a unifying view of previous approaches for population constrained subnetworks under external Poisson arrivals, renamed as semiopen networks. ...doi:10.1108/mabr-09-2019-0035 fatcat:nzgm7mvhtjebhl3m43ny7fwdva
To set the stage for additional progress in its development, we present a retrospective of associated theory, techniques, and applications resulting from work in this area over the past decade and a half ... Dependability (according to current use of this term; see [6, 59] , for example) is that property of a system which allows "reliance to be justifiably placed on the the service it delivers." ... Tantawi  developed a closed-form solution of Fr(y). ...doi:10.1016/0166-5316(92)90002-x fatcat:hpz3rav4sjh65m74q4vh4erajm
In this paper we propose an iterative methodology that relies only on the capability of observing the queue lengths at all network stations for a given resource capacity allocation. ... We develop a general framework for determining the optimal resource capacity for each station comprising a stochastic network, motivated by applications arising in computer capacity planning and business ... In view of Lemma 2, a wide variety of generic techniques are available to study (OPT-BTN). ...doi:10.1287/opre.2016.1554 fatcat:c65kqhibpbhs7lygmhq525gs7q
A unified treatment of buffer storage overflow problems will be discussed as an application example, in which-we call attention to the analogy between buffer behavior and waiting time in the GI/G/l queue ... First we review basic properties of exponential queueing systems, and then give an overview of recent progress made in the areas of queueing network models and discrete-time queueing systems. ... Kobayashi ,  considered the multidimensional diffusion approximation as a technique for treating the general queueing network. ...doi:10.1109/tcom.1977.1093702 fatcat:x5d4cqpkjndtpi2fx2tr2ylvqi
As a performance index to measure the deviation of the closedloop system from an equilibrium point, we use a linear quadratic (LQ) cost of the transients of state and control variables such as queue length ... This backs up the conjecture in the networking literature that the AQM RED is not enough to control TCP dynamic behavior, where RED can be classified as a P-type AQM (or as an output feedback control for ... ACKNOWLEDGMENT The author would like to thank the California Institute of Technology and the Institut National de Recherche en Informatique et en Automatique-Ecole Normale Superieure (INRIA-ENS) for their ...doi:10.1109/tac.2006.878749 fatcat:4cvhj2ihgbflnbuqvrv3zgqf44
The challenge addressed in this paper is to represent a physical network of resources with a queuing model. Each resource is modeled as a server and waiting activities are in a queue. ... From an operational point of view, this pipeline works like a process of activities, and these activities are distributed. So, the term "chain" could be replaced by the term "network"  . ... Closed-form solutions have been derived for the response time distributions through a particular path in open product-form queuing networks in  . ...doi:10.1016/j.apm.2009.10.019 fatcat:i7qg5fxt4jcbveuqwj3q6asowm
« Previous Showing results 1 — 15 out of 6,442 results