• Title/Summary/Keyword: Network Traffic Prediction

Search Result 180, Processing Time 0.026 seconds

A Study on Traffic Prediction Algorithm for Proactive Self-Adaptive System in Road Network (선행적 자가적응형 시스템을 위한 도로 교통량 예측 알고리즘에 관한 연구)

  • Jeong, Hohyeon;Kim, Misoo;Jeong, Jaehoon (Paul);Lee, Eunseok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.983-986
    • /
    • 2015
  • 물리적, 논리적 공간에서 다양한 오브젝트들이 상호작용할 수 있게 되고, 오브젝트에 탑재되는 소프트웨어가 고도화 됨에 따라 엔지니어가 관리 가능한 수준의 시스템 제어가 힘들어지고 있다. 이런 복잡한 시스템의 자율적인 관리를 위해 다양한 상황에 대응 가능한 자가적응성이 요구된다. 자가적응형 소프트웨어는 대상 시스템의 목표나 QoS를 만족할 수 있도록 런타임에 스스로를 변화 시킬 수 있는 능력을 가진 소프트웨어이다. 이러한 소프트웨어는 고도화된 시스템의 관리에 있어서 엔지니어의 부담을 경감시킬수 있다. 본 논문에서 제안하는 선행적 자가적응형 시스템은 도로망과 같은 주기적 특성을 가진 시스템에서 시스템이 직면하는 상황을 사전에 예측하여 미리 대응할 수 있는 시스템이다. 이는 기존에 반응적으로 대응했던 시스템들이 적용한 정책의 효과를 보기까지 낭비되는 시간을 고려하여 해당 지연시간동안에 시스템의 목표나 QoS가 하락하는 상황을 미연에 방지할 수 있다. 본 시스템의 적용분야로 지능형교통체계를 사용하였으며, 도로망 전체에서 정체 발생빈도와 평균 이동속도 그리고 단위길이당 운행시간을 평가항목으로 사용하고, 대상 도로망 전체적인 최적화를 목표로 한다.

Novel online routing algorithms for smart people-parcel taxi sharing services

  • Van, Son Nguyen;Hong, Nhan Vu Thi;Quang, Dung Pham;Xuan, Hoai Nguyen;Babaki, Behrouz;Dries, Anton
    • ETRI Journal
    • /
    • v.44 no.2
    • /
    • pp.220-231
    • /
    • 2022
  • Building smart transportation services in urban cities has become a worldwide problem owing to the rapidly increasing global population and the development of Internet-of-Things applications. Traffic congestion and environmental concerns can be alleviated by sharing mobility, which reduces the number of vehicles on the road network. The taxi-parcel sharing problem has been considered as an efficient planning model for people and goods flows. In this paper, we enhance the functionality of a current people-parcel taxi sharing model. The adapted model analyzes the historical request data and predicts the current service demands. We then propose two novel online routing algorithms that construct optimal routes in real-time. The objectives are to maximize (as far as possible) both the parcel delivery requests and ride requests while minimizing the idle time and travel distance of the taxis. The proposed online routing algorithms are evaluated on instances adapted from real Cabspotting datasets. After implementing our routing algorithms, the total idle travel distance per day was 9.64% to 12.76% lower than that of the existing taxi-parcel sharing method. Our online routing algorithms can be incorporated into an efficient smart shared taxi system.

A Lightweight Software-Defined Routing Scheme for 5G URLLC in Bottleneck Networks

  • Math, Sa;Tam, Prohim;Kim, Seokhoon
    • Journal of Internet Computing and Services
    • /
    • v.23 no.2
    • /
    • pp.1-7
    • /
    • 2022
  • Machine learning (ML) algorithms have been intended to seamlessly collaborate for enabling intelligent networking in terms of massive service differentiation, prediction, and provides high-accuracy recommendation systems. Mobile edge computing (MEC) servers are located close to the edge networks to overcome the responsibility for massive requests from user devices and perform local service offloading. Moreover, there are required lightweight methods for handling real-time Internet of Things (IoT) communication perspectives, especially for ultra-reliable low-latency communication (URLLC) and optimal resource utilization. To overcome the abovementioned issues, this paper proposed an intelligent scheme for traffic steering based on the integration of MEC and lightweight ML, namely support vector machine (SVM) for effectively routing for lightweight and resource constraint networks. The scheme provides dynamic resource handling for the real-time IoT user systems based on the awareness of obvious network statues. The system evaluations were conducted by utillizing computer software simulations, and the proposed approach is remarkably outperformed the conventional schemes in terms of significant QoS metrics, including communication latency, reliability, and communication throughput.

Synthetic storm sewer network for complex drainage system as used for urban flood simulation

  • Dasallas, Lea;An, Hyunuk;Lee, Seungsoo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2021.06a
    • /
    • pp.142-142
    • /
    • 2021
  • An arbitrary representation of an urban drainage sewer system was devised using a geographic information system (GIS) tool in order to calculate the surface and subsurface flow interaction for simulating urban flood. The proposed methodology is a mean to supplement the unavailability of systematized drainage system using high-resolution digital elevation(DEM) data in under-developed countries. A modified DEM was also developed to represent the flood propagation through buildings and road system from digital surface models (DSM) and barely visible streams in digital terrain models (DTM). The manhole, sewer pipe and storm drain parameters are obtained through field validation and followed the guidelines from the Plumbing law of the Philippines. The flow discharge from surface to the devised sewer pipes through the storm drains are calculated. The resulting flood simulation using the modified DEM was validated using the observed flood inundation during a rainfall event. The proposed methodology for constructing a hypothetical drainage system allows parameter adjustments such as size, elevation, location, slope, etc. which permits the flood depth prediction for variable factors the Plumbing law. The research can therefore be employed to simulate urban flood forecasts that can be utilized from traffic advisories to early warning procedures during extreme rainfall events.

  • PDF

DQN-Based Task Migration with Traffic Prediction in UAV-MEC assisted Vehicular Network (UAV-MEC지원 차량 네트워크에서 트래픽 예측을 통한 DQN기반 태스크 마이그레이션)

  • Shin, A Young;Lim, Yujin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.144-146
    • /
    • 2022
  • 차량 환경에서 발생하는 계산 집약적인 태스크가 증가하면서 모바일 엣지 컴퓨팅(MEC, Mobile Edge Computing)의 필요성이 높아지고 있다. 하지만 지상에 존재하는 MEC 서버는 출퇴근 시간과 같이 태스크가 일시적으로 급증하는 상황에 유동적으로 대처할 수 없으며, 이러한 상황을 대비하기 위해 지상 MEC 서버를 추가로 설치하는 것은 자원의 낭비를 불러온다. 최근 이 문제를 해결하기 위해 UAV(Unmanned Aerial Vehicle)기반 MEC 서버를 추가로 사용해 엣지 서비스를 제공하는 연구가 진행되고 있다. 그러나 UAV MEC 서버는 지상 MEC 서버와 달리 한정적인 배터리 용량으로 인해 서버 간 로드밸런싱을 통해 에너지 사용량을 최소화 하는 것이 필요하다. 본 논문에서는 UAV MEC 서버의 에너지 사용량을 고려한 마이그레이션 기법을 제안한다. 또한 GRU(Gated Recurrent Unit) 모델을 활용한 트래픽 예측을 바탕으로 한 마이그레이션을 통해 지연시간을 최소화할 수 있도록 한다. 제안 시스템의 성능을 평가하기 위해 MEC의 마이그레이션 시점을 결정하는 기준점와 차량의 밀도에 따라 실험을 진행하고, 서버의 로드 편차, UAV MEC 서버의 에너지 사용량 그리고 평균 지연 시간 측면에서 성능을 분석한다.

Improved Deep Learning-based Approach for Spatial-Temporal Trajectory Planning via Predictive Modeling of Future Location

  • Zain Ul Abideen;Xiaodong Sun;Chao Sun;Hafiz Shafiq Ur Rehman Khalil
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.7
    • /
    • pp.1726-1748
    • /
    • 2024
  • Trajectory planning is vital for autonomous systems like robotics and UAVs, as it determines optimal, safe paths considering physical limitations, environmental factors, and agent interactions. Recent advancements in trajectory planning and future location prediction stem from rapid progress in machine learning and optimization algorithms. In this paper, we proposed a novel framework for Spatial-temporal transformer-based feed-forward neural networks (STTFFNs). From the traffic flow local area point of view, skip-gram model is trained on trajectory data to generate embeddings that capture the high-level features of different trajectories. These embeddings can then be used as input to a transformer-based trajectory planning model, which can generate trajectories for new objects based on the embeddings of similar trajectories in the training data. In the next step, distant regions, we embedded feedforward network is responsible for generating the distant trajectories by taking as input a set of features that represent the object's current state and historical data. One advantage of using feedforward networks for distant trajectory planning is their ability to capture long-term dependencies in the data. In the final step of forecasting for future locations, the encoder and decoder are crucial parts of the proposed technique. Spatial destinations are encoded utilizing location-based social networks(LBSN) based on visiting semantic locations. The model has been specially trained to forecast future locations using precise longitude and latitude values. Following rigorous testing on two real-world datasets, Porto and Manhattan, it was discovered that the model outperformed a prediction accuracy of 8.7% previous state-of-the-art methods.

