Skip to Main content Skip to Navigation
Theses

Problèmes de convergence, optimisation d'algorithmes et analyse stochastique de systèmes de files d'attente avec rappels.

Abstract : To optimize the networks control in telecommunication, we consider an M^X / G / 1 retrial queue with impatient customers. By using the method of supplementary variables, we obtain the partial generating functions of the steady state joint distribution of the server state and the number of customers in the retrial group is obtained. To complete the analysis of the considered model, we find the steady state distribution of the embedded Markov chain. We investigate the stochastic decomposition property. Although the generating function of the steady state distribution of the number of customers in the retrial group can be obtained in explicit form, it is cumbersome and does not reveal the nature of the distribution in question. Therefore, we investigate the asymptotic behaviour of the random variable representing the number of customers in the retrial group and in the system under limit values of various parameters. We complete this work by numerical examples.
Document type :
Theses
Complete list of metadatas

Cited literature [114 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00829089
Contributor : Nawel K. Arrar <>
Submitted on : Sunday, June 2, 2013 - 12:33:50 AM
Last modification on : Sunday, January 19, 2020 - 6:38:32 PM
Long-term archiving on: : Tuesday, September 3, 2013 - 3:05:10 AM

Identifiers

  • HAL Id : tel-00829089, version 1

Collections

Citation

Nawel Arrar. Problèmes de convergence, optimisation d'algorithmes et analyse stochastique de systèmes de files d'attente avec rappels.. Probabilités [math.PR]. Université Panthéon-Sorbonne - Paris I; Université Badji Mokhtar-Annaba, 2012. Français. ⟨tel-00829089⟩

Share

Metrics

Record views

427

Files downloads

3320