What people are saying - Write a review
We haven't found any reviews in the usual places.
Analytical Results for Queueing Models
Approximate Analysis of Queueing Networks
5 other sections not shown
Other editions - View all
algorithm analysis approximately arrival process arrival rate assume buffer capacity functions capacity service centers central server model Chandy channel coefficient of variation computer system confidence interval consider continuous random variable Convolution decomposition defined denote discrete random variable discussion disk entity equal equations Erlang distribution event example exponential random variable exponentially distributed FCFS follows from Eq gamma integer interarrival LBANC Little's formula mean queue lengths mean response memory method node normalizing constant number of customers obtained output sequence parameter passive queue performance measures performance models point estimate Poisson process priority Prob probability density function probability distribution function processor product form networks product form solution queueing discipline queueing model queueing network models represented requests sample Sauer Section server fixed capacity server group service rate SIMSCRIPT single server fixed statistically independent steady-state response subnetwork terminals transient uniform random number utilization values variance waiting zero