Evaluation of Travel Time Prediction Reliability on Highway Using DSRC Data (DSRC 기반 고속도로 통행 소요시간 예측정보 신뢰성 평가)

  • Han, Daechul;Kim, Joohyon;Kim, Seoungbum
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.4
    • /
    • pp.86-98
    • /
    • 2018
  • Since 2015, the Korea Expressway Corporation has provided predicted travel time information, which is reproduced from DSRC systems over the extended expressway network in Korea. When it is open for public information, it helps travelers decide optimal routes while minimizing traffic congestions and travel cost. Although, sutiable evaluations to investigate the reliability of travel time forecast information have not been conducted so far. First of all, this study seeks to find out a measure of effectiveness to evaluate the reliability of travel time forecast via various literatures. Secondly, using the performance measurement, this study evaluates concurrent travel time forecast information in highway quantitatively and examines the forecast error by exploratory data analysis. It appears that most of highway lines provided reliable forecast information. However, we found significant over/under-forecast on a few links within several long lines and it turns out that such minor errors reduce overall reliability in travel time forecast of the corresponding highway lines. This study would help to build a priority for quality control of the travel time forecast information system, and highlight the importance of performing periodic and sustainable management for travel time forecast information.

Building a TDM Impact Analysis System for the Introduction of Short-term Congestion Management Program in Seoul (교통수요관리 방안의 단기적 효과 분석모형의 구축)

  • 황기연;김익기;엄진기
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.1
    • /
    • pp.173-185
    • /
    • 1999
  • The purpose of this study is to develope a forecasting model to implement short-term Congestion Management Program (CMP) based on TDM strategies in Seoul. The CMP is composed of three elements: 1) setting a goal of short-term traffic management. 2) developing a model to forecast the impacts of TDM alternatives, and 3) finding TDM measures to achieve the goal To Predict the impacts of TDM alternatives, a model called SECOMM (SEoul COngestion Management Model) is developed. The model assumes that trip generation and distribution are not changing in a short term, and that only mode split and traffic assignment are affected by TDM. The model includes the parameter values calibrated by a discrete mode choice model, and roadway and transit networks with 1,020 zones. As a TDM measure implement, it affects mode choice behavior first and then the speeds of roadway network. The chanced speed again affects the mode choice behavior and the roadway speeds. These steps continue until the network is equilibrated. The study recommends that CMP be introduced in Seoul, and that road way conditions be monitored regularly to secure the prediction accuracy of SECOMM. Also, TDM should be the major Policy tools in removing short-term congestion problems in a big city.

  • PDF

The Hybrid Multi-layer Inference Architectures and Algorithms of FPNN Based on FNN and PNN (FNN 및 PNN에 기초한 FPNN의 합성 다층 추론 구조와 알고리즘)

  • Park, Byeong-Jun;O, Seong-Gwon;Kim, Hyeon-Gi
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.7
    • /
    • pp.378-388
    • /
    • 2000
  • In this paper, we propose Fuzzy Polynomial Neural Networks(FPNN) based on Polynomial Neural Networks(PNN) and Fuzzy Neural Networks(FNN) for model identification of complex and nonlinear systems. The proposed FPNN is generated from the mutually combined structure of both FNN and PNN. The one and the other are considered as the premise part and consequence part of FPNN structure respectively. As the consequence part of FPNN, PNN is based on Group Method of Data Handling(GMDH) method and its structure is similar to Neural Networks. But the structure of PNN is not fixed like in conventional Neural Networks and self-organizing networks that can be generated. FPNN is available effectively for multi-input variables and high-order polynomial according to the combination of FNN with PNN. Accordingly it is possible to consider the nonlinearity characteristics of process and to get better output performance with superb predictive ability. As the premise part of FPNN, FNN uses both the simplified fuzzy inference as fuzzy inference method and error back-propagation algorithm as learning rule. The parameters such as parameters of membership functions, learning rates and momentum coefficients are adjusted using genetic algorithms. And we use two kinds of FNN structure according to the division method of fuzzy space of input variables. One is basic FNN structure and uses fuzzy input space divided by each separated input variable, the other is modified FNN structure and uses fuzzy input space divided by mutually combined input variables. In order to evaluate the performance of proposed models, we use the nonlinear function and traffic route choice process. The results show that the proposed FPNN can produce the model with higher accuracy and more robustness than any other method presented previously. And also performance index related to the approximation and prediction capabilities of model is evaluated and discussed.

  • PDF

A dynamic resource allocation and call admission control considering 'satisfaction degree of quality of service' for the VBR video sources with QoS constraints (QoS 제약 조건을 갖는 VBR 비디오에 대한 서비스 품질 만족도를 고려한 동적 자원 할당 및 호 수락 제어)

  • Yoo, Sang-Jo;Kim, Seong-Dae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.1
    • /
    • pp.1-13
    • /
    • 2001
  • In this paper, we propose a new dynamic bandwidth allocation and call admission control for VBR video sources with QoS constraints to support an efficient resource management and at the same Lime to satisfy the user's quality or service requirements. For the dynamic bandwidth allocation, first the next amount of traffic is predicted using a modified adaptive linear prediction method that considers abrupt scene change effects. And then, we dynamically allocate the necessary bandwidth to each connection based on the currently provided quality degree by the network with respect to the user's QoS requirements in terms of average delay and loss ratio. For the admission control, we determine the acceptance or rejection or a new connection based on the quality satisfaction degrees of the existing connections. Simulation results show that our proposed dynamic schemes are able to provide a stable service, which well meets the user's quality requirements.

  • PDF