Show full item metadata.
JavaScript is disabled for your browser. Some features of this site may not work without it. Large phd thesis queueing systems: Goldberg, David Alan, Ph. Massachusetts Institute of Technology. Parallel server queues are a family of stochastic models phd thesis in a variety of applications, including distributor executive resume mistakes systems and telecommunication networks. A particular application that has received considerable attention in recent years is phd thesis on queuing theory analysis of call centers.
phd thesis on queuing theory A queuing theory common to these models is the notion of the 'trade-off' between quality and efficiency. It is known that if the underlying system parameters scale together according to a certain 'square-root scaling law', then this trade-off can theory precisely quantified, in which case the queue is said to be in the Halfin-Whitt regime.
A common approach to understanding this trade-off involves restricting one's models to have exponentially distributed call lengths, and restricting one's analysis to the steady-state behavior of the system. However, these phd thesis on queuing theory considered shortcomings of much work in the area. Although several recent works have moved beyond these assumptions, many open questions remain, especially w.
These questions are the primary focus of this thesis. We identify the limiting rate of convergence to steady-state, discover an asymptotic phase transition that occurs w.
The results of phd thesis on queuing theory first part of this thesis represent phd thesis on queuing theory important step towards understanding how to incorporate transient effects into the analysis of parallel server queues. We first prove that under minor technical conditions, the steady-state number of jobs waiting in queue scales like the square root of the number of phd thesis on queuing theory. We then establish bounds for the large deviations behavior of this model, partially resolving a conjecture made by Gamarnik and Phd thesis in [ We also derive bounds for a related process studied by Reed in [91].
We then derive the first qualitative insights into the steady-state probability theory an arriving job must wait for service in the Phd thesis on queuing theory regime, for generally distributed processing queuing.
We partially queuing theory the behavior of this probability when a certain excess parameter B approaches either 0 or oo. We conclude by studying the large deviations of the number of idle servers, proving that this random phd thesis on queuing theory has a Gaussian-like tail.
We prove our main results by combining tools from the theory of stochastic comparison [99] with the theory of heavy-traffic approximations []. Read article compare the system of interest to a 'modified' queue, in which all servers are kept busy at all times by phd thesis on queuing theory artificial arrivals whenever a server queuing theory otherwise go idle, and certain servers can permanently break down. We then analyze the modified system using heavy-traffic approximations.
The proven bounds hold for all n, have representations as the suprema of certain natural processes, and may prove useful in a variety of settings. The results of the second part of this thesis enhance our understanding of how parallel server queues behave in phd thesis on queuing theory traffic, phd thesis on queuing theory processing times are generally distributed.
Purchase paper copies of MIT theses. All items in DSpace MIT are protected by queuing theory copyright, with all rights reserved, unless otherwise indicated. Notify us about copyright concerns.
2018 ©