SRA 알고리즘을 이용한 Self-Similar 네트워크 Traffic의 생성
Algorithmic Generation of Self-Similar Network Traffic Based on SRA
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
최근의 컴퓨터 네트워크에서 teletraffic의 양상은 Poisson 프로세스보다 self-similar 프로세스에 의해서 더 잘 반영된다. 이는 컴퓨터 네트워크의 teletraffic에 관련하여 self-similar한 성질을 고려하지 않는다면, 컴퓨터 네트워크의 성능에 관한 결과는 부정확 할 수밖에 없다는 의미가 된다. 따라서, 통신 네트워크에 관한 시뮬레이션을 수행하기 위한 매우 중요한 요소 중에 하나는 충분히 긴 self-similar한 sequence를 얼마나 잘 생성하느냐의 문제이다. 본 논문에서는 SRA (successive random addition) 방법을 이용한 pseudo-random self-similar sequence 생성기를 구현 및 분석하였다. 본 pseudo-random self-similar sequence 생성기의 성질을 매우 긴 sequence를 생성하는데 요구되는 통계적인 정확도와 생성시간에 대해서 분석하였다. 본 논문에서 제안한 SRA 방법을 이용한 pseudo-random self-similar sequence 생성기의 성능은 Hurst 변수의 상대적인 정확도로 보았을 때, 그리고 sequence의 생성시간을 고려했을 때에 적합함을 보였다. 이 생성기의 이론적 complexity는 n개의 난수를 발생하는데 O(n)이 요구된다.
Abstract
It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern computer networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of computer networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A generator of pseudo-random self-similar sequences, based on the SRA (successive random addition) method, is implemented and analysed in this paper. Properties of this generator were experimentally studied in the sense of its statistical accuracy and the time required to produce sequences of a given (long) length. This generator shows acceptable level of accuracy of the output data (in the sense of relative accuracy of the Hurst parameter) and is fast. The theoretical algorithmic complexity is O(n).
참고문헌 (22)
- "Statistical Methods for Data with Long Range Dependence", 7, pp.404~427 (1992)
- "Statistics for Long-Memory Processes" (1994)
- "Numerical Methods for Fitting and Simulating Autoregressive-to-Anything Processes", 10, pp.72~81 (1998)
- "Fractals and Chaos" (1991)
- "Modeling and Generation of Self-Similar VBR Video Traffic Proceedings of ACM SIGCOMM'94", 24, pp.269~280 (1994)
- "Nonparametric Statistical Inference", inc. (1992)
- "Long Memory Relationships and the Aggregation of Dynamic Models", 14(rth-holland publishing company), pp.227 1980~238
- "Modeling Persistence in Hydrological Time Series Using Fractional Differencing", 20
- "A Source Model for VBR Video Traffic Based on Input Processes", pp.1441~1448 (1998)
- "Self-Similar Traffic Generation: the Random Midpoint Displacement Algorithm and its Properties", pp.466~472 (1995)
- "On the Self-Similar Nature of Ethernet Traffic IEEE ACM Transactions on Networking", 2, pp.1~15 (1994)
- "Analysis of an ATM Buffer with Self-Similar (``Fractal'') Input Traffic", pp.985~992 (1995)
- "A Fast Fractional Gaussian Noise Ge- nerator", 7, pp.543~553 (1971)
- "Computer Experiments with Fractional Gaussian Noises", 5, pp.228~267 (1969)
- "The Concept of Relevant Time Scales and its Application to Queueing Analysis of Self-Similar Traffic or Is Hurst Naughty or Nice Proceedings of ACM SIGMETRICS'98", pp.222~232 (1998)
- "A Storage Model with Self-Similar Input", 16, pp.387~396 (1994)
- "Fast Approximation of Self-Similar Network Traffic", (lbl-36750) (1995), University of California
- "the Failure of Poisson Modeling Proceedings of ACM SIGCOMM'94", pp.257~268 (1994)
- "The Science of Fractal Images" (1988)
- "Traffic Modeling of Variable Bit Rate MPEG Video and Its Impacts on ATM Networks" (1997)
- "Fractal Network Traffic: from Understanding to Implications" (1996), Columbia University, Graduate School of Arts and Sciences
- "Efficient Fractional Gaussian Noise Generation Using the Spatial Renewal Process", pp.7~11 (1998)