Mean Value Analysis for Blocking Queueing Networks
IEEE Transactions on Software Engineering
Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
Queueing networks with blocking
Queueing networks with blocking
Blocking in a shared resource environment with batched Poisson arrival processes
Performance Evaluation
Blocking probabilities for multiple class batched Poisson arrivals to a shared resource
Performance Evaluation
On the arrival theorem for product form queueing networks with blocking
Performance Evaluation
A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special Issue: performance modeling and evaluation of ATM networks
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
A finite buffer queue with priorities
Performance Evaluation
Product form stationary distributions for queueing networks with blocking and rerouting
Queueing Systems: Theory and Applications
Large Tandem Queueing Networks with Blocking
Queueing Systems: Theory and Applications
A Tandem Queue with Blocking and Markovian Arrival Process
Queueing Systems: Theory and Applications
Decomposition of general queueing networks with MMPP inputs and customer losses
Performance Evaluation
Iterative convergence of passage-time densities in semi-Markov performance models
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Hi-index | 0.01 |
This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are non-exponentially distributed with means sA and sB, respectively. Both nodes have buffers with finite capacities. In this type of network, if the second buffer is full, the accumulation of new tasks by the second node is temporarily suspended (a blocking factor) and tasks must wait on the first node until the transmission process is resumed. All new tasks that find the first buffer full are turned away and are lost (a truncation factor). First, a Markov model of the tandem is investigated. Here, a two-dimensional state graph is constructed and a set of steady-state equations is created. These equations allow calculating state probabilities for each graph state. A special algorithm for transforming the Markov model into a semi-Markov process is presented. This approach allows calculating steady-state probabilities in the semi-Markov model. Next, the algorithms for calculating the main measures of effectiveness in the semi-Markov model are presented. In the numerical part of this paper, the author investigates examples of several semi-Markov models. Finally, the results of calculating both the main measures of effectiveness and quality of service (QoS) parameters are presented.