You searched for subject:(queueing theory)
.
Showing records 1 – 30 of
158 total matches.
◁ [1] [2] [3] [4] [5] [6] ▶

Universiteit Utrecht
1.
Schelling, W.D.
Analyzing a queueing network.
Degree: 2015, Universiteit Utrecht
URL: http://dspace.library.uu.nl:8080/handle/1874/307053
► The purpose of the thesis is to help ING Bank to get a better understanding of their ICT landscape. Since the ICT landscape of ING…
(more)
▼ The purpose of the thesis is to help ING Bank to get a better understanding of their ICT landscape. Since the ICT landscape of ING Bank is very large, we will focus on a specific part of the ICT landscape. ING Bank wants to identify the bottlenecks more quickly. Therefore we develop two different mathematical tools which can help in identifying the bottlenecks of such a complex
queueing system. The first tool is a simulation tool using the program Rockwell Arena. The second tool is an analytical approach, based on Markov chains. Both tools have some advantages and disadvantages which we also discuss in the thesis.
Advisors/Committee Members: Dajani, Karma.
Subjects/Keywords: queueing theory; markov chains; simulation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Schelling, W. D. (2015). Analyzing a queueing network. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/307053
Chicago Manual of Style (16th Edition):
Schelling, W D. “Analyzing a queueing network.” 2015. Masters Thesis, Universiteit Utrecht. Accessed February 27, 2021.
http://dspace.library.uu.nl:8080/handle/1874/307053.
MLA Handbook (7th Edition):
Schelling, W D. “Analyzing a queueing network.” 2015. Web. 27 Feb 2021.
Vancouver:
Schelling WD. Analyzing a queueing network. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Feb 27].
Available from: http://dspace.library.uu.nl:8080/handle/1874/307053.
Council of Science Editors:
Schelling WD. Analyzing a queueing network. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/307053

Anna University
2.
Haridass M.
Bulk Queueing models with unreliable server restricted
admissions and threshold policies for vacations.
Degree: Mathematics, 2013, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/9924
► Queueing theory is an important branch of applied probability and it involves the mathematical study of queues or waiting lines. The formation of waiting lines…
(more)
▼ Queueing theory is an important branch of applied
probability and it involves the mathematical study of queues or
waiting lines. The formation of waiting lines is a common
phenomenon which occurs whenever the current demand for a service
exceeds the current capacity to provide that service. In this
thesis, bulk queueing models with re-service, service
interruptions, variant threshold policies for secondary jobs
(multiple vacations, modified vacations and vacation
interruptions), and restricted admissions on arrivals are
developed. The proposed models of this research work are
theoretically developed and numerically justified. In chapter 2, a
bulk queueing system with server s choice of admitting re-service,
multiple vacations and setup time is analyzed. A bulk arrival
general bulk service queueing system with variant threshold
policies for vacations is discussed in chapter 3. In chapter 4, a
bulk queueing system with multiple vacations under restricted
admissibility policy of arriving batches is considered. A single
server bulk service queueing system with interrupted secondary job
(vacation) is considered in chapter 5. A single server batch
arrival queueing system with unreliable server and single vacation
is analyzed in chapter 6. In chapter 7, a batch arrival single
server retrial queue with modified vacations under N- policy is
analyzed. For this model, the probability generating function of
the steady state orbit size distribution at an arbitrary time epoch
is obtained. A batch arrival general bulk service retrial queueing
model with constant retrial rate is studied in chapter 8. The
probability generating function of the steady state orbit size
distribution at an arbitrary time epoch is obtained. Chapter 6 is
studied by the embedded Markov chain technique and level crossing
analysis. All the remaining chapters are discussed by the
supplementary variable technique.
References p. 255-273, List of Publications p.
274
Advisors/Committee Members: Arumugananthan R.
Subjects/Keywords: Queueing theory; Mathematics; N policy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
M, H. (2013). Bulk Queueing models with unreliable server restricted
admissions and threshold policies for vacations. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9924
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
M, Haridass. “Bulk Queueing models with unreliable server restricted
admissions and threshold policies for vacations.” 2013. Thesis, Anna University. Accessed February 27, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/9924.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
M, Haridass. “Bulk Queueing models with unreliable server restricted
admissions and threshold policies for vacations.” 2013. Web. 27 Feb 2021.
Vancouver:
M H. Bulk Queueing models with unreliable server restricted
admissions and threshold policies for vacations. [Internet] [Thesis]. Anna University; 2013. [cited 2021 Feb 27].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9924.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
M H. Bulk Queueing models with unreliable server restricted
admissions and threshold policies for vacations. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9924
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo
3.
Granville, Kevin.
An Application of Matrix Analytic Methods to Queueing Models with Polling.
Degree: 2019, University of Waterloo
URL: http://hdl.handle.net/10012/14936
► We review what it means to model a queueing system, and highlight several components of interest which govern the behaviour of customers, as well as…
(more)
▼ We review what it means to model a queueing system, and highlight several components of interest which govern the behaviour of customers, as well as the server(s) who tend to them. Our primary focus is on polling systems, which involve one or more servers who must serve multiple queues of customers according to their service policy, which is made up of an overall polling order, and a service discipline defined at each queue. The most common polling orders and service disciplines are discussed, and some examples are given to demonstrate their use. Classic matrix analytic method theory is built up and illustrated on models of increasing complexity, to provide context for the analyses of later chapters. The original research contained within this thesis is divided into two halves, finite population maintenance models and infinite population cyclic polling models.
In the first half, we investigate a 2-class maintenance system with a single server, expressed as a polling model. In Chapter 2, the model we study considers a total of C machines which are at risk of failing when working. Depending on the failure that a machine experiences, it is sorted into either the class-1 or class-2 queue where it awaits service among other machines suffering from similar failures. The possible service policies that are considered include exhaustive, non-preemptive priority, and preemptive resume priority. In Chapter 3, this model is generalized to allow for a maintenance float of f spare machines that can be turned on to replace a failed machine. Additionally, the possible server behaviours are greatly generalized. In both chapters, among other topics, we discuss the optimization of server behaviour as well as the limiting number of working machines as we let C go to infinity. As these are systems with a finite population (for a given C and f), their steady-state distributions can be solved for using the algorithm for level-dependent quasi-birth-and-death processes without loss of accuracy.
When a class of customers are impatient, the algorithms covered in this thesis require their queue length to be truncated in order for us to approximate the steady-state distribution for all but the simplest model. In Chapter 4, we model a 2-queue polling system with impatient customers and k_i-limited service disciplines. Finite buffers are assumed for both queues, such that if a customer arrives to find their queue full then they are blocked and lost forever. Finite buffers are a way to interpret a necessary truncation level, since we can simply assume that it is impossible to observe the removed states. However, if we are interested in approximating an infinite buffer system, this inconsistency will bias the steady-state probabilities if blocking probabilities are not negligible. In Chapter 5, we introduce the Unobserved Waiting Customer approximation as a way to reduce this natural biasing that is incurred when approximating an infinite buffer system. Among the queues considered within this chapter is a N-queue system with exhaustive…
Subjects/Keywords: queueing theory; matrix analytic methods
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Granville, K. (2019). An Application of Matrix Analytic Methods to Queueing Models with Polling. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14936
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Granville, Kevin. “An Application of Matrix Analytic Methods to Queueing Models with Polling.” 2019. Thesis, University of Waterloo. Accessed February 27, 2021.
http://hdl.handle.net/10012/14936.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Granville, Kevin. “An Application of Matrix Analytic Methods to Queueing Models with Polling.” 2019. Web. 27 Feb 2021.
Vancouver:
Granville K. An Application of Matrix Analytic Methods to Queueing Models with Polling. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/10012/14936.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Granville K. An Application of Matrix Analytic Methods to Queueing Models with Polling. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14936
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto
4.
Sarhangian, Vahid.
Certain Static and Dynamic Priority Policies in Queueing Systems.
Degree: 2011, University of Toronto
URL: http://hdl.handle.net/1807/31431
► In this thesis, we first study delay systems with different classes of impatient customers. We analyze the M/GI/1+M queue serving two priority classes under the…
(more)
▼ In this thesis, we first study delay systems with different classes of impatient customers. We analyze the M/GI/1+M queue serving two priority classes under the static non-preemptive priority discipline. We also study the multi-server priority queue considering two cases depending on the time-to-abandon distribution being exponentially distributed or deterministic. In all models, we obtain the Laplace transforms of the virtual waiting time for each class by exploiting the level-crossing method. This enables us to obtain the steady-state system performance measures. In the second part, we consider the steady-state waiting time distributions of a two class M/GI/1 queue operating under a dynamic priority discipline. We find an accurate approximation for the steady-state waiting time distribution of the low-priority customers which allows us to study how they are penalized as the priority parameter increases. We also obtain bounds for the variance of the waiting time of high-priority customers.
MAST
Advisors/Committee Members: Balcioglu, Baris, Mechanical and Industrial Engineering.
Subjects/Keywords: Queueing Theory; Service Engineering; 0546
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sarhangian, V. (2011). Certain Static and Dynamic Priority Policies in Queueing Systems. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31431
Chicago Manual of Style (16th Edition):
Sarhangian, Vahid. “Certain Static and Dynamic Priority Policies in Queueing Systems.” 2011. Masters Thesis, University of Toronto. Accessed February 27, 2021.
http://hdl.handle.net/1807/31431.
MLA Handbook (7th Edition):
Sarhangian, Vahid. “Certain Static and Dynamic Priority Policies in Queueing Systems.” 2011. Web. 27 Feb 2021.
Vancouver:
Sarhangian V. Certain Static and Dynamic Priority Policies in Queueing Systems. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1807/31431.
Council of Science Editors:
Sarhangian V. Certain Static and Dynamic Priority Policies in Queueing Systems. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31431

