Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation

Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation 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.

[1]  Antonis Economou,et al.  Product form stationary distributions for queueing networks with blocking and rerouting , 1998, Queueing Syst. Theory Appl..

[2]  Armin Heindl,et al.  Decomposition of general queueing networks with MMPP inputs and customer losses , 2003, Perform. Evaluation.

[3]  Simonetta Balsamo,et al.  A survey of product form queueing networks with blocking and their equivalences , 1994, Ann. Oper. Res..

[4]  Richard J. Boucherie,et al.  On the Arrival Theorem for Product Form Queueing Networks With Blocking , 1997, Perform. Evaluation.

[5]  Walenty Oniszczuk.  Tandem Models with Blocking in the Computer Subnetworks Performance Analysis , 2006, Biometrics, Computer Security Systems and Artificial Intelligence Applications.

[6]  Demetres D. Kouvatsos,et al.  Maximum entropy two-station cyclic queues with multiple general servers , 2004, Acta Informatica.

[7]  Sridhar Ramesh,et al.  A two‐level queueing network model with blocking and non‐blocking messages , 2000, Ann. Oper. Res..

[8]  Simonetta Balsamo,et al.  Analysis of Queueing Networks with Blocking , 2010 .

[9]  Ian F. Akyildiz,et al.  On the Exact and Approximate Throughput Analysis of Closed Queueing Networks with Blocking , 1988, IEEE Trans. Software Eng..

[10]  Jürgen Becker,et al.  Analysis of queueing networks with blocking using a new aggregation technique , 1998, Ann. Oper. Res..

[11]  A. Badrah.  Performance evaluation of multistage interconnection networks with blocking--discrete and continuous time Markov models , 2002 .

[12]  M. Claudia Clò.  MVA for product-form cyclic queueing networks with blocking , 1998, Ann. Oper. Res..

[13]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[14]  Stanley B. Gershwin,et al.  Throughput estimation in cyclic queueing networks with blocking , 1998, Ann. Oper. Res..

[15]  Matteo Sereno.  Mean Value Analysis of Product Form Solution Queueing Networks with Repetitive Service Blocking , 1999, Perform. Evaluation.

[16]  Li Zhuang,et al.  Approximate mean value performance analysis of cyclic queueing networks with production blocking , 1994, Queueing Syst. Theory Appl..

[17]  J. S. Kaufman,et al.  Blocking in a Shared Resource Environment with Batched Poisson Arrival Processes , 1996, Perform. Evaluation.

[18]  Jeremy T. Bradley,et al.  Iterative convergence of passage-time densities in semi-Markov performance models , 2005, Perform. Evaluation.

[19]  Paola Inverardi,et al.  A review on queueing network models with finite capacity queues for software architectures performance prediction , 2003, Perform. Evaluation.

[20]  Harry G. Perros.  Queueing Networks with Blocking: Exact and Approximate Solutions , 1994 .

[21]  Vinod Sharma,et al.  A finite buffer queue with priorities , 2002, Perform. Evaluation.

[22]  Antonio Gómez-Corral,et al.  A Tandem Queue with Blocking and Markovian Arrival Process , 2002, Queueing Syst. Theory Appl..

[23]  Ian F. Akyildiz,et al.  Mean Value Analysis for Blocking Queueing Networks , 1988, IEEE Trans. Software Eng..

[24]  Jeremy T. Bradley,et al.  A Matrix-based Method for Analysing Stochastic Process Algebras , 2000, ICALP Satellite Workshops.

[25]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[26]  Harry G. Perros.  Queueing networks with blocking , 1994 .

[27]  Irfan-Ullah Awan,et al.  A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks , 2000, Comput. Networks.

[28]  Paul J. Kühn.  Performance of ARQ-protocols for HDX-transmission in hierarchical polling systems , 1981, Perform. Evaluation.

[29]  John A. Morrison,et al.  Blocking Probabilities for Multiple Class Batched Poisson Arrivals to a Shared Resource , 1996, Perform. Evaluation.

[30]  Vladimir V. Korolyuk,et al.  Stochastic Models of Systems , 1999 .

[31]  Li Zhuang,et al.  Acceptance Instant Distributions in Product-Form Closed Queueing Networks with Blocking , 1996, Perform. Evaluation.

[32]  James B. Martin.  Large Tandem Queueing Networks with Blocking , 2002, Queueing Syst. Theory Appl..

[33]  Yves Dallery,et al.  Performance Evaluation of Closed Tandem Queueing Networks with Finite Buffers , 1996, Perform. Evaluation.