Abstract : We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is accepted or rejected. We analyse two different models for impatience : (i) based on workload, and (ii) based on queue-length. For the workload-based model, we obtain the Laplace-Stieltjes Transform of the joint stationary workload and arrival rate process, and that of the waiting time. For the queue-length based model we obtain the analogous z-transform. These queueing models might also be useful for capturing the interaction between congestion control algorithms and queue management schemes in the Internet.
Type de document :
Communication dans un congrès
Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011
https://hal.inria.fr/hal-00644866
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : vendredi 25 novembre 2011 - 13:47:17
Dernière modification le : mardi 11 septembre 2018 - 15:18:15
Document(s) archivé(s) le : dimanche 26 février 2012 - 02:30:12
Onno Boxma, Balakrishna Prabhu. Analysis of an M/G/1 queue with customer impatience and adaptive arrival process. Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011. 〈hal-00644866〉
