Date of Award


Document Type


Degree Name

Doctor of Philosophy (PhD)

First Advisor

Ian F. Akyildiz


The area of classical (product form) queueing networks is briefly discussed. The principal results for classical queueing networks are summarized. The transfer, service and rejection blocking policies are defined, and their use in queueing network models are presented. An overview of the literature in the area of queueing networks with blocking is given, and the relations between the three blocking policies is discussed in general. Duality theorems for open and closed queueing networks with rejection blocking and a single job class are proved. Using a duality theorem, an exact solution is found for closed blocking networks which contain so many jobs that if one station is empty all other stations are full. Algorithms to compute performance measures, in particular throughputs, follow from the way the solution is obtained. It is then proved that for open, mixed and closed networks with rejection blocking, multiple job classes, general service time distributions and reversible routing the equilibrium state probabilities have product form. The reversed process for these networks is examined, and it is proved that it represents a network of the same type. Formulas for throughputs are derived, and algorithms to compute performance measures are outlined. Finally, closed central server models with state-dependent routing, multiple job classes and rejection blocking are investigated. The equilibrium state probabilities have a modified product form, and the reversed process is a network of the same type. Formulas for performance measures are derived for this model and algorithms to compute them are outlined.