Markov Chains and Stochastic Stability is part of the Communications and Control
Engineering Series (CCES) edited by Professors BW Dickinson, ED Sontag, M. Thoma, A …

In Part I we developed stability concepts for discrete chains, together with Foster–Lyapunov
criteria for them to hold. Part II was devoted to developing related stability concepts for …

It is now known that the usual traffic condition (the nominal load being less than 1 at each
station) is not sufficient for stability for a multiclass open queueing network. Although there …

Power grids, flexible manufacturing, cellular communications: interconnectedness has
consequences. This remarkable book gives the tools and philosophy you need to build …

General characterizations of geometric convergence for Markov chains in discrete time on a
general state space have been developed recently in considerable detail. Here we develop …

Traditionally, manufacturing systems have mainly been treated as either job shops or flow
shops. In job shops, parts may arrive with random routes, with each route having a low …

The approach we employ in this chapter to study the stability of queueing networks employs
fluid limits and fluid models. Fluid models were discussed briefly in Section 1.3; we will …

The subject of this paper is open multiclass queueing networks, which are common models
of communication networks, and complex manufacturing systems such as wafer fabrication …

In this paper we consider ψ-irreducible Markov processes evolving in discrete or continuous
time on a general state space. We develop a Liapounov function criterion that permits one to …

A method for evaluating the performance of packet switching communication networks under
a fixed, session-based, routing strategy is proposed. The approach is based on properly …