Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T06:53:10.432Z Has data issue: false hasContentIssue false

LIMITS FOR CUMULATIVE INPUT PROCESSES TO QUEUES

Published online by Cambridge University Press:  01 April 2000

Ward Whitt
Affiliation:
AT&T Labs, Florham Park, New Jersey 07932-0971, E-mail: wow@research.att.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We establish functional central limit theorems (FCLTs) for a cumulative input process to a fluid queue from the superposition of independent on–off sources, where the on periods and off periods may have heavy-tailed probability distributions. Variants of these FCLTs hold for cumulative busy-time and idle-time processes associated with standard queueing models. The heavy-tailed on-period and off-period distributions can cause the limit process to have discontinuous sample paths (e.g., to be a non-Brownian stable process or more general Lévy process) even though the converging processes have continuous sample paths. Consequently, we exploit the Skorohod M1 topology on the function space D of right-continuous functions with left limits. The limits here combined with the previously established continuity of the reflection map in the M1 topology imply both heavy-traffic and non-heavy-traffic FCLTs for buffer-content processes in stochastic fluid networks.

Information

Type
Research Article
Copyright
© 2000 Cambridge University Press