University of Adelaide
5.
Branford, Alan John.
Secondary processes induced by finite birth-and-death processes.
Degree: 1980, University of Adelaide
URL: http://hdl.handle.net/2440/122019
Subjects/Keywords: Queueing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Branford, A. J. (1980). Secondary processes induced by finite birth-and-death processes. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/122019
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Branford, Alan John. “Secondary processes induced by finite birth-and-death processes.” 1980. Thesis, University of Adelaide. Accessed February 27, 2021.
http://hdl.handle.net/2440/122019.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Branford, Alan John. “Secondary processes induced by finite birth-and-death processes.” 1980. Web. 27 Feb 2021.
Vancouver:
Branford AJ. Secondary processes induced by finite birth-and-death processes. [Internet] [Thesis]. University of Adelaide; 1980. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/2440/122019.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Branford AJ. Secondary processes induced by finite birth-and-death processes. [Thesis]. University of Adelaide; 1980. Available from: http://hdl.handle.net/2440/122019
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Debrecen
6.
Alhaj mohammad, Mazin.
Queueing Theory Software Packages
.
Degree: DE – Informatikai Kar, University of Debrecen
URL: http://hdl.handle.net/2437/276904
► At the beginning of the thesis, I talked about the Theoretical part of the queuing theory and its principles. Introducing the types of programs used…
(more)
▼ At the beginning of the thesis, I talked about the Theoretical part of the queuing
theory and its principles. Introducing the types of programs used for testing and examining the software packages by giving some examples and explanations, later then at the last chapter I talked about
Queueing Network both open and closed classes.
Advisors/Committee Members: Sztrik, János (advisor).
Subjects/Keywords: Queueing Theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Alhaj mohammad, M. (n.d.). Queueing Theory Software Packages
. (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/276904
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Alhaj mohammad, Mazin. “Queueing Theory Software Packages
.” Thesis, University of Debrecen. Accessed February 27, 2021.
http://hdl.handle.net/2437/276904.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Alhaj mohammad, Mazin. “Queueing Theory Software Packages
.” Web. 27 Feb 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
Alhaj mohammad M. Queueing Theory Software Packages
. [Internet] [Thesis]. University of Debrecen; [cited 2021 Feb 27].
Available from: http://hdl.handle.net/2437/276904.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
Council of Science Editors:
Alhaj mohammad M. Queueing Theory Software Packages
. [Thesis]. University of Debrecen; Available from: http://hdl.handle.net/2437/276904
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

University of Southern California
7.
Li, Chih-ping.
Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay.
Degree: PhD, Electrical Engineering, 2011, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078
► This dissertation addresses several optimal stochastic scheduling problems that arise in partially observable wireless networks and multi-class queueing systems. They are single-hop network control problems…
(more)
▼ This dissertation addresses several optimal stochastic
scheduling problems that arise in partially observable wireless
networks and multi-class
queueing systems. They are single-hop
network control problems under different channel connectivity
assumptions and different scheduling constraints. Our goals are
two-fold: To identify stochastic scheduling problems of practical
interest, and to develop analytical tools that lead to efficient
control algorithms with provably optimal performance. ❧ In wireless
networks, we study three sets of problems. First, we explore how
the energy and timing overhead due to channel probing affects
network performance. We develop a dynamic channel probing algorithm
that is both throughput and energy optimal. The second problem is
how to exploit time correlations of wireless channels to improve
network throughput when instantaneous channel states are
unavailable. Specifically, we study the network capacity region
over a set of Markov ON/OFF channels with unknown current states.
Recognizing that this is a difficult restless multi-armed bandit
problem, we construct a non-trivial inner bound on the network
capacity region by randomizing well-designed round robin policies.
This inner bound is considered as an operational network capacity
region because it is large and easily achievable. A queue-dependent
round robin policy is constructed to support any throughput vector
within the inner bound. In the third problem, we study throughput
utility maximization over partially observable Markov ON/OFF
channels (specifically, over the inner bound provided in the
previous problem). It has applications in wireless networks with
limited channel probing capability, cognitive radio networks,
target tracking of unmanned aerial vehicles, and restless
multi-armed bandit systems. An admission control and channel
scheduling policy is developed to achieve near-optimal throughput
utility within the inner bound. Here we use a novel ratio MaxWeight
policy that generalizes the existing MaxWeight-type policies from
time-slotted networks to frame-based systems that have
policy-dependent random frame sizes. ❧ In multi-class
queueing
systems, we study how to optimize average service cost and
per-class average
queueing delay in a nonpreemptive multi-class
M/G/1 queue that has adjustable service rates. Several convex delay
penalty and service cost minimization problems with time-average
constraints are investigated. We use the idea of virtual queues to
transform these problems into a new set of queue stability
problems, and the queue-stable policies are the desired solutions.
The solutions are variants of dynamic c-mu rules, and implement
weighted priority policies in every busy period, where the weights
are functions of past
queueing delays in each job class. ❧
Throughout these problems, our analysis and algorithm design uses
and generalizes an achievable region approach driven by Lyapunov
drift
theory. We study the performance region (in throughput,
power, or delay) of interest and identify, or design, a policy
space so…
Advisors/Committee Members: Neely, Michael J. (Committee Chair), Caire, Giuseppe (Committee Member), Jain, Rahul (Committee Member), Krishnamachari, Bhaskar (Committee Member), Ward, Amy R. (Committee Member).
Subjects/Keywords: stochastic network optimization; queueing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, C. (2011). Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078
Chicago Manual of Style (16th Edition):
Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay.” 2011. Doctoral Dissertation, University of Southern California. Accessed February 27, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.
MLA Handbook (7th Edition):
Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay.” 2011. Web. 27 Feb 2021.
Vancouver:
Li C. Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Feb 27].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.
Council of Science Editors:
Li C. Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078

Boston University
8.
Simhon, Eran.
Advance reservations and information sharing in queues with strategic customers.
Degree: PhD, Systems Engineering, 2016, Boston University
URL: http://hdl.handle.net/2144/19499
► In many branches of the economy, including transportation, lodging, and more recently cloud computing, users can reserve resources in advance. Although advance reservations are gaining…
(more)
▼ In many branches of the economy, including transportation, lodging, and more recently cloud computing, users can reserve resources in advance. Although advance reservations are gaining popularity, little is known about the strategic behavior of customers facing the decision whether to reserve a resource in advance or not.
Making an advance reservation can reduce the waiting time or the probability of not getting service, but it is usually associated with an additional cost. To evaluate this trade-off, we develop a game-theoretic framework, called advance reservation games, that helps in reasoning about the strategic behavior of customers in systems that allow advance reservations. Using this framework, we analyze several advance reservation models, in the context of slotted loss queues and waiting queues. The analysis of the economic equilibria, from the provider perspective, yields several key insights, including: (i) If customers have no a-priori information about the availability of servers, then only customers granted service should be charged a reservation fee; (ii) Informing customers about the exact number of available servers is less profitable than only informing them that servers are available; (iii) In many cases, the reservation fee that leads to the equilibrium with maximum possible profit leads to other equilibria, including one resulting with no profit; (iv) If the game repeats many times and customers update their strategy after observing actions of other customers at previous stage, then the system converges to an equilibrium where no one makes an advance reservation, if such an equilibrium exists. Else, the system cycles and yields positive profit to the provider
Finally, we study the impact of information sharing in M/M/1 queues with strategic customers. We analyze the intuitive policy of sharing the queue length with customers when it is small and hiding it when it is large. We prove that, from the provider perspective, such a policy is never optimal. That is, either always sharing the queue length or always hiding it maximizes the average number of customers joining the queue.
Subjects/Keywords: Operations research; Game theory; Queueing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Simhon, E. (2016). Advance reservations and information sharing in queues with strategic customers. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/19499
Chicago Manual of Style (16th Edition):
Simhon, Eran. “Advance reservations and information sharing in queues with strategic customers.” 2016. Doctoral Dissertation, Boston University. Accessed February 27, 2021.
http://hdl.handle.net/2144/19499.
MLA Handbook (7th Edition):
Simhon, Eran. “Advance reservations and information sharing in queues with strategic customers.” 2016. Web. 27 Feb 2021.
Vancouver:
Simhon E. Advance reservations and information sharing in queues with strategic customers. [Internet] [Doctoral dissertation]. Boston University; 2016. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/2144/19499.
Council of Science Editors:
Simhon E. Advance reservations and information sharing in queues with strategic customers. [Doctoral Dissertation]. Boston University; 2016. Available from: http://hdl.handle.net/2144/19499

University of Victoria
9.
Li, Hang.
Parameter estimation of queueing system using mixture model and the EM algorithm.
Degree: Department of Computer Science, 2016, University of Victoria
URL: http://hdl.handle.net/1828/7647
► Parameter estimation is a long-lasting topic in queueing systems and has attracted considerable attention from both academia and industry. In this thesis, we design a…
(more)
▼ Parameter estimation is a long-lasting topic in
queueing systems and has attracted considerable attention from both academia and industry. In this thesis, we design a parameter estimation framework for a tandem
queueing system that collects end-to-end measurement data and utilizes the finite mixture model for the maximum likelihood (ML) estimation. The likelihood equations produced by ML are then solved by the iterative expectation-maximization (EM) algorithm, a powerful algorithm for parameter estimation in scenarios involving complicated distributions.
We carry out a set of experiments with different parameter settings to test the performance of the proposed framework. Experimental results show that our method performs well for tandem
queueing systems, in which the constituent nodes' service time follow distributions governed by exponential family. Under this framework, both the Newton-Raphson (NR) algorithm and the EM algorithm could be applied. The EM algorithm, however, is recommended due to its ease of implementation and lower computational overhead.
Advisors/Committee Members: Wu, Kui (supervisor).
Subjects/Keywords: EM algorithm; Queueing Theory; Mixture Model; Tandem Queueing System
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, H. (2016). Parameter estimation of queueing system using mixture model and the EM algorithm. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7647
Chicago Manual of Style (16th Edition):
Li, Hang. “Parameter estimation of queueing system using mixture model and the EM algorithm.” 2016. Masters Thesis, University of Victoria. Accessed February 27, 2021.
http://hdl.handle.net/1828/7647.
MLA Handbook (7th Edition):
Li, Hang. “Parameter estimation of queueing system using mixture model and the EM algorithm.” 2016. Web. 27 Feb 2021.
Vancouver:
Li H. Parameter estimation of queueing system using mixture model and the EM algorithm. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1828/7647.
Council of Science Editors:
Li H. Parameter estimation of queueing system using mixture model and the EM algorithm. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7647

