• Title/Summary/Keyword: Network Traffic Prediction

Search Result 176, Processing Time 0.028 seconds

Time Series Models for Performance Evaluation of Network Traffic Forecasting (시계열 모형을 이용한 통신망 트래픽 예측 기법연구)

  • Kim, S.
    • The Korean Journal of Applied Statistics
    • /
    • v.20 no.2
    • /
    • pp.219-227
    • /
    • 2007
  • The time series models have been used to analyze and predict the network traffic. In this paper, we compare the performance of the time series models for prediction of network traffic. The feasibility study showed that a class of nonlinear time series models can be outperformed than the linear time series models to predict the network traffic.

DeepPTP: A Deep Pedestrian Trajectory Prediction Model for Traffic Intersection

  • Lv, Zhiqiang;Li, Jianbo;Dong, Chuanhao;Wang, Yue;Li, Haoran;Xu, Zhihao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2321-2338
    • /
    • 2021
  • Compared with vehicle trajectories, pedestrian trajectories have stronger degrees of freedom and complexity, which poses a higher challenge to trajectory prediction tasks. This paper designs a mode to divide the trajectory of pedestrians at a traffic intersection, which converts the trajectory regression problem into a trajectory classification problem. This paper builds a deep model for pedestrian trajectory prediction at intersections for the task of pedestrian short-term trajectory prediction. The model calculates the spatial correlation and temporal dependence of the trajectory. More importantly, it captures the interactive features among pedestrians through the Attention mechanism. In order to improve the training speed, the model is composed of pure convolutional networks. This design overcomes the single-step calculation mode of the traditional recurrent neural network. The experiment uses Vulnerable Road Users trajectory dataset for related modeling and evaluation work. Compared with the existing models of pedestrian trajectory prediction, the model proposed in this paper has advantages in terms of evaluation indicators, training speed and the number of model parameters.

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

A Study on an Adaptive UPC Algorithm Based on Traffic Multiplexing Information in ATM Networks (ATM 망에서 트래픽 다중화 정보에 의한 적응적 UPC 알고리즘에 관한 연구)

  • Kim, Yeong-Cheol;Byeon, Jae-Yeong;Seo, Hyeon-Seung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2779-2789
    • /
    • 1999
  • In this paper, we propose a new neural Buffered Leaky Bucket algorithm for preventing the degradation of network performance caused by congestion and dealing with the traffic congestion in ATM networks. We networks. We justify the validity of the suggested method through performance comparison in aspects of cell loss rate and mean transfer delay under a variety of traffic conditions requiring the different QoS(Quality of Service). also, the cell scheduling algorithms such as DWRR and DWEDF used for multiplexing the incoming traffics are induced to get the delay time of the traffics fairly. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate is changed by the predicted values. The prediction of traffic loss rate by neural networks can effectively reduce the cell loss rate and the cell transfer delay of next incoming cells and be applied to other traffic control systems. Computer simulation results performed for traffic prediction show that QoSs of the various kinds of traffics are increased.

  • PDF

A Study on the Quality Monitoring and Prediction of OTT Traffic in ISP (ISP의 OTT 트래픽 품질모니터링과 예측에 관한 연구)

  • Nam, Chang-Sup
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.2
    • /
    • pp.115-121
    • /
    • 2021
  • This paper used big data and artificial intelligence technology to predict the rapidly increasing internet traffic. There have been various studies on traffic prediction in the past, but they have not been able to reflect the increasing factors that induce huge Internet traffic such as smartphones and streaming in recent years. In addition, event-like factors such as the release of large-capacity popular games or the provision of new contents by OTT (Over the Top) operators are more difficult to predict in advance. Due to these characteristics, it was impossible for an ISP (Internet Service Provider) to reflect real-time service quality management or traffic forecasts in the network business environment with the existing method. Therefore, in this study, in order to solve this problem, an Internet traffic collection system was constructed that searches, discriminates and collects traffic data in real time, separate from the existing NMS. Through this, the flexibility and elasticity to automatically register the data of the collection target are secured, and real-time network quality monitoring is possible. In addition, a large amount of traffic data collected from the system was analyzed by machine learning (AI) to predict future traffic of OTT operators. Through this, more scientific and systematic prediction was possible, and in addition, it was possible to optimize the interworking between ISP operators and to secure the quality of large-scale OTT services.

