A large closed queueing network with autonomous service and bottleneck

Authors:
Vyacheslav M. Abramov
Affiliations:
26/7 Rambam St., Petach Tiqwa 49542, Israel E-mail: vyachesl@inter.net.il
Venue:
Queueing Systems: Theory and Applications
Year:
2000

Citing 1
Cited 3

Discrete flow networks: bottleneck analysis and fluid approximations

Mathematics of Operations Research

Some Results for Large Closed Queueing Networks with and without Bottleneck: Up- and Down-Crossings Approach

Queueing Systems: Theory and Applications
On Existence of Limiting Distribution for Time-Nonhomogeneous Countable Markov Process

Queueing Systems: Theory and Applications
A Large Closed Queueing Network Containing Two Types of Node and Multiple Customer Classes: One Bottleneck Station

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the queue-length process in a closed Jackson-type queueing network with the large number N of homogeneous customers by methods of the theory of martingales and by the up- and down-crossing method. The network considered here consists of a central node (hub), being an infinite-server queueing system with exponentially distributed service times, and k single-server satellite stations (nodes) with generally distributed service times with rates depending on the value N. The service mechanism of these k satellite stations is autonomous, i.e., every satellite server j serves the customers only at random instants that form a strictly stationary and ergodic sequence of random variables. Assuming that the first k-1 satellite stations operate in light usage regime the paper considers the cases where the kth satellite station is a bottleneck node. The approach of the paper is based both on development of the method from the paper by Kogan and Liptser [16], where a Markovian version of this model has been studied, and on development of the up- and down-crossing method.