## An introduction to queueing theory |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Poisson Queues II | 31 |

NonPoisson Queues | 41 |

Bulk Tandem and Priority Queues | 80 |

Copyright | |

6 other sections not shown

### Common terms and phrases

applications arbitrary arrival and service average number busy period called chapter consider constant convolution convolution theorem corresponding cost customer orders difference equation Dirac delta function distribution with mean duration Erlang Erlang distribution evaluate expected exponential distribution exponential service follows Hence hour input integral inventory l'Hopital's rule Laplace-Stieltjes transform M/M/l queue M/M/l system Markov chain mean arrival rate mean number mean queueing mean rate mean service rate mean waiting minutes notation Note number of busy number of customers obtain optimal permission from Sasieni phase Poisson arrivals Poisson distribution Poisson fashion priority class probability density function PROBLEM SET queue discipline queue length queueing model queueing system queueing theory r-th random numbers random variable Section service time distribution simplifies simulation solution steady-state probabilities substituting subsystem t+At taking taxis theorem traffic intensity transition probabilities unit circle vector Yaspan and Friedman Z-transform