Proceedings Article10.1109/ROBOT.1986.1087512
An approximation method for feedforward queueing networks with finite buffers a manufacturing perspective
C. Buyukkoc
- 01 Apr 1986
- Vol. 3, pp 965-972
6
TL;DR: This work considers various queueing medels that can be used as building blocks in the approximate amlysis of some feed forward queueing networks and obtains approximatiom for average queue lengths at each queue and the stability condition for the network.
read more
Abstract: Queueing networks in wich the stations have finite buffers are found in models of complicated communications and manufacturing systems where an exact analysis is often formidable. We consider various queueing medels that can be used as building blocks in the approximate amlysis of some feed forward queueing networks. The basic model is a tandem configuration of queues with finite buffers in between. The arrivals to the first queue are a Poisson stream and the service times at the queues are expoentially distributed. There are finite buffers in between the queues and hence a blocking mechanism has to be enforced. We obtain approximatiom for average queue lengths at each queue and the stability condition for the network, We then consider severed extenions. Numerical examples comparing the approximate solutions to those obtained via simulation and exact methods show that the approximation is good for a broad range of parameters.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Relaxations for the numerical solutions of some stochastic problems
Debasis Mitra,P. Tsoucas +1 more
- 01 Jan 1988
TL;DR: In this paper, the authors studied the systematic design of efficient Jacobi and Gauss-Seidel relaxations, and their over-relaxed variants, for the computation of the stationary distributions of continuous-time Markov processes.
26
A power aware system level interconnect design methodology for latency-insensitive systems
Vikas Chandra,Herman Schmit,A. Xu,L. Pileggi +3 more
- 07 Nov 2004
TL;DR: This approach is the first to consider and simultaneously optimize the channel clock frequency, voltage and the FIFO sizes to minimize the power consumption and it is shown that this approach finds solutions which are close to optimal.
8
Performance analysis modeling for manufacturing systems
TL;DR: In this article, the basic concepts of performance analysis modeling and its application to the design, engineering, and operation of manufacturing systems are presented, and a particularly versatile tool for performance analysis, the Performance Analysis Workstation, is discussed.
8
Realization of Efficient High Throughput Buffering Policies for Network on Chip Router
Liyaqat Nazir,Roohie Naaz Mir +1 more
TL;DR: In this paper, the performance of elastic buffer (EB) flow control is evaluated with a test microarchitecture router for several packet injection rates given at an input port and the evaluation of various forms of the elastic buffers for throughput, FPGA resource utilization, average power consumed, and the maximum speed offered.
Modelling manufacturing systems: A birth-death approach
Berta Buttarazzi,Antonio Ficola +1 more
TL;DR: An approximation method for modelling a manufacturing system as a queueing network, where each queue is limited in size, and interarrival and processing times are exponentially distributed, and an approximation method to reduce the dimension of the model is developed.
References
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.
An Approximation Method for Open Restricted Queueing Networks
TL;DR: It is found that this method provides a fairly good approximation procedure for obtaining system performance measures such as blocking probabilities, output rates, etc., in open restricted queueing networks.
139
Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
Guy Latouche,Marcel F. Neuts +1 more
TL;DR: Stable queuing systems consisting of two groups of servers, having exponential service times, placed in tandem and separated by a finite buffer, are shown to have a steady-state probability vector of matrix-geometric form.
118
Visual Simulation: The Performance Analysis Workstation
TL;DR: Low-cost, high-powered intelligent terminals and workstations equipped with high-resolution displays have recently made practical anew approach to simulation modeling-visual simulation, and this projected AT&T Performance Analysis Workstation combines visual and interactive features in a novel way.
113
Approximate analysis of arbitrary configurations of open queueing networks with blocking
Tayfur Altiok,Harry G. Perros +1 more
TL;DR: An algorithm for analyzing approximately open exponential queueing networks with blocking is presented and approximate results obtained were compared against exact numerical data, and they seem to have an acceptable error level.
83