Flexible Traffic Control Research Articles

SPaT/MAP V2X communication between traffic light and vehicles and a realization with digital twin

The present paper’s focus is the V2X (Vehicle-to-Everything) communication between traffic light controller and road vehicles. After a brief review on the state-of-the-art V2X communication technologies and their feasibility for practical implementation, a brief description of their potential is discussed providing a working solution for SPaT/MAP (Signal Phase and Timing and MAP as intersection geometry) standard based communication, specifically for automotive proving ground usage. The main outcome of the proposed solution is a full y flexible traffic control system applying industrial PLC while ensuring a standardized V2X protocol. As a demonstrative HiL (Hardware-in-the-Loop) example, exploiting the elements of the traffic management system at the ZalaZONE Automotive Proving Ground, a GLOSA (Green Light Optimal Speed Advisory) scenario is presented with the developed SPaT/MAP V2X communication realizing a global optimum traffic control solution. The more, the whole framework is designed in a way that it is capable of using mixed reality components for testing purposes and realizing a digital twin for traffic lights. The method of virtualization for V2X communication is introduced using a co-simulation framework of three common software tools (SUMO, Veins, and OMNeT++).

Coordinated Control of Intelligent Fuzzy Traffic Signal Based on Edge Computing Distribution.

With the development of Internet of Things infrastructures and intelligent traffic systems, the traffic congestion that results from the continuous complexity of urban road networks and traffic saturation has a new solution. In this research, we propose a traffic signal control scenario based on edge computing. We also propose a chemical reaction–cooperative particle swarm optimization (CRO-CPSO) algorithm so that flexible traffic control is sunk to the edge. To implement short-term real-time vehicle waiting time prediction as a collaborative judgment of CRO-CPSO, we suggest a traffic flow prediction system based on fuzzy logic. In addition, we introduce a co-factor (collaborative factor) set based on offline learning to take into account the experiential characteristics of intersections in urban road networks for the generation of strategies by the algorithm. Furthermore, the real case of Changsha County is simulated on the SUMO simulation platform. The issue of traffic flow saturation is improved by our method. Compared with other methods, our algorithm enhances the proportions of vehicles that reach their destinations on time by 13.03%, which maximizes the driving experience for drivers. Meanwhile, our algorithm reduces the driving times of vehicles by 25.34%, thus alleviating traffic jams.

Intelligent traffic management system using Ant Colony Optimization and Internet of Things

SummaryMiniaturization of Internet of Things (IoT) enabled devices has led to advancement in Intelligent Transportation System. Some of the challenges for efficient traffic management are connection of vehicles through an IP based infrastructure for transportation, reliable, and flexible traffic control management, maintaining quality of services for video streaming applications in Internet of Vehicles and many more. Today there is a need of an efficient transportation system with improved efficiency of traffic safety and lower traveling costs. An intelligent traffic control system using Ant Colony Optimization (ACO) algorithm has been proposed and analyzed in this paper. Proposed algorithm has been compared with existing state of art algorithms in terms of average waiting time and average traveling time.

Network Coding-based Resilient Routing for Maintaining Data Security and Availability in Software-Defined Networks

Software-Defined Networking (SDN) improves network performance by flexible traffic control. Data security and data availability are two main concerns for designing a resilient routing algorithm in SDN. Existing algorithms such as the MPT algorithm consider joint data security and availability, but they cannot make a good trade-off. In this paper, we propose a Network Coding-based Resilient Routing algorithm named NCRR to jointly achieve data security and availability. NCRR is a heuristic algorithm that computes routing decisions in three scenarios based on the number of disjoint paths. Specifically, the scenario of three disjoint paths is enough to ensure joint security and availability for a flow when three or more disjoint paths can be used for forwarding this flow. However, due to topological diversity, we cannot always find three disjoint paths for each flow. Thus, the scenarios of two disjoint paths and one path are used to ensure joint security and availability if only two disjoint paths and one path can be used. To evaluate the performance of NCRR, simulations have been conducted using two real-world network topologies. Simulation results show that NCRR improves the joint data security and availability performance by approximately 6.23% on AttMpls topology and 21.34% on Cernet topology, compared with existing MPT.

Formullar: An FPGA-based network testing tool for flexible and precise measurement of ultra-low latency networking systems

As network systems become widespread in emerging time-sensitive domains, latency becomes an important performance factor. Thus, there is a new demand for ultra-low latency (ULL), which requires an extra-ordinarily low latency even in a deterministic manner. To support the ULL requirement, it is mandatory that each network device strictly guarantees this latency. As a result, there is an increasing demand for a precise latency measurement tool that achieves two conflicting goals: high time precision and flexible traffic control. To support these goals, this paper proposes a novel measurement tool, named Formullar, which has a hybrid architecture composed of hardware (Formullar FPGA) and software (Formullar controller) layers. Formullar generates packets in an accurate timing, according to the various traffic patterns. The packet generation is controlled in a fully programmable manner that makes the testing fully automated and flexible. Then, latency is measured based on packet generation and reception timing; the measurement is done by the hardware layer, providing highly precise measurement results. Using this carefully constructed system, a Formullar prototype was implemented on top of the commodity FPGA board NetFPGA-SUME. The evaluation indicates that Formullar provides highly precise measurements with nanoseconds precision at a bandwidth of 10 Gbps.

Traffic Network Modeling and Extended Max-Pressure Traffic Control Strategy Based on Granular Computing Theory

