Issues in performance modeling of data teletraffic

Publisher Website
Google Scholar
Abstract
Data teletraffic is characterized by bursty arrival processes. Performance models are characterized by a desire to know under what circumstances is the probability that an arrival finds a full input buffer very small. In this paper I examine how four models proposed in the literature perform on two data sets of local-area-network traffic. Among my conclusions are (1) the protocol governing the data transmission may have a substantial effect on the statistical properties of the packet stream, (2) approximating the probability that a finite buffer of size b overflows may not be adequately approximated by the probability that an infinite buffer has at least b packets in it, and (3) a data-based estimate of large-deviation rate-function does the best job of estimating packet loss on these data sets. This method may overestimate the loss rate by several orders of magnitude, so there is room for further refinements.

This publication has 0 references indexed in Scilit: