scispace - formally typeset
Search or ask a question
Author

Josh Reed

Bio: Josh Reed is an academic researcher from New York University. The author has contributed to research in topics: Queue & Queueing theory. The author has an hindex of 12, co-authored 33 publications receiving 732 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: The first result is to obtain a deterministic fluid limit for the properly centered and scaled number of customers in the system which may be used to provide a first-order approximation to the queue length process.
Abstract: In this paper, we study the $G/\mathit{GI}/N$ queue in the Halfin--Whitt regime. Our first result is to obtain a deterministic fluid limit for the properly centered and scaled number of customers in the system which may be used to provide a first-order approximation to the queue length process. Our second result is to obtain a second-order stochastic approximation to the number of customers in the system in the Halfin--Whitt regime. This is accomplished by first centering the queue length process by its deterministic fluid limit and then normalizing by an appropriate factor. We then proceed to obtain an alternative but equivalent characterization of our limiting approximation which involves the renewal function associated with the service time distribution. This alternative characterization reduces to the diffusion process obtained by Halfin and Whitt [Oper. Res. 29 (1981) 567--588] in the case of exponentially distributed service times.

123 citations

Journal ArticleDOI
TL;DR: In this paper, a deterministic fluid limit for the properly centered and scaled number of customers in the G/GI/N queue was obtained, which may be used to provide a first-order approximation to the queue length process.
Abstract: In this paper, we study the G/GI/N queue in the Halfin–Whitt regime. Our first result is to obtain a deterministic fluid limit for the properly centered and scaled number of customers in the system which may be used to provide a first-order approximation to the queue length process. Our second result is to obtain a second-order stochastic approximation to the number of customers in the system in the Halfin–Whitt regime. This is accomplished by first centering the queue length process by its deterministic fluid limit and then normalizing by an appropriate factor. We then proceed to obtain an alternative but equivalent characterization of our limiting approximation which involves the renewal function associated with the service time distribution. This alternative characterization reduces to the diffusion process obtained by Halfin and Whitt [Oper. Res. 29 (1981) 567–588] in the case of exponentially distributed service times.

93 citations

Journal ArticleDOI
TL;DR: A single-server queue, operating under the first-in-first-out (FIFO) service discipline, is studied, in which each customer independently abandons the queue if his service has not begun within a generally distributed amount of time.
Abstract: We study a single-server queue, operating under the first-in-first-out (FIFO) service discipline, in which each customer independently abandons the queue if his service has not begun within a generally distributed amount of time. Under some mild conditions on the abandonment distribution, we identify a limiting heavy-traffic regime in which the resulting diffusion approximation for both the offered waiting time process (the process that tracks the amount of time an infinitely patient arriving customer would wait for service) and the queue-length process contain the entire abandonment distribution. To use a continuous mapping approach to establish our weak convergence results, we additionally develop existence, uniqueness, and continuity results for nonlinear generalized regulator mappings that are of independent interest. We further perform a simulation study to evaluate the quality of the proposed approximations for the steady-state mean queue length and the steady-state probability of abandonment suggested by the limiting diffusion process.

65 citations

Posted Content
TL;DR: A diffusion model for the evolution of the best bid/ask queues is considered, which can be useful, among other things, to rank trading venues in terms of the “information content” of their quotes and to estimate hidden liquidity in a market based on high-frequency data.
Abstract: Bid and ask sizes at the top of the order book provide information on short-term price moves. Drawing from classical descriptions of the order book in terms of queues and order-arrival rates (Smith et al (2003)), we consider a diffusion model for the evolution of the best bid/ask queues. We compute the probability that the next price move is upward, conditional on the best bid/ask sizes, the hidden liquidity of the market and the correlation between changes in the bid/ask sizes. The model can be useful, among other things, to rank trading venues in terms of the "information content" of their quotes and to estimate the hidden liquidity in a market based on high-frequency data. We illustrate the approach with an empirical study of a few liquid stocks using quotes from various exchanges.

49 citations

Journal ArticleDOI
TL;DR: This work obtains a heavy traffic limit for the GI/M/n + GI queue, which includes the entire patience time distribution, and shows that for various performance measures, its approximations tend to outperform those commonly used in practice.
Abstract: We obtain a heavy traffic limit for the GI/M/n + GI queue, which includes the entire patience time distribution. Our main approach is to scale the hazard rate function of the patience time distribution in such a way that our resulting diffusion approximation contains the entire hazard rate function. We then show through numerical studies that for various performance measures, our approximations tend to outperform those commonly used in practice. The robustness of our results is also demonstrated by applying them to solving constraint satisfaction problems arising in the context of telephone call centers.

47 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: Convergence of Probability Measures as mentioned in this paper is a well-known convergence of probability measures. But it does not consider the relationship between probability measures and the probability distribution of probabilities.
Abstract: Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

5,689 citations

Book ChapterDOI
01 Jan 2011
TL;DR: Weakconvergence methods in metric spaces were studied in this article, with applications sufficient to show their power and utility, and the results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables.
Abstract: The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

3,554 citations

Book
01 Jan 2013
TL;DR: In this paper, the authors consider the distributional properties of Levy processes and propose a potential theory for Levy processes, which is based on the Wiener-Hopf factorization.
Abstract: Preface to the revised edition Remarks on notation 1. Basic examples 2. Characterization and existence 3. Stable processes and their extensions 4. The Levy-Ito decomposition of sample functions 5. Distributional properties of Levy processes 6. Subordination and density transformation 7. Recurrence and transience 8. Potential theory for Levy processes 9. Wiener-Hopf factorizations 10. More distributional properties Supplement Solutions to exercises References and author index Subject index.

1,957 citations

Journal ArticleDOI
TL;DR: In this paper, applied probability and queuing in the field of applied probabilistic analysis is discussed. But the authors focus on the application of queueing in the context of road traffic.
Abstract: (1987). Applied Probability and Queues. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1095-1096.

1,121 citations

Journal ArticleDOI
TL;DR: A survey of the recent literature on call center operations management can be found in this article, where the authors identify a handful of broad themes for future investigation while also pointing out several very specific research opportunities.
Abstract: Call centers are an increasingly important part of today's business world, employing millions of agents across the globe and serving as a primary customer-facing channel for firms in many different industries. Call centers have been a fertile area for operations management researchers in several domains, including forecasting, capacity planning, queueing, and personnel scheduling. In addition, as telecommunications and information technology have advanced over the past several years, the operational challenges faced by call center managers have become more complicated. Issues associated with human resources management, sales, and marketing have also become increasingly relevant to call center operations and associated academic research. In this paper, we provide a survey of the recent literature on call center operations management. Along with traditional research areas, we pay special attention to new management challenges that have been caused by emerging technologies, to behavioral issues associated with both call center agents and customers, and to the interface between call center operations and sales and marketing. We identify a handful of broad themes for future investigation while also pointing out several very specific research opportunities.

776 citations