Smoothing the input process in a batch queue

Farah Ait Salaht (1, 2, 3) , Hind Castel-Taleb (1, 2, 3) , Thierry Mautor (4) , Jean-Michel Fourneau (4) , Nihal Pekergin (5)

1 TSP - RST - Département Réseaux et Services de Télécommunications
2 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
3 CNRS - Centre National de la Recherche Scientifique
4 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
5 LACL - Laboratoire d'Algorithmique Complexité et Logique

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.

Domaines: Modélisation et simulation

Farah Ait Salaht, Hind Castel-Taleb, Thierry Mautor, Jean-Michel Fourneau, Nihal Pekergin. Smoothing the input process in a batch queue. ISCIS 2015 : 30th International Symposium on Computer and Information Sciences , Sep 2015, London, United Kingdom. pp.223 - 232, ⟨10.1007/978-3-319-22635-4_20⟩. ⟨hal-01255053⟩