Simple formulas for multiplexing delay for independent regenerative sources

Herve Dupuis, Bruce Hajek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Simple expressions are given for the mean delay, mean waiting time, and mean busy period length in a multiplexer. A large class of possible data streams is considered. For example, data streams with active periods having a general distribution are permitted, and the traffic rate during the active periods can be random. Data can also arrive in batches. The output stream of the multiplexer again falls into the class. The exact formulas allow evaluation of the error in approximations such as a heavy traffic diffusion approximation. Both continuous-time and discrete-time models are considered. The discrete-time model includes that studied by A. M. Viterbi and subsequently generalized by M. Neuts. The Pollaczek-Khinchine formula for the mean amount of work in an M/G/1 queue is retrieved as a limiting case.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
PublisherPubl by IEEE
Pages28-35
Number of pages8
ISBN (Print)0818635800
StatePublished - 1993
EventProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93 - San Francisco, CA, USA
Duration: Mar 30 1993Apr 1 1993

Publication series

NameProceedings - IEEE INFOCOM
Volume1
ISSN (Print)0743-166X

Other

OtherProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93
CitySan Francisco, CA, USA
Period3/30/934/1/93

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Simple formulas for multiplexing delay for independent regenerative sources'. Together they form a unique fingerprint.

Cite this