University of Toronto
10.
Tran, Tony.
Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.
Degree: 2011, University of Toronto
URL: http://hdl.handle.net/1807/31609
► The central thesis of this dissertation is that insight from queueing analysis can effectively guide standard (combinatorial) scheduling algorithms in dynamic environments. Scheduling is generally…
(more)
▼ The central thesis of this dissertation is that insight from queueing analysis can effectively guide standard (combinatorial) scheduling algorithms in dynamic environments. Scheduling is generally concerned with complex combinatorial decisions for static problems, whereas queueing theory simplifies the combinatorics and focuses on dynamic systems. We examine a queueing network with flexible servers under queueing and scheduling techniques. Based on the strengths of queueing analysis and scheduling, we develop a hybrid model that guides scheduling with results from the queueing model.
In order to include setup times, we create a logic-based Benders decomposition model for a static representation of the queueing network. Our model is able to find optimal schedules up to 5 orders of magnitude faster than the only other model in the literature. A hybrid model is then developed for the dynamic problem and shown to achieve the best mean flow time while also guaranteeing maximal capacity.
MAST
Advisors/Committee Members: Beck, J. Christopher, Mechanical and Industrial Engineering.
Subjects/Keywords: Combinatorial Scheduling; Queueing Theory; Dynamic Network; 0546
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tran, T. (2011). Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31609
Chicago Manual of Style (16th Edition):
Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Masters Thesis, University of Toronto. Accessed February 27, 2021.
http://hdl.handle.net/1807/31609.
MLA Handbook (7th Edition):
Tran, Tony. “Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments.” 2011. Web. 27 Feb 2021.
Vancouver:
Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1807/31609.
Council of Science Editors:
Tran T. Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31609

Iowa State University
11.
Dai, Dong.
Statistical analysis of queueing problems using real data.
Degree: 2020, Iowa State University
URL: https://lib.dr.iastate.edu/etd/17854
► There are three topics in the thesis. In the first topic, the problem is a staffing problem for queues: we need to decide the number…
(more)
▼ There are three topics in the thesis. In the first topic, the problem is a staffing problem for queues: we need to decide the number of representatives in a bank call center to optimize different performance measures. We compare the stability of the performance of two common staffing methods, square root staffing formula (SQSF) and iterative staffing algorithm (ISA), using the actual call center data from an Israeli bank. We also show the proof of the convergence of the ISA iterative method under the assumption of M(t)/M/s(t). In the second topic, we investigate the patients flow in the emergency department in the Rambam Medical Center, an Israeli hospital. We study the arrival process, the length of stay and the departure process. We show using simulations that the arrival process can be approximate by non-homogeneous Poisson process and the length of stay is a time-varying process in a day of week view. Based on our model, we can predict the number of beds needed each day in the hospital. In the third topic, we apply the actual data from Mercy Hospital in Des Moines. The problem is to compare the cost of add pharmacy technicians in the hospital to help correct patients' previous medications comparing to the benefit of reducing the errors made by patients. We build models to predict the number of errors corrected and the time needed by the pharmacy technicians. Using the salary of pharmacy technicians and known costs for correcting errors, our cost benefit analysis shows that additional help was financially beneficial to Mercy Hospital.
Subjects/Keywords: call-centers; emergency departments; queueing theory; staffing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dai, D. (2020). Statistical analysis of queueing problems using real data. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17854
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Dai, Dong. “Statistical analysis of queueing problems using real data.” 2020. Thesis, Iowa State University. Accessed February 27, 2021.
https://lib.dr.iastate.edu/etd/17854.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Dai, Dong. “Statistical analysis of queueing problems using real data.” 2020. Web. 27 Feb 2021.
Vancouver:
Dai D. Statistical analysis of queueing problems using real data. [Internet] [Thesis]. Iowa State University; 2020. [cited 2021 Feb 27].
Available from: https://lib.dr.iastate.edu/etd/17854.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Dai D. Statistical analysis of queueing problems using real data. [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/17854
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Manitoba
12.
Gunasekara, Charith.
Optimal threshold policy for opportunistic network coding under phase type arrivals.
Degree: Electrical and Computer Engineering, 2016, University of Manitoba
URL: http://hdl.handle.net/1993/31615
► Network coding allows each node in a network to perform some coding operations on the data packets and improve the overall throughput of communication. However,…
(more)
▼ Network coding allows each node in a network to perform some coding operations on the data packets and improve the overall throughput of communication. However, network coding cannot be done unless there are enough packets to be coded so at times it may be advantageous to wait for packets to arrive.
We consider a scenario in which two wireless nodes each with its own buffer communicate via a single access point using network coding. The access point first pairs each data packet being sent from each node and then performs the network coding operation. Packets arriving at the access point that are unable to be paired are instead loaded into one of the two buffers at the access point. In the case where one of the buffers is empty and the other is not network coding is not possible. When this happens the access point must either wait for a network coding opportunity, or transmit the unpaired packet without coding. Delaying packet transmission is associated with an increased waiting cost but also allows for an increase in the overall efficiency of wireless spectrum usage, thus a decrease in packet transmission cost. Conversely, sending packets un-coded is associated with a decrease in waiting cost but also a decrease in the overall efficiency of the wireless spectrum usage. Hence, there is a trade-off between decreasing packet delay time, and increasing the efficiency of the wireless spectrum usage.
We show that the optimal waiting policy for this system with respect to total cost, under phase-type packet arrivals, is to have a separate threshold for the buffer size that is dependent on the current phase of each arrival. We then show that the solution to this optimization problem can be obtained by treating it as a double ended push-out
queueing theory problem. We develop a new technique to keep track of the packet waiting time and the number of packets waiting in the two ended push-out queue. We use the resulting
queueing model to resolve the optimal threshold policy and then analyze the performance of the system using numerical approach.
Advisors/Committee Members: Alfa, Attahiru (Electrical and Computer Engineering), Yahampath, Pradeepa (Electrical and Computer Engineering) (supervisor), Cai, Jun (Electrical and Computer Engineering), Thulasiraman, Parimala (Computer Science), Down, Douglas (McMaster University) (examiningcommittee).
Subjects/Keywords: Queueing Theory; Network Coding; Markov Decision Process
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Gunasekara, C. (2016). Optimal threshold policy for opportunistic network coding under phase type arrivals. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31615
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Gunasekara, Charith. “Optimal threshold policy for opportunistic network coding under phase type arrivals.” 2016. Thesis, University of Manitoba. Accessed February 27, 2021.
http://hdl.handle.net/1993/31615.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Gunasekara, Charith. “Optimal threshold policy for opportunistic network coding under phase type arrivals.” 2016. Web. 27 Feb 2021.
Vancouver:
Gunasekara C. Optimal threshold policy for opportunistic network coding under phase type arrivals. [Internet] [Thesis]. University of Manitoba; 2016. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1993/31615.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Gunasekara C. Optimal threshold policy for opportunistic network coding under phase type arrivals. [Thesis]. University of Manitoba; 2016. Available from: http://hdl.handle.net/1993/31615
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh
13.
Alves, Vasco Filipe Figueiredo.
Essays on strategic queueing.
Degree: PhD, 2016, University of Edinburgh
URL: http://hdl.handle.net/1842/26015
► This thesis includes three essays exploring some economic implications of queueing. A preliminary chapter introducing useful results from the literature which help contextualize the original…
(more)
▼ This thesis includes three essays exploring some economic implications of queueing. A preliminary chapter introducing useful results from the literature which help contextualize the original research in the thesis is presented first. This introductory chapter starts by surveying queueing results from probability theory and operations research. Then it covers a few seminal papers on strategic queueing, mostly but not exclusively from the economics literature. These cover issues of individual and social welfare in the context of First Come First Served (FCFS) and Equitable Processor Sharing (EPS) queues, with one or multiple servers, as well as a discussion of strategic interactions surrounding queue cutting. Then an overview of some important papers on the impact of queueing on competitive behaviour, mostly Industrial Organization economists, is presented. The first original chapter presents a model for the endogenous determination of the number of queues in an M/M/2 system. Customers arriving at a system where two customers are being served play a game, choosing between two parallel queues or one single queue. Subgame perfect equilibria are obtained, varying with customer characteristics and game specifications. With risk neutrality and when jockeying is not permitted, a single queue is an equilibrium, as is two queues. With risk neutrality and jockeying allowed, there is a unique two queue equilibrium. With risk aversion and no jockeying, there is a unique single queue equilibrium, and with risk aversion and jockeying, the equilibrium depends on the magnitude of risk aversion. The second chapter analyses the individual decisions taken by consumers when deciding whether to join an M/M/1 queue where a subset of customers who interact repeatedly can both cut the queue and be overtaken once they join, by-passing occasional users. This is shown to be an equilibrium in repeated games for sufficiently patient customers. The expected sojourn time for customers under this discipline is described as a solution of a system of difference equations, and this is then used to obtain a threshold joining strategy for arrivals, which is independent of the number of regular customers in the queue, as regulars form a sub-queue under the LCFS discipline. Numerical methods are then employed to contrast sojourn times and thresholds with the equilibrium for a strict First Come First Served queueing discipline, and with the socially optimal joining rule. Finally, the third chapter describes a duopoly market for healthcare where one of the two providers is publicly owned and charges a price of zero, while the other sets a price so as to maximize its profit. Both providers are subject to congestion in the form of an M/M/1 queue, and they serve patient-customers with randomly distributed unit costs of time. Consumer demand (as market share) for both providers is obtained and described with its full complement of comparative statics. The private provider’s pricing decision is explored, and equilibrium existence is proven. Social welfare…
Subjects/Keywords: 519.8; economics; microeconomics; game theory; queueing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Alves, V. F. F. (2016). Essays on strategic queueing. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/26015
Chicago Manual of Style (16th Edition):
Alves, Vasco Filipe Figueiredo. “Essays on strategic queueing.” 2016. Doctoral Dissertation, University of Edinburgh. Accessed February 27, 2021.
http://hdl.handle.net/1842/26015.
MLA Handbook (7th Edition):
Alves, Vasco Filipe Figueiredo. “Essays on strategic queueing.” 2016. Web. 27 Feb 2021.
Vancouver:
Alves VFF. Essays on strategic queueing. [Internet] [Doctoral dissertation]. University of Edinburgh; 2016. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1842/26015.
Council of Science Editors:
Alves VFF. Essays on strategic queueing. [Doctoral Dissertation]. University of Edinburgh; 2016. Available from: http://hdl.handle.net/1842/26015

