scispace - formally typeset
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

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

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
Proceedings ArticleDOI

QoS-Guaranteed Controller Placement in SDN

TL;DR: This paper introduces the QoS-Guaranteed Controller Placement problem, and proposes three heuristic algorithms: incremental greedy algorithm, primal-dual- based algorithm and network-partition-based algorithm that slightly outperforms the other two methods on all input topologies.
Journal ArticleDOI

Bed allocation techniques based on census data

TL;DR: A time series model is developed using hourly census data to make good decisions regarding the size of each unit while minimizing data collection and modeling efforts and represents an improvement versus methods currently employed by hospitals.
Journal ArticleDOI

Strong convexity results for queueing systems

TL;DR: It is proved that the reciprocal of the average sojourn time is a concave function of the traffic intensity, and it is shown that the average itself is jointly convex in arrival and service rates.
Journal ArticleDOI

Design and planning problems in flexible manufacturing systems: a critical review

TL;DR: This review paper describes the state-of-the-art research on flexible manufacturing systems design and planning issues and discusses relevant research contributions after 1986, that were not part of any of the previous survey papers on operations research models for FMSs.
Journal ArticleDOI

Measuring statistical heterogeneity: The Pietra index

TL;DR: The Pietra index as discussed by the authors is an alternative to the Gini index, which is a counterpart of the Kolmogorov-Smirnov statistic, and it has immediate and fundamental interpretations within the following applications: renewal processes and continuous time random walks; infinite-server queueing systems and shot noise processes.