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

Search Result 52, Processing Time 0.031 seconds

A Study on Analysis Characteristic Self-similar for Network Traffic with Multiple Time Scale (다중화된 네트워크 트래픽의 self-similar 특성 분석에 관한 연구)

  • Cho, Hyun-Seob;Han, Gun-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.11
    • /
    • pp.3098-3103
    • /
    • 2009
  • In this paper, self-similar characteristics over statistical approaches and real-time Ethernet network traffic measurements are estimated. It is also shown that the self-similar traffic reflects real Ethernet traffic chareacteristics by comparing TCP-MT source model which is exactly self-similar model to the traditional Poisson model.

Performance Analysis of ABR Congestion Control Algorithm using Self-Similar Traffic

  • Kim, Dong-Il;Jin, Sung-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.1
    • /
    • pp.15-21
    • /
    • 2004
  • One of the most important issues in designing a network and realizing a service is dealing with traffic characteristics. Recent experimental research on LAN, WAN, and VBR traffic properties has highlighted that real traffic specificities can not be displayed because the current models based on the Poisson assumption under estimate the long range dependency of network traffic and self-similar peculiarities. Therefore, a new approach using self-similarity characteristics as a real traffic model was recently developed. In This paper we discusses the definition of self-similarity traffic. Moreover, real traffic was collected and we generated self-similar data traffic like real traffic to background load. On the existing ABR congestion control algorithm transmission throughput with the representative ERICA, EPRCA and NIST switch algorithm show the efficient reaction about the burst traffic.

A study about analysis of self-similar characteristics for the optimized design networks (Network 최적 설계를 위한 네트워크 트래픽의 self-similar 특성 분석에 관한 연구)

  • 이동철;김창호;황인수;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.10a
    • /
    • pp.267-271
    • /
    • 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 network Traffic.

  • PDF

A Study on the optimization design of ATM network Using Internet Traffic Characteristics (인터넷 트래픽 특성을 이용한 ATM 망의 최적설계에 관한 연구)

  • 최삼길;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.4
    • /
    • pp.574-581
    • /
    • 2002
  • Traditional queueing analyses are very useful for designing a network's capacity and predicting their performances, however most of the predicted results from the queueing analyses are quite different from the realistic measured performance. And recent empirical studies on LAN, WAN, and VBR traffic characteristic have indicated that the models used in the traditional Poisson assumption cannot properly predict the real traffic properties due to underestimation of the long-range dependence of network traffics and self-similar properties. In this paper, It is also shown that the self-similar traffic reflects real Ethernet traffic characteristics by comparing Pareto-like ON/OFF source model which is exactly self-similar model to the traditional Poisson model. It is also performed optimization design and performance analysis of ATM network using Internet traffic characteristics.

Analysis of self-similar characteristics in the networks (Network에서 트래픽의 self-similar 특성 분석)

  • 황인수;이동철;박기식;최삼길;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.263-267
    • /
    • 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

A Study on the World Wide Web Traffic Source Modeling with Self-Similarity (자기 유사성을 갖는 World Wide Web 트래픽 소스 모델링에 관한 연구)

  • 김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.3
    • /
    • pp.416-420
    • /
    • 2002
  • Traditional queueing analyses are very useful for designing a network's capacity and predicting there performances, however most of the predicted results from the queueing analyses are quite different from the realistic measured performance. And recent empirical studies on LAN, WAN and VBR traffic characteristics have indicated that the models used in the traditional Poisson assumption can't properly predict the real traffic properties due to under estimation of the long range dependence of network traffic and self-similarity In this parer self-similar characteristics over statistical approaches and real time network traffic measurements are estimated It is also shown that the self- similar traffic reflects network traffic characteristics by comparing source model.

A Study on the World Wide Web Traffic Source Modeling with Self-Similarity (자기 유사성을 갖는 World Wide Web 트래픽 소스 모델링에 관한 연구)

  • 김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.104-107
    • /
    • 2002
  • Traditional queueing analyses are very useful for designing a network's capacity and predicting there performances, however most of the predicted results from the queueing analyses are quite different from the realistic measured performance. And recent empirical studies on LAN, WAN and VBR traffic characteristics have indicated that the models used in the traditional Poisson assumption can't properly predict the real traffic properties due to under estimation of the long range dependence of network traffic and self-similarity. In this paper self-similar characteristics over statistical approaches and real time network traffic measurements are estimated. It is also shown that the self-similar traffic reflects network traffic characteristics by comparing source model.

  • PDF

Call Admission Control for Shared Buffer Memory Switch Network with Self-Similar Traffic (Self-Similar 트래픽을 갖는 공유버퍼 메모리 스위치 네트워크 환경에서 호 수락 제어 방법)

  • Kim Ki wan;Kim Doo yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.162-169
    • /
    • 2005
  • Network traffic measurements show that the data traffic on packet switched networks has the self-similar features which is different from the traditional traffic models such as Poisson distribution or Markovian process model. Most of the call admission control researches have been done on the performance analysis of a single network switch. It is necessary to consider the performance analysis of the proposed admission control scheme under interconnected switch environment because the data traffic transmits through switches in networks. From the simulation results, it is shown that the call admission control scheme may not operate properly on the interconnected switch even though the scheme works well on a single switch. In this parer, we analyze the cell loss probability, utilization and self-similarity of output ports of the interconnected networks switch by using shared buffer memory management schemes and propose the new call admission control scheme considering the interconnected network switches under self-similar traffic environments.

An Adaptive Proportional Integral Active Queue Management Algorithm based on Self-Similar Traffic Rate Estimation in WSN

  • Liu, Heng;Wang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1946-1958
    • /
    • 2011
  • Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.

An Analysis of Data Traffic Considering the Delay and Cell Loss Probability (지연시간과 손실율을 고려한 데이터 트래픽 분석)

  • Lim Seog -Ku
    • Journal of Digital Contents Society
    • /
    • v.5 no.1
    • /
    • pp.7-11
    • /
    • 2004
  • There are many problems that must solve to construct next generation high-speed communication network. Among these, item that must consider basically is characteristics analysis of traffic that nows to network Traffic characteristics of many Internet services that is offered present have shown that network traffic exhibits at a wide range of scals-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 burstiness and self-similarity is required. Here self-similarity can be characterized by Hurst parameter. In this paper, the calculation equation is derived considering queueing delay and self-similarity of data traffic art compared with simulation results.

  • PDF