Smoothing the Input Process in a Batch Queue
We state some stochastic comparison results for the loss probabilities 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 performance. More precisely, we derive stochastic bounds for the accumulated number of losses without any assumptions on the input traffic.
- 1.Aït-Salaht, F., Castel-Taleb, H., Fourneau, J., Pekergin, N.: Stochastic bounds and histograms for network performance analysis. In: Computer Performance Engineering—10th European Workshop, EPEW Italy, volume 8168 of Lecture Notes in Computer Science, pp. 13–27. Springer, New York (2013)Google Scholar
- 3.Dupuis, A., Hébuterne, G.: Dimensioning the continuous state leaky bucket for geometric arrivals. In: Data Communications and their Performance, Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks, Istanbul, Turkey, (1995), volume 36 of IFIP Conference Proceedings, pp. 289–301. Chapman and Hall (1995)Google Scholar
- 4.Fourneau, J.-M., Le Coz, M., Pekergin, N., Quessette, F.: An open tool to compute stochastic bounds on steady-state distributions and rewards. In: 11th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS: Orlando. IEEE Computer Society, FL (2003)Google Scholar