• 제목/요약/키워드: Network Traffic Flow Management

검색결과 112건 처리시간 0.018초

Traffic Flow Prediction with Spatio-Temporal Information Fusion using Graph Neural Networks

  • Huijuan Ding;Giseop Noh
    • International journal of advanced smart convergence
    • /
    • 제12권4호
    • /
    • pp.88-97
    • /
    • 2023
  • Traffic flow prediction is of great significance in urban planning and traffic management. As the complexity of urban traffic increases, existing prediction methods still face challenges, especially for the fusion of spatiotemporal information and the capture of long-term dependencies. This study aims to use the fusion model of graph neural network to solve the spatio-temporal information fusion problem in traffic flow prediction. We propose a new deep learning model Spatio-Temporal Information Fusion using Graph Neural Networks (STFGNN). We use GCN module, TCN module and LSTM module alternately to carry out spatiotemporal information fusion. GCN and multi-core TCN capture the temporal and spatial dependencies of traffic flow respectively, and LSTM connects multiple fusion modules to carry out spatiotemporal information fusion. In the experimental evaluation of real traffic flow data, STFGNN showed better performance than other models.

A New Architecture to Offload Network Traffic using OpenFlow in LTE

  • Venmani, Daniel Philip;Gourhant, Yvon;Zeghlache, Djamal
    • 한국산업정보학회논문지
    • /
    • 제17권1호
    • /
    • pp.31-38
    • /
    • 2012
  • Next generation cellular applications and smart phone usage generate very heavy wireless data traffic. It becomes ineluctable for mobile network operators to have multiple core network entities such as Serving Gateway and Packet Data Network Gateway in 4G-LTE to share this high traffic generated. A typical configuration consists of multiple serving gateways behind a load-balancer which would determine which serving gateway would service a end-users'request. Such hardware is expensive, has a rigid policy set, and is a single point of failure. Another perspective of today's increasingly high data traffic is that besides it is being widely accepted that the high bandwidth L TE provides is creating bottlenecks for service providers by the increasing user bandwidth demands without creating any corresponding revenue improvements, a hidden problem that is also passively advancing on the newly emerging 4G-LTE that may need more immediate attention is the network signaling traffic, also known as the control-plane traffic that is generated by the applications developed for smartphones and tablets. With this as starting point, in this paper, we propose a solution, by a new approach considering OpenFlow switch connected to a controller, which gains flexibility in policy, costs less, and has the potential to be more robust to failure with future generations of switches. This also solves the problem of scaling the control-plane traffic that is imperative to preserve revenue and ensure customer satisfaction. Thus, with the proposed architecture with OpenFlow, mobile network operators could manipulate the traffic generated by the control-plane signaling separated from the data-plane, besides also reducing the cost in installing multiple core-network entities.

An Efficient Priority Based Adaptive QoS Traffic Control Scheme for Wireless Access Networks

  • Kang Moon-sik
    • 한국통신학회논문지
    • /
    • 제30권9A호
    • /
    • pp.762-771
    • /
    • 2005
  • In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

A Study on the Verification of Traffic Flow and Traffic Accident Cognitive Function for Road Traffic Situation Cognitive System

  • Am-suk, Oh
    • Journal of information and communication convergence engineering
    • /
    • 제20권4호
    • /
    • pp.273-279
    • /
    • 2022
  • Owing to the need to establish a cooperative-intelligent transport system (C-ITS) environment in the transportation sector locally and abroad, various research and development efforts such as high-tech road infrastructure, connection technology between road components, and traffic information systems are currently underway. However, the current central control center-oriented information collection and provision service structure and the insufficient road infrastructure limit the realization of the C-ITS, which requires a diversity of traffic information, real-time data, advanced traffic safety management, and transportation convenience services. In this study, a network construction method based on the existing received signal strength indicator (RSSI) selected as a comparison target, and the experimental target and the proposed intelligent edge network compared and analyzed. The result of the analysis showed that the data transmission rate in the intelligent edge network was 97.48%, the data transmission time was 215 ms, and the recovery time of network failure was 49,983 ms.

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • 제15권1호
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

