Buffer Engineering for M/G/infinity Input Processes
Abstract
We suggest the M/G/infinity input process as a viable model for representing the heavy correlations observed in network traffic. Originally introduced by Cox, this model represents the busy?server process of an M/G/infinity with Poisson inputs and general service times distributed according to G, and provides a large and versatile class of traffic models. We examine various properties of the M/G/infinity process, focusing particularly on its rich correlation structure. The process is shown to effectively portray short or long-range dependence simply by controlling the tail of the distribution G. In an effort to understand the dynamics of a system supporting M/G/infinity traffic, we study the large butter asymptotics of a multiplexer driven by an M/G/infinity input process.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 2000
- Accession Number
- ADA439728
Entities
People
- Minothi Parulekar
Organizations
- University of Maryland