Bounding the performance of tandem queues with finite buffer spaces

We consider a queueing system with three single servers in tandem with two intermediate buffer storages of finite capacity. The processing times are exponentially distributed and the first server has unlimited number of customers in front of it. Using a negative dependence property between the number of customers at the first and second buffer storages we show that a popular form of decomposition approach applied to this model, indeed, provides a lower bound for its performance. The approach used here to establish the bound is new and could be extended to establish bounds for other types of tandem queues with finite buffer spaces.