University of Illinois – Urbana-Champaign
14.
Lee, Ulysses.
Backpressure networks with cooperative link augmentation.
Degree: MS, Electrical And Computer Engineering, 2016, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/95515
► We investigate a cross-layer communication technique which jointly lever- ages diversity gain from cooperative communications relaying and optimal throughput characteristics of backpressure networking. In particular,…
(more)
▼ We investigate a cross-layer communication technique which jointly lever-
ages diversity gain from cooperative communications relaying and optimal
throughput characteristics of backpressure networking. In particular, we
address the capacity limitations of backpressure networks within fading en-
vironments by the retasking of a cooperating node as a relay with potentially
heterogeneous transmission architecture. Retasking a node as a cooperative
relay can temporally allocate resources of one particular session within the
backpressure network onto another session, thereby allowing for a more flex-
ible physical (PHY) layer for traffic load balancing. With this, we derive a
scheduling method that ensures timely delivery of information in networks
without predetermined infrastructure.
Within this thesis, we propose the architecture of an amplify-and-forward
relay for cooperative communications and derive the performance of multi-
ple cooperative nodes utilizing this architecture. We also propose a suitable
medium access control (MAC) layer facilitating the scheduling and decision
making of nearby relay node candidates. The proposed architecture may be of potential interest for emerging device-to-device (D2D) and swarming mesh
networks.
Advisors/Committee Members: Singer, Andrew Carl (advisor).
Subjects/Keywords: Cooperative Diversity; Backpressure Routing; Network Queueing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lee, U. (2016). Backpressure networks with cooperative link augmentation. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95515
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Lee, Ulysses. “Backpressure networks with cooperative link augmentation.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed February 27, 2021.
http://hdl.handle.net/2142/95515.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lee, Ulysses. “Backpressure networks with cooperative link augmentation.” 2016. Web. 27 Feb 2021.
Vancouver:
Lee U. Backpressure networks with cooperative link augmentation. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/2142/95515.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lee U. Backpressure networks with cooperative link augmentation. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95515
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin
15.
Reddy, Akula Aneesh.
On distributed scheduling for wireless networks with time-varying channels.
Degree: PhD, Electrical and Computer Engineering, 2013, University of Texas – Austin
URL: http://hdl.handle.net/2152/25223
► Wireless scheduling is a fundamental problem in wireless networks that involves scheduling transmissions of multiple users in order to support data flows with as high…
(more)
▼ Wireless scheduling is a fundamental problem in wireless networks that involves scheduling transmissions of multiple users in order to support data flows with as high rates as possible. This problem was first addressed by Tassuilas and Ephremides, resulting in the celebrated Back-Pressure network scheduling algorithm. This algorithm schedules network links to maximize throughput in an opportunistic fashion using instantaneous network state information (NSI), i.e., queue and channel state knowledge across the entire network. However, the Back-Pressure (BP) algorithm suffers from various drawbacks - (a) it requires knowledge of instantaneous NSI from the whole network, i.e. feedback about time-varying channel and queue states from all links of the network, (b) the algorithm requires solving a global optimization problem at each time to determine the schedule, making it highly centralized. Further, Back-pressure algorithm was originally designed for wireless networks where interference is modeled using protocol interference model. As recent break-throughs in full-duplex communications and interference cancelation techniques provide greatly increased capacity and scheduling flexibility, it is not clear how BP algorithm can be modified to improve the data rates and reduce the delay. In this thesis, we address the drawbacks of Back-Pressure algorithm to some extent. In particular, our first work provides a new scheduling algorithm (similar to BP) that allows users to make individual decisions (distributed) based on heterogeneously delayed network state information (NSI). Regarding the complexity issue, in our second work, we analyze the performance of the greedy version of BP algorithm, known as Greedy Maximal Scheduling (GMS) and understand the effect of channel variations on the performance of GMS. In particular, we characterize the efficiency ratio of GMS in wireless networks with fading. In our third and fourth work, we propose and analyze new scheduling algorithms that can benefit from new advancements in interference cancelation techniques.
Advisors/Committee Members: Shakkottai, Sanjay (advisor).
Subjects/Keywords: Wireless networks; Queueing theory; Scheduling algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Reddy, A. A. (2013). On distributed scheduling for wireless networks with time-varying channels. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/25223
Chicago Manual of Style (16th Edition):
Reddy, Akula Aneesh. “On distributed scheduling for wireless networks with time-varying channels.” 2013. Doctoral Dissertation, University of Texas – Austin. Accessed February 27, 2021.
http://hdl.handle.net/2152/25223.
MLA Handbook (7th Edition):
Reddy, Akula Aneesh. “On distributed scheduling for wireless networks with time-varying channels.” 2013. Web. 27 Feb 2021.
Vancouver:
Reddy AA. On distributed scheduling for wireless networks with time-varying channels. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2013. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/2152/25223.
Council of Science Editors:
Reddy AA. On distributed scheduling for wireless networks with time-varying channels. [Doctoral Dissertation]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/25223

