|
" Queues "
Moshe Haviv
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
667232
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Haviv, Moshe
|
| Title & Author
|
:
|
Queues : a course in queueing theory /\ Moshe Haviv
|
| Publication Statement
|
:
|
New York, NY :: Springer,, c2013
|
| Series Statement
|
:
|
International series in operations research & management science,; v. 191
|
| Page. NO
|
:
|
1 online resource
|
| ISBN
|
:
|
1461467659 (electronic bk.)
|
|
|
:
|
: 9781461467656 (electronic bk.)
|
|
|
:
|
9781461467649
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references and index
|
| Contents
|
:
|
The Exponential Distribution and the Poisson Process -- Introduction to Renewal Theory -- Introduction to Markov Chains -- From Single Server Queues to M/G/1 -- Priorities and Scheduling in M/G/1 -- M/G/1 Using Markov Chains and LSTs -- The G/M/1 Queueing System -- Continuous-time Markov Chains and Memoryless Queues -- Open Networks of Exponential Queues -- Closed Networks of Exponential Queues -- Insensitivity and Product-form Queueing Models -- Two-dimensional Markov Processes and their Applications to Memoryless Queues
|
| Abstract
|
:
|
Queueing theory (the mathematical theory of waiting lines in all its configurations) continues to be a standard major area of operations research on the stochastic side. Therefore, universities with an active program in operations research sometimes will have an entire course devoted mainly or entirely to queueing theory, and the course is also taught in computer science, electrical engineering, mathematics, and industrial engineering programs. The basic course in queueing theory is often taught at first year graduate level, though can be taught at senior level undergraduate as well. This text evolved from the author's preferred syllabus for teaching the course, presenting the material in a more logical order than other texts and so being more effective in teaching the basics of queueing theory. The first three chapters focus on the needed preliminaries, including exposition distributions, Poisson processes and generating functions, renewal theory, and Markov chains, Then, rather than switching to first-come first-served memoryless queues here as most texts do, Haviv discusses the M/G/1 model instead of the M/M/1, and then covers priority queues. Later chapters cover the G/M/1 model, thirteen examples of continuous-time Markov processes, open networks of memoryless queues and closed networks, queueing regimes with insensitive parameters, and then concludes with two-dimensional queueing models which are quasi birth and death processes. Each chapter ends with exercises
|
| Subject
|
:
|
Queuing theory
|
| Dewey Classification
|
:
|
658.4/034
|
| LC Classification
|
:
|
T57.9.H38 2013
|
|
|
:
|
T57.9.H38 2013
|
| Added Entry
|
:
|
Ohio Library and Information Network
|
| |