Mathcom Home
Services Customers Tech Info Contact Us
 

Queueing Theory and Performance Analysis.

  • FAQ
  • References
  • News Groups
  • Indices

    FAQ

    The only thing close to a FAQ is the comp.benchmarks FAQ.

    References

    By far the most often referenced works are the classics by Kleinrock:

    Kleinrock, Leonard, 1975, Queueing Systems, Volumes 1 and 2, John Wiley. Excellent theoretical development of the field. This is the standard text in the area. Kleinrock is apparently working on an updated version of his texts, but when they'll be published is unknown.

    Other good texts are:

    Allen, Arnold O. 1990 Probability, Statistics, and Queueing Theory with Computer Science Applications, Second Edition Academic Press, Boston. This is a common text in the field and has an applied approach.

    King, Peter J. 1990. Computer and Communication Systems Performance Modelling. Prentice Hall. Brief intro to prob theory, MG1, priority queues, networks of queues, approximations. Also chapters on numerical solutions, local area networks.

    Nelson, Randolph. 1995. Probability, stochastic processes, and queueing theory. Springer Verlag. Good treatment of prob, combinatorics, RVs and some distributions ... but only uniform, binomial, exponential, poisson. Not the normal distribution! Also, expectation, a big treatment of MG1, markov processes, matrix geometric solutions, and queueing networks.

    Perros, Harry G. 1995. Queueing Networks with Blocking. Oxford press. Brings together many results for different types of blocking. Blocking occurs when one server cannot continue serving because the queue at another server is full.

    Newsgroups

    sci.op-research sci.math.num-analysis

    Indices

    Plato: Decision Tree for Optimization Software



    Copyright 1995-2010 Mathcom Solutions Inc                               Updated August 12, 2010