The Palm theory and the Loynes theory of stationary systems are the two pillars of the modern approach to queuing. This book, presenting the mathematical foundations of the theory of stationaryqueuing systems, contains a thorough treatment of both of these.

This approach helps to clarify the picture, in that it separates the task of obtaining the key system formulas from that of proving convergence to a stationary state and computing its law.

The theory is constantly illustrated by classical results and models: Pollaczek-Khintchin and Tacacs formulas, Jackson and Gordon-Newell networks, multiserver queues, blocking queues, loss systems etc., but it also contains recent and significant examples, where the tools developed turn out to be indispensable.

Several other mathematical tools which are useful within this approach are also presented, such as the martingale calculus for point processes, or stochastic ordering for stationary recurrences.

This thoroughly revised second edition contains substantial additions - in particular, exercises and their solutions - rendering this now classic reference suitable for use as a textbook.

It is widely recognized that the complexity of parallel and distributed systems is such that proper tools must be employed during their design stage in order to achieve the quantitative goals for which they are intended. This volume collects recent research results obtained within the Basic Research Action Qmips, which bears on the quantitative analysis of parallel and distributed architectures. Part 1 is devoted to research on the usage of general formalisms stemming from theoretical computer science in quantitative performance modeling of parallel systems. It contains research papers on process algebras, on Petri nets, and on queueing networks. The contributions in Part 2 are concerned with solution techniques. This part is expected to allow the reader to identify among the general formalisms of Part I, those that are amenable to an efficient mathematical treatment in the perspective of quantitative information. The common theme of Part 3 is the application of the analytical results of Part 2 to the performance evaluation and optimization of parallel and distributed systems. Part 1. Stochastic Process Algebras are used by N. Gotz, H. Hermanns, U. Herzog, V. Mertsiotakis and M. Rettelbach as a novel approach for the struc tured design and analysis of both the functional behaviour and performability (i.e performance and dependability) characteristics of parallel and distributed systems. This is achieved by integrating stochastic modeling and analysis into the powerful and well investigated formal description techniques of process algebras."

This fundamental exposition of queueing theory, written by leading researchers, answers the need for a mathematically sound reference work on the subject and has become the standard reference. The thoroughly revised second edition contains a substantial number of exercises and their solutions, which makes the book suitable as a textbook.

This volume discusses wireless network modeling and performance analysis with the aim of showing how stochastic geometry can be used in a more or less systematic way to analyze the phenomena that arise in this context. The book first focuses on medium access control mechanisms used in ad hoc networks and in cellular networks. It then discusses the use of stochastic geometry for the quantitative analysis of routing algorithms in mobile ad hoc networks. The appendix also contains a concise summary of wireless communication principles and of the network architectures considered in the two volumes.

Stochastic Geometry and Wireless Networks, Part II: Applications focuses on wireless network modeling and performance analysis. The aim is to show how stochastic geometry can be used in a more or less systematic way to analyze the phenomena that arise in this context. It first focuses on medium access control mechanisms used in ad hoc networks and in cellular networks. It then discusses the use of stochastic geometry for the quantitative analysis of routing algorithms in mobile ad hoc networks. The appendix also contains a concise summary of wireless communication principles and of the network architectures considered in this and the previous volume entitled Stochastic Geometry and Wireless Networks, Part I: Theory.