## Abstract

Simple expressions are given for the mean delay, mean waiting time, and mean busy period length in a multiplexer. Data streams with active periods having a general distribution are permitted, and the data rate during the active periods can be random. Data can also arrive in batches. The key restrictions of the model are that the sources are independent, idle periods are exponentially distributed, and a source generates at least enough data during an active period to keep the server busy throughout the period. The exact formulas allow evaluation of the error in approximations such as a heavy traffic diffusion approximation. Both continuous and discrete time models are considered. The discrete-time model includes that studied by Viterbi and subsequently generalized by Neuts. The Pollaczek-Khinchine formula for the mean amount of work in an M/GI/1 queue is retrieved as a limiting case.

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

Pages (from-to) | 195-239 |

Number of pages | 45 |

Journal | Queueing Systems |

Volume | 16 |

Issue number | 3-4 |

DOIs | |

State | Published - Sep 1 1994 |

## Keywords

- Queueing
- diffusion approximation
- fluid model
- multiplexing
- renewal processes

## ASJC Scopus subject areas

- Statistics and Probability
- Computer Science Applications
- Management Science and Operations Research
- Computational Theory and Mathematics