M|G|∞ input processes: a versatile class of models for network traffic

Minothi Parulekar · Armand M. Makowski

85 citations0/0 files storedIEEE Conference on Computer Communications (INFOCOM)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Probability and Risk Models

Abstract

We suggest the M|G|/spl infin/ input process as a viable model for network traffic due to its versatility and tractability. We characterize the process as short- or long-range dependent by means of a simple test. To gauge its performance, we study the large buffer asymptotics of a multiplexer driven by an M|G|/spl infin/ input process. The decay rate of the tail probabilities for the buffer content (in steady-state) is investigated using large deviations techniques suggested by Duffield and O'Connell (see Mathematical Proceedings of the Cambridge Philosophical Society, no.118, p.363-74, 1995). We show that the selection of the appropriate large deviations scaling is related to the forward recurrence time of the service time distribution, and a closed-form expression is derived for the corresponding generalized limiting log-moment generating function associated with the input process. We apply our results to cases where the service time distribution in the M|G|/spl infin/ input model is (i) Rayleigh, (ii) gamma, (iii) geometric, (iv) Weibull, (v) log-normal and (vi) Pareto-cases (v) and (vi) have been found adequate for modeling packet traffic streams in certain networking applications. Finally, we comment on the insufficiency of the short- vs. long-range dependence characterization of an input process as a means to accurately describe the corresponding buffer dynamics.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 85 citations exist upstream.

References

1996Statistics for Long-Memory Processes.1962The stability of a queue with non-independent inter-arrival and service times 1994A storage model with self-similar input 1997Statistics for Long-Memory Processes 1995Large deviations and overflow probabilities for the general single-server queue, with applications 1994Logarithmic asymptotics for steady-state tail probabilities in a single-server queue

Cited by

1997Tail probabilities for M/G/∞ input processes (I): Preliminary asymptotics 1999Asymptotic behavior of a multiplexer fed by a long-range dependent process 1998Queueing at large resources driven by long-tailed M/G/∞-modulated processes 2005Sample-path large deviations for tandem and priority queues with Gaussian inputs 2005Sample Path Large Deviations Principles for Poisson Shot Noise Processes and Applications 1997Heavy traffic analysis for a multiplexer driven by M∨GI∨∞ input processes 2006The M/G/∞ system revisited: finiteness, summability, long range dependence, and reverse engineering

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.