23 research outputs found
BRAVO for many-server QED systems with finite buffers
This paper demonstrates the occurrence of the feature called BRAVO (Balancing
Reduces Asymptotic Variance of Output) for the departure process of a
finite-buffer Markovian many-server system in the QED (Quality and
Efficiency-Driven) heavy-traffic regime. The results are based on evaluating
the limit of a formula for the asymptotic variance of death counts in finite
birth--death processes
A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types
The maintenance, repair, and overhaul (MRO) process is used to recondition equipment in the railroad, off-shore drilling, aircraft, and shipping industries. In the typical MRO process, the equipment is disassembled into component parts and these parts are routed to back-shops for repair. Repaired parts are returned for reassembling the equipment. Scheduling the back-shop for smooth flow often requires prioritizing the repair of component parts from different original assemblies at different machines. To enable such prioritization, we model the back-shop as a multi-class queueing network with a ConWIP execution system and introduce a new priority scheme to maximize the system performance. In this scheme, we identify the bottleneck machine based on overall workload and classify machines into two categories: the bottleneck machine and the non-bottleneck machine(s). Assemblies with the lowest cycle time receive the highest priority on the bottleneck machine and the lowest priority on non-bottleneck machine(s). Our experimental results show that this priority scheme increases the system performance by lowering the average cycle times without adversely impacting the total throughput.
The contribution of this thesis consists primarily of three parts. First, we develop a simple priority scheme for multi-class, multi-server, ConWIP queueing systems with the disassembly/reassembly feature so that schedulers for a job-shop environment would be able to know which part should be given priority, in what order and where. Next, we provide an exact analytical solution to a two-class, two-server closed queueing model with mixed non-preemptive priority scheme. The queueing network model we study has not been analyzed in the literature, and there are no existing models that address the underlying problem of deciding prioritization by job types to maximize the system performance. Finally, we explore conditions under which the non-preemptive priority discipline can be approximated by a preemptive priority discipline
Spectral gap of the Erlang A model in the Halfin-Whitt regime
We consider a hybrid diffusion process that is a combination of two
Ornstein-Uhlenbeck processes with different restraining forces. This process
serves as the heavy-traffic approximation to the Markovian many-server queue
with abandonments in the critical Halfin-Whitt regime. We obtain an expression
for the Laplace transform of the time-dependent probability distribution, from
which the spectral gap is explicitly characterized. The spectral gap gives the
exponential rate of convergence to equilibrium. We further give various
asymptotic results for the spectral gap, in the limits of small and large
abandonment effects. It turns out that convergence to equilibrium becomes
extremely slow for overloaded systems with small abandonment effects.Comment: 48 page
A review of connection admission control algorithms for ATM networks
The emergence of high-speed networks such as those with ATM integrates large numbers of services with a wide range of characteristics. Admission control is a prime instrument for controlling congestion in the network. As part of connection services to an ATM system, the Connection Admission Control (CAC) algorithm decides if another call or connection can be admitted to the Broadband Network. The main task of the CAC is to ensure that the broadband resources will not saturate or overflow within a very small probability. It limits the connections and guarantees Quality of Service for the new connection. The algorithm for connection admission is crucial in determining bandwidth utilisation efficiency. With statistical multiplexing more calls can be allocated on a network link, while still maintaining the Quality of Service specified by the connection with traffic parameters and type of service.
A number of algorithms for admission control for Broadband Services with ATM Networks are described and compared for performance under different traffic loads. There is a general description of the ATM Network as an introduction. Issues to do with source distributions and traffic models are explored in Chapter 2. Chapter 3 provides an extensive presentation of the CAC algorithms for ATM Broadband Networks. The ideas about the Effective Bandwidth are reviewed in Chapter 4, and a different approach to admission control using online measurement is presented in Chapter 5. Chapter 6 has the numerical evaluation of four of the key algorithms, with simulations. Finally Chapter 7 has conclusions of the findings and explores some possibilities for further work
Some Asymptotic Results for the Transient Distribution of the Halfin-Whitt Diffusion Process
We consider the Halfin-Whitt diffusion process , which is used, for
example, as an approximation to the -server queue. We use recently
obtained integral representations for the transient density of this
diffusion process, and obtain various asymptotic results for the density. The
asymptotic limit assumes that a drift parameter in the model is large,
and the state variable and the initial condition (with
) are also large. We obtain some alternate representations for
the density, which involve sums and/or contour integrals, and expand these
using a combination of the saddle point method, Laplace method and singularity
analysis. The results give some insight into how steady state is achieved, and
how if the probability mass migrates from to the range
, which is where it concentrates as , in the limit we
consider. We also discuss an alternate approach to the asymptotics, based on
geometrical optics and singular perturbation techniques.Comment: 43 pages and 8 figure
Spectral gap of the Erlang A model in the Halfin-Whitt regime
We consider a hybrid diffusion process that is a combination of two Ornstein-Uhlenbeck processes with different restraining forces. This process serves as the heavy-traffic approximation to the Markovian many-server queue with abandonments in the critical Halfin-Whitt regime. We obtain an expression for the Laplace transform of the time-dependent probability distribution, from which the spectral gap is explicitly characterized. The spectral gap gives the exponential rate of convergence to equilibrium. We further give various asymptotic results for the spectral gap, in the limits of small and large abandonment effects. It turns out that convergence to equilibrium becomes extremely slow for overloaded systems with small abandonment effects