Introduction to Queuing Theory [electronic resource] /

to the Second Edition -- to the First Edition -- 1. Problems of Queueing Theory under the Simplest Assumptions -- 1.1. Simple Streams -- 1.2. Service with Waiting -- 1.3. Birth and Death Processes -- 1.4. Applications of Birth and Death Processes in Queueing Theory -- 1.5. Priority Service -- 1.6. General Principles of Constructing Markov Models of Systems -- 1.7. Systems with Limited Waiting Time -- 1.8. Systems with Bounded Holding Times -- 2. The Study of the Incoming Customer Stream -- 2.1. Some Examples -- 2.2. A Simple Nonstationary Stream -- 2.3. A Property of Stationary Streams -- 2.4. General Form of Stationary Streams without Aftereffects -- 2.5. The Palm-Khinchin Functions -- 2.6. Characteristics of Stationary Streams and the Lebesgue Integral -- 2.7. Basic Renewal Theory -- 2.8. Limit Theorems for Compound Streams -- 2.9. Direct Probabilistic Methods -- 2.10. Limit Theorem for Thinning Streams -- 2.11. Additional Limit Theorems for Thinning Streams -- 3. Some Classes of Stochastic Processes -- 3.1. Kendall’s Method: Semi-Markov Processes -- 3.2. Linear-Type Markov Processes -- 3.3. Piecewise-Linear Markov Processes -- 3.4. Other Important Classes of Random Processes -- 4. Semi-Markov Models of Queueing Systems -- 4.1. Classification of Queueing Systems -- 4.2. M?G?1 System -- 4.3. Nonstationary Characteristics of an M|G|1 System -- 4.4. A System of the GI?M?m Type -- 4.5. M|G|1 System with an Unreliable and “Renewable” Server -- 4.6. Mixed Service Systems -- 4.7. Systems with Restrictions -- 4.8. Priority Service -- 4.9. The Generalized Scheme of Priority Service with a Limited Queue -- 5. Application of More General Methods -- 5.1. The GI?G?1 System -- 5.2. GI?G?m Systems -- 5.3. The M?G?m?0 System -- 5.4. More Complex Systems with Losses -- 5.5. Ergodic Theorems -- 5.6. Heavily Loaded Queueing Systems -- 5.7. Underloaded Queueing Systems -- 5.8. Little’s Theory and its Corollaries -- 6. Statistical Simulation of Systems -- 6.1. Principles of the Monte Carlo Method -- 6.2. Simulation of Some Classes of Random Processes -- 6.3. Statistical Problems Associated with Simulation -- 6.4. Simulation of Queueing Systems -- 6.5. Calculation of Corrections to Characteristics of Systems.

