• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.51-59
• /
• 2001

In order to support various QoS, IETF has proposed the Differentiated Services Model which provides discrimination service according to t the user’s requirements and payment intention intention for each traffic characteristic. This model is an excellent mechanism, which is not too c complicated in terms of the management for service and network model. Also, it has scalability that satisfies the requirement of Differentiated Services. In this paper, We define the Differentiated Services Model using feedback control, propose its control procedure, and analyze its p performance. In conventional model, non-adaptive traffic, such as UDP traffic, is more occupied the network resource than adaptive traffic, such a as TCP traffic. On the other hand, the Differentiated Services Model using feedback control fairly utlizes the network resources and even p prevents congestion occurrence due to its ability of congestion expectation.

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

• 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와도 비교하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.640-642
• /
• 2002

본 논문에서는 실제 네트워크에서 측정되고 있는 시간축상으로 매우 불안정한 상태의 트래픽 즉, ON／OFF 소스 모델로 가정하여 발생시킨 self-similar 트래픽을 이용하여 다단으로 이루어진 스위치 모델의 처리시간(processing time)에 따른 출력단에서self-similarity의 변화와 이용도(utilization) 등을 사용하여 네트워크의 성능을 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.968-971
• /
• 2019

본 논문에서는 정상과 봇넷 트래픽을 분류하기 위해 트래픽 데이터에서 페이로드 패턴을 추한다. 추출된 가변 길이의 패턴으로 마코브 체인 분류 모델을 학습한다. 마코브 체인 모델은 상태 변이 확률을 계산하며, 봇넷 트래픽에서 나타나는 규칙적인 패턴을 학습하기 적합하다. 모델 성능 개선을 위해서 페이로드 패턴의 최소 길이와 마코브 체인 모델의 최적 상태 수 파라미터를 찾는다. 다중 분류 실험 결과로 약 0.95의 정확도와 0.02의 오탐률을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.142-155
• /
• 2000

In this paper, we propose an efficient policing mechanism for Markov model-based traffic descriptors of VBR MPEG video traffic. A VBR video sequence is described by a set of traffic descriptors using a scene-basedMarkov model to the network for the effective resource allocation and accurate QoS prediction. The networkmonitors the input traffic from the source using a proposed new policing method. for policing the steady statetransition probability of scene states, we define two representative monitoring parameters (mean holding andrecurrence time) for each state. For frame level cell rate policing of each scene state, accumulated average cellrates for the frame types are compared with the model parameters. We propose an exponential bounding functionto accommodate dynanic behaviors during the transient period. Our simulation results show that the proposedpolicing mechanism for Markovian traffic descriptors monitors the sophisticated traffic such as MPEG videoeffectively and well protects network resources from the nalicious or misbehaved traffic.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.549-551
• /
• 2023

차량용 인포테인먼트 시스템은 차량 내부에서 정보와 엔터테인먼트 기능을 제공하는 시스템으로, 현재 급격한 성장세를 보이고 있다. 이에 따라 많은 기업이 차량용 인포테인먼트 관련 기술을 연구하고 개발하고 있다. 이는 결국 차량에서 발생하는 트래픽이 이전보다 증가하는 것을 의미한다. 차량 발생 트래픽은 모바일 트래픽과 달리 시간에 따라 뚜렷한 발생 패턴을 보인다. 이러한 특성을 고려하여 RNN, LSTM, GRU 세 가지 종류의 순환 신경망 모델을 활용하여 차량 트래픽 예측 모델을 구현하였고 시간대별 모델 성능을 비교한 결과, LSTM이 가장 우수한 성능을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7C
• /
• pp.670-676
• /
• 2002

The object of ATM network is to the guarantee quality of service(QoS). Therefore, various of traffic management schemes have been proposed. Among these schemes, call admission control(CAC) is very important to provide real-time services and ON-OFF model, which is single source traffic model, has been used. But ON-OFF model differ from GCRA(Generic Cell Rate Algorithm) controlled traffic in ATM network. In this paper, we analyze the traffic, which is controlled as dual GCRA, and propose TWM(Three-state Worst-case Model), which is new single source traffic model. We also proposed CAC to guarantee peak-to-peak CDV(Cell Delay Variation) based on the TWM. In experiments, ON-OFF model and TWM are compared to show that TWM is superior to ON-Off model in terms of QoS guaranteeing.

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

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2954-2972
• /
• 1998

It is expected that the transport of compressed video will become a significant part of total network traffic because of the widespread introduction of multimedial services such as VOD(video on demand). Accordingly, VBR(variable bit-rate) encoded video will be widely used, due to its advantages in statistical multiplexing gain and consistent vido quality. Since the transport of video traffic requires larger bandwidth than that of voice and data, the characterization of video source and traffic modeling is very important for the design of proper resource allocation scheme in ATM networks. Suitable statistical source models are also required to analyze performance metrics such as packet loss, delay and jitter. In this paper, we analyzed and described on the characterization and traffic modeling of MPEG video sources. The models are broadly classified into two categories; i.e., statistical models and deterministic models. In statistical models, the models are categorized into five groups: AR(autoregressive), Markov, composite Marko and AR, TES, and selfsimilar models. In deterministic models, the models are categorized into $({\sigma},\;{\rho}$, parameterized model, D-BIND, and Empirical Envelopes models. Each model was analyzed for its characteristics along with corresponding advantages and shortcomings, and we made comparisons on the complexity of each model.