• Title/Summary/Keyword: traffic smoothing

Search Result 61, Processing Time 0.024 seconds

TRAFFIC FLOW MODELS WITH NONLOCAL LOOKING AHEAD-BEHIND DYNAMICS

  • Lee, Yongki
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.4
    • /
    • pp.987-1004
    • /
    • 2020
  • Motivated by the traffic flow model with Arrhenius looka-head relaxation dynamics introduced in [25], this paper proposes a traffic flow model with look ahead relaxation-behind intensification by inserting look behind intensification dynamics to the flux. Finite time shock formation conditions in the proposed model with various types of interaction potentials are identified. Several numerical experiments are performed in order to demonstrate the performance of the modified model. It is observed that, comparing to other well-known macroscopic traffic flow models, the model equipped with look ahead relaxation-behind intensification has both enhanced dispersive and smoothing effects.

The Outlier-Filtering Algorithm for National Highway Continuous Traffic Counts Data (일반국도 상시조사 교통량 자료의 이상치 판정 알고리즘 개발)

  • Shin, Jae Myong;Lee, Sang Hyup;Kim, Hyun Suk
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.2
    • /
    • pp.691-702
    • /
    • 2013
  • In this study the quantitative outlier-filtering algorithm has been developed using the smoothing method based on the day-of-the-week traffic volume variation pattern and then, in order to test the effectiveness of the algorithm, it has been used to identify outliers from the traffic volume data collected at 14 continuous traffic counts sites on the national highways in the year 2010. The test results are satisfactory since the filtering rate is 98.2% for normal days and the mis-filtering rate is 8.0% for abnormal days. Therefore, the algorithm will be able to be used for roughly-but-quickly filtering outliers from the collected traffic volume data.

A New Bandwidth Smoothing Technique for On-Line Video Services based on Multicasting (멀티캐스팅 방식의 온라인 비디오 서비스를 위한 새로운 대역폭 완화기법)

  • Jin, Seong-Gi;Kim, Jin-Seok;Gang, Seok-Ryeol;Yun, Hyeon-Su
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.939-948
    • /
    • 1999
  • 주문형 비디오나 원격 회의 그리고 원격 강의와 같은 멀티미디어 애플리케이션들은 비디오나 오디오와 같은 멀티미디어 트래픽을 유발한다. 이러한 멀티미디어 트래픽의 가장 큰 특성은 폭주성이다. 폭주성은 통신망의 효율을 떨어뜨리는 매우 중요한 요인이며, 따라서 폭주성에 대처할 수 있는 효율적인 대역폭 할당 정책이 통신망 관리에서 매우 중요하다. 본 논문에서는 멀티캐스팅 방식의 온라인 비디오 애플리케이션에 대해서 대역폭 완화 작업이라고 불리우는 효율적이고 유용한 대역폭 할당 방안을 설계하였다. 본 논문에서 제시하는 새로운 대역폭 완화 기법은 비디오 서버에서 이미 전송된 데이타의 특성을 이용하여 대역폭 완화창의 크기를 조절하는 동적인 기법이다. 몇 가지 MPEG 트레이스들로 실험했을 때 기존의 온라인 대역폭 완화 기법과 비슷한 성능을 보이고, 특히 멀티캐스팅 방식의 온라인 비디오 서비스에 대해서는 서버의 자원 효율성을 향상시킴을 알 수 있었다. Abstract All of the multimedia applications such as VOD, teleconferencing, and tele-lecturing invoke multimedia traffic like video or audio traffic. The most important characteristic of these multimedia traffic is the burstiness property. So, bandwidth management is becoming the major part of network management. In this paper, we propose a new and efficient bandwidth management technique called bandwidth smoothing for the multicasting on-line video applications. Our bandwidth smoothing technique reduces as much of the network bandwidth required to transmit on-line video traffic as previously proposed methods, and improves the server's resource utilization especially for the multicast on-line video services.

WRR Cell Scheduling Algorithm for Improving Smoothing Scheme (평탄화 기법을 개선한 WRR 셀 스케쥴링 알고리즘)

  • 조해성
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.3
    • /
    • pp.55-62
    • /
    • 2003
  • In this paper, I proposed a new WRR Cell Scheduling algorithm for improving the problem of existing smoothing scheme. in proposed algorithm, when queue of being service VC in present round is emptied, instead VC that difference between assigned weight and length of present buffer is biggest in all VC service. This result efficiency of bandwidth allocation is increased. And above all real-time traffic is serviced, non-real-time to allocate bandwidth of the remainder multimedia-service is possible. In one cycle, number of serviced average cell is increased. And for many eel serviced, length of total Duffer is decreased.

  • PDF