University of Debrecen
16.
Pál, Márk János.
Sorbanállási elméleti problémák elemzése
.
Degree: DE – Informatikai Kar, University of Debrecen
URL: http://hdl.handle.net/2437/276960
► A dolgozatban sorbanállási problémákat fogok elemezni és vizsgálni; megnézni, hogy hogyan lehet a sorbanállási rendszerekben lévő problémákat kezelni, javítani, s sorbanállási rendszereket elemző alkalmazások segítségével…
(more)
▼ A dolgozatban sorbanállási problémákat fogok elemezni és vizsgálni; megnézni, hogy hogyan lehet a sorbanállási rendszerekben lévő problémákat kezelni, javítani, s sorbanállási rendszereket elemző alkalmazások segítségével kimutatásokat/grafikonokat készíteni. A Kendall-jelölés elmagyarázása után a következő rendszereket fogom vizsgálni: M/M/1 rendszer, M/M/c r., M/M/1/K r., M/M/1 r. tétovázó igények esetén, M/M/n/n r., M/M/1 r. abszolut - és relatív prioritásos r., M/M/1/K/K.
Advisors/Committee Members: Sztrik, János (advisor).
Subjects/Keywords: sorbanállás;
queueing;
queueing systems;
sorbanállás elmélet;
queueing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pál, M. J. (n.d.). Sorbanállási elméleti problémák elemzése
. (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/276960
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Pál, Márk János. “Sorbanállási elméleti problémák elemzése
.” Thesis, University of Debrecen. Accessed February 27, 2021.
http://hdl.handle.net/2437/276960.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Pál, Márk János. “Sorbanállási elméleti problémák elemzése
.” Web. 27 Feb 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
Pál MJ. Sorbanállási elméleti problémák elemzése
. [Internet] [Thesis]. University of Debrecen; [cited 2021 Feb 27].
Available from: http://hdl.handle.net/2437/276960.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.
Council of Science Editors:
Pál MJ. Sorbanállási elméleti problémák elemzése
. [Thesis]. University of Debrecen; Available from: http://hdl.handle.net/2437/276960
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

University of Waterloo
17.
Cheng, Nan.
Opportunistic Spectrum Utilization for Vehicular Communication Networks.
Degree: 2016, University of Waterloo
URL: http://hdl.handle.net/10012/10561
► Recently, vehicular networks (VANETs), has become the key technology of the next-generation intelligent transportation systems (ITS). By incorporating wireless communication and networking capabilities into automobiles,…
(more)
▼ Recently, vehicular networks (VANETs), has become the key technology of the next-generation intelligent transportation systems (ITS). By incorporating wireless communication and networking capabilities into automobiles, information can be efficiently and reliably disseminated among vehicles, road side units, and infrastructure, which enables a number of novel applications enhancing the road safety and providing the drivers/passengers with an information-rich environment.
With the development of mobile Internet, people want to enjoy the Internet access in vehicles just as anywhere else. This fact, along with the soaring number of connected vehicles and the emerging data-craving applications and services, has led to a problem of spectrum scarcity, as the current spectrum bands for VANETs are difficult to accommodate the increasing mobile data demands. In this thesis, we aim to solve this problem by utilizing extra spectrum bands, which are not originally allocated for vehicular communications. In this case, the spectrum usage is based on an opportunistic manner, where the spectrum is not available if the primary system is active, or the vehicle is outside the service coverage due to the high mobility. We will analyze the features of such opportunistic spectrum, and design efficient protocols to utilize the spectrum for VANETs.
Firstly, the application of cognitive radio technologies in VANETs, termed CR-VANETs, is proposed and analyzed. In CR-VANETs, the channel availability is severely affected by the street patterns and the mobility features of vehicles. Therefore, we theoretically analyze the channel availability in urban scenario, and obtain its statistics. Based on the knowledge of channel availability, an efficient channel access scheme for CR-VANETs is then designed and evaluated. Secondly, using WiFi to deliver mobile data, named WiFi offloading, is employed to deliver the mobile data on the road, in order to relieve the burden of the cellular networks, and provide vehicular users with a cost-effective data pipe. Using queueing theory, we analyze the offloading performance with respect to the vehicle mobility model and the users' QoS preferences. Thirdly, we employ device-to-device (D2D) communications in VANETs to further improve the spectrum efficiency. In a vehicular D2D (V-D2D) underlaying cellular network, proximate vehicles can directly communicate with each other with a relatively small transmit power, rather than traversing the base station. Therefore, many current transmissions can co-exist on one spectrum resource block. By utilizing the spatial diversity, the spectrum utilization is greatly enhanced. We study the performance of the V-D2D underlaying cellular network, considering the vehicle mobility and the street pattern. We also investigate the impact of the preference of D2D/cellular mode on the interference and network throughput, and obtain the theoretical results.
In summary, the analysis and schemes developed in this thesis are useful to understand the future VANETs with heterogeneous…
Subjects/Keywords: VANETs; Vehicular Communication; Cognitive radio; Game theory; Queueing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cheng, N. (2016). Opportunistic Spectrum Utilization for Vehicular Communication Networks. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10561
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Cheng, Nan. “Opportunistic Spectrum Utilization for Vehicular Communication Networks.” 2016. Thesis, University of Waterloo. Accessed February 27, 2021.
http://hdl.handle.net/10012/10561.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Cheng, Nan. “Opportunistic Spectrum Utilization for Vehicular Communication Networks.” 2016. Web. 27 Feb 2021.
Vancouver:
Cheng N. Opportunistic Spectrum Utilization for Vehicular Communication Networks. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/10012/10561.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Cheng N. Opportunistic Spectrum Utilization for Vehicular Communication Networks. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10561
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science
18.
Sukumaran, Vineeth Bala.
On the Tradeoff Of Average Delay, Average Service Cost, and Average Utility for Single Server Queues with Monotone Policies.
Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/3434
► In this thesis, we study the tradeoff of average delay with average service cost and average utility for both continuous time and discrete time single…
(more)
▼ In this thesis, we study the tradeoff of average delay with average service cost and average utility for both continuous time and discrete time single server
queueing models without and with admission control. The continuous time and discrete time
queueing models that we consider are motivated by cross-layer models for point-to-point links with random packet arrivals and fading at slow and fast time scales. Our studies are motivated by the need to optimally tradeoff the average delay of the packets (a network layer performance measure) with the average service cost of transmitting the packets, e.g. the average power required for transmission (a physical layer performance measure) under a lower bound constraint on the average throughput, in various point-to-point communication scenarios.
The tradeoff problems are studied for a class of monotone and stationary scheduling policies and under the assumption that the service cost rate and utility rate are respectively convex and concave functions of the service rate and arrival rate. We also consider the problem of optimally trading off the average delay and average error rate of randomly arriving message symbols which are transmitted over a noisy point-to-point link, in which case the service cost function is non-convex.
The solutions to the tradeoff problems that we address in the thesis are asymptotic in nature, and are similar in spirit to the Berry-Gallager asymptotic bounds. It is intuitive that to keep a queue stable under a lower bound constraint on the average utility a minimum number of customers have to be served per unit time. This in turn implies that queue stability requires a minimum average service cost expenditure. In the thesis we obtain an asymptotic characterization of the minimum average delay for monotone stationary policies
subject to an upper bound constraint on the average service cost and a lower bound constraint on the average utility, in the asymptotic regime where the average service cost constraint is made arbitrarily close to the above minimum average service cost.
In the thesis, we obtain asymptotic lower bounds on the minimum average delay for the cases for which lower bounds were previously not known. The asymptotic characterization of the minimum average delay for monotone stationary policies, for both continuous time and discrete time models, is obtained via geometric bounds on the stationary probability of the queue length, in the above asymptotic regime. The restriction to monotone stationary policies enables us to obtain an intuitive explanation for the behaviour of the asymptotic lower bounds using the above geometric bounds on the stationary probability distribution of the queue length. The geometric bounds on the stationary probability of the queue length also lead to a partial asymptotic characterization of the structure of any optimal monotone stationary policy, in the above asymptotic regime, which was not available in previous work. Furthermore, the geometric bounds on the stationary probability can be extended to analyse…
Advisors/Committee Members: Mukherji, Utpal (advisor).
Subjects/Keywords: Queueing Models; Single Server Queueing Models; Discrete Time Queueing Models; M/M/1 Queueing Model; Continous Time Queueing Models; Point To Point Communication Links - Average Delay Tradeoff; Fading Wiress Comminication Links - Average Delay Tradeoff; M/M/1 Queue; Discrete Time Single Server Queues; Single Server Queueing Models - Average Utility Tradeoff; Queueing Theory; Single Server Queues - Monotone Policies; Communication
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sukumaran, V. B. (2018). On the Tradeoff Of Average Delay, Average Service Cost, and Average Utility for Single Server Queues with Monotone Policies. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3434
Chicago Manual of Style (16th Edition):
Sukumaran, Vineeth Bala. “On the Tradeoff Of Average Delay, Average Service Cost, and Average Utility for Single Server Queues with Monotone Policies.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed February 27, 2021.
http://etd.iisc.ac.in/handle/2005/3434.
MLA Handbook (7th Edition):
Sukumaran, Vineeth Bala. “On the Tradeoff Of Average Delay, Average Service Cost, and Average Utility for Single Server Queues with Monotone Policies.” 2018. Web. 27 Feb 2021.
Vancouver:
Sukumaran VB. On the Tradeoff Of Average Delay, Average Service Cost, and Average Utility for Single Server Queues with Monotone Policies. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 Feb 27].
Available from: http://etd.iisc.ac.in/handle/2005/3434.
Council of Science Editors:
Sukumaran VB. On the Tradeoff Of Average Delay, Average Service Cost, and Average Utility for Single Server Queues with Monotone Policies. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3434

University of Toronto
19.
WANG, LU.
Operations Management of Crowdsourcing and Crowd Behavior.
Degree: PhD, 2017, University of Toronto
URL: http://hdl.handle.net/1807/82382
► This thesis studies problems in operations management about how to manage crowd behavior. In the first chapter, we investigate the crowdsourcing contest. In a crowdsourcing…
(more)
▼ This thesis studies problems in operations management about how to manage crowd behavior. In the first chapter, we investigate the crowdsourcing contest. In a crowdsourcing contest, innovation is outsourced by a firm to an open crowd that compete in generating innovative solutions. Since the projects typically consist of multiple attributes, we consider two alternative mechanisms. One is a simultaneous contest, where the best solution is chosen from the aggregate solutions simultaneously submitted by all contestants. The other is multiple sequential sub-contests, with each dedicated to one attribute and the contestants asked to build upon the best work in progress from previous sub-contests. The comparison of the expected \emph{best} performances in the two contests depends on the project's characteristics.
In the second chapter, we study the revenue sharing policy in the subscription platform. Subscription providers such as Spotify, Netflix and OneGo (an all-you-can-fly subscription service provider) crowdsource products/services from many vendors and bundle them for the price of one. The collected subscription fees for the bundle then are allocated according to the realized contributions by each crowdsourced product. However, this allocation scheme may create incentive incompatibility for vendors, given their options of not joining the bundle. We examine the incentive compatibility of different parties under various bundling strategies.
In the third chapter, we study the customer behavior with an online reservation system. Online reservation system allows customers to join a queue and virtually wait for service before arriving on site. For example, some platforms have been designed to collect the information of restaurants and show the real-time congestion levels (e.g., Nowait). We consider a model in which customers must travel from their location to the service area and incur a travelling cost. When customers intend to book service online, they are informed about their positions in the queue at the time of booking, so that they make their decision whether to join the queue taking into account both their travelling time and expected waiting time. With those customer behaviors, the optimal policy of a firm heavily relies on the conditions of the travelling and benefit of the service.
Advisors/Committee Members: Hu, Ming, Management.
Subjects/Keywords: Bundling theory; Crowdsourcing contest; Queueing theory; Strategic behavior; Subscription service; Tournament theory; 0454
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
WANG, L. (2017). Operations Management of Crowdsourcing and Crowd Behavior. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/82382
Chicago Manual of Style (16th Edition):
WANG, LU. “Operations Management of Crowdsourcing and Crowd Behavior.” 2017. Doctoral Dissertation, University of Toronto. Accessed February 27, 2021.
http://hdl.handle.net/1807/82382.
MLA Handbook (7th Edition):
WANG, LU. “Operations Management of Crowdsourcing and Crowd Behavior.” 2017. Web. 27 Feb 2021.
Vancouver:
WANG L. Operations Management of Crowdsourcing and Crowd Behavior. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1807/82382.
Council of Science Editors:
WANG L. Operations Management of Crowdsourcing and Crowd Behavior. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/82382

