Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Chang, C.-S.: Smoothing point processes as a means to increase throughput. Oper. Res. 43(1), 117–129 (1995)
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)
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)
Friedman, H.D.: Reduction methods for tandem queuing systems. Oper. Res. 13(1), 121–131 (1965)
Hernández-Orallo, E., Vila-Carbó, J.: Network queue and loss analysis using histogram-based traffic models. Comput. Commun. 33(2), 190–201 (2010)
Muller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, New York (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Salaht, F.A., Taleb, H.C., Fourneau, J.M., Mautor, T., Pekergin, N. (2016). Smoothing the Input Process in a Batch Queue. In: Abdelrahman, O., Gelenbe, E., Gorbil, G., Lent, R. (eds) Information Sciences and Systems 2015. Lecture Notes in Electrical Engineering, vol 363. Springer, Cham. https://doi.org/10.1007/978-3-319-22635-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-22635-4_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22634-7
Online ISBN: 978-3-319-22635-4
eBook Packages: EngineeringEngineering (R0)