A review on queueing network models with finite capacity queues for software architectures performance prediction

  • Authors:

  • Simonetta Balsamo;Vittoria De Nitto Personè;Paola Inverardi

  • Affiliations:

  • Dip. di Informatica, University Ca'Foscari of Venezia, Venice, Italy;Dip. di Informatica, Sistemi e Produzione, University of Roma Tor Vergata, Rome, Italy;Dip. di Informatica, University of L'Aquila, L'Aquila, Italy

  • Venue:
  • Performance Evaluation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A review is carried out on how queueing network models with blocking have been applied so far into the performance evaluation and prediction of Software Architectures (SA). Queueing network models with finite capacity queues and blocking have recently been introduced and applied as more realistic models of systems with finite capacity resources and population constraints. Queueing network models have been often adopted as models for the evaluation of software performance. Starting from our own experience, we observe the need of a more accurate definition of the performance models of SA to capture some features of the communication systems. We consider queueing networks with finite capacity and blocking after service (BAS) to represent some synchronization constraints that cannot be easily modeled with queueing network models with infinite capacity queues. We investigate the use of queueing networks with blocking as performance models of SA with concurrent components and synchronous communication. Queueing theoretic analysis is used to solve the queueing network model and study the synchronous communication and performance of concurrent software components. Our experience is supported by other approaches that also propose the use of queueing networks with blocking. Directions for future research work in the field are included.