University of Southern California
20.
Honnappa, Harsha.
Strategic and transitory models of queueing systems.
Degree: PhD, Electrical Engineering, 2014, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081
► Stochastic network theory, and queueing theory in particular, is the bedrock for the analysis and control of resource constrained systems. Such systems are manifest in…
(more)
▼ Stochastic network
theory, and
queueing theory in
particular, is the bedrock for the analysis and control of resource
constrained systems. Such systems are manifest in our world: in
healthcare delivery, shared computing, communications and
transportation systems, system operators observe high demand for
services necessitating queue management. 'Classical'
queueing
theory has largely focused on the analysis of stationary and
ergodic models. However, most real world resource allocation
systems exhibit time-dependent arrival and service. Further, many
systems operate only on a finite time horizon, or system operators
are interested in the 'small-time' or transient behavior of a
queueing system. In this dissertation, we initiate the development
of models of such 'transitory'
queueing systems. Our first
contribution is the introduction of several disparate models of
multiple server transitory queues. We develop fluid and diffusion
approximations, using a mathematical technique called 'Population
Acceleration'. Next, we extend this analysis to generalized Jackson
networks. The diffusion approximations are completely unlike the
conventional heavy-traffic diffusion approximations. Our second
major contribution is the development of game theoretic models of
traffic and routing in generalized Jackson networks. Almost all
queueing models assume exogeneous arrivals, routing and service.
However, in many situations, like early morning commutes, users are
strategic in when they decide to join a service system and which
route to take, so that they minimize their sojourn time. We
identify the Nash equilibrium traffic and routing profile when
users are strategic.
Advisors/Committee Members: Jain, RahulWard, Amy R. (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Neely, Michael J. (Committee Member).
Subjects/Keywords: queueing theory; applied probability; game theory; stochastic process limits; empirical process theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Honnappa, H. (2014). Strategic and transitory models of queueing systems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081
Chicago Manual of Style (16th Edition):
Honnappa, Harsha. “Strategic and transitory models of queueing systems.” 2014. Doctoral Dissertation, University of Southern California. Accessed February 27, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081.
MLA Handbook (7th Edition):
Honnappa, Harsha. “Strategic and transitory models of queueing systems.” 2014. Web. 27 Feb 2021.
Vancouver:
Honnappa H. Strategic and transitory models of queueing systems. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Feb 27].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081.
Council of Science Editors:
Honnappa H. Strategic and transitory models of queueing systems. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081
21.
Sathian, M.K.
Control policies in repiar of k-out-of-n systems.
Degree: 2016, Cochin University of Science and Technology
URL: http://dyuthi.cusat.ac.in/purl/5184
Subjects/Keywords: Queueing Theory; Markov Chain Model
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sathian, M. K. (2016). Control policies in repiar of k-out-of-n systems. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/5184
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Sathian, M K. “Control policies in repiar of k-out-of-n systems.” 2016. Thesis, Cochin University of Science and Technology. Accessed February 27, 2021.
http://dyuthi.cusat.ac.in/purl/5184.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Sathian, M K. “Control policies in repiar of k-out-of-n systems.” 2016. Web. 27 Feb 2021.
Vancouver:
Sathian MK. Control policies in repiar of k-out-of-n systems. [Internet] [Thesis]. Cochin University of Science and Technology; 2016. [cited 2021 Feb 27].
Available from: http://dyuthi.cusat.ac.in/purl/5184.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Sathian MK. Control policies in repiar of k-out-of-n systems. [Thesis]. Cochin University of Science and Technology; 2016. Available from: http://dyuthi.cusat.ac.in/purl/5184
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Carnegie Mellon University
22.
Doroudi, Sherwin.
Stochastic Analysis of Maintenance and Routing Policies in Queueing Systems.
Degree: 2016, Carnegie Mellon University
URL: http://repository.cmu.edu/dissertations/814
► This dissertation focuses on reexamining traditional management problems that emerge in service systems where customers or jobs queue for service. In particular, we investigate how…
(more)
▼ This dissertation focuses on reexamining traditional management problems that emerge in service systems where customers or jobs queue for service. In particular, we investigate how a manger should make maintenance and routing decisions in settings where there is a departure from traditional modeling assumptions. In many cases, the performance evaluation of a management problems has, at its heart, a complex, infinite Markov chain which must be solved before any optimization can begin. Unfortunately, most Markov chains are not analytically tractable. In the first essay, we address the solution of infinite state Markov chains. We focus on class M Markov chains, a broad class of chains which is representative of a wide array of problems arising in the management of computer, service, and manufacturing systems where queueing parameters change over time according to a restricted stochastic pattern. We develop a new method, called Clearing Analysis on Phases, for the limiting probability distribution of such chains in exact closed form. In the second essay, we apply the CAP method to answer the question of how a manager should maintain a system in a setting where an online customer-facing service is vulnerable to persistent malware infections. These infections can cause performance degradation and facilitate data theft, both of which have monetary repercussions. Infections can go undetected and can only be removed by a timeconsuming cleanup procedure, which takes the service offline and causes all existing jobs to be discarded without service. In particular, we provide recommendations for when (and in response to what events) a manager should initiate cleanup procedures by solving an infinite state maintenance problem. We quantify the efficiency of various cleanup (maintenance) policies by proposing a revenue model which incorporates both delay-based pricing and data theft costs. In the third essay, we examine queueing systems in call centers and answer the question of a how a manager should route customers to strategic staff who choose their own service rates in response to workload incentives. We address this problem using game theoretic techniques. In particular, we introduce a utility model where the servers choose their service rate in order to maximize a tradeoff between an “effort cost” and a “value of idleness.” We find that relaxing the classical assumption that all servers work at a fixed rate renders traditional routing policies inadequate. Our approach allows us to recommend novel routing policies that are both fair for the staff and efficient for the customers. In the fourth essay we look at web server farms and answer the question of how jobs should be immediately routed to computer servers in a setting where some jobs are more valuable or more important than others. Such settings arise when some jobs are generated by users who are paying for a premium service. We address how a manager should incorporate information about a job’s value when making routing decisions in order to minimize expected value-weighted…
Subjects/Keywords: Queueing Theory; Stochastic Processes; Markov Chains; Computer Security; Malware; Call Centers
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Doroudi, S. (2016). Stochastic Analysis of Maintenance and Routing Policies in Queueing Systems. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/814
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Doroudi, Sherwin. “Stochastic Analysis of Maintenance and Routing Policies in Queueing Systems.” 2016. Thesis, Carnegie Mellon University. Accessed February 27, 2021.
http://repository.cmu.edu/dissertations/814.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Doroudi, Sherwin. “Stochastic Analysis of Maintenance and Routing Policies in Queueing Systems.” 2016. Web. 27 Feb 2021.
Vancouver:
Doroudi S. Stochastic Analysis of Maintenance and Routing Policies in Queueing Systems. [Internet] [Thesis]. Carnegie Mellon University; 2016. [cited 2021 Feb 27].
Available from: http://repository.cmu.edu/dissertations/814.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Doroudi S. Stochastic Analysis of Maintenance and Routing Policies in Queueing Systems. [Thesis]. Carnegie Mellon University; 2016. Available from: http://repository.cmu.edu/dissertations/814
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Cornell University
23.
Braverman, Anton.
Stein's method for steady-state diffusion approximations.
Degree: PhD, Operations Research, 2017, Cornell University
URL: http://hdl.handle.net/1813/51668
► Diffusion approximations have been a popular tool for performance analysis in queueing theory, with the main reason being tractability and computational efficiency. This dissertation is…
(more)
▼ Diffusion approximations have been a popular tool for performance analysis in
queueing theory, with the main reason being tractability and computational efficiency. This dissertation is concerned with establishing theoretical guarantees on the performance of steady-state diffusion approximations of
queueing systems. We develop a modular framework based on Stein's method that allows us to establish error bounds, or convergence rates, for the approximations. We apply this framework three
queueing systems: the Erlang-C, Erlang-A, and M/Ph/n+M systems.
The former two systems are simpler and allow us to showcase the full potential of the framework. Namely, we prove that both
Wasserstein and Kolmogorov distances between the stationary
distribution of a normalized customer count process, and that of an
appropriately defined diffusion process decrease at a rate of
1/√{R}, where R is the offered load. Futhermore, these error
bounds are \emph{universal}, valid in any load condition from
lightly loaded to heavily loaded. For the Erlang-C model, we also show that a diffusion approximation with state-dependent diffusion coefficient can achieve a rate of convergence of 1/R, which is an order of magnitude faster when compared to approximations with constant diffusion coefficients.
Advisors/Committee Members: Dai, J.G. (chair), Minca, Andreea (chair), Jarrow, Robert (committee member), Henderson, Shane (committee member).
Subjects/Keywords: Operations research; Diffusion approximation; queueing theory; steady state; Stein method
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Braverman, A. (2017). Stein's method for steady-state diffusion approximations. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/51668
Chicago Manual of Style (16th Edition):
Braverman, Anton. “Stein's method for steady-state diffusion approximations.” 2017. Doctoral Dissertation, Cornell University. Accessed February 27, 2021.
http://hdl.handle.net/1813/51668.
MLA Handbook (7th Edition):
Braverman, Anton. “Stein's method for steady-state diffusion approximations.” 2017. Web. 27 Feb 2021.
Vancouver:
Braverman A. Stein's method for steady-state diffusion approximations. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1813/51668.
Council of Science Editors:
Braverman A. Stein's method for steady-state diffusion approximations. [Doctoral Dissertation]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/51668

