Translator Disclaimer
10 October 1997 Issues in performance modeling of data teletraffic
Author Affiliations +
Proceedings Volume 3231, Performance and Control of Network Systems; (1997)
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States
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.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daniel P. Heyman "Issues in performance modeling of data teletraffic", Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997);


Back to Top