Queueing Theory
eBook - PDF

Queueing Theory

  1. 460 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Queueing Theory

Book details
Table of contents
Citations

About This Book

The series is devoted to the publication of high-level monographs and surveys which cover the whole spectrum of probability and statistics. The books of the series are addressed to both experts and advanced students.

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Queueing Theory by P. P. Bocharov, C. D'Apice, A. V. Pechinkin in PDF and/or ePUB format, as well as other popular books in Mathematics & Probability & Statistics. We have over one million books available in our catalogue for you to explore.

Information

Publisher
De Gruyter
Year
2011
ISBN
9783110936025
Edition
1
Topic
Mathematics
Subtopic
Probability & Statistics
Index
Mathematics

Table of contents

  1. Foreword
  2. Introduction
  3. 1 Probabilistic apparatus of the queueing theory
  4. 1.1 Characteristic transformations
  5. 1.2 Exponential and Poisson distributions
  6. 1.3 Renewal processes. Regenerative processes
  7. 1.4 Markov chains
  8. 1.5 Markov processes with discrete state set
  9. 1.6 Semi-Markov, linearwise, and piecewise-linear processes
  10. 1.7 Kronecker matrix product
  11. 2 Defining parameters of queueing systems
  12. 2.1 Input flow
  13. 2.2 System structure
  14. 2.3 Customer service times
  15. 2.4 Service discipline
  16. 2.5 Performance indices of a queueing system
  17. 2.6 Classification of queueing systems
  18. 2.7 Queueing networks
  19. 2.8 Properties of distributions for some types of recurrent input flows and service times
  20. 3 Elementary Markov models
  21. 3.1 M/M/l/∞ system
  22. 3.2 M/M/n/r system
  23. 3.3 M/M/l/∞ system with ‘impatient’ customers
  24. 3.4 System with a finite number of sources
  25. 3.5 M[X]/M/l/∞ system with batch arrivals
  26. 3.6 M/Em/l/∞ system
  27. 3.7 M/M/l/0 system with retrial queue
  28. 4 Markov systems: algorithmic methods of analysis
  29. 4.1 M/Hm/l/r and Hl/M/l/r systems
  30. 4.2 M2/M/n/r system with non-preemptive priority
  31. 4.3 M/PH/l/r and PH/M/l/r systems
  32. 4.4 M/PH/l/r system with server vacations and flow dependent on the queue state
  33. 4.5 PH/PH/l/r system
  34. 4.6 Markov systems described by generalised birth-and-death process
  35. 5 M/G/l/∞ system: investigation methods
  36. 5.1 Embedded Markov chain
  37. 5.2 Virtual waiting time
  38. 5.3 Residual service time
  39. 5.4 Elapsed waiting time
  40. 5.5 Use of renewal processes
  41. 6 Other simple non-Markov models
  42. 6.1 M/G/∞ system
  43. 6.2 G/G/∞ system
  44. 6.3 M/D/n/∞ system
  45. 6.4 G/M/l/∞ system
  46. 6.5 M/G/l/r system
  47. 6.6 M/G/n/0 system
  48. 7 MAP/G/l/r system
  49. 7.1 Embedded Markov chain: FCFS discipline
  50. 7.2 Supplementary variables: FCFS discipline
  51. 7.3 LCFS discipline
  52. 7.4 Matrix exponential moments
  53. 8 MAP/G/l/∞ system
  54. 8.1 Embedded Markov chain
  55. 8.2 Virtual waiting time
  56. 8.3 Supplementary variables: FCFS discipline
  57. 8.4 LCFS discipline
  58. 9 MAP/G/l/r system: generalisation
  59. 9.1 BMAP/SM/l/r system
  60. 9.2 MAP/G2/l/r system with preemptive priority
  61. 9.3 MAP/G2/l/r system with non-preemptive priority
  62. 9.4 MAP/G/l/r retrial system
  63. 9.5 MAP/G/l/∞ system withforeground-background processor sharing discipline
  64. 9.6 MAP/G/l/r system with LCFS discipline and bounded total volume of customers
  65. 9.7 G/MSP/l/r system
  66. 10 Queueing networks
  67. 10.1 Network classes
  68. 10.2 Open exponential networks
  69. 10.3 Closed exponential networks
  70. Bibliography
  71. Index