Smoothing the input process in a batch queue
Résumé
We state some stochastic comparison results for the loss probabil- ities and the time to live in a tandem network with two queues. We consider such a network under batch arrivals and constant service time. We show that making the service capacity of the first queue finite will improve the perfor- mance. More precisely, we derive stochastic bounds for the flows and for the customer without any assumptions on the input traffic.