Overview

Excerpt from On the Convergence of Multiclass Queueing Networks in Heavy Traffic In his pioneering paper on queueing networks, Jackson [22] assumed that customers visiting or occupying any given station are essentially indistinguishable from one another, and that a customer completing service at station i will move next to station j with some fixed probability n, independent of all previous history. Thus in Jackson's networks, each station serves a single customer class, hence these networks have been called single-class networks. Jackson's model was extended by Baskett ci al. [1] and Kelly [24] to networks populated by multiple types of customers, each type following a deterministic route. The routing mechanism described in this paper subsumes those considered in [1, Readers are referred to Harrison [14] and Harrison and Nguyen [15, 16] for further discussion. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Full Product Details

9781334017919

Table of Contents

Reviews

Author Information

Tab Content 6

Countries Available