Saved in:
Bibliographic Details
Main Authors: Gnedenko, B. V. author., Kovalenko, I. N. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Boston, MA : Birkhäuser Boston, 1989
Subjects:Mathematics., Data structures (Computer science)., Computer mathematics., Algorithms., Computational Science and Engineering., Computational Mathematics and Numerical Analysis., Data Structures.,
Online Access:http://dx.doi.org/10.1007/978-1-4615-9826-8
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:227227
record_format koha
spelling KOHA-OAI-TEST:2272272018-07-31T00:08:20ZIntroduction to Queuing Theory [electronic resource] / Gnedenko, B. V. author. Kovalenko, I. N. author. SpringerLink (Online service) textBoston, MA : Birkhäuser Boston,1989.engto the Second Edition -- to the First Edition -- 1. Problems of Queueing Theory under the Simplest Assumptions -- 1.1. Simple Streams -- 1.2. Service with Waiting -- 1.3. Birth and Death Processes -- 1.4. Applications of Birth and Death Processes in Queueing Theory -- 1.5. Priority Service -- 1.6. General Principles of Constructing Markov Models of Systems -- 1.7. Systems with Limited Waiting Time -- 1.8. Systems with Bounded Holding Times -- 2. The Study of the Incoming Customer Stream -- 2.1. Some Examples -- 2.2. A Simple Nonstationary Stream -- 2.3. A Property of Stationary Streams -- 2.4. General Form of Stationary Streams without Aftereffects -- 2.5. The Palm-Khinchin Functions -- 2.6. Characteristics of Stationary Streams and the Lebesgue Integral -- 2.7. Basic Renewal Theory -- 2.8. Limit Theorems for Compound Streams -- 2.9. Direct Probabilistic Methods -- 2.10. Limit Theorem for Thinning Streams -- 2.11. Additional Limit Theorems for Thinning Streams -- 3. Some Classes of Stochastic Processes -- 3.1. Kendall’s Method: Semi-Markov Processes -- 3.2. Linear-Type Markov Processes -- 3.3. Piecewise-Linear Markov Processes -- 3.4. Other Important Classes of Random Processes -- 4. Semi-Markov Models of Queueing Systems -- 4.1. Classification of Queueing Systems -- 4.2. M?G?1 System -- 4.3. Nonstationary Characteristics of an M|G|1 System -- 4.4. A System of the GI?M?m Type -- 4.5. M|G|1 System with an Unreliable and “Renewable” Server -- 4.6. Mixed Service Systems -- 4.7. Systems with Restrictions -- 4.8. Priority Service -- 4.9. The Generalized Scheme of Priority Service with a Limited Queue -- 5. Application of More General Methods -- 5.1. The GI?G?1 System -- 5.2. GI?G?m Systems -- 5.3. The M?G?m?0 System -- 5.4. More Complex Systems with Losses -- 5.5. Ergodic Theorems -- 5.6. Heavily Loaded Queueing Systems -- 5.7. Underloaded Queueing Systems -- 5.8. Little’s Theory and its Corollaries -- 6. Statistical Simulation of Systems -- 6.1. Principles of the Monte Carlo Method -- 6.2. Simulation of Some Classes of Random Processes -- 6.3. Statistical Problems Associated with Simulation -- 6.4. Simulation of Queueing Systems -- 6.5. Calculation of Corrections to Characteristics of Systems.Mathematics.Data structures (Computer science).Computer mathematics.Algorithms.Mathematics.Computational Science and Engineering.Computational Mathematics and Numerical Analysis.Algorithms.Data Structures.Springer eBookshttp://dx.doi.org/10.1007/978-1-4615-9826-8URN:ISBN:9781461598268
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Mathematics.
Data structures (Computer science).
Computer mathematics.
Algorithms.
Mathematics.
Computational Science and Engineering.
Computational Mathematics and Numerical Analysis.
Algorithms.
Data Structures.
Mathematics.
Data structures (Computer science).
Computer mathematics.
Algorithms.
Mathematics.
Computational Science and Engineering.
Computational Mathematics and Numerical Analysis.
Algorithms.
Data Structures.
spellingShingle Mathematics.
Data structures (Computer science).
Computer mathematics.
Algorithms.
Mathematics.
Computational Science and Engineering.
Computational Mathematics and Numerical Analysis.
Algorithms.
Data Structures.
Mathematics.
Data structures (Computer science).
Computer mathematics.
Algorithms.
Mathematics.
Computational Science and Engineering.
Computational Mathematics and Numerical Analysis.
Algorithms.
Data Structures.
Gnedenko, B. V. author.
Kovalenko, I. N. author.
SpringerLink (Online service)
Introduction to Queuing Theory [electronic resource] /
description to the Second Edition -- to the First Edition -- 1. Problems of Queueing Theory under the Simplest Assumptions -- 1.1. Simple Streams -- 1.2. Service with Waiting -- 1.3. Birth and Death Processes -- 1.4. Applications of Birth and Death Processes in Queueing Theory -- 1.5. Priority Service -- 1.6. General Principles of Constructing Markov Models of Systems -- 1.7. Systems with Limited Waiting Time -- 1.8. Systems with Bounded Holding Times -- 2. The Study of the Incoming Customer Stream -- 2.1. Some Examples -- 2.2. A Simple Nonstationary Stream -- 2.3. A Property of Stationary Streams -- 2.4. General Form of Stationary Streams without Aftereffects -- 2.5. The Palm-Khinchin Functions -- 2.6. Characteristics of Stationary Streams and the Lebesgue Integral -- 2.7. Basic Renewal Theory -- 2.8. Limit Theorems for Compound Streams -- 2.9. Direct Probabilistic Methods -- 2.10. Limit Theorem for Thinning Streams -- 2.11. Additional Limit Theorems for Thinning Streams -- 3. Some Classes of Stochastic Processes -- 3.1. Kendall’s Method: Semi-Markov Processes -- 3.2. Linear-Type Markov Processes -- 3.3. Piecewise-Linear Markov Processes -- 3.4. Other Important Classes of Random Processes -- 4. Semi-Markov Models of Queueing Systems -- 4.1. Classification of Queueing Systems -- 4.2. M?G?1 System -- 4.3. Nonstationary Characteristics of an M|G|1 System -- 4.4. A System of the GI?M?m Type -- 4.5. M|G|1 System with an Unreliable and “Renewable” Server -- 4.6. Mixed Service Systems -- 4.7. Systems with Restrictions -- 4.8. Priority Service -- 4.9. The Generalized Scheme of Priority Service with a Limited Queue -- 5. Application of More General Methods -- 5.1. The GI?G?1 System -- 5.2. GI?G?m Systems -- 5.3. The M?G?m?0 System -- 5.4. More Complex Systems with Losses -- 5.5. Ergodic Theorems -- 5.6. Heavily Loaded Queueing Systems -- 5.7. Underloaded Queueing Systems -- 5.8. Little’s Theory and its Corollaries -- 6. Statistical Simulation of Systems -- 6.1. Principles of the Monte Carlo Method -- 6.2. Simulation of Some Classes of Random Processes -- 6.3. Statistical Problems Associated with Simulation -- 6.4. Simulation of Queueing Systems -- 6.5. Calculation of Corrections to Characteristics of Systems.
format Texto
topic_facet Mathematics.
Data structures (Computer science).
Computer mathematics.
Algorithms.
Mathematics.
Computational Science and Engineering.
Computational Mathematics and Numerical Analysis.
Algorithms.
Data Structures.
author Gnedenko, B. V. author.
Kovalenko, I. N. author.
SpringerLink (Online service)
author_facet Gnedenko, B. V. author.
Kovalenko, I. N. author.
SpringerLink (Online service)
author_sort Gnedenko, B. V. author.
title Introduction to Queuing Theory [electronic resource] /
title_short Introduction to Queuing Theory [electronic resource] /
title_full Introduction to Queuing Theory [electronic resource] /
title_fullStr Introduction to Queuing Theory [electronic resource] /
title_full_unstemmed Introduction to Queuing Theory [electronic resource] /
title_sort introduction to queuing theory [electronic resource] /
publisher Boston, MA : Birkhäuser Boston,
publishDate 1989
url http://dx.doi.org/10.1007/978-1-4615-9826-8
work_keys_str_mv AT gnedenkobvauthor introductiontoqueuingtheoryelectronicresource
AT kovalenkoinauthor introductiontoqueuingtheoryelectronicresource
AT springerlinkonlineservice introductiontoqueuingtheoryelectronicresource
_version_ 1756271091642269696