Tandem queues with subexponential service times and finite buffers (Q600897)

The authors study tandem queues with subexponential service times and finite waiting room between stations. They derive (max, +) linear recursion formulas for the departure times of customers from stations, and using these they obtain the tail asymptotics of the response and waiting times of the customers. They find these asymptotics for both communication blocking and manufacturing blocking schemes.