Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/178018
Title: Teoría de colas. Modelo M/M/s
Author: Pérez Parera, Roger
Director/Tutor: Corcuera Valverde, José Manuel
Keywords: Teoria de cues
Treballs de fi de grau
Processos de Markov
Processos puntuals
Queuing theory
Bachelor's thesis
Markov processes
Point processes
Issue Date: 23-Jun-2020
Abstract: [en] In this Final Degree Project, the Queuing Theory is developed around its best known model: the M/M/s. To do this, two previous theory sections necessary for this model are presented. The first of these sections is about the Poisson process, where definitions and results on the exponential distribution are included and then the Poisson process itself is presented. The Poisson process helps us determine the distribution of customer arrivals in M/M/s queuing systems. The second of these sections is about continuous time Markov chains. This section plays a central role in M/M/s queuing systems, since these are a particular case of birth and death processes, which are nothing more than a specific type of continuous-time Markov chain. With this, section number 4 focuses on the development of M/M/s queuing systems with the objective of knowing measures of effectiveness in relation to these queues and knowing the most appropriate number of servers for a M/M/s queue. To this end, birth and death processes, the concept of stationary distribution and Little’s formulas are introduced earlier. To give practical sense to the theoretical abstraction, in section number 6 a real case of application of the M/M/s model is presented, before presenting in section number 5 the basic theory of queuing networks.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2020, Director: José Manuel Corcuera Valverde
URI: http://hdl.handle.net/2445/178018
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
178018.pdfMemòria759.27 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons