Smoothing the input process in a batch queue

Abstract : 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.
Type de document :
Communication dans un congrès
ISCIS 2015 : 30th International Symposium on Computer and Information Sciences , Sep 2015, London, United Kingdom. Springer, 363, pp.223 - 232, 2016, 〈10.1007/978-3-319-22635-4_20〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01255053
Contributeur : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Soumis le : mercredi 13 janvier 2016 - 10:35:30
Dernière modification le : mercredi 17 octobre 2018 - 12:40:04

Identifiants

Citation

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. Springer, 363, pp.223 - 232, 2016, 〈10.1007/978-3-319-22635-4_20〉. 〈hal-01255053〉

Partager

Métriques

Consultations de la notice

134