Texas A&M University
24.
Hsu, Fang-Han.
Copy Number and Gene Expression: Stochastic Modeling and Therapeutic Application.
Degree: PhD, Electrical Engineering, 2013, Texas A&M University
URL: http://hdl.handle.net/1969.1/149298
► The advances of high-throughput technologies, such as next-generation sequencing and microarrays, have rapidly improved the accessibility of molecular profiles in tumor samples. However, due to…
(more)
▼ The advances of high-throughput technologies, such as next-generation sequencing and microarrays, have rapidly improved the accessibility of molecular profiles in tumor samples. However, due to the immaturity of relevant theories, analyzing these data and systematically understanding the underlying mechanisms causing diseases, which are essential in the development of therapeutic applications, remain challenging.
This dissertation attempts to clarify the effects of DNA copy number alterations (CNAs), which are known to be common mutations in genetic diseases, on steady- state gene expression values, time-course expression activities, and the effectiveness of targeted therapy. Assuming DNA copies operate as independent subsystems producing gene transcripts,
queueing theory is applied to model the stochastic processes representing the arrival of transcription factors (TFs) and the departure of mRNA. The copy-number-gene-expression relationships are shown to be generally nonlinear. Based on the mRNA production rates of two transcription models, one corresponding to an unlimited state with prolific production and one corresponding to a restrictive state with limited production, the dynamic effects of CNAs on gene expression are analyzed. Simulations reveal that CNAs can alter the amplitudes of transcriptional bursting and transcriptional oscillation, suggesting the capability of CNAs to interfere with the regulatory signaling mechanism. With this finding, a string-structured Bayesian network that models a signaling pathway and incorporates the interference due to CNAs is proposed. Using mathematical induction, the upstream and downstream CNAs are found to have equal influence on drug effectiveness. Scoring functions for the detection of unfavorable CNAs in targeted therapy are consequently proposed.
Rigorous experiments are keys to unraveling the etiology of genetic diseases such as cancer, and the proposed models can be applied to provide
theory-supporting hypotheses for experimental design.
Advisors/Committee Members: Serpedin, Erchin (advisor), Dougherty, Edward R (advisor), Ivanov, Ivan (committee member), Yoon, Byung-Jun (committee member).
Subjects/Keywords: copy number alterations; gene expression; queueing theory; Bayesian network; drug effectiveness
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hsu, F. (2013). Copy Number and Gene Expression: Stochastic Modeling and Therapeutic Application. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/149298
Chicago Manual of Style (16th Edition):
Hsu, Fang-Han. “Copy Number and Gene Expression: Stochastic Modeling and Therapeutic Application.” 2013. Doctoral Dissertation, Texas A&M University. Accessed February 27, 2021.
http://hdl.handle.net/1969.1/149298.
MLA Handbook (7th Edition):
Hsu, Fang-Han. “Copy Number and Gene Expression: Stochastic Modeling and Therapeutic Application.” 2013. Web. 27 Feb 2021.
Vancouver:
Hsu F. Copy Number and Gene Expression: Stochastic Modeling and Therapeutic Application. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1969.1/149298.
Council of Science Editors:
Hsu F. Copy Number and Gene Expression: Stochastic Modeling and Therapeutic Application. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/149298

Victoria University of Wellington
25.
Ansell, Jordan.
Assessing the Accuracy of Performance Modelling in Software Defined Networks.
Degree: 2017, Victoria University of Wellington
URL: http://hdl.handle.net/10063/6672
► Analytical modelling and experimental measurement can are used to evaluate the performance of a network. Models provide insight and measurement provides realism. For software defined…
(more)
▼ Analytical modelling and experimental measurement can are used to evaluate the performance of a network. Models provide insight and measurement provides realism.
For software defined networks (SDN) it is unknown how well the existing
queueing models represent the performance of a real SDN network. This leads to uncertainty between what can be predicted and the actual behaviour of a software defined network.
This work investigates the accuracy of software defined network
queueing models. This is done through comparing the performance results of analytical models to experimental performance results.
The outcome of this is an understanding of how reliable the existing
queueing models are and areas where the
queueing models can be improved.
Advisors/Committee Members: Seah, Winston.
Subjects/Keywords: SDN; Queueing Theory; Performance; Analysis; Measurement; Networks; Software defined networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ansell, J. (2017). Assessing the Accuracy of Performance Modelling in Software Defined Networks. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6672
Chicago Manual of Style (16th Edition):
Ansell, Jordan. “Assessing the Accuracy of Performance Modelling in Software Defined Networks.” 2017. Masters Thesis, Victoria University of Wellington. Accessed February 27, 2021.
http://hdl.handle.net/10063/6672.
MLA Handbook (7th Edition):
Ansell, Jordan. “Assessing the Accuracy of Performance Modelling in Software Defined Networks.” 2017. Web. 27 Feb 2021.
Vancouver:
Ansell J. Assessing the Accuracy of Performance Modelling in Software Defined Networks. [Internet] [Masters thesis]. Victoria University of Wellington; 2017. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/10063/6672.
Council of Science Editors:
Ansell J. Assessing the Accuracy of Performance Modelling in Software Defined Networks. [Masters Thesis]. Victoria University of Wellington; 2017. Available from: http://hdl.handle.net/10063/6672

