The seminal paper on this class of queueing networks, published by Baskett, Chandy, Muntz and Palacios in 1975, is probably the most referenced paper in the performance evaluation literature. We present the BCMP result in Section , and then we discuss a number of computational algorithms in Section . It is important to note that we do not strive for completeness in this chapter; we merely selected a few computational algorithms to show their similarity to the algorithms discussed so far and to comment on their computational complexity. . | Performance of Computer Communication Systems A Model-Based Approach. Boudewijn R. Haverkort Copyright 1998 John Wiley Sons Ltd ISBNs 0-471-97228-2 Hardback 0-470-84192-3 Electronic Chapter 13 BCMP queueing networks IN this chapter we present a number of results for a yet richer class of mixed open and closed queueing networks the so-called BCMP queueing networks. The seminal paper on this class of queueing networks published by Baskett Chandy Muntz and Palacios in 1975 is probably the most referenced paper in the performance evaluation literature. We present the BCMP result in Section and then we discuss a number of computational algorithms in Section . It is important to note that we do not strive for completeness in this chapter we merely selected a few computational algorithms to show their similarity to the algorithms discussed so far and to comment on their computational complexity. Queueing network class and solution The best-known class of mixed open and closed queueing networks with product-form solution has been published by Baskett Chandy Muntz and Palacios in 1975 14 . We first present this class of queueing models in Section after which we discuss the steady-state probability distribution of customers in Section . Model class A BCMP queueing network consists of M queueing stations or nodes . Customers belong to one of R classes. For each class routing probabilities through the network must be specified. A class can either be open or closed and jobs are allowed to change classes when changing from queue to queue. The queueing stations can be of 4 types 1. In FCFS nodes jobs are served in a first come first served fashion. Although FCFS nodes may be visited by jobs of multiple classes the service time distributions 294 13 BCMP queueing networks of all classes need to be the same and must be negative exponential albeit possibly load-dependent. This latter option can be used to model multiple server stations or FESCs. 2. .
