Simonetta Balsamo – författare

Queueing network models have been widely applied as a powerful tool for modelling, performance evaluation, and prediction of discrete flow systems, such as computer systems, communication networks, production lines, and manufacturing systems. Queueing network models with finite capacity queues and blocking have been introduced and applied as even more realistic models of systems with finite capacity resources and with population constraints. In recent years, research in this field has grown rapidly. Analysis of Queueing Networks with Blocking introduces queueing network models with finite capacity and various types of blocking mechanisms. It gives a comprehensive definition of the analytical model underlying these blocking queueing networks. It surveys exact and approximate analytical solution methods and algorithms and their relevant properties. It also presents various application examples of queueing networks to model computer systems and communication networks. This book is organized in three parts. Part I introduces queueing networks with blocking and various application examples. Part II deals with exact and approximate analysis of queueing networks with blocking and the condition under which the various techniques can be applied. Part III presents a review of various properties of networks with blocking, describing several equivalence properties both between networks with and without blocking and between different blocking types. Approximate solution methods for the buffer allocation problem are presented.

Queueing network models have been widely applied as a powerful tool for modelling, performance evaluation, and prediction of discrete flow systems, such as computer systems, communication networks, production lines, and manufacturing systems. Queueing network models with finite capacity queues and blocking have been introduced and applied as even more realistic models of systems with finite capacity resources and with population constraints. In recent years, research in this field has grown rapidly. Analysis of Queueing Networks with Blocking introduces queueing network models with finite capacity and various types of blocking mechanisms. It gives a comprehensive definition of the analytical model underlying these blocking queueing networks. It surveys exact and approximate analytical solution methods and algorithms and their relevant properties. It also presents various application examples of queueing networks to model computer systems and communication networks. This book is organized in three parts. Part I introduces queueing networks with blocking and various application examples. Part II deals with exact and approximate analysis of queueing networks with blocking and the condition under which the various techniques can be applied. Part III presents a review of various properties of networks with blocking, describing several equivalence properties both between networks with and without blocking and between different blocking types. Approximate solution methods for the buffer allocation problem are presented.

Queueing network models have been widely applied as a powerful tool for modelling, performance evaluation, and prediction of discrete flow systems, such as computer systems, communication networks, production lines, and manufacturing systems. Queueing network models with finite capacity queues and blocking have been introduced and applied as even more realistic models of systems with finite capacity resources and with population constraints. In recent years, research in this field has grown rapidly. Analysis of Queueing Networks with Blocking introduces queueing network models with finite capacity and various types of blocking mechanisms. It gives a comprehensive definition of the analytical model underlying these blocking queueing networks. It surveys exact and approximate analytical solution methods and algorithms and their relevant properties. It also presents various application examples of queueing networks to model computer systems and communication networks. This book is organized in three parts. Part I introduces queueing networks with blocking and various application examples. Part II deals with exact and approximate analysis of queueing networks with blocking and the condition under which the various techniques can be applied. Part III presents a review of various properties of networks with blocking, describing several equivalence properties both between networks with and without blocking and between different blocking types. Approximate solution methods for the buffer allocation problem are presented.

This book constitutes the refereed proceedings of the 7th Workshop on New Frontiers in Quantitative Methods in Informatics, InfQ 2017, held in Venice, Italy, in December 2017.The 11 revised full papers and the one revised short paper presented were carefully reviewed and selected from 22 submissions. The papers are organized in topical sections on networking and mobile applications; applications of quantitative modeling; big data processing and IoT; theory, methods and tools for quantitative analysis.

This book constitutes the refereed proceedings of the 7th Workshop on New Frontiers in Quantitative Methods in Informatics, InfQ 2017, held in Venice, Italy, in December 2017.The 11 revised full papers and the one revised short paper presented were carefully reviewed and selected from 22 submissions. The papers are organized in topical sections on networking and mobile applications; applications of quantitative modeling; big data processing and IoT; theory, methods and tools for quantitative analysis.

This volume contains the papers from the workshop “Radical Innovations of Software and Systems Engineering in the Future.” This workshop was the ninth in the series of Monterey Software Engineering workshops for formulating and advancing software engineering models and techniques, with the fundamental theme of increasing the practical impact of formal methods. During the last decade object orientation was the driving factor for new system solutions in many areas ranging from e-commerce to embedded systems. New modeling languages such as UML and new programming languages such as Java and CASE tools have considerably in?uenced the system development techniques of today and will remain key techniques for the near future. However, actual practice shows many de?ciencies of these new approaches: – there is no proof and no evidence that software productivity has increased with the new methods; – UML has no clean scienti?c foundations, which inhibits the construction of powerful analysis and development tools; – support for mobile distributed system development is missing; – formanyapplications,object-orienteddesignisnotsuitedtoproducingclean well-structured code, as many applications show.

This volume contains the papers from the workshop “Radical Innovations of Software and Systems Engineering in the Future.” This workshop was the ninth in the series of Monterey Software Engineering workshops for formulating and advancing software engineering models and techniques, with the fundamental theme of increasing the practical impact of formal methods. During the last decade object orientation was the driving factor for new system solutions in many areas ranging from e-commerce to embedded systems. New modeling languages such as UML and new programming languages such as Java and CASE tools have considerably in?uenced the system development techniques of today and will remain key techniques for the near future. However, actual practice shows many de?ciencies of these new approaches: – there is no proof and no evidence that software productivity has increased with the new methods; – UML has no clean scienti?c foundations, which inhibits the construction of powerful analysis and development tools; – support for mobile distributed system development is missing; – formanyapplications,object-orienteddesignisnotsuitedtoproducingclean well-structured code, as many applications show.

This book constitutes the refereed proceedings of the 18th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2011, held in Venice, Italyin June 2011.The 24 revised full papers presented were carefully reviewed and selected from many submissions.The papers are organized in topical sections on queueing theory, software and computer systems, statistics and inference, telecommunication networks, and performance and performability.