Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation behind using a Kronecker structured representation rather than a flat one is to alleviate the storage requirements associated with the MC. With this approach, systems that are an order of magnitude larger can be analyzed on the same platform. The developments in the solution of such MCs are reviewed from an algebraic point of view and possible areas for further research are indicated with an emphasis on preprocessing using reordering, grouping, and lumping and numerical analysis using block iterative, preconditioned projection, multilevel, decompositional, and matrix analytic methods. Case studies from closed queueing networks and stochastic chemical kinetics are provided to motivate decompositional and matrix analytic methods, respectively.

This work considers Kronecker-based models with finite as well as countably infinite state spaces for multidimensional Markovian systems by paying particular attention to those whose reachable state spaces are smaller than their product state spaces. Numerical methods for steady-state and transient analysis of Kronecker-based multidimensional Markovian models are discussed in detail together with implementation issues. Case studies are provided to explain concepts and motivate use of methods. Having grown out of research from the past twenty years, this book expands upon the author’s previously published book Analyzing Markov Chains using Kronecker Products (Springer, 2012). The subject matter is interdisciplinary and at the intersection of applied mathematics and computer science. The book will be of use to researchers and graduate students with an understanding of basic linear algebra, probability, and discrete mathematics.

Matrix-analytic methods (MAM) were introduced by Professor Marcel Neuts and have been applied to a variety of stochastic models since. In order to provide a clear and deep understanding of MAM while showing their power, this book presents MAM concepts and explains the results using a number of worked-out examples. This book’s approach will inform and kindle the interest of researchers attracted to this fertile field. To allow readers to practice and gain experience in the algorithmic and computational procedures of MAM, Introduction to Matrix Analytic Methods in Queues 1 provides a number of computational exercises. It also incorporates simulation as another tool for studying complex stochastic models, especially when the state space of the underlying stochastic models under analytic study grows exponentially. The book’s detailed approach will make it more accessible for readers interested in learning about MAM in stochastic models.

This book constitutes the proceedings of the 13th International Conference on Quantitative Evaluation Systems, QEST 2016, held in Quebec City, Canada, in August 2016. The 21 full papers and 3 tool demonstration papers presented were carefully reviewed and selected from 46 submissions. They are organized in topical sections entitled: Markov processes; tools; sampling, inference, and optimization methods; Markov decision processes and Markovian analysis; networks.

Containing a summary of several recent results on Markov-based input modeling in a coherent notation, this book introduces and compares algorithms for parameter fitting and gives an overview of available software tools in the area. Due to progress made in recent years with respect to new algorithms to generate PH distributions and Markovian arrival processes from measured data, the models outlined are useful alternatives to other distributions or stochastic processes used for input modeling. Graduate students and researchers in applied probability, operations research and computer science along with practitioners using simulation or analytical models for performance analysis and capacity planning will find the unified notation and up-to-date results presented useful. Input modeling is the key step in model based system analysis to adequately describe the load of a system using stochastic models. The goal of input modeling is to find a stochastic model to describe a sequence of measurements from a real system to model for example the inter-arrival times of packets in a computer network or failure times of components in a manufacturing plant. Typical application areas are performance and dependability analysis of computer systems, communication networks, logistics or manufacturing systems but also the analysis of biological or chemical reaction networks and similar problems. Often the measured values have a high variability and are correlated. It’s been known for a long time that Markov based models like phase type distributions or Markovian arrival processes are very general and allow one to capture even complex behaviors. However, the parameterization of these models results often in a complex and non-linear optimization problem. Only recently, several new results about the modeling capabilities of Markov based models and algorithms to fit the parameters of those models have been published.​

This book constitutes the refereed proceedings of the 13th European Workshop on Computer Performance Engineering, EPEW 2016, held in Chios, Greece, in October 2016. The 14 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 25 submissions. The papers presented at the workshop reflect the diversity of modern performance engineering, with topics ranging from the analysis of queueing networks and stochastic processes, to performance analysis of computer systems and networks, and even modeling of human behavior.

This book constitutes the proceedings of the 19th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems, MMB 2018, held in Erlangen, Germany, in February 2018. The 16 full papers, 4 PhD track papers, and 9 tool papers presented in this volume were carefully reviewed and selected from 42 submissions. They are dealing with performance and dependability evaluation techniques for computer and communication systems and its related fields.

This book constitutes the refereed post-conference proceedings of the 25th International Conference on Distributed and Computer and Communication Networks, DCCN 2022, held in Moscow, Russia, in September 26–29, 2022. The 31 revised full papers and 2 revised short papers were carefully reviewed and selected from 130 submissions. The papers cover the following topics: computer and communication networks; analytical modeling of distributed systems; and distributed systems applications.

Modern systems have become increasingly complex to design and build, while the demand for reliability and cost-effective enhancement continues. Robust international competition has further intensified the need for all designers, managers, practitioners, scientists, and engineers to ensure a level of reliability of their products and processes before release at the lowest cost. Developments in Reliability Engineering equips its audience with the necessary information to keep up with the latest original research and state-of-the-art advances in reliability engineering. The volume offers an excursus from historical theories and methods to the present-world practical utility of these concepts with worked-out examples. - Guides readers through reliability topics from an historical perspective to new research results, advancements, and latest developments - Draws on the authors' experience of reliability analysis in a range of industries and disciplines, showing the need for reliability from the product design stage right through to aftercare - Provides methods throughout, making this title a good source of actionable information

Computations with Markov Chains presents the edited and reviewed proceedings of the Second International Workshop on the Numerical Solution of Markov Chains, held January 16--18, 1995, in Raleigh, North Carolina. New developments of particular interest include recent work on stability and conditioning, Krylov subspace-based methods for transient solutions, quadratic convergent procedures for matrix geometric problems, further analysis of the GTH algorithm, the arrival of stochastic automata networks at the forefront of modelling stratagems, and more. An authoritative overview of the field for applied probabilists, numerical analysts and systems modelers, including computer scientists and engineers.