Self-Similar Traffic Models
| dc.contributor.advisor | Baras, John S. | en_US |
| dc.contributor.author | Ramakrishnan, Pradeep | en_US |
| dc.contributor.department | ISR | en_US |
| dc.contributor.department | CSHCN | en_US |
| dc.date.accessioned | 2007-05-23T10:08:01Z | |
| dc.date.available | 2007-05-23T10:08:01Z | |
| dc.date.issued | 1999 | en_US |
| dc.description.abstract | With the advent of broadband communications characterized by a heterogeneous traffic mix (e.g. video conferencing applications, ftp, browsing the web....), commonly held assumptions of traditional traffic models have been put into question. Essentially the present type of traffic is of a highly bursty nature, which is not captured by the traditional traffic models (e.g. Poisson Process). This has a major impact on the design of a network. New models that characterize this burstiness effect are required for the analysis, design, planning, engineering and congestion management of broad-band networks [1].<BR><BR>Measurements using high-resolution traffic equipments of wide area network traffic have confirmed this particular traffic phenomenon. The features shown by the traffic have been called "self-similar or fractal traffic". Their important properties are stated below [1] :- <BR><BR>Distributions of the actual traffic processes decay more slowly (heavy tailed, e.g. of such a distribution is the Pareto distribution) than exponentially (light tailed e.g. a Poisson distribution). <i>See</i> definition of heavy tail and light tailed distribution in the appendix. <BR><BR>Correlations exhibit a hyperbolic (long range dependence) rather than an exponential (short range dependence) decay. <BR><BR>Traditional traffic models used in queueing analysis assume variations only in limited time scales while long-range dependent or self-similar processes fluctuate over a wide range of time scales. This report tries to present various traffic models that represent these properties and the important parameters that need to be estimated which will hopefully enable the design of an optimum network. | en_US |
| dc.format.extent | 208181 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/6063 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1999-12 | en_US |
| dc.relation.ispartofseries | CSHCN; TR 1999-5 | en_US |
| dc.subject | TCP | en_US |
| dc.subject | MATLAB | en_US |
| dc.subject | OPNET | en_US |
| dc.subject | Internet | en_US |
| dc.subject | Intelligent Signal Processing and Communications Systems | en_US |
| dc.title | Self-Similar Traffic Models | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1