교차로에서 원활한 교통 흐름 지원을 위한 VANET 기반 동적인 교통 신호등 제어 기법 (Dynamic Traffic Light Control Scheme Based on VANET to Support Smooth Traffic Flow at Intersections)

  • 차시호;이종언;류민우
    • 디지털산업정보학회논문지
    • /
    • 제18권4호
    • /
    • pp.23-30
    • /
    • 2022
  • Recently, traffic congestion and environmental pollution have occurred due to population concentration and vehicle increase in large cities. Various studies are being conducted to solve these problems. Most of the traffic congestion in cities is caused by traffic signals at intersections. This paper proposes a dynamic traffic light control (DTLC) scheme to support safe vehicle operation and smooth traffic flow using real-time traffic information based on VANET. DTLC receives instantaneous speed and directional information of each vehicle through road side units (RSUs) to obtain the density and average speed of vehicles for each direction. RSUs deliver this information to traffic light controllers (TLCs), which utilize it to dynamically control traffic lights at intersections. To demonstrate the validity of DTLC, simulations were performed on average driving speed and average waiting time using the ns-2 simulator. Simulation results show that DTLC can provide smooth traffic flow by increasing average driving speed at dense intersections and reducing average waiting time.

ITS를 위한 차량검지시스템을 기반으로 한 교통 정체 예측 모듈 개발 (Development of Traffic Congestion Prediction Module Using Vehicle Detection System for Intelligent Transportation System)

  • 신원식;오세도;김영진
    • 산업공학
    • /
    • 제23권4호
    • /
    • pp.349-356
    • /
    • 2010
  • The role of Intelligent Transportation System (ITS) is to efficiently manipulate the traffic flow and reduce the cost in logistics by using the state of the art technologies which combine telecommunication, sensor, and control technology. Especially, the hardware part of ITS is rapidly adapting to the up-to-date techniques in GPS and telematics to provide essential raw data to the controllers. However, the software part of ITS needs more sophisticated techniques to take care of vast amount of on-line data to be analyzed by the controller for their decision makings. In this paper, the authors develop a traffic congestion prediction model based on several different parameters from the sensory data captured in the Vehicle Detection System (VDS). This model uses the neural network technology in analyzing the traffic flow and predicting the traffic congestion in the designated area. This model also validates the results by analyzing the errors between actual traffic data and prediction program.

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)
    • /
    • 제13권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.

Large Flows Detection, Marking, and Mitigation based on sFlow Standard in SDN

  • Afaq, Muhammad;Rehman, Shafqat;Song, Wang-Cheol
    • 한국멀티미디어학회논문지
    • /
    • 제18권2호
    • /
    • pp.189-198
    • /
    • 2015
  • Despite the fact that traffic engineering techniques have been comprehensively utilized in the past to enhance the performance of communication networks, the distinctive characteristics of Software Defined Networking (SDN) demand new traffic engineering techniques for better traffic control and management. Considering the behavior of traffic, large flows normally carry out transfers of large blocks of data and are naturally packet latency insensitive. However, small flows are often latency-sensitive. Without intelligent traffic engineering, these small flows may be blocked in the same queue behind megabytes of file transfer traffic. So it is very important to identify large flows for different applications. In the scope of this paper, we present an approach to detect large flows in real-time without even a short delay. After the detection of large flows, the next problem is how to control these large flows effectively and prevent network jam. In order to address this issue, we propose an approach in which when the controller is enabled, the large flow is mitigated the moment it hits the predefined threshold value in the control application. This real-time detection, marking, and controlling of large flows will assure an optimize usage of an overall network.

개선된 Elephant Flows 발견 알고리즘 (An improved algorithm for Detection of Elephant Flows)

  • 정진우;최윤기;손성훈
    • 한국통신학회논문지
    • /
    • 제37B권9호
    • /
    • pp.849-858
    • /
    • 2012
  • 본 논문에서는 빠르고 정확하게 elephant flow를 발견할 수 있는 알고리즘을 제시한다. 최근 인터넷 사용자의 증가와 다양한 응용 프로그램의 등장으로 인하여, 네트워크 트래픽의 대규모화가 급속히 진행되고 있는 추세이다. 이러한 변화에 따라 네트워크 대역의 상당 부분을 점유하는 elephant flow 가 자주 발생하게 되었다. Elephant flow는 인터넷 트래픽의 관리 (management) 및 서비스 측면에서 네트워크 대역 (network bandwidth)의 불공평한 사용 문제를 유발한다. 본 논문에서는 Elephant flow를 발견하는 방법들 중 하나인 기존 Landmark-LRU 기법에 간단한 메커니즘을 추가시켜, 발견율을 크게 증가시키는 방법을 제시하였다. 그리고 제안하는 개선안을 실제 네트워크에서 추출한 트레이스 (network traces)에 적용하는 시뮬레이션을 통하여 평가하였다. 그 결과로 우리가 제시하는 개선 알고리즘이 효율적인 메모리 비용을 유지하면서 Landmark-LRU 기법보다 더 정확하게 elephant flow를 발견하는 것을 확인할 수 있었다.