• Title/Summary/Keyword: Self-similar network traffic

Search Result 52, Processing Time 0.029 seconds

Analysis of EFCI and ER Switches Algorithm for ABR Traffic, Using Self-similar pattern and Poisson pattern (Self-similar 패턴과 Poisson 패턴을 사용한 EFCI와 ER 스위치 알고리즘의 ABR 트래픽 분석)

  • 이동철;박기식;김탁근;손준영;김동일;최삼길
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.296-300
    • /
    • 2000
  • In previous papers, it proved relevant to using together with EFCI and ER switch for effective ABR traffic managements. It also applied to EFCI and ER switch algorithm, that consider ABR traffic as poisson pattern. However, in recently network environment, it has been proved about traffic pattern, that is similar to self-similar pattern than poisson pattern. In this paper, we will compare previous poisson pattern with self-similar pattern under ATM network.

  • PDF

Performance Analysis for ABR Congestion Control Algorithm of ATM Switch using Self-Similar Traffic (자기 유사한 트래픽을 이용한 ATM 스위치의 ABR 혼잡제어 알고리즘의 성능분석)

  • Jin, Sung-Ho;Yim, Jae-Hong
    • The KIPS Transactions:PartC
    • /
    • v.10C no.1
    • /
    • pp.51-60
    • /
    • 2003
  • One of the most important matters in designing network and realizing service, is to grip on the traffic characteristics. Conventional traffic prediction and analysis used the models which based on the Poisson or Markovian. Recently, experimental research on the LAN, WAN and VBR traffic properties have been pointed rut that they weren't able to display actual real traffic specificities because the models based on the Poisson assumption had been underestimated the long range dependency of network traffic and self-similar peculiarities, it has been lately presented that the new approach method using self-similarity characteristics as similar as the real traffic models. Therefore, in this paper, we generated self-similar data traffic like real traffic as background load. On the existing ABR congestion control algorithm, we analyzed by classify into ACR, buffer utilization. cell drop rate, transmission throughput with the representative EFCI, ERICA, EPRCA and NIST twitch algorithm to show the efficient reaction about the burst traffic.

Bandwidth Allocation for Self-Similar Data Traffic Characteristics (자기유사적인 데이터 트래픽 특성을 고려한 대역폭 할당)

  • Lim Seog-Ku
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.3
    • /
    • pp.175-181
    • /
    • 2005
  • Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits at a wide range of scales-Self-similarity. Self-similarity is expressed by long term dependency, this is contradictory concept with Poisson model that have relativity short term dependency. Therefore, first of all for design and dimensioning of next generation communication network, traffic model that are reflected burstness and self-similarity is required. Here self-similarity can be characterized by Hurst parameter. In this paper, when different many data traffic being integrated under various environments is arrived to communication network, Hurst Parameter's change is analyzed and compared with simulation results.

  • PDF

Delay characteristics and Throughput analysis on Network offered Multi-media service (멀티미디어 서비스를 제공하는 네트워크의 지연 특성과 처리율 분석)

  • 황인수;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.2
    • /
    • pp.289-295
    • /
    • 2000
  • Traffic analysis during past years used the Poisson distribution or Markov model, assuming an exponential distribution of packet queue arrival. Recent studies, however, have shown aperiodic and burst characteristics of network traffics. Such characteristics of data traffic enable the scalability of network, QoS, optimized design, when we analyze new traffic model having a self-similar characteristic. This paper analyzes the self-similar characteristics of a small-scale mixed traffic in a network simulation, the real WAN delay time, TCP packet size, and the total network usage.

  • PDF

Statistical Characteristics of Self-similar Data Traffic (자기유사성을 갖는 데이터 트래픽의 통계적인 특성)

  • Koo Hye-Ryun;Hong Keong-Ho;Lim Seog-Ku
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.05a
    • /
    • pp.410-415
    • /
    • 2005
  • Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits at a wide range of scales - Self-similarity. Self-similarity is expressed by long term dependency, this is contradictory concept with Poisson model that have relativity short term dependency. Therefore, first of all for design and dimensioning of next generation communication network, traffic model that are reflected burstness and self-similarity is required. Here self-similarity can be characterized by Hurst parameter. In this paper, when different many data traffic being integrated under various environments is arrived to communication network, Hurst Parameter's change is analyzed and compared with simulation results.

  • PDF

