DMCA
Self-Similar Network Traffic: An Overview (1999)
| Citations: | 96 - 7 self |
BibTeX
@MISC{Park99self-similarnetwork,
author = {Kihong Park and Walter Willinger},
title = {Self-Similar Network Traffic: An Overview},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
INTRODUCTION 1.1.1 Background Since the seminal study of Leland, Taqqu, Willinger and Wilson [41] which set the groundwork for considering self-similarity an important notion in the understanding of network traffic including the modeling and analysis of network performance, an explosion of work has ensued investigating the multifaceted nature of this phenomenon. 1 The long held paradigm in the communication and performance communities has been that voice traffic and, by extension, data traffic are adequately described by certain Markovian models (e.g., Poisson) which are amenable to accurate analysis and efficient control. The first property stems from the well-developed field of Markovian analysis which allows tight equilibrium bounds on performance variables such as the waiting time in various queueing systems to be found. This also 1 For a non-technical account of the discovery of the self-similar nature of network traffic, including parallel effort
Keyphrases
self-similar network traffic network traffic important notion parallel effort non-technical account voice traffic performance variable efficient control markovian analysis long held paradigm first property tight equilibrium bound performance community multifaceted nature well-developed field seminal study data traffic self-similar nature certain markovian model network performance
