Approximate analysis of discrete-time tandem queueing networks with customer loss

The departure process of an IBP/Geo/1/K queue by an interrupted Bernoulli process (IBP) is approximated. Several different approximation models are considered, and their accuracy is examined through extensive validation tests. These models are used in a simple decomposition algorithm to analyze a tandem configuration of finite capacity queues with customer loss. Validation tests show that the decomposition algorithm has good accuracy.<
>