Some results for large closed queueing networks with and without bottleneck: Up- and down-crossings approach

Some results for large closed queueing networks with and without bottleneck: Up- and down-crossings approach

0.00 Avg rating0 Votes
Article ID: iaor2004840
Country: Netherlands
Volume: 38
Issue: 2
Start Page Number: 149
End Page Number: 184
Publication Date: Jun 2001
Journal: Queueing Systems
Authors:
Keywords: networks: path
Abstract:

The paper provides the up- and down-crossing method to study the asymptotic behavior of queue-length and waiting time in closed Jackson-type queueing networks. These queueing networks consist of central node (hub) and k single-server satellite stations. The case of infinite server hub with exponentially distributed service times is considered in the first section to demonstrate the up- and down-crossing approach to such kind of problems and help to give readers the main idea of the method. The main results of the paper are related to the case of single-server hub with generally distributed service times depending on queue-length. Assuming that the first k − 1 satellite nodes operate in light usage regime, we consider three cases concerning the kth satellite node. They are the light usage regime and limiting cases for the moderate usage regime and heavy usage regime. The results related to light usage regime show that, as the number of customers in network increases to infinity, the network is decomposed to independent single-server queueing systems. In the limiting cases of moderate usage regime, the diffusion approximations of queue-length and waiting time processes are obtained. In the case of heavy usage regime it is shown that the joint limiting non-stationary queue-lengths distribution at the first k − 1 satellite nodes is represented in the product form and coincides with the product of stationary GI/M/1 queue-length distributions with parameters depending on time.

Reviews

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