|
![]() |
|||
|
||||
OverviewThis volume presents an overview of mathematical methods used in queuing theory, and various examples of solutions of problems using these methods are given. Many of the topics considered are not traditional, and include general Markov processes, test functions, coupling methods, probability metrics, continuity of queues, quantitative estimates in continuity, convergence rate to the stationary state and limit theorems for the first occurrence times. Much attention is also devoted to the modern theory of regenerative processes. Each chapter concludes with problems and comments on the literature cited. For researchers and graduate students in applied probability, operations research and computer science. Full Product DetailsAuthor: Vladimir V. KalashnikovPublisher: Springer Imprint: Springer Edition: Softcover reprint of hardcover 1st ed. 1994 Volume: 271 Dimensions: Width: 21.00cm , Height: 2.00cm , Length: 29.70cm Weight: 1.025kg ISBN: 9789048143399ISBN 10: 904814339 Pages: 382 Publication Date: 05 December 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of Contents1. Queueing Theory.- 2. Necessary Facts from Probability Theory and the Theory of Analytic Functions.- 3. Random Flows.- 4. Elementary Methods in Queueing Theory.- 5. Markov Chains.- 6. Renewal Processes.- 7. Regenerative Processes.- 8. Discrete Time Markov Queueing Models.- 9. Markov Queueing Models.- 10. Method of Supplementary Variables.- 11. First-Occurrence Events.- References.- List of Notations and Abbreviations.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |