Contents
Academic literature on the topic 'Processus de Markovthéorie des files d'attente'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Processus de Markovthéorie des files d'attente.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Dissertations / Theses on the topic "Processus de Markovthéorie des files d'attente"
Groenevelt, Robin. "Modèles stochastiques pour les réseaux ad hoc mobiles." Phd thesis, Université de Nice Sophia-Antipolis, 2005. http://tel.archives-ouvertes.fr/tel-00274901.
Full textBarbot, Nelly. "Files d'attente fluides en environnement markovien." Rennes 1, 2002. http://www.theses.fr/2002REN10094.
Full textRosenberg, Catherine. "Non-stationnarité dans les files d'attente markoviennes." Paris 11, 1986. http://www.theses.fr/1986PA112242.
Full textThis thesis is divided into two distinct parts, each one concerning a different aspect of non-stationary in Markovian queueing systems. In the first part, we introduce two models of exponential queueing systems with non-stationary parameters which do not obey a certain independence assumption often made in Queueing Theory. A complete analysis is carried out (i. E. Explicit results, necessary and sufficient conditions for stability (via Jury's criteria), curves. ). This first part ends with a generalization of those two models. The first model is a queue (infinite or capacity limited with a resume level), whose arrival process is Poisson with a randomly changing arrival rate. The second model is a queue with randomly changing service rate. The second part deals with queueing systems whose service process (or arrival process, or both) takes its value from a finite set of general distributions (Fl,. . . ,FN). The passage from one distribution to another is governed by a extraneous Markov process which is assumed to be independent of the distributions. We study three distinct models, the first one corresponding to the one described above, the second is the "dual" of the first one for the arrival process and the third one is a generalization of the first one. These systems have already been studied by Yechiali, Naor and Neuts. In this second part, we deal with the particular case where the extraneous Markov process is quasi-decomposable (as defined by Courtois). We first show, formally, that these three models are quasi decomposable with the same parameter as for the extranecus Markov process. Finally, we give an approximate solution for the first model, using z-transforms. In the very important case of slow variations between the different service distributions, we compute the error due to the approximation and present performance curves
Moyal, Pascal. "Contributions à l'étude des files d'attente avec clients impatients." Phd thesis, Télécom ParisTech, 2005. http://pastel.archives-ouvertes.fr/pastel-00001340.
Full textDantzer, Jean-François. "Stabilité des réseaux de files d'attente et limites fluides stochastiques." Versailles-St Quentin en Yvelines, 2000. http://www.theses.fr/2000VERS0010.
Full textNaceur, Tesnim. "Systèmes de files d'attente stratégiques avec information contrôlée." Thesis, Avignon, 2020. http://www.theses.fr/2020AVIG0279.
Full textFaced to queuing systems, customers can make their strategic decisions in order to join or not these systems. An interesting new aspect has emerged and studied in recent years, which is about the impact of current queue-length information on strategic decisions of customers, on the equilibrium and the performance of the system. Customers are not necessarily homogeneous in their behavior and their access to the information, which implies different equilibrium and performances solutions.In some cases, service provider may have an interest to give to customers the system state information and withholding it to others in order to optimize certain objectives. In other cases, obtaining the information is mainly the choice of customers and therefore thay have to decide to inspect or to collect the information or not, according to their constrainsts and their wishes.The main motivation for this thesis is to study the impact of the queue length information on the strategic decisions of customers and to analyze the performance of such strategic queuing systems with controlled information. Our contributions allow to determine the equilibuim and optimize the performance of the systems according to the queue length information. Theoretical and analytical solutions have been proposed to solve the studied problems
Aguilar, Cornejo Manuel. "Contribution à la validation de systèmes de processus communiquant par files d'attente : analyse statique pour la réduction de files." Grenoble INPG, 2003. http://www.theses.fr/2003INPG0106.
Full textDao, Thi Thu Ha. "Les files et les réseaux zéro-automatiques." Paris 7, 2007. http://www.theses.fr/2007PA077141.
Full textWe introduce and study a new model: Zero-automatic queues. First, we consider the discipline First In First Out. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. When considering the two simplest and extremal cases of 0-automatic queues, we recover the simple M/M/1 queue, and Gelenbe's G-queue with positive and negative customers. The salient result is that all stable 0-automatic queues have a product form stationary distribution and a Poisson output process. This is a crucial point to build a network of 0-automatic queues with product form stationary distribution. We consider two types of networks, with either a Jackson-like or a Kelly-like touting mechanism. In both cases, and under the stability condition, we prove that the stationary distribution of the buffer contents has a « product-form » and can be explicitly determined. Furthermore, the departure process out of the network is Poisson. Consider the 0-automatic queues with the service discipline Last In First Out, ail nice properties of the FIFO 0-automatic queues do not hold for the LIFO queue. However, it is intersting to compare these two types of queues
Choquet-Geniet, Annie. "Analyse et propriétés des processus communiquant par files fifo : réseaux à files à choix libre topologique et réseaux à files linéaires." Paris 11, 1987. http://www.theses.fr/1987PA112248.
Full textEl, Merzouqi Saïd. "Stabilité et instabilité des réseaux de files d'attente stochastiques à plusieurs classes de clients." Rouen, 2002. http://www.theses.fr/2002ROUES044.
Full textBooks on the topic "Processus de Markovthéorie des files d'attente"
Nelson, Randolph. Probability, stochastic processes, and queueing theory: The mathematics of computer performance modeling. New York: Springer-Verlag, 1995.
Find full textProbability, stochastic processes, and queueing theory: The mathematics of computer performance modelling. New York: Springer-Verlag, 1995.
Find full textCooper, Robert B. Introduction to queueing theory. 3rd ed. Washington, D.C: CEEPress Books, 1990.
Find full textPrabhu, N. U. (Narahari Umanath), 1924- and Tang Loon Ching, eds. Markov-modulated processes & semiregenerative phenomena. Singapore: World Scientific, 2009.
Find full textHaverkort, Boudewijn R. Performance of computer communication systems: A model-based approach. Chichester: J. Wiley, 1998.
Find full textNelson, Randolph. Probability, Stochastic Processes, and Queueing Theory: The Mathematics of Computer Performance Modeling. Springer, 2000.
Find full textNelson, Randolph. Probability, Stochastic Processes, And Queueing Theory. Springer-Verlag, 2004.
Find full textGunter, Bolch, ed. Queueing networks and Markov chains: Modeling and performance evaluation with computer science applications. New York: Wiley, 1998.
Find full textBook chapters on the topic "Processus de Markovthéorie des files d'attente"
AFANASEVA, Larisa. "Analyse de stabilité de modèles de files d’attente basée sur la méthode de synchronisation." In Théorie des files d’attente 2, 7–39. ISTE Group, 2021. http://dx.doi.org/10.51926/iste.9004.ch1.
Full textDIMITROV, Boyan. "Distributions et processus aléatoires liés aux modèles de files d’attente et de fiabilité." In Théorie des files d’attente 2, 91–147. ISTE Group, 2021. http://dx.doi.org/10.51926/iste.9004.ch3.
Full text