Fast approximation of selfsimilar network traffic
Abstract
Recent network traffic studies argue that network arrival processes are much more faithfully modeled using statistically selfsimilar processes instead of traditional Poisson processes [LTWW94a, PF94]. One difficulty in dealing with selfsimilar models is how to efficiently synthesize traces (sample paths) corresponding to selfsimilar traffic. We present a fast Fourier transform method for synthesizing approximate selfsimilar sample paths and assess its performance and validity. We find that the method is as fast or faster than existing methods and appears to generate a closer approximation to true selfsimilar sample paths than the other known fast method (Random Midpoint Displacement). We then discuss issues in using such synthesized sample paths for simulating network traffic, and how an approximation used by our method can dramatically speed up evaluation of Whittle`s estimator for H, the Hurst parameter giving the strength of longrange dependence present in a selfsimilar time series.
 Authors:
 Publication Date:
 Research Org.:
 Lawrence Berkeley Lab., CA (United States)
 Sponsoring Org.:
 USDOE, Washington, DC (United States)
 OSTI Identifier:
 64968
 Report Number(s):
 LBL36750; CONF95081181
ON: DE95011271
 DOE Contract Number:
 AC0376SF00098
 Resource Type:
 Conference
 Resource Relation:
 Conference: SIGCOMM `95, Boston, MA (United States), 30 Aug  2 Sep 1995; Other Information: PBD: Jan 1995
 Country of Publication:
 United States
 Language:
 English
 Subject:
 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; COMPUTER NETWORKS; SIMULATION; FOURIER TRANSFORMATION; ALGORITHMS
Citation Formats
Paxson, V. Fast approximation of selfsimilar network traffic. United States: N. p., 1995.
Web.
Paxson, V. Fast approximation of selfsimilar network traffic. United States.
Paxson, V. 1995.
"Fast approximation of selfsimilar network traffic". United States.
doi:. https://www.osti.gov/servlets/purl/64968.
@article{osti_64968,
title = {Fast approximation of selfsimilar network traffic},
author = {Paxson, V.},
abstractNote = {Recent network traffic studies argue that network arrival processes are much more faithfully modeled using statistically selfsimilar processes instead of traditional Poisson processes [LTWW94a, PF94]. One difficulty in dealing with selfsimilar models is how to efficiently synthesize traces (sample paths) corresponding to selfsimilar traffic. We present a fast Fourier transform method for synthesizing approximate selfsimilar sample paths and assess its performance and validity. We find that the method is as fast or faster than existing methods and appears to generate a closer approximation to true selfsimilar sample paths than the other known fast method (Random Midpoint Displacement). We then discuss issues in using such synthesized sample paths for simulating network traffic, and how an approximation used by our method can dramatically speed up evaluation of Whittle`s estimator for H, the Hurst parameter giving the strength of longrange dependence present in a selfsimilar time series.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 1995,
month = 1
}

Previous studies demonstrated that Ethemet local area network traffic is statistically selfsimilar and that the commonly used Poisson models are not able to capture the fractal characteristics of Ethemet traffic. This contribution uses simulated selfsimilar traffic traces from the MITRE Corporation and Sandia`s simulation software to evaluate the ABR performance of an ATM backbone. The ATM backbone interconnects Ethemet LANs via edge devices such as routers and bridges. We evaluate the overall network performance in terms of throughput, response time, fairness, and buffer requirements. Because typical edge devices perform simple forwarding functions, their usual mechanism for signaling network congestion ismore »

Network traffic as a selforganized critical phenomena
This paper presents an overview of an approach to address complexity issues and reallife problems in large, urban transportation systems. In this context we discuss the fundamental problem of designing a metropolitan transportation system which is both efficient and controllable. 
Performance analysis of ATM ABR service under selfsimilar traffic in the presence of background VBR traffic
Recent empirical studies of traffic measurements of packet switched networks have demonstrated that actual network traffic is selfsimilar, or long range dependent, in nature. That is, the measured traffic is bursty over a wide range of time intervals. Furthermore, the emergence of highspeed network backbones demands the study of accurate models of aggregated traffic to assess network performance. This paper provides a method for generation of selfsimilar traffic, which can be used to drive network simulation models. The authors present the results of a simulation study of a twonode ATM network configuration that supports the ATM Forum`s Available Bit Ratemore » 
FPGA Based Realtime Network Traffic Analysis using Traffic Dispersion Patterns
The problem of Network Traffic Classification (NTC) has attracted significant amount of interest in the research community, offering a wide range of solutions at various levels. The core challenge is in addressing high amounts of traffic diversity found in today's networks. The problem becomes more challenging if a quick detection is required as in the case of identifying malicious network behavior or new applications like peertopeer traffic that have potential to quickly throttle the network bandwidth or cause significant damage. Recently, Traffic Dispersion Graphs (TDGs) have been introduced as a viable candidate for NTC. The TDGs work by forming amore » 
Heuristic method on solving traffic network under variable parameter condition
The two crucial problems in traffic network and trip forecasting are {open_quotes}trip distribution{close_quotes} and {open_quotes}traffic assignment{close_quotes}. There are interrelated and interdependent problems either in theory or in practice, because in the problem of trip distribution, trip fares (resistances on network links) are needed as parameters in order to solve the OD (origindestination) trip matrix, and in the problem of traffic assignment, the resistances on network links (trip fares) are also functions of trip flow. The problem of traffic resistance is linked with and used as a variable in the above two problems. These problems have been studied over hundred years.more »