Reasonable traffic network model and flexible traffic control strategy play important roles in improving the urban traffic control efficiency. Introducing granular computing theory into traffic network modeling and traffic control is a useful attempt, since granular computing is closer to the human thinking in solving problems. In this paper, the traffic elements are depicted using S-rough set to achieve the granulation partition of traffic network. Four layers are partitioned in the proposed hierarchical multigranularity traffic network model, such as vehicle layer, platoon layer, segment and intersection layer, and subregion layer. Each traffic granule is represented in rough representation form, and the dynamic characteristics are described using the elementary transfer operations based on S-rough set theory. As an application on the proposed traffic network model, an extended max-pressure traffic control strategy is applied on the platoon and segment and intersection layer. Simulation results illustrate that the proposed traffic network model and traffic control strategy achieve better performance.

Priority-Based Flow Control for Dynamic and Reliable Flow Management in SDN

Software-defined networking (SDN) is a promising paradigm of computer networks, offering a programmable and centralized network architecture. However, although such a technology supports the ability to dynamically handle network traffic based on real-time and flexible traffic control, SDN-based networks can be vulnerable to dynamic change of flow control rules, which causes transmission disruption and packet loss in SDN hardware switches. This problem can be critical because the interruption and packet loss in SDN switches can bring additional performance degradation for SDN-controlled traffic flows in the data plane. In this paper, we propose a novel robust flow control mechanism referred to as priority-based flow control (PFC) for dynamic but disruption-free flow management when it is necessary to change flow control rules on the fly. PFC minimizes the complexity of flow modification process in SDN switches by temporarily adapting the priority of flow rules in order to substantially reduce the time spent on control-plane processing during run-time. Measurement results show that PFC is able to successfully prevent transmission disruption and packet loss events caused by traffic path changes, thus offering dynamic and lossless traffic control for SDN switches.

End-user traffic policing for QoS assurance in polyservice RINA networks

Looking at the ever-increasing amount of heterogeneous distributed applications supported on current data transport networks, it seems evident that best-effort packet delivery falls short to supply their actual needs. Multiple approaches to Quality of Service (QoS) differentiation have been proposed over the years, but their usage has always been hindered by the rigidness of the TCP/IP-based Internet model, which does not even allow for applications to express their QoS needs to the underlying network. In this context, the Recursive InterNetwork Architecture (RINA) has appeared as a clean-slate network architecture aiming to replace the current Internet based on TCP/IP. RINA provides a well-defined QoS support across layers, with standard means for layers to inform of the different QoS guarantees that they can support. Besides, applications and other processes can express their flow requirements, including different QoS-related measures, like delay and jitter, drop probability or average traffic usage. Greedy end-users, however, tend to request the highest quality for their flows, forcing providers to apply intelligent data rate limitation procedures at the edge of their networks. In this work, we propose a new rate limiting policy that, instead of enforcing limits on a per QoS class basis, imposes limits on several independent QoS dimensions. This offers a flexible traffic control to RINA network providers, while enabling end-users freely managing their leased resources. The performance of the proposed policy is assessed in an experimental RINA network test-bed and its performance compared against other policies, either RINA-specific or adopted from TCP/IP. Results show that the proposed policy achieves an effective traffic control for high QoS traffic classes, while also letting lower QoS classes to take profit of the capacity initially reserved for the former ones when available.

Intelligent Traffic Light Based on PLC Control

The traditional traffic light system with a fixed control mode and single control function is contradicted with the current traffic section. The traditional one has been unable to meet the functional requirements of the existing flexible traffic control system. This paper research and develop an intelligent traffic light called PLC control system. It uses PLC as control core, using a sensor module for receiving real-time information of vehicles, traffic control mode for information to select the traffic lights. Of which control mode is flexible and changeable, and it also set the countdown reminder to improve the effectiveness of traffic lights, which can realize the goal of intelligent traffic diversion, intelligent traffic diversion.

Flexible traffic control of the synfire-mode transmission by inhibitory modulation: Nonlinear noise reduction

Intermingled neural connections apparent in the brain make us wonder what controls the traffic of propagating activity in the brain to secure signal transmission without harmful crosstalk. Here, we reveal that inhibitory input but not excitatory input works as a particularly useful traffic controller because it controls the degree of synchrony of population firing of neurons as well as controlling the size of the population firing bidirectionally. Our dynamical system analysis reveals that the synchrony enhancement depends crucially on the nonlinear membrane potential dynamics and a hidden slow dynamical variable. Our electrophysiological study with rodent slice preparations show that the phenomenon happens in real neurons. Furthermore, our analysis with the Fokker-Planck equations demonstrates the phenomenon in a semianalytical manner.

Modelling Framework for Dynamic Multiclass Traffic Assignment in ITS Environment

Deployment of flexible traffic control, pre-trip, on-trip,guidance and other ITS services require considerable researchtoward the development of appropriate methodological frameworkand tools. In this paper, adapted modelling framework fordynamic mu/tic/ass traffic assignment (DMTA) in ITS environmentis proposed and elaborated. DMTA system uses trafficdata associated with three backdrops: time, space and defined'user classes'. The proposed structure of DMTA system includesmodules for 0-D estimation and prediction, real-timenetwork state simulation, consistency checking, updating functions,resetting functions. The methodological tools for solvingDMTA problems include combination of mathematical programming,simulation and heuristic methods.

Virtual spacing for flexible traffic control

AbstractWeighted fair queuing emerges as an elegant and effective solution to the problem of integrating real time services with strict delay constraints and high‐speed data services for which significant delays cannot always be avoided. Virtual spacing is a weighted fair queuing scheduling algorithm intended to be applied in the context of the ATM based BISDN. After discussing how virtual spacing allows flexible traffic control for a variety of service types, we discuss the issue of its implementation in switching nodes. The aim of the paper is to highlight the advantages of weighted fair queuing in enabling a truly integrated services network and to propose a technologically feasible implementation.