Duke University
26.
Chen, Mingliu.
Stochastic Optimization in Market Design and Incentive Management Problems
.
Degree: 2020, Duke University
URL: http://hdl.handle.net/10161/20989
► This dissertation considers practical operational settings, in which a decision maker needs to either coordinate preferences or to align incentives among different parties. We…
(more)
▼ This dissertation considers practical operational settings, in which a decision maker needs to either coordinate preferences or to align incentives among different parties. We formulate these issues into stochastic optimization problems and use a variety of techniques from the theories of applied probability,
queueing and dynamic programming. First, we study a stochastic matching problem. We consider matching over time with short and long-lived players who are very sensitive to mismatch, and propose a novel method to characterize the mismatch. In particular, players' preferences are uniformly distributed on a circle, so the mismatch between two players is characterized by the one-dimensional circular angle between them. This framework allows us to capture matching processes in applications ranging from ride sharing to job hunting. Our analytical framework relies on threshold matching policies, and is focused on a limiting regime where players demonstrate low tolerance towards mismatch. This framework yields closed-form optimal matching thresholds. If the matching process is controlled by a centralized social planner (e.g. an online matching platform), the matching threshold reflects the trade-off between matching rate and matching quality. The corresponding optimal matching threshold is smaller than myopic matching threshold, which helps building market thickness. We further compare the centralized system with decentralized systems, where players decide their matching partners. We find that matching controlled by either side of the market may achieve optimal social welfare. Second, we consider a dynamic incentive management problem in which a principal induces effort from an agent to reduce the arrival rate of a Poisson process of adverse events. The effort is costly to the agent, and unobservable to the principal, unless the principal is monitoring the agent. Monitoring ensures effort but is costly to the principal. The optimal contract involves monetary payments and monitoring sessions that depend on past arrival times. We formulate the problem as a stochastic optimal control model and solve the problem analytically. The optimal schedules of payment and monitoring demonstrate different structures depending on model parameters. Overall, the optimal dynamic contracts are simple to describe, easy to compute and implement, and intuitive to explain.
Advisors/Committee Members: Sun, Peng (advisor).
Subjects/Keywords: Operations research;
Dynamic Programming;
Market Design;
Matching;
Mechanism Design;
Queueing Theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, M. (2020). Stochastic Optimization in Market Design and Incentive Management Problems
. (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/20989
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chen, Mingliu. “Stochastic Optimization in Market Design and Incentive Management Problems
.” 2020. Thesis, Duke University. Accessed February 27, 2021.
http://hdl.handle.net/10161/20989.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chen, Mingliu. “Stochastic Optimization in Market Design and Incentive Management Problems
.” 2020. Web. 27 Feb 2021.
Vancouver:
Chen M. Stochastic Optimization in Market Design and Incentive Management Problems
. [Internet] [Thesis]. Duke University; 2020. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/10161/20989.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chen M. Stochastic Optimization in Market Design and Incentive Management Problems
. [Thesis]. Duke University; 2020. Available from: http://hdl.handle.net/10161/20989
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

UCLA
27.
Corcoran, Taylor.
Drug Deals: Policies to Increase the Availability of Effective Medications.
Degree: Management (MS/PHD), 2019, UCLA
URL: http://www.escholarship.org/uc/item/6g07v080
► Two key issues faced by any policy maker in healthcare are providing effective treatments for ailments and ensuring that these treatments are available to patients.…
(more)
▼ Two key issues faced by any policy maker in healthcare are providing effective treatments for ailments and ensuring that these treatments are available to patients. In this dissertation, we use contract theory, epidemic modeling, and queueing theory to study the effectiveness and availability of treatment in the context of medicines and vaccines. In the first essay, ``Flexible FDA Approval Policies", we analyze the problem faced by the Food and Drug Administration (FDA) of deciding whether to approve or reject novel drugs based on evidence of their safety and efficacy. Traditionally, the FDA requires clinical trial evidence that is statistically significant at the 2.5% level, but the agency often uses regulatory discretion when making approval decisions. Factors including disease severity, prevalence, and availability of existing therapies are qualitatively considered, but transparent, quantitative guidelines that systematically assess these characteristics are lacking. We develop a novel queueing model of the drug approval process which explicitly incorporates these factors, as well as obsolescence, or when newer drugs replace older formulas. We show that the optimal significance level is higher for diseases with lengthy clinical trials, greater attrition rates in the development stage, low intensity of research and development, or low levels of obsolescence among drugs on the market. Using publicly available data, we estimate model parameters and calculate the optimal significance levels for drugs targeting three diseases: breast cancer, HIV, and hypertension. Our results indicate that the current 2.5% significance level is too stringent for some diseases yet too lenient for others. A counterfactual analysis of the FDA's Fast Track program demonstrates that, by bringing drugs to patients more quickly, this program achieves a level of societal benefit that cannot be attained by solely changing approval standards. The second essay, ``Contracts to Increase the Effectiveness and Availability of Vaccines", studies contractual issues between global health organizations (GHOs) and pharmaceutical companies in the vaccine supply chain for neglected tropical diseases (NTDs). NTDs are a diverse group of conditions that affect over 1 billion individuals worldwide but which have historically received inadequate funding. Current funding mechanisms, such as the Advanced Market Commitment, do not incentivize pharmaceutical companies to exert costly research and development (R&D) effort to develop highly efficacious vaccines. We develop a joint game-theoretic and epidemic model that allows us to study different payment contracts and their impact on the spread of the disease. We show that traditional wholesale price contracts perform poorly and at best mitigate – diminish the number of cases – the spread of the disease, while performance-based contracts that directly link payment to vaccine efficacy have the potential to eliminate – reduce the number of cases to zero – the disease.We formulate epidemic models for two NTDs:…
Subjects/Keywords: Management; Drug Approval; Epidemic Modeling; Game Theory; Neglected Diseases; Queueing Models
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Corcoran, T. (2019). Drug Deals: Policies to Increase the Availability of Effective Medications. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/6g07v080
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Corcoran, Taylor. “Drug Deals: Policies to Increase the Availability of Effective Medications.” 2019. Thesis, UCLA. Accessed February 27, 2021.
http://www.escholarship.org/uc/item/6g07v080.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Corcoran, Taylor. “Drug Deals: Policies to Increase the Availability of Effective Medications.” 2019. Web. 27 Feb 2021.
Vancouver:
Corcoran T. Drug Deals: Policies to Increase the Availability of Effective Medications. [Internet] [Thesis]. UCLA; 2019. [cited 2021 Feb 27].
Available from: http://www.escholarship.org/uc/item/6g07v080.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Corcoran T. Drug Deals: Policies to Increase the Availability of Effective Medications. [Thesis]. UCLA; 2019. Available from: http://www.escholarship.org/uc/item/6g07v080
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North-West University
28.
Van der Merwe, Zuann Stephanus.
A network traffic model for wireless mesh networks / Z.S. van der Merwe.
Degree: 2013, North-West University
URL: http://hdl.handle.net/10394/9229
► Design and management decisions require an accurate prediction of the performance of the network. Network performance estimation techniques require accurate network traffic models. In this…
(more)
▼ Design and management decisions require an accurate prediction of the performance of the network. Network performance estimation techniques require accurate network traffic models. In this thesis we are concerned with the modelling of network traffic for the wireless mesh network (WMN) environment. Queueing theory has been used in the past to model the WMN environment and we found in this study that queueing theory was used in two main methods to model WMNs. The first method is to consider each node in the network in terms of the number of hops it is away from the gateway.
Each node is then considered as a queueing station and the parameters for the station is derived from the number of hops each node is away from the gateway. These topologies can be very limiting in terms of the number of physical topologies they can model due to the fact that their parameters are only dependent on the number of hop-counts each node is away from the gateway. The second method is to consider a fixed topology with no gateways. This method simplifies analysis but once again is very limiting.
In this dissertation we propose a queueing based network traffic model that uses a connection matrix to define the topology of the network. We then derive the parameters for our model from the connection matrix. The connection matrix allows us to model a wider variety of topologies without modifying our model. We verify our model by comparing results from our model to results from a discrete event simulator and we validate our model by comparing results from our model to results from models previously proposed by other authors. By comparing results from our model to results of other models we show that our model is indeed capable of modelling a wider variety of topologies.
Subjects/Keywords: Network traffic model;
Queueing Theory;
Wireless Mesh Networks (WMN)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Van der Merwe, Z. S. (2013). A network traffic model for wireless mesh networks / Z.S. van der Merwe.
(Thesis). North-West University. Retrieved from http://hdl.handle.net/10394/9229
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Van der Merwe, Zuann Stephanus. “A network traffic model for wireless mesh networks / Z.S. van der Merwe.
” 2013. Thesis, North-West University. Accessed February 27, 2021.
http://hdl.handle.net/10394/9229.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Van der Merwe, Zuann Stephanus. “A network traffic model for wireless mesh networks / Z.S. van der Merwe.
” 2013. Web. 27 Feb 2021.
Vancouver:
Van der Merwe ZS. A network traffic model for wireless mesh networks / Z.S. van der Merwe.
[Internet] [Thesis]. North-West University; 2013. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/10394/9229.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Van der Merwe ZS. A network traffic model for wireless mesh networks / Z.S. van der Merwe.
[Thesis]. North-West University; 2013. Available from: http://hdl.handle.net/10394/9229
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Washington
29.
Ashrafi, Seyed Shwan.
Random Access over Multi-Packet Reception Channels: A Mean-Field Approach.
Degree: PhD, 2016, University of Washington
URL: http://hdl.handle.net/1773/37106
► This thesis addresses the problem of Multi-Packet Reception (MPR) for random access scenarios in Wireless LAN type infrastructure network. Our results builds on a recently…
(more)
▼ This thesis addresses the problem of Multi-Packet Reception (MPR) for random access scenarios in Wireless LAN type infrastructure network. Our results builds on a recently proposed physical-layer network coding mechanism – Compute-and-Forward (C&F); we embed this within slotted ALOHA and Carrier Sense Multiple Access (CSMA) protocols for operational scenarios where multiple simultaneous transmissions are likely to occur. A mean-field approach is used to understand the impact of multi-packet reception in random access networks. By focusing on a special family of MPR channels – the all-or-nothing model, stability conditions are derived for slotted ALOHA and CSMA systems under the above assumption. Interestingly, a number of physical-layer network coding schemes such as compute-and-forward, successive compute-and-forward (SCF) and successive interference cancellation can be viewed as special cases of all-or-nothing symmetric MPR model. In addition, the problem is analyzed under the general symmetric MPR channels which turns out not to be fundamentally different from the all-or-nothing MPR. The primary outcome is a deeper understanding of the behavior of random access schemes over general symmetric MPR channels. Due to the interaction among users and the challenges emanating from such interactions, random access can be more readily analyzed if the state of users are assumed decoupled and an approximate stability region obtained for the system. Nonetheless, the approximate stability region computation based on the decoupling assumption is still complicated for even small (few clients) networks. By a mean-field approach, the random access problem is studied in the large number of clients regime. As a result, the evolution of the system state in the limit can be well approximated by a deterministic dynamical system. The stability conditions for the limiting system then paves the way for a better understanding of a known/observed phenomenon called meta-stability whereby (finite) random-access networks undergo a phase transition: from stability to meta-stability. In the thesis, we first present results for slotted ALOHA with all-or-nothing MPR model. An approximate stability region is characterized which is then used for system performance evaluation in terms of throughput and delay. These results are then extended to the case of general symmetric MPR channels. Next, the stability of persistent CSMA systems is analyzed similar to slotted ALOHA analysis and throughput and delay results are obtained. Meta-stability is discussed for CSMA systems and system design guidelines are outlined to guarantee certain quality-of-service requirements, i.e., avoidance of meta-stable behavior. By adding a back-off mechanism, the stationary behavior of a saturated system is studied, again through mean-field analysis. Finally, we propose a novel extension to the cooperating multiple AP scenario for dense networks, where we present new algorithms for MPR-capable systems and present some initial analysis.
Advisors/Committee Members: Roy, Sumit (advisor).
Subjects/Keywords: Mean Field Analysis; Queueing Theory; Random Access; Electrical engineering; electrical engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ashrafi, S. S. (2016). Random Access over Multi-Packet Reception Channels: A Mean-Field Approach. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/37106
Chicago Manual of Style (16th Edition):
Ashrafi, Seyed Shwan. “Random Access over Multi-Packet Reception Channels: A Mean-Field Approach.” 2016. Doctoral Dissertation, University of Washington. Accessed February 27, 2021.
http://hdl.handle.net/1773/37106.
MLA Handbook (7th Edition):
Ashrafi, Seyed Shwan. “Random Access over Multi-Packet Reception Channels: A Mean-Field Approach.” 2016. Web. 27 Feb 2021.
Vancouver:
Ashrafi SS. Random Access over Multi-Packet Reception Channels: A Mean-Field Approach. [Internet] [Doctoral dissertation]. University of Washington; 2016. [cited 2021 Feb 27].
Available from: http://hdl.handle.net/1773/37106.
Council of Science Editors:
Ashrafi SS. Random Access over Multi-Packet Reception Channels: A Mean-Field Approach. [Doctoral Dissertation]. University of Washington; 2016. Available from: http://hdl.handle.net/1773/37106

New Jersey Institute of Technology
30.
Bai, Yitao.
Simulation study for the effect of dependencies in queueing systems.
Degree: MSin Industrial Engineering - (M.S.), Mechanical and Industrial Engineering, 1993, New Jersey Institute of Technology
URL: https://digitalcommons.njit.edu/theses/1257
► Few theoretical results have been obtained in the literature for the effects of dependencies between random variables on the performance of queueing systems. This…
(more)
▼ Few theoretical results have been obtained in the literature for the effects of dependencies between random variables on the performance of
queueing systems. This thesis aims at investigating this issue via simulation. Several dependencies are studied in detail, including dependencies between interarrival times, between interarrival time and service time, between service times and dependencies between different stages in networks of queues. We define several classes of dependent random variables and study their correlation coefficients, then we apply them to single and multiple station service systems. Comparisons with the independent case, for which the explicit form solution are available, are made and characterized by figures. The main contribution of this thesis is that it disproves the monotonicity properties of effect of dependencies on system performance in both single and multiple service stations
queueing systems. These results may be helpful in evaluating the performance of both telecommunication and manufacturing systems.
Advisors/Committee Members: Xiuli Chao, Suebsak Nanthavanij, Sanchoy K. Das.
Subjects/Keywords: Queueing theory.; Industrial Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bai, Y. (1993). Simulation study for the effect of dependencies in queueing systems. (Thesis). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/theses/1257
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Bai, Yitao. “Simulation study for the effect of dependencies in queueing systems.” 1993. Thesis, New Jersey Institute of Technology. Accessed February 27, 2021.
https://digitalcommons.njit.edu/theses/1257.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Bai, Yitao. “Simulation study for the effect of dependencies in queueing systems.” 1993. Web. 27 Feb 2021.
Vancouver:
Bai Y. Simulation study for the effect of dependencies in queueing systems. [Internet] [Thesis]. New Jersey Institute of Technology; 1993. [cited 2021 Feb 27].
Available from: https://digitalcommons.njit.edu/theses/1257.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Bai Y. Simulation study for the effect of dependencies in queueing systems. [Thesis]. New Jersey Institute of Technology; 1993. Available from: https://digitalcommons.njit.edu/theses/1257
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] [6] ▶
.