Approximate analysis for the merge configuration of an open queueing network with blocking

Approximate analysis for the merge configuration of an open queueing network with blocking

0.00 Avg rating0 Votes
Article ID: iaor1989347
Country: United States
Volume: 21
Issue: 2
Start Page Number: 122
End Page Number: 129
Publication Date: Jun 1989
Journal: IIE Transactions
Authors: ,
Keywords: stochastic processes, networks
Abstract:

A merge configuration of open queueing networks with exponential service times and finite buffers is analysed. We offer an iterative algorithm to approximate the steady-state probabilities for each queue of the system. The procedure decomposes the queueing network into individual queues and analyses each individual queue in isolation. An M/M/1/N or M/G/1/N model is used for the analysis of the merging queues; an M/M/1/N with state dependent arrival rates is used for the receiving queue. The approximation method is easy to implement, requires little memory, is computationally fast and yields very accurate results.

Reviews

Required fields are marked *. Your email address will not be published.