Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks

Abstract : In this paper we analyze the M/G/1 processor sharing queue with heavy tailed services and with impatient customers. It is assumed that impatience depends on the value of the service required. We prove that a reduced service rate (RSR) approximation holds for estimating the sojourn time of a customer in the system, when the queue capacity is finite or infinite. This allows us to evaluate the reneging probability of customers with very large service times. We then use these results to investigate the impact of admission control on a link of a packet network. Admission control simply consists of limiting the number of simultaneous connections. It turns out that there is a real benefit for the efficiency of the system to perform admission control: It globally increases the fraction of customers, who complete their service (i.e. without being impatient). Finally, we investigate the fairness of the system and propose a criterion to assess the capacity of the system so as to allow the completion of very large service times.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00072052
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:39:08 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Sunday, April 4, 2010 - 10:50:47 PM

Identifiers

  • HAL Id : inria-00072052, version 1

Collections

Citation

Jacqueline Boyer, Fabrice Guillemin, Philippe Robert, Bert Zwart. Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks. [Research Report] RR-4536, INRIA. 2002. ⟨inria-00072052⟩

Share

Metrics

Record views

203

Files downloads

352