## Abstract

In [4], we treated the problem of passage through a discrete‐time clock‐regulated multistage queueing network by modeling the input time series {a_{n}} to each queue as a Markov chain. We showed how to transform probability transition information from the input of one queue to the input of the next in order to predict mean queue length at each stage. The Markov approximation is very good for p = E(a_{n}) ≦ ½, which is in fact the range of practical utility. Here we carry out a Markov time series input analysis to predict the stage to stage change in the probability distribution of queue length. The main reason for estimating the queue length distribution at each stage is to locate “hot spots”, loci where unrestricted queue length would exceed queue capacity, and a quite simple expression is obtained for this purpose.

Original language | English (US) |
---|---|

Pages (from-to) | 685-693 |

Number of pages | 9 |

Journal | Communications on Pure and Applied Mathematics |

Volume | 43 |

Issue number | 5 |

DOIs | |

State | Published - Jul 1990 |

## ASJC Scopus subject areas

- General Mathematics
- Applied Mathematics