A Dynamic Offset and Delay Differential Assembly Method for OBS Network

  • Sui Zhicheng;Xiao Shilin;Zeng Qingji
    • Journal of Communications and Networks
    • /
    • v.8 no.2
    • /
    • pp.234-240
    • /
    • 2006
  • We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

Prevention of Traffic Accident using AHP Rules (AHP를 이용한 교통사고 예방)

  • Jin, Hyun-Soo
    • Proceedings of the KAIS Fall Conference
    • /
    • 2008.05a
    • /
    • pp.157-159
    • /
    • 2008
  • This paper has been studied traffic accident using intelligence prediction algorithm. and wish to prevent accident by guiding in 2 km ahead the accident that occur in fog section and a snow-covered road, sudden roadworks and sharp curve section, etc and removing fog and snow automatically using the ubiquitous and intelligence technique. If we can predict of traffic accident, we can prevent the many traffic accident. In this paper, we present neural network approach for prediction of traffic accident. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering prevention of traffic algorithm for optimal traffic cycle is better than fixed signal method which dose not using prevention of traffic algorithm.

  • PDF

An implementation of the dynamic rate leaky bucket algorithm combined with a neural network based prediction (신경회로망 예측기법을 결합한 Dynamic Rate Leaky Bucket 알고리즘의 구현)

  • 이두헌;신요안;김영한
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.2
    • /
    • pp.259-267
    • /
    • 1997
  • The advent of B-ISDN using ATM(asynchronous transfer mode) made possible a variety of new multimedia services, however it also created a problem of congestion control due to bursty nature of various traffic sources. To tackle this problem, UPC/NPC(user parameter control/network parameter control) have been actively studied and DRLB(dynamic rate leaky bucket) algorithm, in which the token generation rate is changed according to states of data source andbuffer occupancy, is a good example of the UPC/NPC. However, the DRLB algorithm has drawbacks of low efficiency and difficult real-time implementation for bursty traffic sources because the determination of token generation rate in the algorithm is based on the present state of network. In this paper, we propose a more plastic and effective congestion control algorithm by combining the DRLB algorithm and neural network based prediction to remedy the drawbacks of the DRLB algorithm, and verify the efficacy of the proposed method by computer simulations.

  • PDF

On-line Prediction Algorithm for Non-stationary VBR Traffic (Non-stationary VBR 트래픽을 위한 동적 데이타 크기 예측 알고리즘)

  • Kang, Sung-Joo;Won, You-Jip;Seong, Byeong-Chan
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.3
    • /
    • pp.156-167
    • /
    • 2007
  • In this paper, we develop the model based prediction algorithm for Variable-Bit-Rate(VBR) video traffic with regular Group of Picture(GOP) pattern. We use multiplicative ARIMA process called GOP ARIMA (ARIMA for Group Of Pictures) as a base stochastic model. Kalman Filter based prediction algorithm consists of two process: GOP ARIMA modeling and prediction. In performance study, we produce three video traces (news, drama, sports) and we compare the accuracy of three different prediction schemes: Kalman Filter based prediction, linear prediction, and double exponential smoothing. The proposed prediction algorithm yields superior prediction accuracy than the other two. We also show that confidence interval analysis can effectively detect scene changes of the sample video sequence. The Kalman filter based prediction algorithm proposed in this work makes significant contributions to various aspects of network traffic engineering and resource allocation.

Adaptive Input Traffic Prediction Scheme for Absolute and Proportional Delay Differentiated Services in Broadband Convergence Network

  • Paik, Jung-Hoon;Ryoo, Jeong-Dong;Joo, Bheom-Soon
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.227-237
    • /
    • 2008
  • In this paper, an algorithm that provides absolute and proportional differentiation of packet delays is proposed with the objective of enhancing quality of service in future packet networks. It features an adaptive scheme that adjusts the target delay for every time slot to compensate the deviation from the target delay, which is caused by prediction error on the traffic to arrive at the next time slot. It predicts the traffic to arrive at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized by the delay control operation for the next time slot to offset it. Because the proposed algorithm compensates the prediction error continuously, it shows superior adaptability to bursty traffic and exponential traffic. Through simulations we demonstrate that the algorithm meets the quantitative delay bounds and is robust to traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA, and the performance is verified under the test board based on the XPC860P CPU.

  • PDF