Queueing Analysis: Finite Systems v.2
A Foundation of Performance Evaluation
Published on 11. November 1993
Book
Hardback
560 pages
978-0-444-81614-6 (ISBN)
Description
Queueing models have been used very effectively for the performance of evaluation of many computer and communication systems. As a continuation of Volume 1: Vacation and Priority Systems, which dealt with M/G/1-type systems, this volume explores systems with a finite population (M/G/1/N) and those with a finite capacity (M/G/1/K). The methods of imbedded Markov chains and semi-Markov processes, the delay cycle analysis, and the method of supplementary variables are extensively used. In order to maximise the reader's understanding, multiple approaches have been employed, including the derivation of the results by several techniques. This elaborate presentation of new and important research results applicable to emerging technologies is aimed at engineers and mathematicians alike, with a basic understanding or a comprehensive knowledge of queueing systems. It will be of particular interest to researchers and graduate students of applied probability, operations research, computer science and electrical engineering and to researchers and engineers of performance of computers and communication networks. Volume 3: Discrete Time Systems will follow this volume to complete the set.
More details
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Elsevier Science & Technology
Target group
College/higher education
Professional and scholarly
Illustrations
glossary, references, indexes
Dimensions
Height: 230 mm
ISBN-13
978-0-444-81614-6 (9780444816146)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Content
Part 1 M/G/1/N: Queue size; performance measures; queue size at service completion times; queue size at an arbitrary time; output and quasi-input processes; message-dependent process; waiting time; queue size and elapsed service time; unfinished work; arrival time probabilities; waiting time in the FCFS system; waiting time in the ROS system; time-dependent processes; queue size and elapsed service time; queue size; equivalence with Takacs's and Jaiswal's results; queue size and remaining service time; steady-state limits; busy periods; length of a busy period; number of messages served in a busy period; delay cycle; waiting time in the LCFS system; exceptional service for the first message in a busy period; restoration-time model; busy period process; systems with vacations I; models and performance measures; multiple vacation model; systems with vacations II; single vacation model; system with setup times; system with exceptional first service; heterogeneous systems; individual message model; nonpreemptive priority system; FCFS system; multiple finite-source model; single finite-source model. Part 2 M/G/1/K: systems without vacations I; queue size; waiting time and unfinished work; busy periods; busy period process; systems without vacations II; LCFS and ROS systems; output, quasi-input and overflow processes; M/G/m/m loss system; pushout models; M/G/1/K with resume level; systems with vacations and exhaustive service; multiple vacation model; single vacation model; Courtois's solution; N-policy and setup times; exceptional first service time; systems with vacations and E-limited service; multiple vacation model; single vacation model; N-policy and setup times; systems with vacations and other limited service; G-limited service systems; multiple vacation model; single vacation model; N-policy and setup times; P-limited exhaustive service systems; P-limited gated service systems; batch arrival systems without vacations; partial acceptance model; total acceptance model; total rejection model; batch arrival systems with vacations; partial acceptance model; total acceptance model; total rejection model; finite population systems; M/G/1/K/N; M/G/1/K/N with vacations; M/G/m/m/N loss system.