Journal ArticleDOI
Fundamentals of Queueing Theory
Rodney Coleman
- Vol. 138, Iss: 3, pp 436-437
Reads0
Chats0
TLDR
The Fundamentals of Queueing Theory, Fourth Edition as discussed by the authors provides a comprehensive overview of simple and more advanced queuing models, with a self-contained presentation of key concepts and formulae.Abstract:
Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.read more
Citations
More filters
Book
The Connection Machine
TL;DR: The Connection Machine describes a fundamentally different kind of computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time.
Journal ArticleDOI
Input Versus Output Queueing on a Space-Division Packet Switch
TL;DR: Two simple models of queueing on an N \times N space-division packet switch are examined, and it is possible to slightly increase utilization of the output trunks and drop interfering packets at the end of each time slot, rather than storing them in the input queues.
Journal ArticleDOI
The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
Donald Gross,Douglas R. Miller +1 more
TL;DR: An implementation for a general class of Markov processes that can be described in terms of state space S, event set E, rate vectors R, and target vectors T-abbreviated as SERT is presented.
Journal ArticleDOI
Dynamic batching policies for an on-demand video server
TL;DR: It is shown that a first come, first served (FCFS) policy that schedules the video with the longest outstanding request can perform better than the maximum queue length (MQL) policy, and multicasting is better exploited by scheduling playback of the most popular videos at predetermined, regular intervals (hence, termed FCFS-n).
Journal ArticleDOI
End-to-end congestion control for the internet: delays and stability
Ramesh Johari,David Kim Hong Tan +1 more
TL;DR: Stability results for a fluid flow model of end-to-end Internet congestion control and criteria for local stability and rate of convergence are completely characterized for a single resource, single user system.
References
More filters
Journal ArticleDOI
The convexity of a general performance measure for multiserver queues
Arie Harel,Paul Zipkin +1 more
TL;DR: In this paper, a general performance measure for queueing systems is examined, which reflects both the mean and the variance of sojourn times; the standard deviation is a special case.
Journal ArticleDOI
A scalable non-myopic atomic game for a smart parking mechanism
TL;DR: This study integrates a socially efficient price that accounts for the waiting times of drivers in their search for parking into the social optimum problem by considering the competition of drivers for parking spaces where the drivers’ preferences are reflected in a collective decision such as social welfare.
Journal ArticleDOI
Optimal selection of the local storage sizes of an assembly system
TL;DR: The minimum required local storage sizes of the work stations and the transporter stations are obtained such that the probability of finding either a work station or a transporter station blocked is sufficiently close to zero.
Journal ArticleDOI
Erlang Capacity Analysis of CDMA Systems Supporting Voice and Delay-Tolerant Data Services Under the Delay Constraint
TL;DR: This paper develops a 2-D Markov model, which is based on the First-Come- First-Serve service discipline, and presents a numerical procedure, which can make a balance between the Erlang capacities with respect to the blocking probability of voice call and withrespect to the delay confidence of data call, in order to accommodate extra Erlang capacity.
Proceedings ArticleDOI
Modeling the performance of low latency queueing for emergency telecommunications
TL;DR: This work develops custom simulators to model a proposed enhancement to LLQ which may be beneficial to emergency telecommunications services and describes the computational experiences in using the simulators.