In a G/GI/c loss system with balking, reneging, or limited waiting space, deleting some of the arriving customers can either increase or decrease the fraction of the remaining arrivals who get served, depending on how customers are deleted. We present a model in which the random deletion of arrivals independently and with some fixed probability can never decrease the fraction of the remaining a...

In this paper, we studied multi-server queue with Poisson arrivals, general service time distribution, and deterministic reneging times. This work was motivated by the timeout mechanism used in managing application servers in transaction processing environments. In such systems, a customer who stays in the queue longer than the timeout period is lost. We proposed a scaling approach, and a fast ...

In this paper we present a detailed analysis of queueing models with vacations and impatient customers, where the source of impatience is the absence of the server. Instead of the standard assumption that customers perform independent abandonments, we consider situations where customers abandon the system simultaneously. This is, for example, the case in remote systems where customers may decid...

This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy, in which customers have deadlines and are served only until their deadlines elapse. The performance of the system is measured by the fraction of reneged work (the residual work lost due to elapsed deadlines), which is shown to be minimized by the EDF po...

In a near video-on-demand (near-VOD) system, requests for a movie arriving in a period of time are grouped (or “batched”) together and served with a single multicast stream. In this paper, we consider providing near-VOD services when there is a cost associated with using a network multicast channel. We address the tradeoff between system profit, given by the total pay-per-view collected minus t...

Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected Ornstein–Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate and the re...

We use data on announced and actual exchange rate arrangements to ask which countries follow de facto regimes different from their de iure ones, that is, do not do what they say. Our results suggest that countries with poor institutional quality have difficulty in maintaining pegging and abandon it often. In contrast, many countries with relatively good institutions display fear of floating, th...