• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.65-75
• /
• 2005

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 have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.37-45
• /
• 2004

As Internet technologies are mature, many new applications that are different characteristics are emerging. Recently we see wide use of P2P(Peer to Peer) applications of which traffic shows different statistical characteristics compared with traditional application such as web(HTTP) and FTP(File Transfer Protocol). In this paper, we measured subscriber network of KT(Korea Telecom) to analyze P2P traffic characteristics. We show flow characteristics of measured traffic. We also estimate Hurst parameter of P2P traffic and compare self-similarity with web traffic. Analysis results indicate that P2P traffic is much bustier than web traffic and makes both upstream traffic and downstream traffic be symmetric. To predict parameters related QoS such as packet loss and delays we model P2P traffic using two self-similar traffic models and predict both loss probability and mm delay then compare their accuracies. With simulation we show that the self-similar traffic models we derive predict the performance of P2P traffic accurately and thus when we design a network or evaluate its performance, we can use the P2P traffic model as reference input traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.279-288
• /
• 2004

Rapidly emerging P2P(Peer to Peer) applications generate very bursty traffic, which gives a lot of burden to network, and the amount of such traffic is increasing rapidly. Thus it is becoming more important to understand the characteristics of such traffic and reflect it when we design and analyze the network. To do that we measured the traffic in a campus network and present flow statistics and traffic models of the measured traffic, and compare them with those of the web traffic. The results indicate that P2P traffic is much burstier than web traffic and as a result it negatively affects network performance. We modeled P2P traffic using self-similar traffic model to predict packet delay and loss occurred in network which are very important to evaluate network performance. We also predict queue length distribution and loss probability in SSQ(Single Sewer Queue). To assess accuracy of traffic model, we compare the SSQ statistics of traffic models with that of the traffic trace. The results show that self-similar traffic models we use can predict P2P traffic behavior in network precisely. It is expected that the traffic models we derived can be used when we design network capacity and predict network performance and QoS of the P2P applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6B
• /
• pp.575-583
• /
• 2004

In this paper, we extend the multiple time scale control framework to the window-based congestion control, in particular, such as the TCP. This is performed by interfacing the TCP with a large time scale control module which adjusts the aggressiveness of the bandwidth consumption behavior exhibited by the TCP as a function of large time scale Self-Similar network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by the RTT. How to effectively utilize such an information-due to its probabilistic nature, dispersion over the multiple time scales, and affection on the top of the existing window-based congestion controls-is a non-trivial problem. The evaluation performance of the multiple time scale TCP is facilitated by a simulation of the bench-mark environment which is based on the physical modeling of a self-similar traffic. We explicate our methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under the self-similar traffic conditions. We discuss issues arising in the comparative performance evaluation under heavy-tailed workloads.

• Proceedings of the KAIS Fall Conference
• /
• 2007.11a
• /
• pp.174-177
• /
• 2007

이동통신망의 규모나 서비스 등이 기하급수적으로 증가하기 때문에 데이터 트래픽에 대한 정확한 특성분석은 매우 어렵지만, 트래픽 특성분석이 망 설계나 운용에 상당한 영향을 미친다는 점을 고려하면, 데이터 트래픽 모델링에 대한 연구는 가장 기본적으로 이루어져야 할 사항이라 할 수 있다. 따라서 본 논문에서는 데이터 트래픽에 대한 특성을 분석하기 위해 cdma2000 시스템의 국제적인 표준화 단체인 3GPP2에서 언급한 HTTP, FTP, WAP, Near Real Time Video 트래픽에 대한 트래픽 특성을 분석하여 자기 유사성(Self-similarity)을 가짐을 입증하였다.

• 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.

• Journal of Internet Computing and Services
• /
• v.17 no.2
• /
• pp.19-28
• /
• 2016

Internet traffic has been significantly increasing due to the development of information and communication networks and the growing numbers of cell phone users that access networks. This paper connects to this issue by presenting a way to detect and analyze a typical DDoS attack that results in Internet breaches and network attacks, which are on the increase. To achieve this goal, we improve features and GUI of the existing ATMSim analysis package and use it. This package operates on a network flow-based analysis method, which means that normal traffic collected through an internal LAN at the Korean Bible University campus as well as anomaly traffic with DDoS attacks are generated. Self-similarity processes are used to analyze normal and anomaly traffic that are collected and generated from the improved ATMSim. Our numerical results obtained from three Hurst parameter estimate techniques show that there is quantitatively a significant difference between normal traffic and anomaly traffic from a self-similarity perspective.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.274-287
• /
• 2009

In the Internet environment in which best-effort services are provided, we need to guarantee end-to-end performance rather than hop performance to provide services with a variety of QoS(Quality of Service) requirements. The end-to-end performance is affected by many factors along the path of traffic flow. Most existing simulation studies are concentrated on a single node or a few nodes. We need much different approach considering the simulation execution time to simulate a large-scale network. In this paper, we derive requirements and present methodologies for the implementation of the simulator to simulate it. Then, we design and implement our simulator using OPNET. Performance evaluation is carried out using the simulator for large-scale KII (National Information Infrastructure in Korea). We use a self-similar traffic model and present some results on the end-to-end performance metric for the networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1531-1534
• /
• 2002

주로 음성 트래픽을 처리하는 2G CDMA/PCS 시스템과 달리 CDMA2000 및 IxEV-DO 와 같은 차세대 이동통신시스템은 음성 트래픽뿐 만 아니라 패킷형태의 데이터 트래픽도 처리해야 하므로 차세대 이동통신망의 설계 및 디멘져닝을 위해서는 무엇보다도 데이터 트래픽의 주요 특성인 버스트성(Burstiness)과 자기유사성(Self-similarity)이 반영된 트래픽 모델이 요구된다. 이러한 관점에서 본 논문에서는 데이터 트래픽 특성이 서로 다른 다수의 데이터 트래픽의 통합되어 망에 입력되는 경우의 성능을 시뮬레이션 하였고, 그 결과를 해석적 모델인 Norros의 Effective Bandwidth Formula및 Z. FAN의 Bahadur-Rao Theorem을 적용한 Formula와도 비교하였다.