GOP ARIMA based Bandwidth Prediction for Non-stationary VBR Traffic (MPEG VBR 트래픽을 위한 GOP ARIMA 기반 대역폭 예측기법)

  • Kang, Sung-Joo;Won, You-Jip
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.301-303
    • /
    • 2004
  • In this work, we develop on-line traffic prediction algorithm for real-time VBR traffic. There are a number of important issues: (i) The traffic prediction algorithm should exploit the stochastic characteristics of the underlying traffic and (ii) it should quickly adapt to structural changes in underlying traffic. GOP ARIMA model effectively addresses this issues and it is used as basis in our bandwidth prediction. Our prediction model deploy Kalman filter to incorporate the prediction error for the next prediction round. We examine the performance of GOP ARIMA based prediction with linear prediction with LMS and double exponential smoothing. The proposed prediction algorithm exhibits superior performam againt the rest.

  • PDF

Video Stream Smoothing Using Multistreams (멀티스트림을 이용한 비디오 스트림의 평활화)

  • 강경원;문광석
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.1
    • /
    • pp.21-26
    • /
    • 2002
  • Video stream invoke a variety of traffic with the structure of compression algorithm and image complexity. Thus, it is difficult to allocate the resource on the both sides of sender and receiver, and playout on the Internet such as a packet switched network. Thus, in this paper we proposed video stream smoothing using multistream for the effective transmission of video stream. This method specifies the type of LDU(logical data unit) according to the type of original stream, and then makes a large number of streams as a fixed size, and transfers them. So, the proposed method can reduce the buffering time which occurs during the process of the smoothing and prefetch be robust to the jitter on network, as well. Consequently, it has the effective transmission characteristics of fully utilizing the clients bandwidth.

  • PDF

Performance Analysis of Traffic Shaper for an MPEG Video Source (MPEG 비디오원을 대상으로 한 트래픽 쉐이퍼의 성능 분석)

  • Lee, S.C.;Lee, M.Y.;Hong, J.S.;Lie, C.H.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.1
    • /
    • pp.23-37
    • /
    • 1997
  • In this paper, performance analysis of video traffic shaper for Motion Picture Experts Group (MPEG) video traffic in on ATM network are investigated. Traffic shaping for MPEG video traffic is proposed as a traffic control function in ATM networks. The proposed shaper smoothes video traffics by controling the output rate of the buffer, which is placed in an MPEG source, according to I,B,P frame sequences of MPEG. In performance analysis of an video traffic shaper, a periodic botch arrival model is suggested to describe cell streams in a frame of MPEG video traffic. The queueing model which has periodic independent botch arrival and periodic deterministic service time is used to obtain the cell loss ratio, the mean cell delay, and the measure of smoothing effect. Simulation results are used to validate this queueing model. The cell loss performance of ATM multiplexer is measured by simulation study with real MPEG-1 data. From the viewpoint of traffic load, the cell loss ratio is observed to be considerably high, which is considered to result from the burstiness of MPEG video traffic. As a result, it is shown that the shaping decreases cell loss ratio of multiplexer. The results of this paper can be employed to establish a basic guideline in the implementation of a traffic control scheme and the design of ATM multiplexer for MPEG video traffic.

  • PDF

DDoS Attack Detection on the IPv6 Environment (IPv6환경에서 DDoS 침입탐지)

  • Koo, Min-Jeong;Oh, Chang-Suk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.185-192
    • /
    • 2006
  • By mistaking normal packets for harmful traffic, it may not offer service according to the intention of attacker with harmful traffic, because it is not easy to classify network traffic for normal service and it for DUoS(Distributed DoS) attack like the Internet worm. And in the IPv6 environment these researches on harmful traffic are weak. In this dissertation, hosts in the IPv6 environment are attacked by NETWIB and their attack traffic is monitored, then the statistical information of the traffic is obtained from MIB(Management Information Base) objects used in the IPv6. By adapting the ESM(Exponential Smoothing Method) to this information, a normal traffic boundary, i.e., a threshold is determined. Input traffic over the threshold is thought of as attack traffic.

  • PDF

Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN (무선랜에서의 실시간 및 비실시간 트래픽 스케줄링)

  • Lee, Ju-Hee;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

LSTM based Network Traffic Volume Prediction (LSTM 기반의 네트워크 트래픽 용량 예측)

  • Nguyen, Giang-Truong;Nguyen, Van-Quyet;Nguyen, Huu-Duy;Kim, Kyungbaek
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.362-364
    • /
    • 2018
  • Predicting network traffic volume has become a popular topic recently due to its support in many situations such as detecting abnormal network activities and provisioning network services. Especially, predicting the volume of the next upcoming traffic from the series of observed recent traffic volume is an interesting and challenging problem. In past, various techniques are researched by using time series forecasting methods such as moving averaging and exponential smoothing. In this paper, we propose a long short-term memory neural network (LSTM) based network traffic volume prediction method. The proposed method employs the changing rate of observed traffic volume, the corresponding time window index, and a seasonality factor indicating the changing trend as input features, and predicts the upcoming network traffic. The experiment results with real datasets proves that our proposed method works better than other time series forecasting methods in predicting upcoming network traffic.