Title :
Approximate Solution of Queueing Models
Author :
Sauer, Charles H. ; Chandy, K. Mani
Author_Institution :
IBM Thomas J. Watson Research Center
fDate :
4/1/1980 12:00:00 AM
Abstract :
A variety of phenomena and interactions defy exact analytic modeling. Approximation can provide a reasonably accurate solution of a realistic model and is computationally inexpensive.
Keywords :
Approximation methods; Computer networks; Markov processes; Probability distribution; Processor scheduling; Routing;
DOI :
10.1109/MC.1980.1653573