Performance Evaluation of DiffServ Networks Considering Self-Similar Traffic Characteristics (자기유사 트래픽 특성을 고려한 차등서비스 망의 성능 평가)

  • Park, Jeong-Sook;Jeon, Yong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.344-355
    • /
    • 2008
  • In this paper, we are dealing with the problems of performance evaluation of Differentiated Services(DiffServ) networks. For successful performance evaluation, the ability to accurately represent "real" traffic on the network by suitable traffic models is an essential ingredient. Many research results on the nature of real traffic measurements demonstrated LRD(long-range dependence) property for the Internet traffic including Web, TELNET, and P2P traffic. The LRD can be effectively represented by self-similarity. In this paper, we design and implement self-similar traffic generator using the aggregated On/Off source model, based on the analysis of the On-Off source model, FFT-FGN(Fast Fourier Transform-Fractional Gaussian Noise) model, and RMD(Random Midpoint Displacement) model. We confirmed the self-similarity of our generated traffic by checking the packet inter-arrival time of TCPdump data. Further we applied the implemented traffic generator to the performance evaluation of DiffServ networks and observed the effect of performance to the a value of the On/Off model, and performance of EF/BE class traffic by CBQ.

A Comparison of Three Fixed-Length Sequence Generators of Synthetic Self-Similar Network Traffic (Synthetic Self-Similar 네트워크 Traffic의 세 가지 고정길이 Sequence 생성기에 대한 비교)

  • Jeong, Hae-Duck J.;Lee, Jong-Suk R.
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.899-914
    • /
    • 2003
  • It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.

A Study on the Congestion Control with Multiple Time Scale under Self-Similar Traffic (자기유사성 트래픽 조건에서 다중 시간 간격을 이용한 혼잡제어에 관한 연구)

  • Cho, Hyeon-Seob;Kim, Young-Cho;Kim, Hui-Suk
    • Proceedings of the KAIS Fall Conference
    • /
    • 2006.05a
    • /
    • pp.294-297
    • /
    • 2006
  • Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

  • PDF

On the QoS Behavior of Self-Similar Traffic in a Converged ONU-BS Under Custom Queueing

  • Obele, Brownson Obaridoa;Iftikhar, Mohsin;Kang, Min-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.286-297
    • /
    • 2011
  • A novel converged optical network unit (ONU)-base station (BS) architecture has been contemplated for next-generation optical-wireless networks. It has been demonstrated through high quality studies that data traffic carried by both wired and wireless networks exhibit self-similar and long range dependent characteristics; attributes that classical teletraffic theory based on simplistic Poisson models fail to capture. Therefore, in order to apprehend the proposed converged architecture and to reinforce the provisioning of tightly bound quality of service (QoS) parameters to end-users, we substantiate the analysis of the QoS behavior of the ONU-BS under self-similar and long range dependent traffic conditions using custom queuing which is a common queuing discipline. This paper extends our previous work on priority queuing and brings novelty in terms of presenting performance analysis of the converged ONU-BS under realistic traffic load conditions. Further, the presented analysis can be used as a network planning and optimization tool to select the most robust and appropriate queuing discipline for the ONU-BS relevant to the QoS requirements of different applications.

Congestion Control of Self-Similar Traffic in Two-way Network (양방향 네트워크에서 자기유사성 트래픽 혼잡 제어)

  • 석경휴;송선희;김철영;나상동
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.295-303
    • /
    • 2004
  • In this Paper, we discuss an active TCP link of unsynchronized transmission mode network in two-way traffic and the Improvement of its traffic patron thorough the network pathway of protocol is shown. This is because the traffic pattern is performed on the basis of existing windows which are distributing information in several periods of time in the way of interfacing LTS control module, which is controlling by an information of exceeding the time limit of feedback loop determined by RTP, with TCP. The simulation to utilize this efficiently is performed with the circumstance of bench mark based on physical modeling of the self-similarity traffic in the performance of TCP. In this paper, we use a methodology to understand and evaluate the effect of change of transmitting protocol in sticks under the condition of the self-similar traffic in two-way network and it is shown that an improvement of congestion control by self-similarity under a heavy condition.