WorldWideScience

Sample records for traffic flow networks

  1. Predicting Information Flows in Network Traffic.

    Science.gov (United States)

    Hinich, Melvin J.; Molyneux, Robert E.

    2003-01-01

    Discusses information flow in networks and predicting network traffic and describes a study that uses time series analysis on a day's worth of Internet log data. Examines nonlinearity and traffic invariants, and suggests that prediction of network traffic may not be possible with current techniques. (Author/LRW)

  2. Understanding characteristics in multivariate traffic flow time series from complex network structure

    Science.gov (United States)

    Yan, Ying; Zhang, Shen; Tang, Jinjun; Wang, Xiaofei

    2017-07-01

    Discovering dynamic characteristics in traffic flow is the significant step to design effective traffic managing and controlling strategy for relieving traffic congestion in urban cities. A new method based on complex network theory is proposed to study multivariate traffic flow time series. The data were collected from loop detectors on freeway during a year. In order to construct complex network from original traffic flow, a weighted Froenius norm is adopt to estimate similarity between multivariate time series, and Principal Component Analysis is implemented to determine the weights. We discuss how to select optimal critical threshold for networks at different hour in term of cumulative probability distribution of degree. Furthermore, two statistical properties of networks: normalized network structure entropy and cumulative probability of degree, are utilized to explore hourly variation in traffic flow. The results demonstrate these two statistical quantities express similar pattern to traffic flow parameters with morning and evening peak hours. Accordingly, we detect three traffic states: trough, peak and transitional hours, according to the correlation between two aforementioned properties. The classifying results of states can actually represent hourly fluctuation in traffic flow by analyzing annual average hourly values of traffic volume, occupancy and speed in corresponding hours.

  3. Control of Networked Traffic Flow Distribution - A Stochastic Distribution System Perspective

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Hong [Pacific Northwest National Laboratory (PNNL); Aziz, H M Abdul [ORNL; Young, Stan [National Renewable Energy Laboratory (NREL); Patil, Sagar [Pacific Northwest National Laboratory (PNNL)

    2017-10-01

    Networked traffic flow is a common scenario for urban transportation, where the distribution of vehicle queues either at controlled intersections or highway segments reflect the smoothness of the traffic flow in the network. At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic model for a one-way single-lane corridor traffic system based on theory of stochastic distribution control.. It has been shown that the developed stochastic model would provide the optimal probability density function (PDF) of the traffic queueing length as a dynamic function of the traffic signal setting parameters. Based upon such a stochastic distribution model, we have proposed a preliminary closed loop framework on stochastic distribution control for the traffic queueing system to make the traffic queueing length PDF follow a target PDF that potentially realizes the smooth traffic flow distribution in a concerned corridor.

  4. End-to-End Traffic Flow Modeling of the Integrated SCaN Network

    Science.gov (United States)

    Cheung, K.-M.; Abraham, D. S.

    2012-05-01

    In this article, we describe the analysis and simulation effort of the end-to-end traffic flow for the Integrated Space Communications and Navigation (SCaN) Network. Using the network traffic derived for the 30-day period of July 2018 from the Space Communications Mission Model (SCMM), we generate the wide-area network (WAN) bandwidths of the ground links for different architecture options of the Integrated SCaN Network. We also develop a new analytical scheme to model the traffic flow and buffering mechanism of a store-and-forward network. It is found that the WAN bandwidth of the Integrated SCaN Network is an important differentiator of different architecture options, as the recurring circuit costs of certain architecture options can be prohibitively high.

  5. A Wavelet Neural Network Optimal Control Model for Traffic-Flow Prediction in Intelligent Transport Systems

    Science.gov (United States)

    Huang, Darong; Bai, Xing-Rong

    Based on wavelet transform and neural network theory, a traffic-flow prediction model, which was used in optimal control of Intelligent Traffic system, is constructed. First of all, we have extracted the scale coefficient and wavelet coefficient from the online measured raw data of traffic flow via wavelet transform; Secondly, an Artificial Neural Network model of Traffic-flow Prediction was constructed and trained using the coefficient sequences as inputs and raw data as outputs; Simultaneous, we have designed the running principium of the optimal control system of traffic-flow Forecasting model, the network topological structure and the data transmitted model; Finally, a simulated example has shown that the technique is effectively and exactly. The theoretical results indicated that the wavelet neural network prediction model and algorithms have a broad prospect for practical application.

  6. Sonification of network traffic flow for monitoring and situational awareness

    Science.gov (United States)

    2018-01-01

    Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators’ situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen. PMID:29672543

  7. Sonification of network traffic flow for monitoring and situational awareness.

    Science.gov (United States)

    Debashi, Mohamed; Vickers, Paul

    2018-01-01

    Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators' situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen.

  8. Monitoring individual traffic flows within the ATLAS TDAQ network

    CERN Document Server

    Sjoen, R; Ciobotaru, M; Batraneanu, S M; Leahu, L; Martin, B; Al-Shabibi, A

    2010-01-01

    The ATLAS data acquisition system consists of four different networks interconnecting up to 2000 processors using up to 200 edge switches and five multi-blade chassis devices. The architecture of the system has been described in [1] and its operational model in [2]. Classical, SNMP-based, network monitoring provides statistics on aggregate traffic, but for performance monitoring and troubleshooting purposes there was an imperative need to identify and quantify single traffic flows. sFlow [3] is an industry standard based on statistical sampling which attempts to provide a solution to this. Due to the size of the ATLAS network, the collection and analysis of the sFlow data from all devices generates a data handling problem of its own. This paper describes how this problem is addressed by making it possible to collect and store data either centrally or distributed according to need. The methods used to present the results in a relevant fashion for system analysts are discussed and we explore the possibilities a...

  9. A Network Traffic Control Enhancement Approach over Bluetooth Networks

    DEFF Research Database (Denmark)

    Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

    2003-01-01

    This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated solu...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well......This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...

  10. Traffic and Granular Flow ’07

    CERN Document Server

    Chevoir, François; Gondret, Philippe; Lassarre, Sylvain; Lebacque, Jean-Patrick; Schreckenberg, Michael

    2009-01-01

    This book covers several research fields, all of which deal with transport. Three main topics are treated: road traffic, granular matter, and biological transport. Different points of view, i.e. modelling, simulations, experiments, and phenomenological observations, are considered. Sub-topics include: highway or urban vehicular traffic (dynamics of traffic, macro/micro modelling, measurements, data analysis, security issues, psychological issues), pedestrian traffic, animal traffic (e.g. social insects), collective motion in biological systems (molecular motors...), granular flow (dense flows, intermittent flows, solid/liquid transition, jamming, force networks, fluid and solid friction), networks (biological networks, urban traffic, the internet, vulnerability of networks, optimal transport networks) and cellular automata applied to the various aforementioned fields.

  11. A measure theoretic approach to traffic flow optimization on networks

    OpenAIRE

    Cacace, Simone; Camilli, Fabio; De Maio, Raul; Tosin, Andrea

    2018-01-01

    We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average speed,controlling few agents, for example smart traffic lights and automated cars. The measuretheoretic approach allows to study in a same setting local and nonlocal drivers interactionsand to consider the control variables as additional measures interacting ...

  12. A network centrality measure framework for analyzing urban traffic flow: A case study of Wuhan, China

    Science.gov (United States)

    Zhao, Shuangming; Zhao, Pengxiang; Cui, Yunfan

    2017-07-01

    In this paper, we propose an improved network centrality measure framework that takes into account both the topological characteristics and the geometric properties of a road network in order to analyze urban traffic flow in relation to different modes: intersection, road, and community, which correspond to point mode, line mode, and area mode respectively. Degree, betweenness, and PageRank centralities are selected as the analysis measures, and GPS-enabled taxi trajectory data is used to evaluate urban traffic flow. The results show that the mean value of the correlation coefficients between the modified degree, the betweenness, and the PageRank centralities and the traffic flow in all periods are higher than the mean value of the correlation coefficients between the conventional degree, the betweenness, the PageRank centralities and the traffic flow at different modes; this indicates that the modified measurements, for analyzing traffic flow, are superior to conventional centrality measurements. This study helps to shed light into the understanding of urban traffic flow in relation to different modes from the perspective of complex networks.

  13. Monitoring individual traffic flows within the ATLAS TDAQ network

    International Nuclear Information System (INIS)

    Sjoen, R; Batraneanu, S M; Leahu, L; Martin, B; Al-Shabibi, A; Stancu, S; Ciobotaru, M

    2010-01-01

    The ATLAS data acquisition system consists of four different networks interconnecting up to 2000 processors using up to 200 edge switches and five multi-blade chassis devices. The architecture of the system has been described in [1] and its operational model in [2]. Classical, SNMP-based, network monitoring provides statistics on aggregate traffic, but for performance monitoring and troubleshooting purposes there was an imperative need to identify and quantify single traffic flows. sFlow [3] is an industry standard based on statistical sampling which attempts to provide a solution to this. Due to the size of the ATLAS network, the collection and analysis of the sFlow data from all devices generates a data handling problem of its own. This paper describes how this problem is addressed by making it possible to collect and store data either centrally or distributed according to need. The methods used to present the results in a relevant fashion for system analysts are discussed and we explore the possibilities and limitations of this diagnostic tool, giving an example of its use in solving system problems that arise during the ATLAS data taking.

  14. Variable speed limit strategies analysis with mesoscopic traffic flow model based on complex networks

    Science.gov (United States)

    Li, Shu-Bin; Cao, Dan-Ni; Dang, Wen-Xiu; Zhang, Lin

    As a new cross-discipline, the complexity science has penetrated into every field of economy and society. With the arrival of big data, the research of the complexity science has reached its summit again. In recent years, it offers a new perspective for traffic control by using complex networks theory. The interaction course of various kinds of information in traffic system forms a huge complex system. A new mesoscopic traffic flow model is improved with variable speed limit (VSL), and the simulation process is designed, which is based on the complex networks theory combined with the proposed model. This paper studies effect of VSL on the dynamic traffic flow, and then analyzes the optimal control strategy of VSL in different network topologies. The conclusion of this research is meaningful to put forward some reasonable transportation plan and develop effective traffic management and control measures to help the department of traffic management.

  15. Real-Time Corrected Traffic Correlation Model for Traffic Flow Forecasting

    Directory of Open Access Journals (Sweden)

    Hua-pu Lu

    2015-01-01

    Full Text Available This paper focuses on the problems of short-term traffic flow forecasting. The main goal is to put forward traffic correlation model and real-time correction algorithm for traffic flow forecasting. Traffic correlation model is established based on the temporal-spatial-historical correlation characteristic of traffic big data. In order to simplify the traffic correlation model, this paper presents correction coefficients optimization algorithm. Considering multistate characteristic of traffic big data, a dynamic part is added to traffic correlation model. Real-time correction algorithm based on Fuzzy Neural Network is presented to overcome the nonlinear mapping problems. A case study based on a real-world road network in Beijing, China, is implemented to test the efficiency and applicability of the proposed modeling methods.

  16. An Architecture to Manage Incoming Traffic of Inter-Domain Routing Using OpenFlow Networks

    Directory of Open Access Journals (Sweden)

    Walber José Adriano Silva

    2018-04-01

    Full Text Available The Border Gateway Protocol (BGP is the current state-of-the-art inter-domain routing between Autonomous Systems (ASes. Although BGP has different mechanisms to manage outbound traffic in an AS domain, it lacks an efficient tool for inbound traffic control from transit ASes such as Internet Service Providers (ISPs. For inter-domain routing, the BGP’s destination-based forwarding paradigm limits the granularity of distributing the network traffic among the multiple paths of the current Internet topology. Thus, this work offered a new architecture to manage incoming traffic in the inter-domain using OpenFlow networks. The architecture explored direct inter-domain communication to exchange control information and the functionalities of the OpenFlow protocol. Based on the achieved results of the size of exchanging messages, the proposed architecture is not only scalable, but also capable of performing load balancing for inbound traffic using different strategies.

  17. Traffic Flow Prediction Using MI Algorithm and Considering Noisy and Data Loss Conditions: An Application to Minnesota Traffic Flow Prediction

    Directory of Open Access Journals (Sweden)

    Seyed Hadi Hosseini

    2014-10-01

    Full Text Available Traffic flow forecasting is useful for controlling traffic flow, traffic lights, and travel times. This study uses a multi-layer perceptron neural network and the mutual information (MI technique to forecast traffic flow and compares the prediction results with conventional traffic flow forecasting methods. The MI method is used to calculate the interdependency of historical traffic data and future traffic flow. In numerical case studies, the proposed traffic flow forecasting method was tested against data loss, changes in weather conditions, traffic congestion, and accidents. The outcomes were highly acceptable for all cases and showed the robustness of the proposed flow forecasting method.

  18. Betweenness centrality and its applications from modeling traffic flows to network community detection

    Science.gov (United States)

    Ren, Yihui

    As real-world complex networks are heterogeneous structures, not all their components such as nodes, edges and subgraphs carry the same role or importance in the functions performed by the networks: some elements are more critical than others. Understanding the roles of the components of a network is crucial for understanding the behavior of the network as a whole. One the most basic function of networks is transport; transport of vehicles/people, information, materials, forces, etc., and these quantities are transported along edges between source and destination nodes. For this reason, network path-based importance measures, also called centralities, play a crucial role in the understanding of the transport functions of the network and the network's structural and dynamical behavior in general. In this thesis we study the notion of betweenness centrality, which measures the fraction of lowest-cost (or shortest) paths running through a network component, in particular through a node or an edge. High betweenness centrality nodes/edges are those that will be frequently used by the entities transported through the network and thus they play a key role in the overall transport properties of the network. In the first part of the thesis we present a first-principles based method for traffic prediction using a cost-based generalization of the radiation model (emission/absorbtion model) for human mobility, coupled with a cost-minimizing algorithm for efficient distribution of the mobility fluxes through the network. Using US census and highway traffic data, we show that traffic can efficiently and accurately be computed from a range-limited, network betweenness type calculation. The model based on travel time costs captures the log-normal distribution of the traffic and attains a high Pearson correlation coefficient (0.75) when compared with real traffic. We then focus on studying the extent of changes in traffic flows in the wake of a localized damage or alteration to the

  19. A multiclass vehicular dynamic traffic flow model for main roads and dedicated lanes/roads of multimodal transport network

    Energy Technology Data Exchange (ETDEWEB)

    Sossoe, K.S., E-mail: kwami.sossoe@irt-systemx.fr [TECHNOLOGICAL RESEARCH INSTITUTE SYSTEMX (France); Lebacque, J-P., E-mail: jean-patrick.lebacque@ifsttar.fr [UPE/IFSTTAR-COSYS-GRETTIA (France)

    2015-03-10

    We present in this paper a model of vehicular traffic flow for a multimodal transportation road network. We introduce the notion of class of vehicles to refer to vehicles of different transport modes. Our model describes the traffic on highways (which may contain several lanes) and network transit for pubic transportation. The model is drafted with Eulerian and Lagrangian coordinates and uses a Logit model to describe the traffic assignment of our multiclass vehicular flow description on shared roads. The paper also discusses traffic streams on dedicated lanes for specific class of vehicles with event-based traffic laws. An Euler-Lagrangian-remap scheme is introduced to numerically approximate the model’s flow equations.

  20. Breakdown in traffic networks fundamentals of transportation science

    CERN Document Server

    Kerner, Boris S

    2017-01-01

    This book offers a detailed investigation of breakdowns in traffic and transportation networks. It shows empirically that transitions from free flow to so-called synchronized flow, initiated by local disturbances at network bottlenecks, display a nucleation-type behavior: while small disturbances in free flow decay, larger ones grow further and lead to breakdowns at the bottlenecks. Further, it discusses in detail the significance of this nucleation effect for traffic and transportation theories, and the consequences this has for future automatic driving, traffic control, dynamic traffic assignment, and optimization in traffic and transportation networks. Starting from a large volume of field traffic data collected from various sources obtained solely through measurements in real world traffic, the author develops his insights, with an emphasis less on reviewing existing methodologies, models and theories, and more on providing a detailed analysis of empirical traffic data and drawing consequences regarding t...

  1. 77 FR 3544 - Meeting and Webinar on the Active Traffic and Demand Management and Intelligent Network Flow...

    Science.gov (United States)

    2012-01-24

    ... Intelligent Network Flow Optimization Operational Concepts; Notice of Public Meeting AGENCY: Research and... Demand Management (ADTM) and Intelligent Network Flow Optimization (INFLO) operational concepts. The ADTM... infrastructure. The vision for ATDM research is to allow transportation agencies to increase traffic flow...

  2. Consistency analysis of network traffic repositories

    NARCIS (Netherlands)

    Lastdrager, Elmer; Lastdrager, E.E.H.; Pras, Aiko

    Traffic repositories with TCP/IP header information are very important for network analysis. Researchers often assume that such repositories reliably represent all traffic that has been flowing over the network; little thoughts are made regarding the consistency of these repositories. Still, for

  3. Predicting Traffic Flow in Local Area Networks by the Largest Lyapunov Exponent

    Directory of Open Access Journals (Sweden)

    Yan Liu

    2016-01-01

    Full Text Available The dynamics of network traffic are complex and nonlinear, and chaotic behaviors and their prediction, which play an important role in local area networks (LANs, are studied in detail, using the largest Lyapunov exponent. With the introduction of phase space reconstruction based on the time sequence, the high-dimensional traffic is projected onto the low dimension reconstructed phase space, and a reduced dynamic system is obtained from the dynamic system viewpoint. Then, a numerical method for computing the largest Lyapunov exponent of the low-dimensional dynamic system is presented. Further, the longest predictable time, which is related to chaotic behaviors in the system, is studied using the largest Lyapunov exponent, and the Wolf method is used to predict the evolution of the traffic in a local area network by both Dot and Interval predictions, and a reliable result is obtained by the presented method. As the conclusion, the results show that the largest Lyapunov exponent can be used to describe the sensitivity of the trajectory in the reconstructed phase space to the initial values. Moreover, Dot Prediction can effectively predict the flow burst. The numerical simulation also shows that the presented method is feasible and efficient for predicting the complex dynamic behaviors in LAN traffic, especially for congestion and attack in networks, which are the main two complex phenomena behaving as chaos in networks.

  4. Traffic Flow Prediction Model for Large-Scale Road Network Based on Cloud Computing

    Directory of Open Access Journals (Sweden)

    Zhaosheng Yang

    2014-01-01

    Full Text Available To increase the efficiency and precision of large-scale road network traffic flow prediction, a genetic algorithm-support vector machine (GA-SVM model based on cloud computing is proposed in this paper, which is based on the analysis of the characteristics and defects of genetic algorithm and support vector machine. In cloud computing environment, firstly, SVM parameters are optimized by the parallel genetic algorithm, and then this optimized parallel SVM model is used to predict traffic flow. On the basis of the traffic flow data of Haizhu District in Guangzhou City, the proposed model was verified and compared with the serial GA-SVM model and parallel GA-SVM model based on MPI (message passing interface. The results demonstrate that the parallel GA-SVM model based on cloud computing has higher prediction accuracy, shorter running time, and higher speedup.

  5. Optimum principle for a vehicular traffic network: minimum probability of congestion

    International Nuclear Information System (INIS)

    Kerner, Boris S

    2011-01-01

    We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached when link flow rates are assigned in the network in such a way that the probability for spontaneous occurrence of traffic breakdown in at least one of the network bottlenecks during a given observation time reaches the minimum possible value. Based on numerical simulations with a stochastic three-phase traffic flow model, we show that in comparison to the well-known Wardrop's principles, the application of the BM principle permits considerably greater network inflow rates at which no traffic breakdown occurs and, therefore, free flow remains in the whole network. (fast track communication)

  6. Forecasting Multivariate Road Traffic Flows Using Bayesian Dynamic Graphical Models, Splines and Other Traffic Variables

    NARCIS (Netherlands)

    Anacleto, Osvaldo; Queen, Catriona; Albers, Casper J.

    Traffic flow data are routinely collected for many networks worldwide. These invariably large data sets can be used as part of a traffic management system, for which good traffic flow forecasting models are crucial. The linear multiregression dynamic model (LMDM) has been shown to be promising for

  7. A Wavelet Analysis-Based Dynamic Prediction Algorithm to Network Traffic

    Directory of Open Access Journals (Sweden)

    Meng Fan-Bo

    2016-01-01

    Full Text Available Network traffic is a significantly important parameter for network traffic engineering, while it holds highly dynamic nature in the network. Accordingly, it is difficult and impossible to directly predict traffic amount of end-to-end flows. This paper proposes a new prediction algorithm to network traffic using the wavelet analysis. Firstly, network traffic is converted into the time-frequency domain to capture time-frequency feature of network traffic. Secondly, in different frequency components, we model network traffic in the time-frequency domain. Finally, we build the prediction model about network traffic. At the same time, the corresponding prediction algorithm is presented to attain network traffic prediction. Simulation results indicates that our approach is promising.

  8. Optimum principle for a vehicular traffic network: minimum probability of congestion

    Energy Technology Data Exchange (ETDEWEB)

    Kerner, Boris S, E-mail: boris.kerner@daimler.com [Daimler AG, GR/PTF, HPC: G021, 71059 Sindelfingen (Germany)

    2011-03-04

    We introduce an optimum principle for a vehicular traffic network with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached when link flow rates are assigned in the network in such a way that the probability for spontaneous occurrence of traffic breakdown in at least one of the network bottlenecks during a given observation time reaches the minimum possible value. Based on numerical simulations with a stochastic three-phase traffic flow model, we show that in comparison to the well-known Wardrop's principles, the application of the BM principle permits considerably greater network inflow rates at which no traffic breakdown occurs and, therefore, free flow remains in the whole network. (fast track communication)

  9. Will Automated Vehicles Negatively Impact Traffic Flow?

    Directory of Open Access Journals (Sweden)

    S. C. Calvert

    2017-01-01

    Full Text Available With low-level vehicle automation already available, there is a necessity to estimate its effects on traffic flow, especially if these could be negative. A long gradual transition will occur from manual driving to automated driving, in which many yet unknown traffic flow dynamics will be present. These effects have the potential to increasingly aid or cripple current road networks. In this contribution, we investigate these effects using an empirically calibrated and validated simulation experiment, backed up with findings from literature. We found that low-level automated vehicles in mixed traffic will initially have a small negative effect on traffic flow and road capacities. The experiment further showed that any improvement in traffic flow will only be seen at penetration rates above 70%. Also, the capacity drop appeared to be slightly higher with the presence of low-level automated vehicles. The experiment further investigated the effect of bottleneck severity and truck shares on traffic flow. Improvements to current traffic models are recommended and should include a greater detail and understanding of driver-vehicle interaction, both in conventional and in mixed traffic flow. Further research into behavioural shifts in driving is also recommended due to limited data and knowledge of these dynamics.

  10. Predicting Free Flow Speed and Crash Risk of Bicycle Traffic Flow Using Artificial Neural Network Models

    Directory of Open Access Journals (Sweden)

    Cheng Xu

    2015-01-01

    Full Text Available Free flow speed is a fundamental measure of traffic performance and has been found to affect the severity of crash risk. However, the previous studies lack analysis and modelling of impact factors on bicycles’ free flow speed. The main focus of this study is to develop multilayer back propagation artificial neural network (BPANN models for the prediction of free flow speed and crash risk on the separated bicycle path. Four different models with considering different combinations of input variables (e.g., path width, traffic condition, bicycle type, and cyclists’ characteristics were developed. 459 field data samples were collected from eleven bicycle paths in Hangzhou, China, and 70% of total samples were used for training, 15% for validation, and 15% for testing. The results show that considering the input variables of bicycle types and characteristics of cyclists will effectively improve the accuracy of the prediction models. Meanwhile, the parameters of bicycle types have more significant effect on predicting free flow speed of bicycle compared to those of cyclists’ characteristics. The findings could contribute for evaluation, planning, and management of bicycle safety.

  11. Traffic Policing in Dynamic Military Networks Using Software Defined Networking

    OpenAIRE

    Skappel, Hans Fredrik

    2016-01-01

    This thesis looks at how Software Defined Networking (SDN) can be used to provide traffic engineering and to police traffic in an Operational Military Network (OMN). SDN is a concept where the control plane is separated from the forwarding plane, and the control plane is capable of controlling forwarding plane elements located on multiple network nodes using the OpenFlow protocol. Specifically, we have discussed the problems in OMNs, and possible SDN approaches to mitigate the challenges. Bas...

  12. Traffic dynamics on coupled spatial networks

    International Nuclear Information System (INIS)

    Du, Wen-Bo; Zhou, Xing-Lian; Chen, Zhen; Cai, Kai-Quan; Cao, Xian-Bin

    2014-01-01

    With the rapid development of modern traffic, various means of transportation systems make it more convenient and diversified for passengers to travel out. In this paper, we establish a two-layered spatial network model where the low-speed lower layer is a regular lattice and the high-speed upper layer is a scale-free network embedded in the lattice. Passengers will travel along the path with the minimal travel time, and they can transfer from one layer to the other, which will induce extra transfer cost. We extensively investigate the traffic process on these coupled spatial networks and focus on the effect of the parameter α, the speed ratio between two networks. It is found that, as α grows, the network capacity of the coupled networks increases in the early stage and then decreases, indicating that cooperation between the coupled networks will induce the highest network capacity at an optimal α. We then provide an explanation for this non-monotonous dependence from a micro-scope point of view. The travel time reliability is also examined. Both in free-flow state and congestion state, the travel time is linearly related to the Euclidean distance. However, the variance of travel time in the congestion state is remarkably larger than that in the free-flow state, namely, people have to set aside more redundant time in an unreliable traffic system

  13. Robust and Agile System against Fault and Anomaly Traffic in Software Defined Networks

    Directory of Open Access Journals (Sweden)

    Mihui Kim

    2017-03-01

    Full Text Available The main advantage of software defined networking (SDN is that it allows intelligent control and management of networking though programmability in real time. It enables efficient utilization of network resources through traffic engineering, and offers potential attack defense methods when abnormalities arise. However, previous studies have only identified individual solutions for respective problems, instead of finding a more global solution in real time that is capable of addressing multiple situations in network status. To cover diverse network conditions, this paper presents a comprehensive reactive system for simultaneously monitoring failures, anomalies, and attacks for high availability and reliability. We design three main modules in the SDN controller for a robust and agile defense (RAD system against network anomalies: a traffic analyzer, a traffic engineer, and a rule manager. RAD provides reactive flow rule generation to control traffic while detecting network failures, anomalies, high traffic volume (elephant flows, and attacks. The traffic analyzer identifies elephant flows, traffic anomalies, and attacks based on attack signatures and network monitoring. The traffic engineer module measures network utilization and delay in order to determine the best path for multi-dimensional routing and load balancing under any circumstances. Finally, the rule manager generates and installs a flow rule for the selected best path to control traffic. We implement the proposed RAD system based on Floodlight, an open source project for the SDN controller. We evaluate our system using simulation with and without the aforementioned RAD modules. Experimental results show that our approach is both practical and feasible, and can successfully augment an existing SDN controller in terms of agility, robustness, and efficiency, even in the face of link failures, attacks, and elephant flows.

  14. Modelling traffic congestion using queuing networks

    Indian Academy of Sciences (India)

    Flow-density curves; uninterrupted traffic; Jackson networks. ... ness - also suffer from a big handicap vis-a-vis the Indian scenario: most of these models do .... more well-known queuing network models and onsite data, a more exact Road Cell ...

  15. Property relationships of the physical infrastructure and the traffic flow networks

    Science.gov (United States)

    Zhou, Ta; Zou, Sheng-Rong; He, Da-Ren

    2010-03-01

    We studied both empirically and analytically the correlation between the degrees or the clustering coefficients, respectively, of the networks in the physical infrastructure and the traffic flow layers in three Chinese transportation systems. The systems are bus transportation systems in Beijing and Hangzhou, and the railway system in the mainland. It is found that the correlation between the degrees obey a linear function; while the correlation between the clustering coefficients obey a power law. A possible dynamic explanation on the rules is presented.

  16. Cellular automata model for traffic flow at intersections in internet of vehicles

    Science.gov (United States)

    Zhao, Han-Tao; Liu, Xin-Ru; Chen, Xiao-Xu; Lu, Jian-Cheng

    2018-03-01

    Considering the effect of the front vehicle's speed, the influence of the brake light and the conflict of the traffic flow, we established a cellular automata model called CE-NS for traffic flow at the intersection in the non-vehicle networking environment. According to the information interaction of Internet of Vehicles (IoV), introducing parameters describing the congestion and the accurate speed of the front vehicle into the CE-NS model, we improved the rules of acceleration, deceleration and conflict, and finally established a cellular automata model for traffic flow at intersections of IoV. The relationship between traffic parameters such as vehicle speed, flow and average travel time is obtained by numerical simulation of two models. Based on this, we compared the traffic situation of the non-vehicle networking environment with conditions of IoV environment, and analyzed the influence of the different degree of IoV on the traffic flow. The results show that the traffic speed is increased, the travel time is reduced, the flux of intersections is increased and the traffic flow is more smoothly under IoV environment. After the vehicle which achieves IoV reaches a certain proportion, the operation effect of the traffic flow begins to improve obviously.

  17. Traffic measurement for big network data

    CERN Document Server

    Chen, Shigang; Xiao, Qingjun

    2017-01-01

    This book presents several compact and fast methods for online traffic measurement of big network data. It describes challenges of online traffic measurement, discusses the state of the field, and provides an overview of the potential solutions to major problems. The authors introduce the problem of per-flow size measurement for big network data and present a fast and scalable counter architecture, called Counter Tree, which leverages a two-dimensional counter sharing scheme to achieve far better memory efficiency and significantly extend estimation range. Unlike traditional approaches to cardinality estimation problems that allocate a separated data structure (called estimator) for each flow, this book takes a different design path by viewing all the flows together as a whole: each flow is allocated with a virtual estimator, and these virtual estimators share a common memory space. A framework of virtual estimators is designed to apply the idea of sharing to an array of cardinality estimation solutions, achi...

  18. Lagrangian generic second order traffic flow models for node

    Directory of Open Access Journals (Sweden)

    Asma Khelifi

    2018-02-01

    Full Text Available This study sheds light on higher order macroscopic traffic flow modeling on road networks, thanks to the generic second order models (GSOM family which embeds a myriad of traffic models. It has been demonstrated that such higher order models are easily solved in Lagrangian coordinates which are compatible with both microscopic and macroscopic descriptions. The generalized GSOM model is reformulated in the Lagrangian coordinate system to develop a more efficient numerical method. The difficulty in applying this approach on networks basically resides in dealing with node dynamics. Traffic flow characteristics at node are different from that on homogeneous links. Different geometry features can lead to different critical research issues. For instance, discontinuity in traffic stream can be an important issue for traffic signal operations, while capacity drop may be crucial for lane-merges. The current paper aims to establish and analyze a new adapted node model for macroscopic traffic flow models by applying upstream and downstream boundary conditions on the Lagrangian coordinates in order to perform simulations on networks of roads, and accompanying numerical method. The internal node dynamics between upstream and downstream links are taken into account of the node model. Therefore, a numerical example is provided to underscore the efficiency of this approach. Simulations show that the discretized node model yields accurate results. Additional kinematic waves and contact discontinuities are induced by the variation of the driver attribute.

  19. Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks.

    Science.gov (United States)

    Artuñedo, Antonio; Del Toro, Raúl M; Haber, Rodolfo E

    2017-04-26

    Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller ( TLC ) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks.

  20. Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks

    Directory of Open Access Journals (Sweden)

    Antonio Artuñedo

    2017-04-01

    Full Text Available Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller (TLC network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks.

  1. Routing strategies in traffic network and phase transition in network ...

    Indian Academy of Sciences (India)

    3Department of Electronic Engineering, City University of Hong Kong, Hong Kong ... Routing strategy; network traffic flow; hysteretic loop; phase transition from ... ered from two aspects: modifying the underlying network structure or developing ... capacity corresponds to α = −1 in the case of identical nodes' delivering ability.

  2. Roads at risk: traffic detours from debris flows in southern Norway

    Science.gov (United States)

    Meyer, N. K.; Schwanghart, W.; Korup, O.; Nadim, F.

    2015-05-01

    Globalisation and interregional exchange of people, goods, and services has boosted the importance of and reliance on all kinds of transport networks. The linear structure of road networks is especially sensitive to natural hazards. In southern Norway, steep topography and extreme weather events promote frequent traffic disruption caused by debris flows. Topographic susceptibility and trigger frequency maps serve as input into a hazard appraisal at the scale of first-order catchments to quantify the impact of debris flows on the road network in terms of a failure likelihood of each link connecting two network vertices, e.g. road junctions. We compute total additional traffic loads as a function of traffic volume and excess distance, i.e. the extra length of an alternative path connecting two previously disrupted network vertices using a shortest-path algorithm. Our risk metric of link failure is the total additional annual traffic load, expressed as vehicle kilometres, because of debris-flow-related road closures. We present two scenarios demonstrating the impact of debris flows on the road network and quantify the associated path-failure likelihood between major cities in southern Norway. The scenarios indicate that major routes crossing the central and north-western part of the study area are associated with high link-failure risk. Yet options for detours on major routes are manifold and incur only little additional costs provided that drivers are sufficiently well informed about road closures. Our risk estimates may be of importance to road network managers and transport companies relying on speedy delivery of services and goods.

  3. Finding Elephant Flows for Optical Networks

    NARCIS (Netherlands)

    Fioreze, Tiago; Oude Wolbers, Mattijs; van de Meent, R.; Pras, Aiko

    2007-01-01

    Optical networks are fast and reliable networks that enable, amongst others, dedicated light paths to be established for elephant IP flows. Elephant IP flows are characterized by being small in number, but long in time and high in traffic volume. Moving these flows from the general IP network to

  4. Research on the Method of Traffic Organization and Optimization Based on Dynamic Traffic Flow Model

    Directory of Open Access Journals (Sweden)

    Shu-bin Li

    2017-01-01

    Full Text Available The modern transportation system is becoming sluggish by traffic jams, so much so that it can harm the economic and society in our country. One of the reasons is the surging vehicles day by day. Another reason is the shortage of the traffic supply seriously. But the most important reason is that the traffic organization and optimization hardly met the conditions of modern transport development. In this paper, the practical method of the traffic organization and optimization used in regional area is explored by the dynamic traffic network analysis method. Firstly, the operational states of the regional traffic network are obtained by simulation method based on the self-developed traffic simulation software DynaCHINA, in which the improved traffic flow simulation model was proposed in order to be more suitable for actual domestic urban transport situation. Then the appropriated optimization model and algorithm were proposed according to different optimized content and organization goals, and the traffic simulation processes more suitable to regional optimization were designed exactly. Finally, a regional network in Tai’an city was selected as an example. The simulation results show that the proposed method is effective and feasible. It can provide strong scientific and technological support for the traffic management department.

  5. Modelling of road traffic for traffic flow optimization of modern regional center as an example of Odessa

    Directory of Open Access Journals (Sweden)

    S.V. Myronenko

    2016-12-01

    Full Text Available At present sharply there is a problem of traffic management especially in big cities. The increase in the number of vehicles, both personal and public, led to congestion of city roads, many hours of traffic jams, difficulty of movement of pedestrians, increase the number of accidents, etc. Aim: The aim of the study is to evaluate the possibility of using simulation models to solve problems of analysis and optimization of traffic flows. To achieve this goal in a simulation environment the data base of the transport network will be developed. Materials and Methods: The problem of analysis and optimization of traffic flow is considered by the example of the city of Odessa (Ukraine, the results and recommendations can be easily adapted for other cities of Ukraine, and for the cities of most countries of the former socialist bloc. Features of transport systems make it impossible to build an adequate analytical model to explore options for the management of the system and its characteristic in different conditions. At the same time simulation modelling as a method to study such objects is a promising for the solution to this problem. As a simulation environment an OmniTRANS package as a universal tool for modeling of discrete, continuous and hybrid systems. Results: With OmniTRANS programs the model of traffic in Odessa was derived and the intensity of the traffic flow. B first approximation the transport network of the central district of the city was considered and built; without calibration and simulation it was developed a database of elements of the transport network and shown how it can be used to solve problems of analysis and optimization of traffic flows. Models constructed from elements of created database, allows you to change the level of detail of the simulated objects and phenomena, thereby obtaining models as macro and micro level.

  6. Traffic Flow Prediction with Rainfall Impact Using a Deep Learning Method

    Directory of Open Access Journals (Sweden)

    Yuhan Jia

    2017-01-01

    Full Text Available Accurate traffic flow prediction is increasingly essential for successful traffic modeling, operation, and management. Traditional data driven traffic flow prediction approaches have largely assumed restrictive (shallow model architectures and do not leverage the large amount of environmental data available. Inspired by deep learning methods with more complex model architectures and effective data mining capabilities, this paper introduces the deep belief network (DBN and long short-term memory (LSTM to predict urban traffic flow considering the impact of rainfall. The rainfall-integrated DBN and LSTM can learn the features of traffic flow under various rainfall scenarios. Experimental results indicate that, with the consideration of additional rainfall factor, the deep learning predictors have better accuracy than existing predictors and also yield improvements over the original deep learning models without rainfall input. Furthermore, the LSTM can outperform the DBN to capture the time series characteristics of traffic flow data.

  7. Traffic Management for Next Generation Transport Networks

    DEFF Research Database (Denmark)

    Yu, Hao

    required by the next generation transport network to provide Quality-of-Service (QoS) guaranteed video services. Augmenting network capacity and upgrading network nodes indicate long deployment period, replacement of equipment and thus significant cost to the network service providers. This challenge may...... slacken the steps of some network operators towards providing IPTV services. In this dissertation, the topology-based hierarchical scheduling scheme is proposed to tackle the problem addressed. The scheme simplifies the deployment process by placing an intelligent switch with centralized traffic...... management functions at the edge of the network, scheduling traffic on behalf of the other nodes. The topology-based hierarchical scheduling scheme is able to provide outstanding flow isolation due to its centralized scheduling ability, which is essential for providing IPTV services. In order to reduce...

  8. Self-organized natural roads for predicting traffic flow: a sensitivity study

    International Nuclear Information System (INIS)

    Jiang, Bin; Zhao, Sijian; Yin, Junjun

    2008-01-01

    In this paper, we extended road-based topological analysis to both nationwide and urban road networks, and concentrated on a sensitivity study with respect to the formation of self-organized natural roads based on the Gestalt principle of good continuity. Both annual average daily traffic (AADT) and global positioning system (GPS) data were used to correlate with a series of ranking metrics including five centrality-based metrics and two PageRank metrics. It was found that there exists a tipping point from segment-based to road-based network topology in terms of correlation between ranking metrics and their traffic. To our great surprise, (1) this correlation is significantly improved if a selfish rather than utopian strategy is adopted in forming the self-organized natural roads, and (2) point-based metrics assigned by summation into individual roads tend to have a much better correlation with traffic flow than line-based metrics. These counter-intuitive surprising findings constitute emergent properties of self-organized natural roads, which are intelligent enough for predicting traffic flow, thus shedding substantial light on the understanding of road networks and their traffic from the perspective of complex networks

  9. RESEARCH OF ENGINEERING TRAFFIC IN COMPUTER UZ NETWORK USING MPLS TE TECHNOLOGY

    Directory of Open Access Journals (Sweden)

    V. M. Pakhomovа

    2014-12-01

    Full Text Available Purpose. In railway transport of Ukraine one requires the use of computer networks of different technologies: Ethernet, Token Bus, Token Ring, FDDI and others. In combined computer networks on the railway transport it is necessary to use packet switching technology in multiprotocol networks MPLS (MultiProtocol Label Switching more effectively. They are based on the use of tags. Packet network must transmit different types of traffic with a given quality of service. The purpose of the research is development a methodology for determining the sequence of destination flows for the considered fragment of computer network of UZ. Methodology. When optimizing traffic management in MPLS networks has the important role of technology traffic engineering (Traffic Engineering, TE. The main mechanism of TE in MPLS is the use of unidirectional tunnels (MPLS TE tunnel to specify the path of the specified traffic. The mathematical model of the problem of traffic engineering in computer network of UZ technology MPLS TE was made. Computer UZ network is represented with the directed graph, their vertices are routers of computer network, and each arc simulates communication between nodes. As an optimization criterion serves the minimum value of the maximum utilization of the TE-tunnel. Findings. The six options destination flows were determined; rational sequence of flows was found, at which the maximum utilization of TE-tunnels considered a simplified fragment of a computer UZ network does not exceed 0.5. Originality. The method of solving the problem of traffic engineering in Multiprotocol network UZ technology MPLS TE was proposed; for different classes its own way is laid, depending on the bandwidth and channel loading. Practical value. Ability to determine the values of the maximum coefficient of use of TE-tunnels in computer UZ networks based on developed software model «TraffEng». The input parameters of the model: number of routers, channel capacity, the

  10. Learning Traffic as Images: A Deep Convolutional Neural Network for Large-Scale Transportation Network Speed Prediction.

    Science.gov (United States)

    Ma, Xiaolei; Dai, Zhuang; He, Zhengbing; Ma, Jihui; Wang, Yong; Wang, Yunpeng

    2017-04-10

    This paper proposes a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy. Spatiotemporal traffic dynamics are converted to images describing the time and space relations of traffic flow via a two-dimensional time-space matrix. A CNN is applied to the image following two consecutive steps: abstract traffic feature extraction and network-wide traffic speed prediction. The effectiveness of the proposed method is evaluated by taking two real-world transportation networks, the second ring road and north-east transportation network in Beijing, as examples, and comparing the method with four prevailing algorithms, namely, ordinary least squares, k-nearest neighbors, artificial neural network, and random forest, and three deep learning architectures, namely, stacked autoencoder, recurrent neural network, and long-short-term memory network. The results show that the proposed method outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time. The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks.

  11. Flow whitelisting in SCADA networks

    DEFF Research Database (Denmark)

    Barbosa, Rafael Ramos Regis; Sadre, Ramin; Pras, Aiko

    2013-01-01

    and the Internet. This paper describes an approach for improving the security of SCADA networks using flow whitelisting. A flow whitelist describes legitimate traffic based on four properties of network packets: client address, server address, server-side port and transport protocol. The proposed approach...

  12. Online traffic flow model applying dynamic flow-density relation

    International Nuclear Information System (INIS)

    Kim, Y.

    2002-01-01

    This dissertation describes a new approach of the online traffic flow modelling based on the hydrodynamic traffic flow model and an online process to adapt the flow-density relation dynamically. The new modelling approach was tested based on the real traffic situations in various homogeneous motorway sections and a motorway section with ramps and gave encouraging simulation results. This work is composed of two parts: first the analysis of traffic flow characteristics and second the development of a new online traffic flow model applying these characteristics. For homogeneous motorway sections traffic flow is classified into six different traffic states with different characteristics. Delimitation criteria were developed to separate these states. The hysteresis phenomena were analysed during the transitions between these traffic states. The traffic states and the transitions are represented on a states diagram with the flow axis and the density axis. For motorway sections with ramps the complicated traffic flow is simplified and classified into three traffic states depending on the propagation of congestion. The traffic states are represented on a phase diagram with the upstream demand axis and the interaction strength axis which was defined in this research. The states diagram and the phase diagram provide a basis for the development of the dynamic flow-density relation. The first-order hydrodynamic traffic flow model was programmed according to the cell-transmission scheme extended by the modification of flow dependent sending/receiving functions, the classification of cells and the determination strategy for the flow-density relation in the cells. The unreasonable results of macroscopic traffic flow models, which may occur in the first and last cells in certain conditions are alleviated by applying buffer cells between the traffic data and the model. The sending/receiving functions of the cells are determined dynamically based on the classification of the

  13. Weighted complex network analysis of the Beijing subway system: Train and passenger flows

    Science.gov (United States)

    Feng, Jia; Li, Xiamiao; Mao, Baohua; Xu, Qi; Bai, Yun

    2017-05-01

    In recent years, complex network theory has become an important approach to the study of the structure and dynamics of traffic networks. However, because traffic data is difficult to collect, previous studies have usually focused on the physical topology of subway systems, whereas few studies have considered the characteristics of traffic flows through the network. Therefore, in this paper, we present a multi-layer model to analyze traffic flow patterns in subway networks, based on trip data and an operation timetable obtained from the Beijing Subway System. We characterize the patterns in terms of the spatiotemporal flow size distributions of both the train flow network and the passenger flow network. In addition, we describe the essential interactions between these two networks based on statistical analyses. The results of this study suggest that layered models of transportation systems can elucidate fundamental differences between the coexisting traffic flows and can also clarify the mechanism that causes these differences.

  14. Traffic signal synchronization in the saturated high-density grid road network.

    Science.gov (United States)

    Hu, Xiaojian; Lu, Jian; Wang, Wei; Zhirui, Ye

    2015-01-01

    Most existing traffic signal synchronization strategies do not perform well in the saturated high-density grid road network (HGRN). Traffic congestion often occurs in the saturated HGRN, and the mobility of the network is difficult to restore. In order to alleviate traffic congestion and to improve traffic efficiency in the network, the study proposes a regional traffic signal synchronization strategy, named the long green and long red (LGLR) traffic signal synchronization strategy. The essence of the strategy is to control the formation and dissipation of queues and to maximize the efficiency of traffic flows at signalized intersections in the saturated HGRN. With this strategy, the same signal control timing plan is used at all signalized intersections in the HGRN, and the straight phase of the control timing plan has a long green time and a long red time. Therefore, continuous traffic flows can be maintained when vehicles travel, and traffic congestion can be alleviated when vehicles stop. Using the strategy, the LGLR traffic signal synchronization model is developed, with the objective of minimizing the number of stops. Finally, the simulation is executed to analyze the performance of the model by comparing it to other models, and the superiority of the LGLR model is evident in terms of delay, number of stops, queue length, and overall performance in the saturated HGRN.

  15. Structuring of Road Traffic Flows

    Directory of Open Access Journals (Sweden)

    Planko Rožić

    2005-09-01

    Full Text Available Systemic traffic count on the Croatian road network hasbeen carried out for more than three decades in different ways.During this period a large number of automatic traffic countershave been installed, and they operate on different principles.The traffic count has been analyzed from the aspect of vehicleclassification. The count results can be only partly comparedsince they yield different structures of traffic flows. Special analysisrefers to the classification of vehicles by automatic trafficcounters.During the research, a database has been formed with physicalelements of vehicles of over five thousand vehicle types. Theresearch results prove that the vehicle length only is not sufficientfor the classification of vehicles, the way it is used in thepresent automatic traffic counts, but rather the number of axles,the wheelbase as well as the front and rear overhangs needto be considered as well. Therefore, the detector system shouldapply also the detector of axles.The results have been presented that were obtained as partof the program TEST- Technological, research, developmentproject supported by the Minist1y of Science, Education andSport.

  16. MOE-Analysis for Oversaturated Flow with Interrupted Facility and Heterogeneous Traffic for Urban Roads

    Directory of Open Access Journals (Sweden)

    Hemant Kumar Sharma

    2012-09-01

    Full Text Available Speed-flow functions have been developed by several transportation experts to predict accurately the speed of urban road networks. HCM Speed-Flow Curve, BPR Curve, MTC Speed-Flow Curve, Akçelik Speed-Flow Curve are some extraordinary efforts to define the shape of speed-flow curves. However, the complexity of driver's behaviour, interactions among different type of vehicles, lateral clearance, co-relation of driver's psychology with vehicular characteristics and interdependence of various variables of traffic has led to continuous development and refinement of speed-flow curves. The problem gets more difficult in the case of urban roads with heterogeneous traffic, oversaturated flow and signalized network (which includes some unsignalized intersections as well. This paper presents analysis for various measures of effectiveness (MOE for urban roads with interrupted flow comprising heterogeneous traffic. Model has been developed for heterogeneous traffic under constraints of roadway geometry, vehicle characteristics, driving behaviour and traffic controls. The model developed in this paper predicts speed, delay, average queue and maximum queue estimates for urban roads and quantifies congestion for oversaturated conditions. The investigation details the oversaturated portion of flow in particular.

  17. Serial Network Flow Monitor

    Science.gov (United States)

    Robinson, Julie A.; Tate-Brown, Judy M.

    2009-01-01

    Using a commercial software CD and minimal up-mass, SNFM monitors the Payload local area network (LAN) to analyze and troubleshoot LAN data traffic. Validating LAN traffic models may allow for faster and more reliable computer networks to sustain systems and science on future space missions. Research Summary: This experiment studies the function of the computer network onboard the ISS. On-orbit packet statistics are captured and used to validate ground based medium rate data link models and enhance the way that the local area network (LAN) is monitored. This information will allow monitoring and improvement in the data transfer capabilities of on-orbit computer networks. The Serial Network Flow Monitor (SNFM) experiment attempts to characterize the network equivalent of traffic jams on board ISS. The SNFM team is able to specifically target historical problem areas including the SAMS (Space Acceleration Measurement System) communication issues, data transmissions from the ISS to the ground teams, and multiple users on the network at the same time. By looking at how various users interact with each other on the network, conflicts can be identified and work can begin on solutions. SNFM is comprised of a commercial off the shelf software package that monitors packet traffic through the payload Ethernet LANs (local area networks) on board ISS.

  18. Big Data-Driven Based Real-Time Traffic Flow State Identification and Prediction

    Directory of Open Access Journals (Sweden)

    Hua-pu Lu

    2015-01-01

    Full Text Available With the rapid development of urban informatization, the era of big data is coming. To satisfy the demand of traffic congestion early warning, this paper studies the method of real-time traffic flow state identification and prediction based on big data-driven theory. Traffic big data holds several characteristics, such as temporal correlation, spatial correlation, historical correlation, and multistate. Traffic flow state quantification, the basis of traffic flow state identification, is achieved by a SAGA-FCM (simulated annealing genetic algorithm based fuzzy c-means based traffic clustering model. Considering simple calculation and predictive accuracy, a bilevel optimization model for regional traffic flow correlation analysis is established to predict traffic flow parameters based on temporal-spatial-historical correlation. A two-stage model for correction coefficients optimization is put forward to simplify the bilevel optimization model. The first stage model is built to calculate the number of temporal-spatial-historical correlation variables. The second stage model is present to calculate basic model formulation of regional traffic flow correlation. A case study based on a real-world road network in Beijing, China, is implemented to test the efficiency and applicability of the proposed modeling and computing methods.

  19. Dynamic Traffic Congestion Simulation and Dissipation Control Based on Traffic Flow Theory Model and Neural Network Data Calibration Algorithm

    Directory of Open Access Journals (Sweden)

    Li Wang

    2017-01-01

    Full Text Available Traffic congestion is a common problem in many countries, especially in big cities. At present, China’s urban road traffic accidents occur frequently, the occurrence frequency is high, the accident causes traffic congestion, and accidents cause traffic congestion and vice versa. The occurrence of traffic accidents usually leads to the reduction of road traffic capacity and the formation of traffic bottlenecks, causing the traffic congestion. In this paper, the formation and propagation of traffic congestion are simulated by using the improved medium traffic model, and the control strategy of congestion dissipation is studied. From the point of view of quantitative traffic congestion, the paper provides the fact that the simulation platform of urban traffic integration is constructed, and a feasible data analysis, learning, and parameter calibration method based on RBF neural network is proposed, which is used to determine the corresponding decision support system. The simulation results prove that the control strategy proposed in this paper is effective and feasible. According to the temporal and spatial evolution of the paper, we can see that the network has been improved on the whole.

  20. Best response game of traffic on road network of non-signalized intersections

    Science.gov (United States)

    Yao, Wang; Jia, Ning; Zhong, Shiquan; Li, Liying

    2018-01-01

    This paper studies the traffic flow in a grid road network with non-signalized intersections. The nature of the drivers in the network is simulated such that they play an iterative snowdrift game with other drivers. A cellular automata model is applied to study the characteristics of the traffic flow and the evolution of the behaviour of the drivers during the game. The drivers use best-response as their strategy to update rules. Three major findings are revealed. First, the cooperation rate in simulation experiences staircase-shaped drop as cost to benefit ratio r increases, and cooperation rate can be derived analytically as a function of cost to benefit ratio r. Second, we find that higher cooperation rate corresponds to higher average speed, lower density and higher flow. This reveals that defectors deteriorate the efficiency of traffic on non-signalized intersections. Third, the system experiences more randomness when the density is low because the drivers will not have much opportunity to update strategy when the density is low. These findings help to show how the strategy of drivers in a traffic network evolves and how their interactions influence the overall performance of the traffic system.

  1. Airport Network Flow Simulator

    Science.gov (United States)

    1978-10-01

    The Airport Network Flow Simulator is a FORTRAN IV simulation of the flow of air traffic in the nation's 600 commercial airports. It calculates for any group of selected airports: (a) the landing and take-off (Type A) delays; and (b) the gate departu...

  2. SNAPS : semantic network traffic analysis through projection and selection

    NARCIS (Netherlands)

    Cappers, B.C.M.; van Wijk, J.J.; Harrison, L.; Prigent, N.; Engle, S.; Best, D.; Goodall, J.

    2015-01-01

    Most network traffic analysis applications are designed to discover malicious activity by only relying on high-level flow-based message properties. However, to detect security breaches that are specifically designed to target one network (e.g., Advanced Persistent Threats), deep packet inspection

  3. Modeling Air Traffic Situation Complexity with a Dynamic Weighted Network Approach

    Directory of Open Access Journals (Sweden)

    Hongyong Wang

    2018-01-01

    Full Text Available In order to address the flight delays and risks associated with the forecasted increase in air traffic, there is a need to increase the capacity of air traffic management systems. This should be based on objective measurements of traffic situation complexity. In current air traffic complexity research, no simple means is available to integrate airspace and traffic flow characteristics. In this paper, we propose a new approach for the measurement of air traffic situation complexity. This approach considers the effects of both airspace and traffic flow and objectively quantifies air traffic situation complexity. Considering the aircraft, waypoints, and airways as nodes, and the complexity relationships among these nodes as edges, a dynamic weighted network is constructed. Air traffic situation complexity is defined as the sum of the weights of all edges in the network, and the relationships of complexity with some commonly used indices are statistically analyzed. The results indicate that the new complexity index is more accurate than traffic count and reflects the number of trajectory changes as well as the high-risk situations. Additionally, analysis of potential applications reveals that this new index contributes to achieving complexity-based management, which represents an efficient method for increasing airspace system capacity.

  4. Traffic Flow Management Wrap-Up

    Science.gov (United States)

    Grabbe, Shon

    2011-01-01

    Traffic Flow Management involves the scheduling and routing of air traffic subject to airport and airspace capacity constraints, and the efficient use of available airspace. Significant challenges in this area include: (1) weather integration and forecasting, (2) accounting for user preferences in the Traffic Flow Management decision making process, and (3) understanding and mitigating the environmental impacts of air traffic on the environment. To address these challenges, researchers in the Traffic Flow Management area are developing modeling, simulation and optimization techniques to route and schedule air traffic flights and flows while accommodating user preferences, accounting for system uncertainties and considering the environmental impacts of aviation. This presentation will highlight some of the major challenges facing researchers in this domain, while also showcasing recent innovations designed to address these challenges.

  5. An optimal general type-2 fuzzy controller for Urban Traffic Network

    DEFF Research Database (Denmark)

    Khooban, Mohammad Hassan; Vafamand, Navid; Liaghat, Alireza

    2017-01-01

    Urban traffic network model is illustrated by state-charts and object-diagram. However, they have limitations to show the behavioral perspective of the Traffic Information flow. Consequently, a state space model is used to calculate the half-value waiting time of vehicles. In this study......, a combination of the general type-2 fuzzy logic sets and the Modified Backtracking Search Algorithm (MBSA) techniques are used in order to control the traffic signal scheduling and phase succession so as to guarantee a smooth flow of traffic with the least wait times and average queue length. The parameters...

  6. Synchronized flow in oversaturated city traffic.

    Science.gov (United States)

    Kerner, Boris S; Klenov, Sergey L; Hermanns, Gerhard; Hemmerle, Peter; Rehborn, Hubert; Schreckenberg, Michael

    2013-11-01

    Based on numerical simulations with a stochastic three-phase traffic flow model, we reveal that moving queues (moving jams) in oversaturated city traffic dissolve at some distance upstream of the traffic signal while transforming into synchronized flow. It is found that, as in highway traffic [Kerner, Phys. Rev. E 85, 036110 (2012)], such a jam-absorption effect in city traffic is explained by a strong driver's speed adaptation: Time headways (space gaps) between vehicles increase upstream of a moving queue (moving jam), resulting in moving queue dissolution. It turns out that at given traffic signal parameters, the stronger the speed adaptation effect, the shorter the mean distance between the signal location and the road location at which moving queues dissolve fully and oversaturated traffic consists of synchronized flow only. A comparison of the synchronized flow in city traffic found in this Brief Report with synchronized flow in highway traffic is made.

  7. A new traffic control design method for large networks with signalized intersections

    Science.gov (United States)

    Leininger, G. G.; Colony, D. C.; Seldner, K.

    1979-01-01

    The paper presents a traffic control design technique for application to large traffic networks with signalized intersections. It is shown that the design method adopts a macroscopic viewpoint to establish a new traffic modelling procedure in which vehicle platoons are subdivided into main stream queues and turning queues. Optimization of the signal splits minimizes queue lengths in the steady state condition and improves traffic flow conditions, from the viewpoint of the traveling public. Finally, an application of the design method to a traffic network with thirty-three signalized intersections is used to demonstrate the effectiveness of the proposed technique.

  8. Computing Programs for Determining Traffic Flows from Roundabouts

    Science.gov (United States)

    Boroiu, A. A.; Tabacu, I.; Ene, A.; Neagu, E.; Boroiu, A.

    2017-10-01

    For modelling road traffic at the level of a road network it is necessary to specify the flows of all traffic currents at each intersection. These data can be obtained by direct measurements at the traffic light intersections, but in the case of a roundabout this is not possible directly and the literature as well as the traffic modelling software doesn’t offer ways to solve this issue. Two sets of formulas are proposed by which all traffic flows from the roundabouts with 3 or 4 arms are calculated based on the streams that can be measured. The objective of this paper is to develop computational programs to operate with these formulas. For each of the two sets of analytical relations, a computational program was developed in the Java operating language. The obtained results fully confirm the applicability of the calculation programs. The final stage for capitalizing these programs will be to make them web pages in HTML format, so that they can be accessed and used on the Internet. The achievements presented in this paper are an important step to provide a necessary tool for traffic modelling because these computational programs can be easily integrated into specialized software.

  9. Classification and Analysis of Computer Network Traffic

    DEFF Research Database (Denmark)

    Bujlow, Tomasz

    2014-01-01

    various classification modes (decision trees, rulesets, boosting, softening thresholds) regarding the classification accuracy and the time required to create the classifier. We showed how to use our VBS tool to obtain per-flow, per-application, and per-content statistics of traffic in computer networks...

  10. Calibration of CORSIM models under saturated traffic flow conditions.

    Science.gov (United States)

    2013-09-01

    This study proposes a methodology to calibrate microscopic traffic flow simulation models. : The proposed methodology has the capability to calibrate simultaneously all the calibration : parameters as well as demand patterns for any network topology....

  11. Communication efficiency and congestion of signal traffic in large-scale brain networks.

    Science.gov (United States)

    Mišić, Bratislav; Sporns, Olaf; McIntosh, Anthony R

    2014-01-01

    The complex connectivity of the cerebral cortex suggests that inter-regional communication is a primary function. Using computational modeling, we show that anatomical connectivity may be a major determinant for global information flow in brain networks. A macaque brain network was implemented as a communication network in which signal units flowed between grey matter nodes along white matter paths. Compared to degree-matched surrogate networks, information flow on the macaque brain network was characterized by higher loss rates, faster transit times and lower throughput, suggesting that neural connectivity may be optimized for speed rather than fidelity. Much of global communication was mediated by a "rich club" of hub regions: a sub-graph comprised of high-degree nodes that are more densely interconnected with each other than predicted by chance. First, macaque communication patterns most closely resembled those observed for a synthetic rich club network, but were less similar to those seen in a synthetic small world network, suggesting that the former is a more fundamental feature of brain network topology. Second, rich club regions attracted the most signal traffic and likewise, connections between rich club regions carried more traffic than connections between non-rich club regions. Third, a number of rich club regions were significantly under-congested, suggesting that macaque connectivity actively shapes information flow, funneling traffic towards some nodes and away from others. Together, our results indicate a critical role of the rich club of hub nodes in dynamic aspects of global brain communication.

  12. ReFlow: Reports on Internet Traffic

    NARCIS (Netherlands)

    Hoogesteger, Martijn; de Oliveira Schmidt, R.; Sperotto, Anna; Pras, Aiko

    Internet traffic statistics can provide valuable information to network analysts and researchers about the traffic, technologies and main characteristics of today’s networks. For many years Internet2 maintained a public website with statistics about the traffic in the Abilene network. This site was

  13. Estimation and Control of Networked Distributed Parameter Systems: Application to Traffic Flow

    KAUST Repository

    Canepa, Edward

    2016-11-01

    The management of large-scale transportation infrastructure is becoming a very complex task for the urban areas of this century which are covering bigger geographic spaces and facing the inclusion of connected and self-controlled vehicles. This new system paradigm can leverage many forms of sensing and interaction, including a high-scale mobile sensing approach. To obtain a high penetration sensing system on urban areas more practical and scalable platforms are needed, combined with estimation algorithms suitable to the computational capabilities of these platforms. The purpose of this work was to develop a transportation framework that is able to handle different kinds of sensing data (e.g., connected vehicles, loop detectors) and optimize the traffic state on a defined traffic network. The framework estimates the traffic on road networks modeled by a family of Lighthill-Whitham-Richards equations. Based on an equivalent formulation of the problem using a Hamilton-Jacobi equation and using a semi-analytic formula, I will show that the model constraints resulting from the Hamilton-Jacobi equation are linear, albeit with unknown integer variables. This general framework solve exactly a variety of problems arising in transportation networks: traffic estimation, traffic control (including robust control), cybersecurity and sensor fault detection, or privacy analysis of users in probe-based traffic monitoring systems. This framework is very flexible, fast, and yields exact results. The recent advances in sensors (GPS, inertial measurement units) and microprocessors enable the development low-cost dedicated devices for traffic sensing in cities, 5 which are highly scalable, providing a feasible solution to cover large urban areas. However, one of the main problems to address is the privacy of the users of the transportation system, the framework presented here is a viable option to guarantee the privacy of the users by design.

  14. Comparison of classical statistical methods and artificial neural network in traffic noise prediction

    International Nuclear Information System (INIS)

    Nedic, Vladimir; Despotovic, Danijela; Cvetanovic, Slobodan; Despotovic, Milan; Babic, Sasa

    2014-01-01

    Traffic is the main source of noise in urban environments and significantly affects human mental and physical health and labor productivity. Therefore it is very important to model the noise produced by various vehicles. Techniques for traffic noise prediction are mainly based on regression analysis, which generally is not good enough to describe the trends of noise. In this paper the application of artificial neural networks (ANNs) for the prediction of traffic noise is presented. As input variables of the neural network, the proposed structure of the traffic flow and the average speed of the traffic flow are chosen. The output variable of the network is the equivalent noise level in the given time period L eq . Based on these parameters, the network is modeled, trained and tested through a comparative analysis of the calculated values and measured levels of traffic noise using the originally developed user friendly software package. It is shown that the artificial neural networks can be a useful tool for the prediction of noise with sufficient accuracy. In addition, the measured values were also used to calculate equivalent noise level by means of classical methods, and comparative analysis is given. The results clearly show that ANN approach is superior in traffic noise level prediction to any other statistical method. - Highlights: • We proposed an ANN model for prediction of traffic noise. • We developed originally designed user friendly software package. • The results are compared with classical statistical methods. • The results are much better predictive capabilities of ANN model

  15. Comparison of classical statistical methods and artificial neural network in traffic noise prediction

    Energy Technology Data Exchange (ETDEWEB)

    Nedic, Vladimir, E-mail: vnedic@kg.ac.rs [Faculty of Philology and Arts, University of Kragujevac, Jovana Cvijića bb, 34000 Kragujevac (Serbia); Despotovic, Danijela, E-mail: ddespotovic@kg.ac.rs [Faculty of Economics, University of Kragujevac, Djure Pucara Starog 3, 34000 Kragujevac (Serbia); Cvetanovic, Slobodan, E-mail: slobodan.cvetanovic@eknfak.ni.ac.rs [Faculty of Economics, University of Niš, Trg kralja Aleksandra Ujedinitelja, 18000 Niš (Serbia); Despotovic, Milan, E-mail: mdespotovic@kg.ac.rs [Faculty of Engineering, University of Kragujevac, Sestre Janjic 6, 34000 Kragujevac (Serbia); Babic, Sasa, E-mail: babicsf@yahoo.com [College of Applied Mechanical Engineering, Trstenik (Serbia)

    2014-11-15

    Traffic is the main source of noise in urban environments and significantly affects human mental and physical health and labor productivity. Therefore it is very important to model the noise produced by various vehicles. Techniques for traffic noise prediction are mainly based on regression analysis, which generally is not good enough to describe the trends of noise. In this paper the application of artificial neural networks (ANNs) for the prediction of traffic noise is presented. As input variables of the neural network, the proposed structure of the traffic flow and the average speed of the traffic flow are chosen. The output variable of the network is the equivalent noise level in the given time period L{sub eq}. Based on these parameters, the network is modeled, trained and tested through a comparative analysis of the calculated values and measured levels of traffic noise using the originally developed user friendly software package. It is shown that the artificial neural networks can be a useful tool for the prediction of noise with sufficient accuracy. In addition, the measured values were also used to calculate equivalent noise level by means of classical methods, and comparative analysis is given. The results clearly show that ANN approach is superior in traffic noise level prediction to any other statistical method. - Highlights: • We proposed an ANN model for prediction of traffic noise. • We developed originally designed user friendly software package. • The results are compared with classical statistical methods. • The results are much better predictive capabilities of ANN model.

  16. Probabilistic description of traffic flow

    International Nuclear Information System (INIS)

    Mahnke, R.; Kaupuzs, J.; Lubashevsky, I.

    2005-01-01

    A stochastic description of traffic flow, called probabilistic traffic flow theory, is developed. The general master equation is applied to relatively simple models to describe the formation and dissolution of traffic congestions. Our approach is mainly based on spatially homogeneous systems like periodically closed circular rings without on- and off-ramps. We consider a stochastic one-step process of growth or shrinkage of a car cluster (jam). As generalization we discuss the coexistence of several car clusters of different sizes. The basic problem is to find a physically motivated ansatz for the transition rates of the attachment and detachment of individual cars to a car cluster consistent with the empirical observations in real traffic. The emphasis is put on the analogy with first-order phase transitions and nucleation phenomena in physical systems like supersaturated vapour. The results are summarized in the flux-density relation, the so-called fundamental diagram of traffic flow, and compared with empirical data. Different regimes of traffic flow are discussed: free flow, congested mode as stop-and-go regime, and heavy viscous traffic. The traffic breakdown is studied based on the master equation as well as the Fokker-Planck approximation to calculate mean first passage times or escape rates. Generalizations are developed to allow for on-ramp effects. The calculated flux-density relation and characteristic breakdown times coincide with empirical data measured on highways. Finally, a brief summary of the stochastic cellular automata approach is given

  17. A paradox for traffic dynamics in complex networks with ATIS

    International Nuclear Information System (INIS)

    Zheng Jianfeng; Gao Ziyou

    2008-01-01

    In this work, we study the statistical properties of traffic (e.g., vehicles) dynamics in complex networks, by introducing advanced transportation information systems (ATIS). The ATIS can provide the information of traffic flow pattern throughout the network and have an obvious effect on path routing strategy for such vehicles equipped with ATIS. The ATIS can be described by the understanding of link cost functions. Different indices such as efficiency and system total cost are discussed in depth. It is found that, for random networks (scale-free networks), the efficiency is effectively improved (decreased) if ATIS is properly equipped; however the system total cost is largely increased (decreased). It indicates that there exists a paradox between the efficiency and system total cost in complex networks. Furthermore, we report the simulation results by considering different kinds of link cost functions, and the paradox is recovered. Finally, we extend our traffic model, and also find the existence of the paradox

  18. Network traffic anomaly prediction using Artificial Neural Network

    Science.gov (United States)

    Ciptaningtyas, Hening Titi; Fatichah, Chastine; Sabila, Altea

    2017-03-01

    As the excessive increase of internet usage, the malicious software (malware) has also increase significantly. Malware is software developed by hacker for illegal purpose(s), such as stealing data and identity, causing computer damage, or denying service to other user[1]. Malware which attack computer or server often triggers network traffic anomaly phenomena. Based on Sophos's report[2], Indonesia is the riskiest country of malware attack and it also has high network traffic anomaly. This research uses Artificial Neural Network (ANN) to predict network traffic anomaly based on malware attack in Indonesia which is recorded by Id-SIRTII/CC (Indonesia Security Incident Response Team on Internet Infrastructure/Coordination Center). The case study is the highest malware attack (SQL injection) which has happened in three consecutive years: 2012, 2013, and 2014[4]. The data series is preprocessed first, then the network traffic anomaly is predicted using Artificial Neural Network and using two weight update algorithms: Gradient Descent and Momentum. Error of prediction is calculated using Mean Squared Error (MSE) [7]. The experimental result shows that MSE for SQL Injection is 0.03856. So, this approach can be used to predict network traffic anomaly.

  19. Detecting Distributed Network Traffic Anomaly with Network-Wide Correlation Analysis

    Directory of Open Access Journals (Sweden)

    Yang Dan

    2008-12-01

    Full Text Available Distributed network traffic anomaly refers to a traffic abnormal behavior involving many links of a network and caused by the same source (e.g., DDoS attack, worm propagation. The anomaly transiting in a single link might be unnoticeable and hard to detect, while the anomalous aggregation from many links can be prevailing, and does more harm to the networks. Aiming at the similar features of distributed traffic anomaly on many links, this paper proposes a network-wide detection method by performing anomalous correlation analysis of traffic signals' instantaneous parameters. In our method, traffic signals' instantaneous parameters are firstly computed, and their network-wide anomalous space is then extracted via traffic prediction. Finally, an anomaly is detected by a global correlation coefficient of anomalous space. Our evaluation using Abilene traffic traces demonstrates the excellent performance of this approach for distributed traffic anomaly detection.

  20. The Stability of Multi-modal Traffic Network

    International Nuclear Information System (INIS)

    Han Linghui; Sun Huijun; Zhu Chengjuan; Jia Bin; Wu Jianjun

    2013-01-01

    There is an explicit and implicit assumption in multimodal traffic equilibrium models, that is, if the equilibrium exists, then it will also occur. The assumption is very idealized; in fact, it may be shown that the quite contrary could happen, because in multimodal traffic network, especially in mixed traffic conditions the interaction among traffic modes is asymmetric and the asymmetric interaction may result in the instability of traffic system. In this paper, to study the stability of multimodal traffic system, we respectively present the travel cost function in mixed traffic conditions and in traffic network with dedicated bus lanes. Based on a day-to-day dynamical model, we study the evolution of daily route choice of travelers in multimodal traffic network using 10000 random initial values for different cases. From the results of simulation, it can be concluded that the asymmetric interaction between the cars and buses in mixed traffic conditions can lead the traffic system to instability when traffic demand is larger. We also study the effect of travelers' perception error on the stability of multimodal traffic network. Although the larger perception error can alleviate the effect of interaction between cars and buses and improve the stability of traffic system in mixed traffic conditions, the traffic system also become instable when the traffic demand is larger than a number. For all cases simulated in this study, with the same parameters, traffic system with dedicated bus lane has better stability for traffic demand than that in mixed traffic conditions. We also find that the network with dedicated bus lane has higher portion of travelers by bus than it of mixed traffic network. So it can be concluded that building dedicated bus lane can improve the stability of traffic system and attract more travelers to choose bus reducing the traffic congestion. (general)

  1. Performability indicators for the traffic analysis of wide area networks

    International Nuclear Information System (INIS)

    Tsopelas, Panagiotis; Platis, Agapios

    2003-01-01

    In connecting computing networks, reliability term is strongly related to the availability of connections of Wide Area networks (WANs) or Local Area networks (LANs). In this paper we will examine the network connections activity of a Greek University in order to provide two sources of information: The Quantity of Information Not Delivered (QIND) and the Information Flow Interruption (IFI). These indicators will provide us with the inference of information from observable characteristics of data flow(s), even when the data is encrypted or otherwise not directly available (traffic), which is lost due to failures or upgrades inside this network. The reliability analysis is obtained by collecting the network failures data (duration and frequency) and traffic (total and average) for a specified period of 1 year. It is assumed that the numerical analysis is based on the fact that the lifetime follows and exponential distribution (here as we are working on discrete time the distribution must be the geometric distribution). Hence a Markov chain model seems suitable for modelling the functioning of this system. An algorithm concentrates the results in a transition probability matrix and calculates the reward functions for the QIND/IFI indicators with the use of the power method. Finally, the application part provides an example of how final results can be used to evaluate the observed network

  2. Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks

    Directory of Open Access Journals (Sweden)

    Haiyang Yu

    2017-06-01

    Full Text Available Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs, for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs and long short-term memory (LSTM neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

  3. Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks.

    Science.gov (United States)

    Yu, Haiyang; Wu, Zhihai; Wang, Shuqin; Wang, Yunpeng; Ma, Xiaolei

    2017-06-26

    Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

  4. Estimating Urban Traffic Patterns through Probabilistic Interconnectivity of Road Network Junctions.

    Directory of Open Access Journals (Sweden)

    Ed Manley

    Full Text Available The emergence of large, fine-grained mobility datasets offers significant opportunities for the development and application of new methodologies for transportation analysis. In this paper, the link between routing behaviour and traffic patterns in urban areas is examined, introducing a method to derive estimates of traffic patterns from a large collection of fine-grained routing data. Using this dataset, the interconnectivity between road network junctions is extracted in the form of a Markov chain. This representation encodes the probability of the successive usage of adjacent road junctions, encoding routes as flows between decision points rather than flows along road segments. This network of functional interactions is then integrated within a modified Markov chain Monte Carlo (MCMC framework, adapted for the estimation of urban traffic patterns. As part of this approach, the data-derived links between major junctions influence the movement of directed random walks executed across the network to model origin-destination journeys. The simulation process yields estimates of traffic distribution across the road network. The paper presents an implementation of the modified MCMC approach for London, United Kingdom, building an MCMC model based on a dataset of nearly 700000 minicab routes. Validation of the approach clarifies how each element of the MCMC framework contributes to junction prediction performance, and finds promising results in relation to the estimation of junction choice and minicab traffic distribution. The paper concludes by summarising the potential for the development and extension of this approach to the wider urban modelling domain.

  5. Traffic Flow Theory - A State-of-the-Art Report: Revised Monograph on Traffic Flow Theory

    Science.gov (United States)

    2002-04-13

    This publication is an update and expansion of the Transportation Research Board (TRB) Special Report 165, "Traffic Flow Theory," published in 1975. This updating was undertaken on recommendation of the TRB's Committee on Traffic Flow Theory and Char...

  6. From Cellular Attractor Selection to Adaptive Signal Control for Traffic Networks.

    Science.gov (United States)

    Tian, Daxin; Zhou, Jianshan; Sheng, Zhengguo; Wang, Yunpeng; Ma, Jianming

    2016-03-14

    The management of varying traffic flows essentially depends on signal controls at intersections. However, design an optimal control that considers the dynamic nature of a traffic network and coordinates all intersections simultaneously in a centralized manner is computationally challenging. Inspired by the stable gene expressions of Escherichia coli in response to environmental changes, we explore the robustness and adaptability performance of signalized intersections by incorporating a biological mechanism in their control policies, specifically, the evolution of each intersection is induced by the dynamics governing an adaptive attractor selection in cells. We employ a mathematical model to capture such biological attractor selection and derive a generic, adaptive and distributed control algorithm which is capable of dynamically adapting signal operations for the entire dynamical traffic network. We show that the proposed scheme based on attractor selection can not only promote the balance of traffic loads on each link of the network but also allows the global network to accommodate dynamical traffic demands. Our work demonstrates the potential of bio-inspired intelligence emerging from cells and provides a deep understanding of adaptive attractor selection-based control formation that is useful to support the designs of adaptive optimization and control in other domains.

  7. Traffic Flow Optimization Using a Quantum Annealer

    Directory of Open Access Journals (Sweden)

    Florian Neukart

    2017-12-01

    Full Text Available Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology’s usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of a real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum computing. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.

  8. A two-stage flow-based intrusion detection model for next-generation networks.

    Science.gov (United States)

    Umer, Muhammad Fahad; Sher, Muhammad; Bi, Yaxin

    2018-01-01

    The next-generation network provides state-of-the-art access-independent services over converged mobile and fixed networks. Security in the converged network environment is a major challenge. Traditional packet and protocol-based intrusion detection techniques cannot be used in next-generation networks due to slow throughput, low accuracy and their inability to inspect encrypted payload. An alternative solution for protection of next-generation networks is to use network flow records for detection of malicious activity in the network traffic. The network flow records are independent of access networks and user applications. In this paper, we propose a two-stage flow-based intrusion detection system for next-generation networks. The first stage uses an enhanced unsupervised one-class support vector machine which separates malicious flows from normal network traffic. The second stage uses a self-organizing map which automatically groups malicious flows into different alert clusters. We validated the proposed approach on two flow-based datasets and obtained promising results.

  9. Multi-Agent Based Microscopic Simulation Modeling for Urban Traffic Flow

    Directory of Open Access Journals (Sweden)

    Xianyan Kuang

    2014-10-01

    Full Text Available Traffic simulation plays an important role in the evaluation of traffic decisions. The movement of vehicles essentially is the operating process of drivers, in order to reproduce the urban traffic flow from the micro-aspect on computer, this paper establishes an urban traffic flow microscopic simulation system (UTFSim based on multi-agent. The system is seen as an intelligent virtual environment system (IVES, and the four-layer structure of it is built. The road agent, vehicle agent and signal agent are modeled. The concept of driving trajectory which is divided into LDT (Lane Driving Trajectory and VDDT (Vehicle Dynamic Driving Trajectory is introduced. The “Link-Node” road network model is improved. The driving behaviors including free driving, following driving, lane changing, slowing down, vehicle stop, etc. are analyzed. The results of the signal control experiments utilizing the UTFSim developed in the platform of Visual Studio. NET indicates that it plays a good performance and can be used in the evaluation of traffic management and control.

  10. Wireless traffic steering for green cellular networks

    CERN Document Server

    Zhang, Shan; Zhou, Sheng; Niu, Zhisheng; Shen, Xuemin (Sherman)

    2016-01-01

    This book introduces wireless traffic steering as a paradigm to realize green communication in multi-tier heterogeneous cellular networks. By matching network resources and dynamic mobile traffic demand, traffic steering helps to reduce on-grid power consumption with on-demand services provided. This book reviews existing solutions from the perspectives of energy consumption reduction and renewable energy harvesting. Specifically, it explains how traffic steering can improve energy efficiency through intelligent traffic-resource matching. Several promising traffic steering approaches for dynamic network planning and renewable energy demand-supply balancing are discussed. This book presents an energy-aware traffic steering method for networks with energy harvesting, which optimizes the traffic allocated to each cell based on the renewable energy status. Renewable energy demand-supply balancing is a key factor in energy dynamics, aimed at enhancing renewable energy sustainability to reduce on-grid energy consum...

  11. Autosolitons in applied physics and traffic flow

    International Nuclear Information System (INIS)

    Kerner, B.S.

    1996-01-01

    A review of investigations of autosolitons in nonlinear systems which are of interest for the applied physics and for the transportation research is presented. Autosolitons are solitary intrinsic states which can be formed in a broad class of physical, chemical, biological dissipative distributed media and in traffic flow. Properties of autosolitons which are general for physical systems and for traffic flow will be discussed. Based on results of recent investigations of traffic jams in traffic flow, a comparison of nonlinear characteristics of traffic jams and with nonlinear properties of autosolitons which can be formed in active systems with diffusion will be given. Forms, properties, processes of evolution of autosolitons in traffic flow, in semiconductors and in gas discharge plasma are considered. copyright 1996 American Institute of Physics

  12. Solving Minimum Cost Multi-Commodity Network Flow Problem ...

    African Journals Online (AJOL)

    ADOWIE PERE

    2018-03-23

    Mar 23, 2018 ... network-based modeling framework for integrated fixed and mobile ... Minimum Cost Network Flow Problem (MCNFP) and some ..... Unmanned Aerial Vehicle Routing in Traffic. Incident ... Ph.D. Thesis, Dept. of Surveying &.

  13. Optimized Structure of the Traffic Flow Forecasting Model With a Deep Learning Approach.

    Science.gov (United States)

    Yang, Hao-Fan; Dillon, Tharam S; Chen, Yi-Ping Phoebe

    2017-10-01

    Forecasting accuracy is an important issue for successful intelligent traffic management, especially in the domain of traffic efficiency and congestion reduction. The dawning of the big data era brings opportunities to greatly improve prediction accuracy. In this paper, we propose a novel model, stacked autoencoder Levenberg-Marquardt model, which is a type of deep architecture of neural network approach aiming to improve forecasting accuracy. The proposed model is designed using the Taguchi method to develop an optimized structure and to learn traffic flow features through layer-by-layer feature granulation with a greedy layerwise unsupervised learning algorithm. It is applied to real-world data collected from the M6 freeway in the U.K. and is compared with three existing traffic predictors. To the best of our knowledge, this is the first time that an optimized structure of the traffic flow forecasting model with a deep learning approach is presented. The evaluation results demonstrate that the proposed model with an optimized structure has superior performance in traffic flow forecasting.

  14. Network structure of subway passenger flows

    Science.gov (United States)

    Xu, Q.; Mao, B. H.; Bai, Y.

    2016-03-01

    The results of transportation infrastructure network analyses have been used to analyze complex networks in a topological context. However, most modeling approaches, including those based on complex network theory, do not fully account for real-life traffic patterns and may provide an incomplete view of network functions. This study utilizes trip data obtained from the Beijing Subway System to characterize individual passenger movement patterns. A directed weighted passenger flow network was constructed from the subway infrastructure network topology by incorporating trip data. The passenger flow networks exhibit several properties that can be characterized by power-law distributions based on flow size, and log-logistic distributions based on the fraction of boarding and departing passengers. The study also characterizes the temporal patterns of in-transit and waiting passengers and provides a hierarchical clustering structure for passenger flows. This hierarchical flow organization varies in the spatial domain. Ten cluster groups were identified, indicating a hierarchical urban polycentric structure composed of large concentrated flows at urban activity centers. These empirical findings provide insights regarding urban human mobility patterns within a large subway network.

  15. Characterization of General TCP Traffic under a Large Number of Flows Regime

    National Research Council Canada - National Science Library

    Tinnakornsrisuphap, Peerapol; La, Richard J; Makowski, Armand M

    2002-01-01

    .... Accurate traffic modeling of a large number of short-lived TCP flows is extremely difficult due to the interaction between session, transport, and network layers, and the explosion of the size...

  16. Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks

    NARCIS (Netherlands)

    Berger, Andre; Gross, James; Danielis, Peter; Dán, György

    2017-01-01

    Various industrial control applications have stringent end-to-end latency requirements in the order of a few milliseconds. Software-defined networking (SDN) is a promising solution in order to meet these stringent requirements under varying traffic patterns, as it enables the flexible management of

  17. Predicting commuter flows in spatial networks using a radiation model based on temporal ranges

    Science.gov (United States)

    Ren, Yihui; Ercsey-Ravasz, Mária; Wang, Pu; González, Marta C.; Toroczkai, Zoltán

    2014-11-01

    Understanding network flows such as commuter traffic in large transportation networks is an ongoing challenge due to the complex nature of the transportation infrastructure and human mobility. Here we show a first-principles based method for traffic prediction using a cost-based generalization of the radiation model for human mobility, coupled with a cost-minimizing algorithm for efficient distribution of the mobility fluxes through the network. Using US census and highway traffic data, we show that traffic can efficiently and accurately be computed from a range-limited, network betweenness type calculation. The model based on travel time costs captures the log-normal distribution of the traffic and attains a high Pearson correlation coefficient (0.75) when compared with real traffic. Because of its principled nature, this method can inform many applications related to human mobility driven flows in spatial networks, ranging from transportation, through urban planning to mitigation of the effects of catastrophic events.

  18. Traffic Flow Condition Classification for Short Sections Using Single Microwave Sensor

    Directory of Open Access Journals (Sweden)

    Memiş Kemal

    2010-01-01

    Full Text Available Daily observed traffic flow can show different characteristics varying with the times of the day. They are caused by traffic incidents such as accidents, disabled cars, construction activities and other unusual events. Three different major traffic conditions can be occurred: "Flow," "Dense" and "Congested". Objective of this research is to identify the current traffic condition by examining the traffic measurement parameters. The earlier researches have dealt only with speed and volume by ignoring occupancy. In our study, the occupancy is another important parameter of classification. The previous works have used multiple sensors to classify traffic condition whereas our work uses only single microwave sensor. We have extended Multiple Linear Regression classification with our new approach of Estimating with Error Prediction. We present novel algorithms of Multiclassification with One-Against-All Method and Multiclassification with Binary Comparison for multiple SVM architecture. Finaly, a non-linear model of backpropagation neural network is introduced for classification. This combination has not been reported on previous studies. Training data are obtained from the Corsim based microscopic traffic simulator TSIS 5.1. All performances are compared using this data set. Our methods are currently installed and running at traffic management center of 2.Ring Road in Istanbul.

  19. ON THE ARRIVAL TRAFFIC FLOW ORGANIZATION

    Directory of Open Access Journals (Sweden)

    Nikita A. Assorov

    2017-01-01

    Full Text Available This article is about air traffic flow organization, ICAO regulations describe the organizing of traffic flow as one of the purposes of air traffic control, but they don’t state exactly at what point the flow has to be organized and metered. The flight phase, where air traffic controller interferes with his instructions in order to begin organizing of all aircraft landing at a certain airport depends on the actual traffic volume per hour, airspace capacity and design.The example of air traffic situation in Moscow Domodedovo airport is described in the article, with runway 32 right in use, no significant weather, real usage of STARs, considering all the ICAO and Russian Federation regulations regarding speed control with the restrictions mentioned in AIP of Moscow Domodedovo. The purpose of the experiment is to prove the need of metering the air traffic flow on the entry points in Moscow TMA, because in case of unorganized air traffic flow approach controllers will have additional unnecessary workload.The conducted calculations show, that only 3 aircraft entering TMA on the same distance from initial approach point can be handled using only speed control and existing standard arrival procedures, in all other cases vectoring or holding areas should be used.In order to avoid such situations and increase the number of the aircraft that can be handled by the approach controller with less instructions, all the traffic arriving on the TMA entry point has to be metered by area control centre, because the air traffic control unit has much more space and time for long term speed control modifications, e.g. ±0,02 Mach. In conclusion a simple rule comes to mind – the bigger inbound traffic is, the earlier one has to organize it, in order to do it speed control, radar vectors, miles-in-trail can be used. Also new equipment and technology can help air traffic controller with this task, e.g. AMAN (arrival manager, in addition to this, the experience of

  20. Real-time network traffic classification technique for wireless local area networks based on compressed sensing

    Science.gov (United States)

    Balouchestani, Mohammadreza

    2017-05-01

    Network traffic or data traffic in a Wireless Local Area Network (WLAN) is the amount of network packets moving across a wireless network from each wireless node to another wireless node, which provide the load of sampling in a wireless network. WLAN's Network traffic is the main component for network traffic measurement, network traffic control and simulation. Traffic classification technique is an essential tool for improving the Quality of Service (QoS) in different wireless networks in the complex applications such as local area networks, wireless local area networks, wireless personal area networks, wireless metropolitan area networks, and wide area networks. Network traffic classification is also an essential component in the products for QoS control in different wireless network systems and applications. Classifying network traffic in a WLAN allows to see what kinds of traffic we have in each part of the network, organize the various kinds of network traffic in each path into different classes in each path, and generate network traffic matrix in order to Identify and organize network traffic which is an important key for improving the QoS feature. To achieve effective network traffic classification, Real-time Network Traffic Classification (RNTC) algorithm for WLANs based on Compressed Sensing (CS) is presented in this paper. The fundamental goal of this algorithm is to solve difficult wireless network management problems. The proposed architecture allows reducing False Detection Rate (FDR) to 25% and Packet Delay (PD) to 15 %. The proposed architecture is also increased 10 % accuracy of wireless transmission, which provides a good background for establishing high quality wireless local area networks.

  1. Modeling Network Traffic in Wavelet Domain

    Directory of Open Access Journals (Sweden)

    Sheng Ma

    2004-12-01

    Full Text Available This work discovers that although network traffic has the complicated short- and long-range temporal dependence, the corresponding wavelet coefficients are no longer long-range dependent. Therefore, a "short-range" dependent process can be used to model network traffic in the wavelet domain. Both independent and Markov models are investigated. Theoretical analysis shows that the independent wavelet model is sufficiently accurate in terms of the buffer overflow probability for Fractional Gaussian Noise traffic. Any model, which captures additional correlations in the wavelet domain, only improves the performance marginally. The independent wavelet model is then used as a unified approach to model network traffic including VBR MPEG video and Ethernet data. The computational complexity is O(N for developing such wavelet models and generating synthesized traffic of length N, which is among the lowest attained.

  2. Multicast traffic grooming in flexible optical WDM networks

    Science.gov (United States)

    Patel, Ankitkumar N.; Ji, Philip N.; Jue, Jason P.; Wang, Ting

    2012-12-01

    In Metropolitan Area Networks (MANs), point-to-multipoint applications, such as IPTV, video-on-demand, distance learning, and content distribution, can be efficiently supported through light-tree-based multicastcommunications instead of lightpath-based unicast-communications. The application of multicasting for such traffic is justified by its inherent benefits of reduced control and management overhead and elimination of redundant resource provisioning. Supporting such multicast traffic in Flexible optical WDM (FWDM) networks that can provision light-trees using optimum amount of spectrum within flexible channel spacing leads to higher wavelength and spectral efficiencies compared to the conventional ITU-T fixed grid networks. However, in spite of such flexibility, the residual channel capacity of stranded channels may not be utilized if the network does not offer channels with arbitrary line rates. Additionally, the spectrum allocated to guard bands used to isolate finer granularity channels remains unutilized. These limitations can be addressed by using traffic grooming in which low-rate multicast connections are aggregated and switched over high capacity light-trees. In this paper, we address the multicast traffic grooming problem in FWDM networks, and propose a novel auxiliary graph-based algorithm for the first time. The performance of multicast traffic grooming is evaluated in terms of spectral, cost, and energy efficiencies compared to lightpath-based transparent FWDM networks, lightpathbased traffic grooming-capable FWDM networks, multicast-enabled transparent FWDM networks, and multicast traffic grooming-capable fixed grid networks. Simulation results demonstrate that multicast traffic grooming in FWDM networks not only improves spectral efficiency, but also cost, and energy efficiencies compared to other multicast traffic provisioning approaches of FWDM and fixed grid networks.

  3. Minimal-delay traffic grooming for WDM star networks

    Science.gov (United States)

    Choi, Hongsik; Garg, Nikhil; Choi, Hyeong-Ah

    2003-10-01

    All-optical networks face the challenge of reducing slower opto-electronic conversions by managing assignment of traffic streams to wavelengths in an intelligent manner, while at the same time utilizing bandwidth resources to the maximum. This challenge becomes harder in networks closer to the end users that have insufficient data to saturate single wavelengths as well as traffic streams outnumbering the usable wavelengths, resulting in traffic grooming which requires costly traffic analysis at access nodes. We study the problem of traffic grooming that reduces the need to analyze traffic, for a class of network architecture most used by Metropolitan Area Networks; the star network. The problem being NP-complete, we provide an efficient twice-optimal-bound greedy heuristic for the same, that can be used to intelligently groom traffic at the LANs to reduce latency at the access nodes. Simulation results show that our greedy heuristic achieves a near-optimal solution.

  4. Analysis of vehicular traffic flow in the major areas of Kuala Lumpur utilizing open-traffic

    Science.gov (United States)

    Manogaran, Saargunawathy; Ali, Muhammad; Yusof, Kamaludin Mohamad; Suhaili, Ramdhan

    2017-09-01

    Vehicular traffic congestion occurs when a large number of drivers are overcrowded on the road and the traffic flow does not run smoothly. Traffic congestion causes chaos on the road and interruption to daily activities of users. Time consumed on road give lots of negative effects on productivity, social behavior, environmental and cost to economy. Congestion is worsens and leads to havoc during the emergency such as flood, accidents, road maintenance and etc., where behavior of traffic flow is always unpredictable and uncontrollable. Real-time and historical traffic data are critical inputs for most traffic flow analysis applications. Researcher attempt to predict traffic using simulations as there is no exact model of traffic flow exists due to its high complexity. Open Traffic is an open source platform available for traffic data analysis linked to Open Street Map (OSM). This research is aimed to study and understand the Open Traffic platform. The real-time traffic flow pattern in Kuala Lumpur area was successfully been extracted and analyzed using Open Traffic. It was observed that the congestion occurs on every major road in Kuala Lumpur and most of it owes to the offices and the economic and commercial centers during rush hours. At some roads the congestion occurs at night due to the tourism activities.

  5. Active Traffic Capture for Network Forensics

    Science.gov (United States)

    Slaviero, Marco; Granova, Anna; Olivier, Martin

    Network traffic capture is an integral part of network forensics, but current traffic capture techniques are typically passive in nature. Under heavy loads, it is possible for a sniffer to miss packets, which affects the quality of forensic evidence.

  6. Self-Similar Traffic In Wireless Networks

    OpenAIRE

    Jerjomins, R.; Petersons, E.

    2005-01-01

    Many studies have shown that traffic in Ethernet and other wired networks is self-similar. This paper reveals that wireless network traffic is also self-similar and long-range dependant by analyzing big amount of data captured from the wireless router.

  7. On traffic modelling in GPRS networks

    DEFF Research Database (Denmark)

    Madsen, Tatiana Kozlova; Schwefel, Hans-Peter; Prasad, Ramjee

    2005-01-01

    Optimal design and dimensioning of wireless data networks, such as GPRS, requires the knowledge of traffic characteristics of different data services. This paper presents an in-detail analysis of an IP-level traffic measurements taken in an operational GPRS network. The data measurements reported...... here are done at the Gi interface. The aim of this paper is to reveal some key statistics of GPRS data applications and to validate if the existing traffic models can adequately describe traffic volume and inter-arrival time distribution for different services. Additionally, we present a method of user...

  8. Traffic flow wide-area surveillance system definition

    Energy Technology Data Exchange (ETDEWEB)

    Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.; Abston, R.A.; Carnal, C.L. [Oak Ridge National Lab., TN (United States); Moynihan, P.I. [Jet Propulsion Lab., Pasadena, CA (United States)

    1994-11-01

    Traffic Flow Wide-Area Surveillance (TFWAS) is a system for assessing the state of traffic flow over a wide area for enhanced traffic control and improved traffic management and planning. The primary purpose of a TFWAS system is to provide a detailed traffic flow description and context description to sophisticated traffic management and control systems being developed or envisioned for the future. A successful TFWAS system must possess the attributes of safety, reconfigurability, reliability, and expandability. The primary safety premise of TFWAS is to ensure that no action or failure of the TFWAS system or its components can result in risk of injury to humans. A wide variety of communication techniques is available for use with TFWAS systems. These communication techniques can be broken down into two categories, landlines and wireless. Currently used and possible future traffic sensing technologies have been examined. Important criteria for selecting TFWAS sensors include sensor capabilities, costs, operational constraints, sensor compatibility with the infrastructure, and extent. TFWAS is a concept that can take advantage of the strengths of different traffic sensing technologies, can readily adapt to newly developed technologies, and can grow with the development of new traffic control strategies. By developing innovative algorithms that will take information from a variety of sensor types and develop descriptions of traffic flows over a wide area, a more comprehensive understanding of the traffic state can be provided to the control system to perform the most reasonable control actions over the entire wide area. The capability of characterizing the state of traffic over an entire region should revolutionize developments in traffic control strategies.

  9. Traffic and Granular Flow ’03

    CERN Document Server

    Luding, Stefan; Bovy, Piet; Schreckenberg, Michael; Wolf, Dietrich

    2005-01-01

    These proceedings are the fifth in the series Traffic and Granular Flow, and we hope they will be as useful a reference as their predecessors. Both the realistic modelling of granular media and traffic flow present important challenges at the borderline between physics and engineering, and enormous progress has been made since 1995, when this series started. Still the research on these topics is thriving, so that this book again contains many new results. Some highlights addressed at this conference were the influence of long range electric and magnetic forces and ambient fluids on granular media, new precise traffic measurements, and experiments on the complex decision making of drivers. No doubt the “hot topics” addressed in granular matter research have diverged from those in traffic since the days when the obvious analogies between traffic jams on highways and dissipative clustering in granular flow intrigued both c- munities alike. However, now just this diversity became a stimulating feature of the ...

  10. 11th Traffic and Granular Flow Conference

    CERN Document Server

    Daamen, Winnie

    2016-01-01

    The Conference on Traffic and Granular Flow brings together international researchers from different fields ranging from physics to computer science and engineering to discuss the latest developments in traffic-related systems. Originally conceived to facilitate new ideas by considering the similarities of traffic and granular flow, TGF'15, organised by Delft University of Technology, now covers a broad range of topics related to driven particle and transport systems. Besides the classical topics of granular flow and highway traffic, its scope includes data transport (Internet traffic), pedestrian and evacuation dynamics, intercellular transport, swarm behaviour and the collective dynamics of other biological systems. Recent advances in modelling, computer simulation and phenomenology are presented, and prospects for applications, for example to traffic control, are discussed. The conference explores the interrelations between the above-mentioned fields and offers the opportunity to stimulate interdisciplinar...

  11. Linking network usage patterns to traffic Gaussianity fit

    NARCIS (Netherlands)

    de Oliveira Schmidt, R.; Sadre, R.; Melnikov, Nikolay; Schönwälder, Jürgen; Pras, Aiko

    Gaussian traffic models are widely used in the domain of network traffic modeling. The central assumption is that traffic aggregates are Gaussian distributed. Due to its importance, the Gaussian character of network traffic has been extensively assessed by researchers in the past years. In 2001,

  12. Classification and Analysis of Computer Network Traffic

    OpenAIRE

    Bujlow, Tomasz

    2014-01-01

    Traffic monitoring and analysis can be done for multiple different reasons: to investigate the usage of network resources, assess the performance of network applications, adjust Quality of Service (QoS) policies in the network, log the traffic to comply with the law, or create realistic models of traffic for academic purposes. We define the objective of this thesis as finding a way to evaluate the performance of various applications in a high-speed Internet infrastructure. To satisfy the obje...

  13. Urban traffic simulated from the dual representation: Flow, crisis and congestion

    International Nuclear Information System (INIS)

    Hu Maobin; Jiang Rui; Wang Ruili; Wu Qingsong

    2009-01-01

    We propose a traffic simulation model for urban system based on the dual graph representation of a urban road network and with a random entering vehicle rate. To avoid the shortcoming of 'Space Syntax' of ignoring the road's metric distance, we consider both the motion of the vehicles along roads and the navigation of the vehicles in the network. Simulations have shown some basic properties of urban traffic system, such as flux fluctuation, crisis and dissipation, phase transition from a free flow to jams, overall capacity, the distribution of traveling time, and the fundamental diagram. The system's behavior greatly depends on the topology of the transportation network. A well-planned lattice grid can keep more vehicles travelling. The critical entering vehicle rate is much greater in lattice grid than in a self-organized network. The vehicles have to travel longer time in a self-organized urban system due to the navigation cost.

  14. Fine-granularity inference and estimations to network traffic for SDN.

    Directory of Open Access Journals (Sweden)

    Dingde Jiang

    Full Text Available An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN. However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective.

  15. Fine-granularity inference and estimations to network traffic for SDN.

    Science.gov (United States)

    Jiang, Dingde; Huo, Liuwei; Li, Ya

    2018-01-01

    An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective.

  16. Multimodale trafiknet i GIS (Multimodal Traffic Network in GIS)

    DEFF Research Database (Denmark)

    Kronbak, Jacob; Brems, Camilla Riff

    1996-01-01

    The report introduces the use of multi-modal traffic networks within a geographical Information System (GIS). The necessary theory of modelling multi-modal traffic network is reviewed and applied to the ARC/INFO GIS by an explorative example.......The report introduces the use of multi-modal traffic networks within a geographical Information System (GIS). The necessary theory of modelling multi-modal traffic network is reviewed and applied to the ARC/INFO GIS by an explorative example....

  17. Competitive Traffic Assignment in Road Networks

    Directory of Open Access Journals (Sweden)

    Krylatov Alexander Y.

    2016-09-01

    Full Text Available Recently in-vehicle route guidance and information systems are rapidly developing. Such systems are expected to reduce congestion in an urban traffic area. This social benefit is believed to be reached by imposing the route choices on the network users that lead to the system optimum traffic assignment. However, guidance service could be offered by different competitive business companies. Then route choices of different mutually independent groups of users may reject traffic assignment from the system optimum state. In this paper, a game theoretic approach is shown to be very efficient to formalize competitive traffic assignment problem with various groups of users in the form of non-cooperative network game with the Nash equilibrium search. The relationships between the Wardrop’s system optimum associated with the traffic assignment problem and the Nash equilibrium associated with the competitive traffic assignment problem are investigated. Moreover, some related aspects of the Nash equilibrium and the Wardrop’s user equilibrium assignments are also discussed.

  18. A QoS Framework with Traffic Request in Wireless Mesh Network

    Science.gov (United States)

    Fu, Bo; Huang, Hejiao

    In this paper, we consider major issues in ensuring greater Quality-of-Service (QoS) in Wireless Mesh Networks (WMNs), specifically with regard to reliability and delay. To this end, we use traffic request to record QoS requirements of data flows. In order to achieve required QoS for all data flows efficiently and with high portability, we develop Network State Update Algorithm. All assumptions, definitions, and algorithms are made exclusively with WMNs in mind, guaranteeing the portability of our framework to various environments in WMNs. The simulation results in proof that our framework is correct.

  19. Competition between Local Collisions and Collective Hydrodynamic Feedback Controls Traffic Flows in Microfluidic Networks

    Science.gov (United States)

    Belloul, M.; Engl, W.; Colin, A.; Panizza, P.; Ajdari, A.

    2009-05-01

    By studying the repartition of monodisperse droplets at a simple T junction, we show that the traffic of discrete fluid systems in microfluidic networks results from two competing mechanisms, whose significance is driven by confinement. Traffic is dominated by collisions occurring at the junction for small droplets and by collective hydrodynamic feedback for large ones. For each mechanism, we present simple models in terms of the pertinent dimensionless parameters of the problem.

  20. Constraints of nonresponding flows based on cross layers in the networks

    Science.gov (United States)

    Zhou, Zhi-Chao; Xiao, Yang; Wang, Dong

    2016-02-01

    In the active queue management (AQM) scheme, core routers cannot manage and constrain user datagram protocol (UDP) data flows by the sliding window control mechanism in the transport layer due to the nonresponsive nature of such traffic flows. However, the UDP traffics occupy a large part of the network service nowadays which brings a great challenge to the stability of the more and more complex networks. To solve the uncontrollable problem, this paper proposes a cross layers random early detection (CLRED) scheme, which can control the nonresponding UDP-like flows rate effectively when congestion occurs in the access point (AP). The CLRED makes use of the MAC frame acknowledgement (ACK) transmitting congestion information to the sources nodes and utilizes the back-off windows of the MAC layer throttling data rate. Consequently, the UDP-like flows data rate can be restrained timely by the sources nodes in order to alleviate congestion in the complex networks. The proposed CLRED can constrain the nonresponsive flows availably and make the communication expedite, so that the network can sustain stable. The simulation results of network simulator-2 (NS2) verify the proposed CLRED scheme.

  1. Traffic Dynamics on Complex Networks: A Survey

    Directory of Open Access Journals (Sweden)

    Shengyong Chen

    2012-01-01

    Full Text Available Traffic dynamics on complex networks are intriguing in recent years due to their practical implications in real communication networks. In this survey, we give a brief review of studies on traffic routing dynamics on complex networks. Strategies for improving transport efficiency, including designing efficient routing strategies and making appropriate adjustments to the underlying network structure, are introduced in this survey. Finally, a few open problems are discussed in this survey.

  2. A Modified Cellular Automaton Approach for Mixed Bicycle Traffic Flow Modeling

    Directory of Open Access Journals (Sweden)

    Xiaonian Shan

    2015-01-01

    Full Text Available Several previous studies have used the Cellular Automaton (CA for the modeling of bicycle traffic flow. However, previous CA models have several limitations, resulting in differences between the simulated and the observed traffic flow features. The primary objective of this study is to propose a modified CA model for simulating the characteristics of mixed bicycle traffic flow. Field data were collected on physically separated bicycle path in Shanghai, China, and were used to calibrate the CA model using the genetic algorithm. Traffic flow features between simulations of several CA models and field observations were compared. The results showed that our modified CA model produced more accurate simulation for the fundamental diagram and the passing events in mixed bicycle traffic flow. Based on our model, the bicycle traffic flow features, including the fundamental diagram, the number of passing events, and the number of lane changes, were analyzed. We also analyzed the traffic flow features with different traffic densities, traffic components on different travel lanes. Results of the study can provide important information for understanding and simulating the operations of mixed bicycle traffic flow.

  3. Urban Traffic Signal System Control Structural Optimization Based on Network Analysis

    Directory of Open Access Journals (Sweden)

    Li Wang

    2013-01-01

    Full Text Available Advanced urban traffic signal control systems such as SCOOT and SCATS normally coordinate traffic network using multilevel hierarchical control mechanism. In this mechanism, several key intersections will be selected from traffic signal network and the network will be divided into different control subareas. Traditionally, key intersection selection and control subareas division are executed according to dynamic traffic counts and link length between intersections, which largely rely on traffic engineers’ experience. However, it omits important inherent characteristics of traffic network topology. In this paper, we will apply network analysis approach into these two aspects for traffic system control structure optimization. Firstly, the modified C-means clustering algorithm will be proposed to assess the importance of intersections in traffic network and furthermore determine the key intersections based on three indexes instead of merely on traffic counts in traditional methods. Secondly, the improved network community discovery method will be used to give more reasonable evidence in traffic control subarea division. Finally, to test the effectiveness of network analysis approach, a hardware-in-loop simulation environment composed of regional traffic control system, microsimulation software and signal controller hardware, will be built. Both traditional method and proposed approach will be implemented on simulation test bed to evaluate traffic operation performance indexes, for example, travel time, stop times, delay and average vehicle speed. Simulation results show that the proposed network analysis approach can improve the traffic control system operation performance effectively.

  4. Decentralized State-Observer-Based Traffic Density Estimation of Large-Scale Urban Freeway Network by Dynamic Model

    Directory of Open Access Journals (Sweden)

    Yuqi Guo

    2017-08-01

    Full Text Available In order to estimate traffic densities in a large-scale urban freeway network in an accurate and timely fashion when traffic sensors do not cover the freeway network completely and thus only local measurement data can be utilized, this paper proposes a decentralized state observer approach based on a macroscopic traffic flow model. Firstly, by using the well-known cell transmission model (CTM, the urban freeway network is modeled in the way of distributed systems. Secondly, based on the model, a decentralized observer is designed. With the help of the Lyapunov function and S-procedure theory, the observer gains are computed by using linear matrix inequality (LMI technique. So, the traffic densities of the whole road network can be estimated by the designed observer. Finally, this method is applied to the outer ring of the Beijing’s second ring road and experimental results demonstrate the effectiveness and applicability of the proposed approach.

  5. Reconstruction of dynamical equations for traffic flow

    OpenAIRE

    Kriso, S.; Friedrich, R.; Peinke, J.; Wagner, P.

    2001-01-01

    Traffic flow data collected by an induction loop detector on the highway close to Koeln-Nord are investigated with respect to their dynamics including the stochastic content. In particular we present a new method, with which the flow dynamics can be extracted directly from the measured data. As a result a Langevin equation for the traffic flow is obtained. From the deterministic part of the flow dynamics, stable fixed points are extracted and set into relation with common features of the fund...

  6. A method for classification of network traffic based on C5.0 Machine Learning Algorithm

    DEFF Research Database (Denmark)

    Bujlow, Tomasz; Riaz, M. Tahir; Pedersen, Jens Myrup

    2012-01-01

    current network traffic. To overcome the drawbacks of existing methods for traffic classification, usage of C5.0 Machine Learning Algorithm (MLA) was proposed. On the basis of statistical traffic information received from volunteers and C5.0 algorithm we constructed a boosted classifier, which was shown...... and classification, an algorithm for recognizing flow direction and the C5.0 itself. Classified applications include Skype, FTP, torrent, web browser traffic, web radio, interactive gaming and SSH. We performed subsequent tries using different sets of parameters and both training and classification options...

  7. Accurate Multisteps Traffic Flow Prediction Based on SVM

    Directory of Open Access Journals (Sweden)

    Zhang Mingheng

    2013-01-01

    Full Text Available Accurate traffic flow prediction is prerequisite and important for realizing intelligent traffic control and guidance, and it is also the objective requirement for intelligent traffic management. Due to the strong nonlinear, stochastic, time-varying characteristics of urban transport system, artificial intelligence methods such as support vector machine (SVM are now receiving more and more attentions in this research field. Compared with the traditional single-step prediction method, the multisteps prediction has the ability that can predict the traffic state trends over a certain period in the future. From the perspective of dynamic decision, it is far important than the current traffic condition obtained. Thus, in this paper, an accurate multi-steps traffic flow prediction model based on SVM was proposed. In which, the input vectors were comprised of actual traffic volume and four different types of input vectors were compared to verify their prediction performance with each other. Finally, the model was verified with actual data in the empirical analysis phase and the test results showed that the proposed SVM model had a good ability for traffic flow prediction and the SVM-HPT model outperformed the other three models for prediction.

  8. Network Analysis of Urban Traffic with Big Bus Data

    OpenAIRE

    Zhao, Kai

    2016-01-01

    Urban traffic analysis is crucial for traffic forecasting systems, urban planning and, more recently, various mobile and network applications. In this paper, we analyse urban traffic with network and statistical methods. Our analysis is based on one big bus dataset containing 45 million bus arrival samples in Helsinki. We mainly address following questions: 1. How can we identify the areas that cause most of the traffic in the city? 2. Why there is a urban traffic? Is bus traffic a key cause ...

  9. Abnormal traffic flow data detection based on wavelet analysis

    Directory of Open Access Journals (Sweden)

    Xiao Qian

    2016-01-01

    Full Text Available In view of the traffic flow data of non-stationary, the abnormal data detection is difficult.proposed basing on the wavelet analysis and least squares method of abnormal traffic flow data detection in this paper.First using wavelet analysis to make the traffic flow data of high frequency and low frequency component and separation, and then, combined with least square method to find abnormal points in the reconstructed signal data.Wavelet analysis and least square method, the simulation results show that using wavelet analysis of abnormal traffic flow data detection, effectively reduce the detection results of misjudgment rate and false negative rate.

  10. Improved Road-Network-Flow Control Strategy Based on Macroscopic Fundamental Diagrams and Queuing Length in Connected-Vehicle Network

    Directory of Open Access Journals (Sweden)

    Xiaohui Lin

    2017-01-01

    Full Text Available Connected-vehicles network provides opportunities and conditions for improving traffic signal control, and macroscopic fundamental diagrams (MFD can control the road network at the macrolevel effectively. This paper integrated proposed real-time access to the number of mobile vehicles and the maximum road queuing length in the Connected-vehicles network. Moreover, when implementing a simple control strategy to limit the boundary flow of a road network based on MFD, we determined whether the maximum queuing length of each boundary section exceeds the road-safety queuing length in real-time calculations and timely adjusted the road-network influx rate to avoid the overflow phenomenon in the boundary section. We established a road-network microtraffic simulation model in VISSIM software taking a district as the experimental area, determined MFD of the region based on the number of mobile vehicles, and weighted traffic volume of the road network. When the road network was tending to saturate, we implemented a simple control strategy and our algorithm limits the boundary flow. Finally, we compared the traffic signal control indicators with three strategies: (1 no control strategy, (2 boundary control, and (3 boundary control with limiting queue strategy. The results show that our proposed algorithm is better than the other two.

  11. Microscopic modeling of multi-lane highway traffic flow

    Science.gov (United States)

    Hodas, Nathan O.; Jagota, Anand

    2003-12-01

    We discuss a microscopic model for the study of multi-lane highway traffic flow dynamics. Each car experiences a force resulting from a combination of the desire of the driver to attain a certain velocity, aerodynamic drag, and change of the force due to car-car interactions. The model also includes multi-lane simulation capability and the ability to add and remove obstructions. We implement the model via a Java applet, which is used to simulate traffic jam formation, the effect of bottlenecks on traffic flow, and the existence of light, medium, and heavy traffic flow. The simulations also provide insight into how the properties of individual cars result in macroscopic behavior. Because the investigation of emergent characteristics is so common in physics, the study of traffic in this manner sheds new light on how the micro-to-macro transition works in general.

  12. Fixed Point Learning Based Intelligent Traffic Control System

    Science.gov (United States)

    Zongyao, Wang; Cong, Sui; Cheng, Shao

    2017-10-01

    Fixed point learning has become an important tool to analyse large scale distributed system such as urban traffic network. This paper presents a fixed point learning based intelligence traffic network control system. The system applies convergence property of fixed point theorem to optimize the traffic flow density. The intelligence traffic control system achieves maximum road resources usage by averaging traffic flow density among the traffic network. The intelligence traffic network control system is built based on decentralized structure and intelligence cooperation. No central control is needed to manage the system. The proposed system is simple, effective and feasible for practical use. The performance of the system is tested via theoretical proof and simulations. The results demonstrate that the system can effectively solve the traffic congestion problem and increase the vehicles average speed. It also proves that the system is flexible, reliable and feasible for practical use.

  13. Examining perimeter gating control of urban traffic networkswith locally adaptive traffic signals

    NARCIS (Netherlands)

    Keyvan Ekbatani, M.; Gao, X.; Gayah, V.V.; Knoop, V.L.

    2015-01-01

    Traditionally, urban traffic is controlled by traffic lights. Recent findings of the Macroscopic or Network Fundamental Diagram (MFD or NFD) have led to the development of novel traffic control strategies that can be applied at a networkwide level. One pertinent example is perimeter flow control

  14. Proactive Traffic Information Control in Emergency Evacuation Network

    Directory of Open Access Journals (Sweden)

    Zhengfeng Huang

    2015-01-01

    Full Text Available Traffic demand in emergency evacuation is usually too large to be effectively managed with reactive traffic information control methods. These methods adapt to the road traffic passively by publishing real-time information without consideration of the routing behavior feedback produced by evacuees. Other remedy measures have to be prepared in case of nonrecurring congestion under these methods. To use the network capacity fully to mitigate near-future evacuation traffic congestion, we propose proactive traffic information control (PTIC model. Based on the mechanism between information and routing behavior feedback, this model can change the route choice of evacuees in advance by dissipating strategic traffic information. Generally, the near-future traffic condition is difficult to accurately predict because it is uncertain in evacuation. Assume that the value of traffic information obeys certain distribution within a range, and then real-time traffic information may reflect the most-likely near-future traffic condition. Unlike the real-time information, the proactive traffic information is a selection within the range to achieve a desired level of the road network performance index (total system travel time. In the aspect of the solution algorithm, differential equilibrium decomposed optimization (D-EDO is proposed to compare with other heuristic methods. A field study on a road network around a large stadium is used to validate the PTIC.

  15. A knowledge-based system for controlling automobile traffic

    Science.gov (United States)

    Maravas, Alexander; Stengel, Robert F.

    1994-01-01

    Transportation network capacity variations arising from accidents, roadway maintenance activity, and special events as well as fluctuations in commuters' travel demands complicate traffic management. Artificial intelligence concepts and expert systems can be useful in framing policies for incident detection, congestion anticipation, and optimal traffic management. This paper examines the applicability of intelligent route guidance and control as decision aids for traffic management. Basic requirements for managing traffic are reviewed, concepts for studying traffic flow are introduced, and mathematical models for modeling traffic flow are examined. Measures for quantifying transportation network performance levels are chosen, and surveillance and control strategies are evaluated. It can be concluded that automated decision support holds great promise for aiding the efficient flow of automobile traffic over limited-access roadways, bridges, and tunnels.

  16. Synchronization between Different Networks with Time-Varying Delay and Its Application in Bilayer Coupled Public Traffic Network

    Directory of Open Access Journals (Sweden)

    Wenju Du

    2016-01-01

    Full Text Available In order to study the dynamic characteristics of urban public traffic network, this paper establishes the conventional bus traffic network and the urban rail traffic network based on the space R modeling method. Then regarding these two networks as the subnetwork, the paper presents a new bilayer coupled public traffic network through the transfer relationship between subway and bus, and this model well reflects the connection between the passengers and bus operating vehicles. Based on the synchronization theory of coupling network with time-varying delay and taking “Lorenz system” as the network node, the paper studies the synchronization of bilayer coupled public traffic network. Finally, numerical results are given to show the impact of public traffic dispatching, delayed departure, the number of public bus stops between bus lines, and the number of transfer stations between two traffic modes on the bilayer coupled public traffic network balance through Matlab simulation.

  17. New Solutions Based On Wireless Networks For Dynamic Traffic Lights Management: A Comparison Between IEEE 802.15.4 And Bluetooth

    Directory of Open Access Journals (Sweden)

    Collotta Mario

    2015-09-01

    Full Text Available The Wireless Sensor Networks are widely used to detect and exchange information and in recent years they have been increasingly involved in Intelligent Transportation System applications, especially in dynamic management of signalized intersections. In fact, the real-time knowledge of information concerning traffic light junctions represents a valid solution to congestion problems. In this paper, a wireless network architecture, based on IEEE 802.15.4 or Bluetooth, in order to monitor vehicular traffic flows near to traffic lights, is introduced. Moreover, an innovative algorithm is proposed in order to determine dynamically green times and phase sequence of traffic lights, based on measured values of traffic flows. Several simulations compare IEEE 802.15.4 and Bluetooth protocols in order to identify the more suitable communication protocol for ITS applications. Furthermore, in order to confirm the validity of the proposed algorithm for the dynamic management of traffic lights, some case studies have been considered and several simulations have been performed.

  18. Dynamics of Number of Packets in Transit in Free Flow State of Data Network

    International Nuclear Information System (INIS)

    Shengkun Xie; Lawniczak, A.T.

    2011-01-01

    We study how the dynamics of Number of Packets in Transit (NPT) is affected by the coupling of a routing type with a volume of incoming packet traffic in a data network model of packet switching type. The NPT is a network performance indicator of an aggregate type that measures in '' real time '', how many packets are in the network on their routes to their destinations. We conduct our investigation using a time-discrete simulation model that is an abstraction of the Network Layer of the ISO OSI Seven Layer Reference Model. This model focuses on packets and their routing. We consider a static routing and two different types of dynamic routings coupled with different volumes of incoming packet traffic in the network free flow state. Our study shows that the order of the values of the NPT mean value time series depends on the coupling of a routing type with a volume of incoming packet traffic and changes when the volume of incoming packet traffic increases and is closed to the critical source load values, i.e. when it is closed to the phase transition points from the network free flow state to its congested states. (authors)

  19. Evaluation and Simulation of Common Video Conference Traffics in Communication Networks

    Directory of Open Access Journals (Sweden)

    Farhad faghani

    2014-01-01

    Full Text Available Multimedia traffics are the basic traffics in data communication networks. Especially Video conferences are the most desirable traffics in huge networks(wired, wireless, …. Traffic modeling can help us to evaluate the real networks. So, in order to have good services in data communication networks which provide multimedia services, QoS will be very important .In this research we tried to have an exact traffic model design and simulation to overcome QoS challenges. Also, we predict bandwidth by Kalman filter in Ethernet networks.

  20. Effects of traffic generation patterns on the robustness of complex networks

    Science.gov (United States)

    Wu, Jiajing; Zeng, Junwen; Chen, Zhenhao; Tse, Chi K.; Chen, Bokui

    2018-02-01

    Cascading failures in communication networks with heterogeneous node functions are studied in this paper. In such networks, the traffic dynamics are highly dependent on the traffic generation patterns which are in turn determined by the locations of the hosts. The data-packet traffic model is applied to Barabási-Albert scale-free networks to study the cascading failures in such networks and to explore the effects of traffic generation patterns on network robustness. It is found that placing the hosts at high-degree nodes in a network can make the network more robust against both intentional attacks and random failures. It is also shown that the traffic generation pattern plays an important role in network design.

  1. A State-of-the-Art Review of the Sensor Location, Flow Observability, Estimation, and Prediction Problems in Traffic Networks

    Directory of Open Access Journals (Sweden)

    Enrique Castillo

    2015-01-01

    Full Text Available A state-of-the-art review of flow observability, estimation, and prediction problems in traffic networks is performed. Since mathematical optimization provides a general framework for all of them, an integrated approach is used to perform the analysis of these problems and consider them as different optimization problems whose data, variables, constraints, and objective functions are the main elements that characterize the problems proposed by different authors. For example, counted, scanned or “a priori” data are the most common data sources; conservation laws, flow nonnegativity, link capacity, flow definition, observation, flow propagation, and specific model requirements form the most common constraints; and least squares, likelihood, possible relative error, mean absolute relative error, and so forth constitute the bases for the objective functions or metrics. The high number of possible combinations of these elements justifies the existence of a wide collection of methods for analyzing static and dynamic situations.

  2. Forecasting short-term data center network traffic load with convolutional neural networks

    Science.gov (United States)

    Ordozgoiti, Bruno; Gómez-Canaval, Sandra

    2018-01-01

    Efficient resource management in data centers is of central importance to content service providers as 90 percent of the network traffic is expected to go through them in the coming years. In this context we propose the use of convolutional neural networks (CNNs) to forecast short-term changes in the amount of traffic crossing a data center network. This value is an indicator of virtual machine activity and can be utilized to shape the data center infrastructure accordingly. The behaviour of network traffic at the seconds scale is highly chaotic and therefore traditional time-series-analysis approaches such as ARIMA fail to obtain accurate forecasts. We show that our convolutional neural network approach can exploit the non-linear regularities of network traffic, providing significant improvements with respect to the mean absolute and standard deviation of the data, and outperforming ARIMA by an increasingly significant margin as the forecasting granularity is above the 16-second resolution. In order to increase the accuracy of the forecasting model, we exploit the architecture of the CNNs using multiresolution input distributed among separate channels of the first convolutional layer. We validate our approach with an extensive set of experiments using a data set collected at the core network of an Internet Service Provider over a period of 5 months, totalling 70 days of traffic at the one-second resolution. PMID:29408936

  3. Forecasting short-term data center network traffic load with convolutional neural networks.

    Science.gov (United States)

    Mozo, Alberto; Ordozgoiti, Bruno; Gómez-Canaval, Sandra

    2018-01-01

    Efficient resource management in data centers is of central importance to content service providers as 90 percent of the network traffic is expected to go through them in the coming years. In this context we propose the use of convolutional neural networks (CNNs) to forecast short-term changes in the amount of traffic crossing a data center network. This value is an indicator of virtual machine activity and can be utilized to shape the data center infrastructure accordingly. The behaviour of network traffic at the seconds scale is highly chaotic and therefore traditional time-series-analysis approaches such as ARIMA fail to obtain accurate forecasts. We show that our convolutional neural network approach can exploit the non-linear regularities of network traffic, providing significant improvements with respect to the mean absolute and standard deviation of the data, and outperforming ARIMA by an increasingly significant margin as the forecasting granularity is above the 16-second resolution. In order to increase the accuracy of the forecasting model, we exploit the architecture of the CNNs using multiresolution input distributed among separate channels of the first convolutional layer. We validate our approach with an extensive set of experiments using a data set collected at the core network of an Internet Service Provider over a period of 5 months, totalling 70 days of traffic at the one-second resolution.

  4. Incorporation of Duffing Oscillator and Wigner-Ville Distribution in Traffic Flow Prediction

    Directory of Open Access Journals (Sweden)

    Anamarija L. Mrgole

    2017-02-01

    Full Text Available The main purpose of this study was to investigate the use of various chaotic pattern recognition methods for traffic flow prediction. Traffic flow is a variable, dynamic and complex system, which is non-linear and unpredictable. The emergence of traffic flow congestion in road traffic is estimated when the traffic load on a specific section of the road in a specific time period is close to exceeding the capacity of the road infrastructure. Under certain conditions, it can be seen in concentrating chaotic traffic flow patterns. The literature review of traffic flow theory and its connection with chaotic features implies that this kind of method has great theoretical and practical value. Researched methods of identifying chaos in traffic flow have shown certain restrictions in their techniques but have suggested guidelines for improving the identification of chaotic parameters in traffic flow. The proposed new method of forecasting congestion in traffic flow uses Wigner-Ville frequency distribution. This method enables the display of a chaotic attractor without the use of reconstruction phase space.

  5. Construction and simulation of a novel continuous traffic flow model

    International Nuclear Information System (INIS)

    Hwang, Yao-Hsin; Yu, Jui-Ling

    2017-01-01

    In this paper, we aim to propose a novel mathematical model for traffic flow and apply a newly developed characteristic particle method to solve the associate governing equations. As compared with the existing non-equilibrium higher-order traffic flow models, the present one is put forward to satisfy the following three conditions: 1.Preserve the equilibrium state in the smooth region. 2.Yield an anisotropic propagation of traffic flow information. 3.Expressed with a conservation law form for traffic momentum. These conditions will ensure a more practical simulation in traffic flow physics: The current traffic will not be influenced by the condition in the behind and result in unambiguous condition across a traffic shock. Through analyses of characteristics, stability condition and steady-state solution adherent to the equation system, it is shown that the proposed model actually conform to these conditions. Furthermore, this model can be cast into its characteristic form which, incorporated with the Rankine-Hugoniot relation, is appropriate to be simulated by the characteristic particle method to obtain accurate computational results. - Highlights: • The traffic model expressed with the momentum conservation law. • Traffic flow information propagate anisotropically and preserve the equilibrium state in the smooth region. • Computational particles of two families are invented to mimic forward-running and backward-running characteristics. • Formation of shocks will be naturally detected by the intersection of computational particles of same family. • A newly developed characteristic particle method is used to simulate traffic flow model equations.

  6. Network Traffic Prediction Based on Deep Belief Network and Spatiotemporal Compressive Sensing in Wireless Mesh Backbone Networks

    Directory of Open Access Journals (Sweden)

    Laisen Nie

    2018-01-01

    Full Text Available Wireless mesh network is prevalent for providing a decentralized access for users and other intelligent devices. Meanwhile, it can be employed as the infrastructure of the last few miles connectivity for various network applications, for example, Internet of Things (IoT and mobile networks. For a wireless mesh backbone network, it has obtained extensive attention because of its large capacity and low cost. Network traffic prediction is important for network planning and routing configurations that are implemented to improve the quality of service for users. This paper proposes a network traffic prediction method based on a deep learning architecture and the Spatiotemporal Compressive Sensing method. The proposed method first adopts discrete wavelet transform to extract the low-pass component of network traffic that describes the long-range dependence of itself. Then, a prediction model is built by learning a deep architecture based on the deep belief network from the extracted low-pass component. Otherwise, for the remaining high-pass component that expresses the gusty and irregular fluctuations of network traffic, the Spatiotemporal Compressive Sensing method is adopted to predict it. Based on the predictors of two components, we can obtain a predictor of network traffic. From the simulation, the proposed prediction method outperforms three existing methods.

  7. Network Traffic Features for Anomaly Detection in Specific Industrial Control System Network

    Directory of Open Access Journals (Sweden)

    Matti Mantere

    2013-09-01

    Full Text Available The deterministic and restricted nature of industrial control system networks sets them apart from more open networks, such as local area networks in office environments. This improves the usability of network security, monitoring approaches that would be less feasible in more open environments. One of such approaches is machine learning based anomaly detection. Without proper customization for the special requirements of the industrial control system network environment, many existing anomaly or misuse detection systems will perform sub-optimally. A machine learning based approach could reduce the amount of manual customization required for different industrial control system networks. In this paper we analyze a possible set of features to be used in a machine learning based anomaly detection system in the real world industrial control system network environment under investigation. The network under investigation is represented by architectural drawing and results derived from network trace analysis. The network trace is captured from a live running industrial process control network and includes both control data and the data flowing between the control network and the office network. We limit the investigation to the IP traffic in the traces.

  8. Using OpenSSH to secure mobile LAN network traffic

    Science.gov (United States)

    Luu, Brian B.; Gopaul, Richard D.

    2002-08-01

    Mobile Internet Protocol (IP) Local Area Network (LAN) is a technique, developed by the U.S. Army Research Laboratory, which allows a LAN to be IP mobile when attaching to a foreign IP-based network and using this network as a means to retain connectivity to its home network. In this paper, we describe a technique that uses Open Secure Shell (OpenSSH) software to ensure secure, encrypted transmission of a mobile LAN's network traffic. Whenever a mobile LAN, implemented with Mobile IP LAN, moves to a foreign network, its gateway (router) obtains an IP address from the new network. IP tunnels, using IP encapsulation, are then established from the gateway through the foreign network to a home agent on its home network. These tunnels provide a virtual two-way connection to the home network for the mobile LAN as if the LAN were connected directly to its home network. Hence, when IP mobile, a mobile LAN's tunneled network traffic must traverse one or more foreign networks that may not be trusted. This traffic could be subject to eavesdropping, interception, modification, or redirection by malicious nodes in these foreign networks. To protect network traffic passing through the tunnels, OpenSSH is used as a means of encryption because it prevents surveillance, modification, and redirection of mobile LAN traffic passing across foreign networks. Since the software is found in the public domain, is available for most current operating systems, and is commonly used to provide secure network communications, OpenSSH is the software of choice.

  9. Reports on internet traffic statistics

    NARCIS (Netherlands)

    Hoogesteger, Martijn; de Oliveira Schmidt, R.; Sperotto, Anna; Pras, Aiko

    2013-01-01

    Internet traffic statistics can provide valuable information to network analysts and researchers about the way nowadays networks are used. In the past, such information was provided by Internet2 in a public website called Internet2 NetFlow: Weekly Reports. The website reported traffic statistics

  10. Traffic flow dynamics data, models and simulation

    CERN Document Server

    Treiber, Martin

    2013-01-01

    This textbook provides a comprehensive and instructive coverage of vehicular traffic flow dynamics and modeling. It makes this fascinating interdisciplinary topic, which to date was only documented in parts by specialized monographs, accessible to a broad readership. Numerous figures and problems with solutions help the reader to quickly understand and practice the presented concepts. This book is targeted at students of physics and traffic engineering and, more generally, also at students and professionals in computer science, mathematics, and interdisciplinary topics. It also offers material for project work in programming and simulation at college and university level. The main part, after presenting different categories of traffic data, is devoted to a mathematical description of the dynamics of traffic flow, covering macroscopic models which describe traffic in terms of density, as well as microscopic many-particle models in which each particle corresponds to a vehicle and its driver. Focus chapters on ...

  11. Effects of Car Accidents on Three-Lane Traffic Flow

    Directory of Open Access Journals (Sweden)

    Jianzhong Chen

    2014-01-01

    Full Text Available A three-lane traffic flow model is proposed to investigate the effect of car accidents on the traffic flow. The model is an extension of the full velocity difference (FVD model by taking into account the lane changing. The extended lane-changing rules are presented to model the lane-changing behaviour. The cases that the car accidents occupy the exterior or interior lane, the medium lane, and two lanes are studied by numerical simulations. The time-space diagrams and the current diagrams are presented, and the traffic jams are investigated. The results show that the car accident has a different effect on the traffic flow when it occupies different lanes. The car accidents have a more serious effect on the whole road when they occupy two lanes. The larger the density is, the greater the influence on the traffic flow becomes.

  12. International Workshop on Traffic and Granular Flow

    CERN Document Server

    Herrmann, Hans; Schreckenberg, Michael; Wolf, Dietrich; Social, Traffic and Granular Dynamics

    2000-01-01

    "Are there common phenomena and laws in the dynamic behavior of granular materials, traffic, and socio-economic systems?" The answers given at the international workshop "Traffic and Granular Flow '99" are presented in this volume. From a physical standpoint, all these systems can be treated as (self)-driven many-particle systems with strong fluctuations, showing multistability, phase transitions, non-linear waves, etc. The great interest in these systems is due to several unexpected new discoveries and their practical relevance for solving some fundamental problems of today's societies. This includes intelligent measures for traffic flow optimization and methods from "econophysics" for stabilizing (stock) markets.

  13. Particle hopping vs. fluid-dynamical models for traffic flow

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K.

    1995-12-31

    Although particle hopping models have been introduced into traffic science in the 19509, their systematic use has only started recently. Two reasons for this are, that they are advantageous on modem computers, and that recent theoretical developments allow analytical understanding of their properties and therefore more confidence for their use. In principle, particle hopping models fit between microscopic models for driving and fluiddynamical models for traffic flow. In this sense, they also help closing the conceptual gap between these two. This paper shows connections between particle hopping models and traffic flow theory. It shows that the hydrodynamical limits of certain particle hopping models correspond to the Lighthill-Whitham theory for traffic flow, and that only slightly more complex particle hopping models produce already the correct traffic jam dynamics, consistent with recent fluid-dynamical models for traffic flow. By doing so, this paper establishes that, on the macroscopic level, particle hopping models are at least as good as fluid-dynamical models. Yet, particle hopping models have at least two advantages over fluid-dynamical models: they straightforwardly allow microscopic simulations, and they include stochasticity.

  14. A Bayes Theory-Based Modeling Algorithm to End-to-end Network Traffic

    OpenAIRE

    Zhao Hong-hao; Meng Fan-bo; Zhao Si-wen; Zhao Si-hang; Lu Yi

    2016-01-01

    Recently, network traffic has exponentially increasing due to all kind of applications, such as mobile Internet, smart cities, smart transportations, Internet of things, and so on. the end-to-end network traffic becomes more important for traffic engineering. Usually end-to-end traffic estimation is highly difficult. This paper proposes a Bayes theory-based method to model the end-to-end network traffic. Firstly, the end-to-end network traffic is described as a independent identically distrib...

  15. Efficient Algorithms for Network-Wide Road Traffic Control

    NARCIS (Netherlands)

    van de Weg, G.S.

    2017-01-01

    Controlling road traffic networks is a complex problem. One of the difficulties is the coordination of actuators, such as traffic lights, variables speed limits, ramp metering and route guidance, with the aim to improve the network performance over a near-future time horizon. This dissertation

  16. A Bayes Theory-Based Modeling Algorithm to End-to-end Network Traffic

    Directory of Open Access Journals (Sweden)

    Zhao Hong-hao

    2016-01-01

    Full Text Available Recently, network traffic has exponentially increasing due to all kind of applications, such as mobile Internet, smart cities, smart transportations, Internet of things, and so on. the end-to-end network traffic becomes more important for traffic engineering. Usually end-to-end traffic estimation is highly difficult. This paper proposes a Bayes theory-based method to model the end-to-end network traffic. Firstly, the end-to-end network traffic is described as a independent identically distributed normal process. Then the Bases theory is used to characterize the end-to-end network traffic. By calculating the parameters, the model is determined correctly. Simulation results show that our approach is feasible and effective.

  17. Flow level performance approximations for elastic traffic integrated with prioritized stream traffic

    NARCIS (Netherlands)

    Malhotra, R.; Berg, J.L. van den

    2007-01-01

    Almost all traffic in todays networks can be classified as being either stream or elastic. The support of these two traffic types is possible either with a Differentiated (DiffServ) or an Integrated Services (IntServ) architecture. However, both DiffServ and IntServ rely on efficient scheduling

  18. Hierarchical and coupling model of factors influencing vessel traffic flow.

    Science.gov (United States)

    Liu, Zhao; Liu, Jingxian; Li, Huanhuan; Li, Zongzhi; Tan, Zhirong; Liu, Ryan Wen; Liu, Yi

    2017-01-01

    Understanding the characteristics of vessel traffic flow is crucial in maintaining navigation safety, efficiency, and overall waterway transportation management. Factors influencing vessel traffic flow possess diverse features such as hierarchy, uncertainty, nonlinearity, complexity, and interdependency. To reveal the impact mechanism of the factors influencing vessel traffic flow, a hierarchical model and a coupling model are proposed in this study based on the interpretative structural modeling method. The hierarchical model explains the hierarchies and relationships of the factors using a graph. The coupling model provides a quantitative method that explores interaction effects of factors using a coupling coefficient. The coupling coefficient is obtained by determining the quantitative indicators of the factors and their weights. Thereafter, the data obtained from Port of Tianjin is used to verify the proposed coupling model. The results show that the hierarchical model of the factors influencing vessel traffic flow can explain the level, structure, and interaction effect of the factors; the coupling model is efficient in analyzing factors influencing traffic volumes. The proposed method can be used for analyzing increases in vessel traffic flow in waterway transportation system.

  19. Characterization and Modeling of Network Traffic

    DEFF Research Database (Denmark)

    Shawky, Ahmed; Bergheim, Hans; Ragnarsson, Olafur

    2011-01-01

    -arrival time, IP addresses, port numbers and transport protocol are the only necessary parameters to model network traffic behaviour. In order to recreate this behaviour, a complex model is needed which is able to recreate traffic behaviour based on a set of statistics calculated from the parameters values...

  20. Cooperative Learning for Distributed In-Network Traffic Classification

    Science.gov (United States)

    Joseph, S. B.; Loo, H. R.; Ismail, I.; Andromeda, T.; Marsono, M. N.

    2017-04-01

    Inspired by the concept of autonomic distributed/decentralized network management schemes, we consider the issue of information exchange among distributed network nodes to network performance and promote scalability for in-network monitoring. In this paper, we propose a cooperative learning algorithm for propagation and synchronization of network information among autonomic distributed network nodes for online traffic classification. The results show that network nodes with sharing capability perform better with a higher average accuracy of 89.21% (sharing data) and 88.37% (sharing clusters) compared to 88.06% for nodes without cooperative learning capability. The overall performance indicates that cooperative learning is promising for distributed in-network traffic classification.

  1. Game theoretic analysis of congestion, safety and security networks, air traffic and emergency departments

    CERN Document Server

    Zhuang, Jun

    2015-01-01

    Maximizing reader insights into the roles of intelligent agents in networks, air traffic and emergency departments, this volume focuses on congestion in systems where safety and security are at stake, devoting special attention to applying game theoretic analysis of congestion to: protocols in wired and wireless networks; power generation, air transportation and emergency department overcrowding. Reviewing exhaustively the key recent research into the interactions between game theory, excessive crowding, and safety and security elements, this book establishes a new research angle by illustrating linkages between the different research approaches and serves to lay the foundations for subsequent analysis. Congestion (excessive crowding) is defined in this work as all kinds of flows; e.g., road/sea/air traffic, people, data, information, water, electricity, and organisms. Analyzing systems where congestion occurs – which may be in parallel, series, interlinked, or interdependent, with flows one way or both way...

  2. An Efficient Computational Technique for Fractal Vehicular Traffic Flow

    Directory of Open Access Journals (Sweden)

    Devendra Kumar

    2018-04-01

    Full Text Available In this work, we examine a fractal vehicular traffic flow problem. The partial differential equations describing a fractal vehicular traffic flow are solved with the aid of the local fractional homotopy perturbation Sumudu transform scheme and the local fractional reduced differential transform method. Some illustrative examples are taken to describe the success of the suggested techniques. The results derived with the aid of the suggested schemes reveal that the present schemes are very efficient for obtaining the non-differentiable solution to fractal vehicular traffic flow problem.

  3. Equivalent noise level response to number of vehicles: a comparison between a high traffic flow and low traffic flow highway in Klang Valley, Malaysia

    OpenAIRE

    Halim, Herni; Abdullah, Ramdzani

    2014-01-01

    HIGHLIGHTS Highway traffic noise is a serious problem in Malaysia Heavy traffic flow highway recorded higher noise level compared to low traffic flow Noise level stabilized at certain number of vehicles on the road i.e above 500 vehicles. Although much research on road traffic noise has found that noise level increase are influenced by driver behavior and source-receiver distance, little attention has been paid to the relationship between noise level and total number of vehicles...

  4. Effects of node buffer and capacity on network traffic

    International Nuclear Information System (INIS)

    Ling Xiang; Ding Jian-Xun; Hu Mao-Bin

    2012-01-01

    In this paper, we study the optimization of network traffic by considering the effects of node buffer ability and capacity. Two node buffer settings are considered. The node capacity is considered to be proportional to its buffer ability. The node effects on network traffic systems are studied with the shortest path protocol and an extension of the optimal routing [Phys. Rev. E 74 046106 (2006)]. In the diagrams of flux—density relationships, it is shown that a nodes buffer ability and capacity have profound effects on the network traffic

  5. Hierarchical and coupling model of factors influencing vessel traffic flow.

    Directory of Open Access Journals (Sweden)

    Zhao Liu

    Full Text Available Understanding the characteristics of vessel traffic flow is crucial in maintaining navigation safety, efficiency, and overall waterway transportation management. Factors influencing vessel traffic flow possess diverse features such as hierarchy, uncertainty, nonlinearity, complexity, and interdependency. To reveal the impact mechanism of the factors influencing vessel traffic flow, a hierarchical model and a coupling model are proposed in this study based on the interpretative structural modeling method. The hierarchical model explains the hierarchies and relationships of the factors using a graph. The coupling model provides a quantitative method that explores interaction effects of factors using a coupling coefficient. The coupling coefficient is obtained by determining the quantitative indicators of the factors and their weights. Thereafter, the data obtained from Port of Tianjin is used to verify the proposed coupling model. The results show that the hierarchical model of the factors influencing vessel traffic flow can explain the level, structure, and interaction effect of the factors; the coupling model is efficient in analyzing factors influencing traffic volumes. The proposed method can be used for analyzing increases in vessel traffic flow in waterway transportation system.

  6. Dynamic methods of air traffic flow management

    Directory of Open Access Journals (Sweden)

    Jacek SKORUPSKI

    2011-01-01

    Full Text Available Air traffic management is a complex hierarchical system. Hierarchy levels can be defined according to decision making time horizon or to analyze area volume. For medium time horizon and wide analysis area, the air traffic flow management services were established. Their main task is to properly co-ordinate air traffic in European airspace, so as to minimize delays arising in congested sectors. Those services have to assure high safety level at the same time. Thus it is a very complex task, with many goals, many decision variables and many constraints.In the paper review of the methods developed for aiding air traffic flow management services is presented. More detailed description of a dynamic method is given. This method is based on stochastic capacity and scenario analysis. Some problems in utilization of presented methods are also pointed out, so are the next research possibilities.

  7. Anticipation of Traffic Demands to Guarantee QoS in IP/Optical Networks

    Directory of Open Access Journals (Sweden)

    Carolina Pinart

    2010-09-01

    Full Text Available Traffic in the Internet backbone is expected to grow above a few Tbit/s in 2020. To cope with this, operators are moving to IP/optical network architectures, where IP is the convergence layer for all services. On the other hand, the quality of service (QoS requirements of future applications encompasses the individualization of services and the assurance of stricter quality parameters such as latency, jitter or capacity. In other words, future optical networks will not only transport more IP data, but they will also have to offer differentiated QoS requirements to services. Finally, some emerging applications, e.g., grid computing, need greater flexibility in the usage of network resources, which involves establishing and releasing connections as if they were virtualized resources controlled by other elements or layers. In this context, traffic-driven lightpath provisioning and service-plane approaches arise as very interesting candidate solutions to solve the main challenges described above. This work reviews the concepts of service-oriented and self-managed networks and relates them to propose an integrated approach to assure QoS by offering flow-aware networking in the sense that traffic demands will be anticipated in a suitable way, lightpaths will be established taking into account QoS information (i.e., impairments and complex services will be decomposed into optical connections so that the above techniques can be employed to assure QoS for any service.

  8. Traffic Steering Framework for Mobile-Assisted Resource Management in Heterogeneous Networks

    DEFF Research Database (Denmark)

    Dogadaev, Anton Konstantinovich; Checko, Aleksandra; Popovska Avramova, Andrijana

    2013-01-01

    With the expected growth of mobile data traffic it is essential to manage the network resources efficiently. In order to undertake this challenge, we propose a framework for network-centric, mobile-assisted resource management, which facilitates traffic offloading from mobile network to Wi-Fi...... to the network backbone. What is more, we give an overview of existing standardization activities on offloading the mobile traffic through Wi-Fi....

  9. Research of convolutional neural networks for traffic sign recognition

    OpenAIRE

    Stadalnikas, Kasparas

    2017-01-01

    In this thesis the convolutional neural networks application for traffic sign recognition is analyzed. Thesis describes the basic operations, techniques that are commonly used to apply in the image classification using convolutional neural networks. Also, this paper describes the data sets used for traffic sign recognition, their problems affecting the final training results. The paper reviews most popular existing technologies – frameworks for developing the solution for traffic sign recogni...

  10. Nuclear traffic and peloton formation in fungal networks

    Science.gov (United States)

    Roper, Marcus; Hickey, Patrick; Lewkiewicz, Stephanie; Dressaire, Emilie; Read, Nick

    2013-11-01

    Hyphae, the network of microfluidic pipes that make up a growing fungal cell, must balance their function as conduits for the transport of nuclei with other cellular functions including secretion and growth. Constant flow of nuclei may interfere with the protein traffic that enables other functions to be performed. Live-cell imaging reveals that nuclear flows are anti-congestive; that groups of nuclei flow faster than single nuclei, and that nuclei sweep through the colony in dense clumps. We call these clumps pelotons, after the term used to describe groups of cycle racers slip-streaming off each other. Because of the pelotons, individual hyphae transport nuclei only intermittently, producing long intervals in which hyphae can perform their other functions. Modeling reveals how pelotons are created by interactions between nuclei and the hyphal cytoskeleton, and reveal the control that the fungus enjoys over peloton assembly and timing.

  11. Traffic flow characteristic and capacity in intelligent work zones.

    Science.gov (United States)

    2009-10-15

    Intellgent transportation system (ITS) technologies are utilized to manage traffic flow and safety in : highway work zones. Traffic management plans for work zones require queuing analyses to determine : the anticipated traffic backups, but the predi...

  12. Understanding structure of urban traffic network based on spatial-temporal correlation analysis

    Science.gov (United States)

    Yang, Yanfang; Jia, Limin; Qin, Yong; Han, Shixiu; Dong, Honghui

    2017-08-01

    Understanding the structural characteristics of urban traffic network comprehensively can provide references for improving road utilization rate and alleviating traffic congestion. This paper focuses on the spatial-temporal correlations between different pairs of traffic series and proposes a complex network-based method of constructing the urban traffic network. In the network, the nodes represent road segments, and an edge between a pair of nodes is added depending on the result of significance test for the corresponding spatial-temporal correlation. Further, a modified PageRank algorithm, named the geographical weight-based PageRank algorithm (GWPA), is proposed to analyze the spatial distribution of important segments in the road network. Finally, experiments are conducted by using three kinds of traffic series collected from the urban road network in Beijing. Experimental results show that the urban traffic networks constructed by three traffic variables all indicate both small-world and scale-free characteristics. Compared with the results of PageRank algorithm, GWPA is proved to be valid in evaluating the importance of segments and identifying the important segments with small degree.

  13. Characterization of YouTube Video Streaming Traffic

    OpenAIRE

    Ravattu, Radha; Balasetty, Prudhviraj

    2013-01-01

    Online digital videos have made a revolutionary evolution since the social networking sites such as YouTube and Hulu have emerged. These websites facilitate video accessable and only a click away. Ever increasing internet traffic and a very significant increase in the use of videos in social networking has led to the problem of network congestion. Consequently, it becomes essential and imperative to analyze the traffic flow and comprehend how it is being delivered from the server. If the flow...

  14. The Effect of Queueing Strategy on Network Traffic

    International Nuclear Information System (INIS)

    Zhang Xue-Jun; Guan Xiang-Min; Sun Deng-Feng; Tang Shao-Ting

    2013-01-01

    In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce a dynamic-information-based (DIB) queueing strategy into network traffic model under the efficient routing strategy. DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination. It is found that, compared with the traditional first-in-first-out (FIFO) queueing strategy, DIB can effectively balance the traffic load of the system via delaying packets to be delivered to congested nodes. Although the network capacity has no obvious changes, some other indexes which reflect transportation efficiency are efficiently improved in the congestion state. Besides, extensive simulation results and discussions are provided to explain the phenomena. The results may provide novel insights for research on traffic systems. (condensed matter: structural, mechanical, and thermal properties)

  15. Reducing habitat fragmentation on minor rural roads through traffic calming

    NARCIS (Netherlands)

    Jaarsma, C.F.; Willems, G.P.A.

    2002-01-01

    The rural road network suffers continually from ambiguity. On the one hand, the presence of this network and its traffic flows offer accessibility and make a contribution to economic development. While on the other, its presence and its traffic flows cause fragmentation. The actual ecological impact

  16. Traffic engineering and regenerator placement in GMPLS networks with restoration

    Science.gov (United States)

    Yetginer, Emre; Karasan, Ezhan

    2002-07-01

    In this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multipro-tocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) prob-lem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.

  17. Navier-Stokes-like equations for traffic flow.

    Science.gov (United States)

    Velasco, R M; Marques, W

    2005-10-01

    The macroscopic traffic flow equations derived from the reduced Paveri-Fontana equation are closed starting with the maximization of the informational entropy. The homogeneous steady state taken as a reference is obtained for a specific model of the desired velocity and a kind of Chapman-Enskog method is developed to calculate the traffic pressure at the Navier-Stokes level. Numerical solution of the macroscopic traffic equations is obtained and its characteristics are analyzed.

  18. Entropy-based heavy tailed distribution transformation and visual analytics for monitoring massive network traffic

    Science.gov (United States)

    Han, Keesook J.; Hodge, Matthew; Ross, Virginia W.

    2011-06-01

    For monitoring network traffic, there is an enormous cost in collecting, storing, and analyzing network traffic datasets. Data mining based network traffic analysis has a growing interest in the cyber security community, but is computationally expensive for finding correlations between attributes in massive network traffic datasets. To lower the cost and reduce computational complexity, it is desirable to perform feasible statistical processing on effective reduced datasets instead of on the original full datasets. Because of the dynamic behavior of network traffic, traffic traces exhibit mixtures of heavy tailed statistical distributions or overdispersion. Heavy tailed network traffic characterization and visualization are important and essential tasks to measure network performance for the Quality of Services. However, heavy tailed distributions are limited in their ability to characterize real-time network traffic due to the difficulty of parameter estimation. The Entropy-Based Heavy Tailed Distribution Transformation (EHTDT) was developed to convert the heavy tailed distribution into a transformed distribution to find the linear approximation. The EHTDT linearization has the advantage of being amenable to characterize and aggregate overdispersion of network traffic in realtime. Results of applying the EHTDT for innovative visual analytics to real network traffic data are presented.

  19. Physics of flow in weighted complex networks

    Science.gov (United States)

    Wu, Zhenhua

    This thesis uses concepts from statistical physics to understand the physics of flow in weighted complex networks. The traditional model for random networks is the Erdoḧs-Renyi (ER.) network, where a network of N nodes is created by connecting each of the N(N - 1)/2 pairs of nodes with a probability p. The degree distribution, which is the probability distribution of the number of links per node, is a Poisson distribution. Recent studies of the topology in many networks such as the Internet and the world-wide airport network (WAN) reveal a power law degree distribution, known as a scale-free (SF) distribution. To yield a better description of network dynamics, we study weighted networks, where each link or node is given a number. One asks how the weights affect the static and the dynamic properties of the network. In this thesis, two important dynamic problems are studied: the current flow problem, described by Kirchhoff's laws, and the maximum flow problem, which maximizes the flow between two nodes. Percolation theory is applied to these studies of the dynamics in complex networks. We find that the current flow in disordered media belongs to the same universality class as the optimal path. In a randomly weighted network, we identify the infinite incipient percolation cluster as the "superhighway", which contains most of the traffic in a network. We propose an efficient strategy to improve significantly the global transport by improving the superhighways, which comprise a small fraction of the network. We also propose a network model with correlated weights to describe weighted networks such as the WAN. Our model agrees with WAN data, and provides insight into the advantages of correlated weights in networks. Lastly, the upper critical dimension is evaluated using two different numerical methods, and the result is consistent with the theoretical prediction.

  20. Cellular automata model for urban road traffic flow considering pedestrian crossing street

    Science.gov (United States)

    Zhao, Han-Tao; Yang, Shuo; Chen, Xiao-Xu

    2016-11-01

    In order to analyze the effect of pedestrians' crossing street on vehicle flows, we investigated traffic characteristics of vehicles and pedestrians. Based on that, rules of lane changing, acceleration, deceleration, randomization and update are modified. Then we established two urban two-lane cellular automata models of traffic flow, one of which is about sections with non-signalized crosswalk and the other is on uncontrolled sections with pedestrians crossing street at random. MATLAB is used for numerical simulation of the different traffic conditions; meanwhile space-time diagram and relational graphs of traffic flow parameters are generated and then comparatively analyzed. Simulation results indicate that when vehicle density is lower than around 25 vehs/(km lane), pedestrians have modest impact on traffic flow, whereas when vehicle density is higher than about 60 vehs/(km lane), traffic speed and volume will decrease significantly especially on sections with non-signal-controlled crosswalk. The results illustrate that the proposed models reconstruct the traffic flow's characteristic with the situation where there are pedestrians crossing and can provide some practical reference for urban traffic management.

  1. Traffic flow dynamics. Data, models and simulation

    Energy Technology Data Exchange (ETDEWEB)

    Treiber, Martin [Technische Univ. Dresden (Germany). Inst. fuer Wirtschaft und Verkehr; Kesting, Arne [TomTom Development Germany GmbH, Berlin (Germany)

    2013-07-01

    First comprehensive textbook of this fascinating interdisciplinary topic which explains advances in a way that it is easily accessible to engineering, physics and math students. Presents practical applications of traffic theory such as driving behavior, stability analysis, stop-and-go waves, and travel time estimation. Presents the topic in a novel and systematic way by addressing both microscopic and macroscopic models with a focus on traffic instabilities. Revised and extended edition of the German textbook ''Verkehrsdynamik und -simulation''. This textbook provides a comprehensive and instructive coverage of vehicular traffic flow dynamics and modeling. It makes this fascinating interdisciplinary topic, which to date was only documented in parts by specialized monographs, accessible to a broad readership. Numerous figures and problems with solutions help the reader to quickly understand and practice the presented concepts. This book is targeted at students of physics and traffic engineering and, more generally, also at students and professionals in computer science, mathematics, and interdisciplinary topics. It also offers material for project work in programming and simulation at college and university level. The main part, after presenting different categories of traffic data, is devoted to a mathematical description of the dynamics of traffic flow, covering macroscopic models which describe traffic in terms of density, as well as microscopic many-particle models in which each particle corresponds to a vehicle and its driver. Focus chapters on traffic instabilities and model calibration/validation present these topics in a novel and systematic way. Finally, the theoretical framework is shown at work in selected applications such as traffic-state and travel-time estimation, intelligent transportation systems, traffic operations management, and a detailed physics-based model for fuel consumption and emissions.

  2. Modeling the heterogeneous traffic correlations in urban road systems using traffic-enhanced community detection approach

    Science.gov (United States)

    Lu, Feng; Liu, Kang; Duan, Yingying; Cheng, Shifen; Du, Fei

    2018-07-01

    A better characterization of the traffic influence among urban roads is crucial for traffic control and traffic forecasting. The existence of spatial heterogeneity imposes great influence on modeling the extent and degree of road traffic correlation, which is usually neglected by the traditional distance based method. In this paper, we propose a traffic-enhanced community detection approach to spatially reveal the traffic correlation in city road networks. First, the road network is modeled as a traffic-enhanced dual graph with the closeness between two road segments determined not only by their topological connection, but also by the traffic correlation between them. Then a flow-based community detection algorithm called Infomap is utilized to identify the road segment clusters. Evaluated by Moran's I, Calinski-Harabaz Index and the traffic interpolation application, we find that compared to the distance based method and the community based method, our proposed traffic-enhanced community based method behaves better in capturing the extent of traffic relevance as both the topological structure of the road network and the traffic correlations among urban roads are considered. It can be used in more traffic-related applications, such as traffic forecasting, traffic control and guidance.

  3. An Improved Car-Following Model in Vehicle Networking Based on Network Control

    Directory of Open Access Journals (Sweden)

    D. Y. Kong

    2014-01-01

    Full Text Available Vehicle networking is a system to realize information interoperability between vehicles and people, vehicles and roads, vehicles and vehicles, and cars and transport facilities, through the network information exchange, in order to achieve the effective monitoring of the vehicle and traffic flow. Realizing information interoperability between vehicles and vehicles, which can affect the traffic flow, is an important application of network control system (NCS. In this paper, a car-following model using vehicle networking theory is established, based on network control principle. The car-following model, which is an improvement of the traditional traffic model, describes the traffic in vehicle networking condition. The impact that vehicle networking has on the traffic flow is quantitatively assessed in a particular scene of one-way, no lane changing highway. The examples show that the capacity of the road is effectively enhanced by using vehicle networking.

  4. Generic Traffic Descriptors in Managing Service Quality in BISDN/ATM Network

    Directory of Open Access Journals (Sweden)

    Ivan Bošnjak

    2002-03-01

    Full Text Available Traffic models for multiservice broadband networks differsignificantly regarding simple analytic models applicable intelephone traffic and circuit-switch network. The paper presentsa clear analysis of standardised traffic descriptors andquality parameters of the main services in BISDNIATM. Trafficdescriptors have been associated with the basic values andconcepts developed within generic traffic theory. Part systematisationof traffic parameters has been performed as basis for formalisedgeneralised description of parameters and effectivequality management of A TM services.

  5. Mathematical programs with complementarity constraints in traffic and telecommunications networks.

    Science.gov (United States)

    Ralph, Daniel

    2008-06-13

    Given a suitably parametrized family of equilibrium models and a higher level criterion by which to measure an equilibrium state, mathematical programs with equilibrium constraints (MPECs) provide a framework for improving or optimizing the equilibrium state. An example is toll design in traffic networks, which attempts to reduce total travel time by choosing which arcs to toll and what toll levels to impose. Here, a Wardrop equilibrium describes the traffic response to each toll design. Communication networks also have a deep literature on equilibrium flows that suggest some MPECs. We focus on mathematical programs with complementarity constraints (MPCCs), a subclass of MPECs for which the lower level equilibrium system can be formulated as a complementarity problem and therefore, importantly, as a nonlinear program (NLP). Although MPECs and MPCCs are typically non-convex, which is a consequence of the upper level objective clashing with the users' objectives in the lower level equilibrium program, the last decade of research has paved the way for finding local solutions of MPCCs via standard NLP techniques.

  6. Heterogeneous traffic flow modelling using second-order macroscopic continuum model

    Science.gov (United States)

    Mohan, Ranju; Ramadurai, Gitakrishnan

    2017-01-01

    Modelling heterogeneous traffic flow lacking in lane discipline is one of the emerging research areas in the past few years. The two main challenges in modelling are: capturing the effect of varying size of vehicles, and the lack in lane discipline, both of which together lead to the 'gap filling' behaviour of vehicles. The same section length of the road can be occupied by different types of vehicles at the same time, and the conventional measure of traffic concentration, density (vehicles per lane per unit length), is not a good measure for heterogeneous traffic modelling. First aim of this paper is to have a parsimonious model of heterogeneous traffic that can capture the unique phenomena of gap filling. Second aim is to emphasize the suitability of higher-order models for modelling heterogeneous traffic. Third, the paper aims to suggest area occupancy as concentration measure of heterogeneous traffic lacking in lane discipline. The above mentioned two main challenges of heterogeneous traffic flow are addressed by extending an existing second-order continuum model of traffic flow, using area occupancy for traffic concentration instead of density. The extended model is calibrated and validated with field data from an arterial road in Chennai city, and the results are compared with those from few existing generalized multi-class models.

  7. CIME course on Modelling and Optimisation of Flows on Networks

    CERN Document Server

    Ambrosio, Luigi; Helbing, Dirk; Klar, Axel; Zuazua, Enrique

    2013-01-01

    In recent years flows in networks have attracted the interest of many researchers from different areas, e.g. applied mathematicians, engineers, physicists, economists. The main reason for this ubiquity is the wide and diverse range of applications, such as vehicular traffic, supply chains, blood flow, irrigation channels, data networks and others. This book presents an extensive set of notes by world leaders on the main mathematical techniques used to address such problems, together with investigations into specific applications. The main focus is on partial differential equations in networks, but ordinary differential equations and optimal transport are also included. Moreover, the modeling is completed by analysis, numerics, control and optimization of flows in networks. The book will be a valuable resource for every researcher or student interested in the subject.

  8. Reports on internet traffic statistics

    OpenAIRE

    Hoogesteger, Martijn; de Oliveira Schmidt, R.; Sperotto, Anna; Pras, Aiko

    2013-01-01

    Internet traffic statistics can provide valuable information to network analysts and researchers about the way nowadays networks are used. In the past, such information was provided by Internet2 in a public website called Internet2 NetFlow: Weekly Reports. The website reported traffic statistics from the Abilene network on a weekly basis. At that time, the network connected 230 research institutes with a 10Gb/s link. Although these reports were limited to the behavior of the Albeline's users,...

  9. Simulation-Based Dynamic Passenger Flow Assignment Modelling for a Schedule-Based Transit Network

    Directory of Open Access Journals (Sweden)

    Xiangming Yao

    2017-01-01

    Full Text Available The online operation management and the offline policy evaluation in complex transit networks require an effective dynamic traffic assignment (DTA method that can capture the temporal-spatial nature of traffic flows. The objective of this work is to propose a simulation-based dynamic passenger assignment framework and models for such applications in the context of schedule-based rail transit systems. In the simulation framework, travellers are regarded as individual agents who are able to obtain complete information on the current traffic conditions. A combined route selection model integrated with pretrip route selection and entrip route switch is established for achieving the dynamic network flow equilibrium status. The train agent is operated strictly with the timetable and its capacity limitation is considered. A continuous time-driven simulator based on the proposed framework and models is developed, whose performance is illustrated through a large-scale network of Beijing subway. The results indicate that more than 0.8 million individual passengers and thousands of trains can be simulated simultaneously at a speed ten times faster than real time. This study provides an efficient approach to analyze the dynamic demand-supply relationship for large schedule-based transit networks.

  10. The effects of redundancy and information manipulation on traffic networks

    OpenAIRE

    Özel, Berk; Ozel, Berk

    2014-01-01

    Traffic congestion is one of the most frequently encountered problems in real life. It is not only a scientific concern of scholars, but also an inevitable issue for most of the individuals living in urban areas. Since every driver in traffic networks tries to minimize own journey length, and volume of the traffic prevents coordination between individuals, a cooperative behavior will not be provided spontaneously in order to decrease the total cost of the network and the time spent on traffic...

  11. Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

    Science.gov (United States)

    Jiang, Zhong-Yuan; Ma, Jian-Feng

    Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

  12. Research on three-phase traffic flow modeling based on interaction range

    Science.gov (United States)

    Zeng, Jun-Wei; Yang, Xu-Gang; Qian, Yong-Sheng; Wei, Xu-Ting

    2017-12-01

    On the basis of the multiple velocity difference effect (MVDE) model and under short-range interaction, a new three-phase traffic flow model (S-MVDE) is proposed through careful consideration of the influence of the relationship between the speeds of the two adjacent cars on the running state of the rear car. The random slowing rule in the MVDE model is modified in order to emphasize the influence of vehicle interaction between two vehicles on the probability of vehicles’ deceleration. A single-lane model which without bottleneck structure under periodic boundary conditions is simulated, and it is proved that the traffic flow simulated by S-MVDE model will generate the synchronous flow of three-phase traffic theory. Under the open boundary, the model is expanded by adding an on-ramp, the congestion pattern caused by the bottleneck is simulated at different main road flow rates and on-ramp flow rates, which is compared with the traffic congestion pattern observed by Kerner et al. and it is found that the results are consistent with the congestion characteristics in the three-phase traffic flow theory.

  13. Traffic and Granular Flow '11

    CERN Document Server

    Buslaev, Alexander; Bugaev, Alexander; Yashina, Marina; Schadschneider, Andreas; Schreckenberg, Michael; TGF11

    2013-01-01

    This book continues the biannual series of conference proceedings, which has become a classical reference resource in traffic and granular research alike. It addresses new developments at the interface between physics, engineering and computational science. Complex systems, where many simple agents, be they vehicles or particles, give rise to surprising and fascinating phenomena.   The contributions collected in these proceedings cover several research fields, all of which deal with transport. Topics include highway, pedestrian and internet traffic, granular matter, biological transport, transport networks, data acquisition, data analysis and technological applications. Different perspectives, i.e. modeling, simulations, experiments and phenomenological observations, are considered.

  14. Impact of distracted driving on safety and traffic flow.

    Science.gov (United States)

    Stavrinos, Despina; Jones, Jennifer L; Garner, Annie A; Griffin, Russell; Franklin, Crystal A; Ball, David; Welburn, Sharon C; Ball, Karlene K; Sisiopiku, Virginia P; Fine, Philip R

    2013-12-01

    Studies have documented a link between distracted driving and diminished safety; however, an association between distracted driving and traffic congestion has not been investigated in depth. The present study examined the behavior of teens and young adults operating a driving simulator while engaged in various distractions (i.e., cell phone, texting, and undistracted) and driving conditions (i.e., free flow, stable flow, and oversaturation). Seventy five participants 16-25 years of age (split into 2 groups: novice drivers and young adults) drove a STISIM simulator three times, each time with one of three randomly presented distractions. Each drive was designed to represent daytime scenery on a 4 lane divided roadway and included three equal roadway portions representing Levels of Service (LOS) A, C, and E as defined in the 2000 Highway Capacity Manual. Participants also completed questionnaires documenting demographics and driving history. Both safety and traffic flow related driving outcomes were considered. A Repeated Measures Multivariate Analysis of Variance was employed to analyze continuous outcome variables and a Generalized Estimate Equation (GEE) Poisson model was used to analyze count variables. Results revealed that, in general more lane deviations and crashes occurred during texting. Distraction (in most cases, text messaging) had a significantly negative impact on traffic flow, such that participants exhibited greater fluctuation in speed, changed lanes significantly fewer times, and took longer to complete the scenario. In turn, more simulated vehicles passed the participant drivers while they were texting or talking on a cell phone than while undistracted. The results indicate that distracted driving, particularly texting, may lead to reduced safety and traffic flow, thus having a negative impact on traffic operations. No significant differences were detected between age groups, suggesting that all drivers, regardless of age, may drive in a manner

  15. Integrated Traffic Flow Management Decision Making

    Science.gov (United States)

    Grabbe, Shon R.; Sridhar, Banavar; Mukherjee, Avijit

    2009-01-01

    A generalized approach is proposed to support integrated traffic flow management decision making studies at both the U.S. national and regional levels. It can consider tradeoffs between alternative optimization and heuristic based models, strategic versus tactical flight controls, and system versus fleet preferences. Preliminary testing was accomplished by implementing thirteen unique traffic flow management models, which included all of the key components of the system and conducting 85, six-hour fast-time simulation experiments. These experiments considered variations in the strategic planning look-ahead times, the replanning intervals, and the types of traffic flow management control strategies. Initial testing indicates that longer strategic planning look-ahead times and re-planning intervals result in steadily decreasing levels of sector congestion for a fixed delay level. This applies when accurate estimates of the air traffic demand, airport capacities and airspace capacities are available. In general, the distribution of the delays amongst the users was found to be most equitable when scheduling flights using a heuristic scheduling algorithm, such as ration-by-distance. On the other hand, equity was the worst when using scheduling algorithms that took into account the number of seats aboard each flight. Though the scheduling algorithms were effective at alleviating sector congestion, the tactical rerouting algorithm was the primary control for avoiding en route weather hazards. Finally, the modeled levels of sector congestion, the number of weather incursions, and the total system delays, were found to be in fair agreement with the values that were operationally observed on both good and bad weather days.

  16. Chaos in a dynamic model of urban transportation network flow based on user equilibrium states

    International Nuclear Information System (INIS)

    Xu Meng; Gao Ziyou

    2009-01-01

    In this study, we investigate the dynamical behavior of network traffic flow. We first build a two-stage mathematical model to analyze the complex behavior of network flow, a dynamical model, which is based on the dynamical gravity model proposed by Dendrinos and Sonis [Dendrinos DS, Sonis M. Chaos and social-spatial dynamic. Berlin: Springer-Verlag; 1990] is used to estimate the number of trips. Considering the fact that the Origin-Destination (O-D) trip cost in the traffic network is hard to express as a functional form, in the second stage, the user equilibrium network assignment model was used to estimate the trip cost, which is the minimum cost of used path when user equilibrium (UE) conditions are satisfied. It is important to use UE to estimate the O-D cost, since a connection is built among link flow, path flow, and O-D flow. The dynamical model describes the variations of O-D flows over discrete time periods, such as each day and each week. It is shown that even in a system with dimensions equal to two, chaos phenomenon still exists. A 'Chaos Propagation' phenomenon is found in the given model.

  17. Finite size scaling analysis on Nagel-Schreckenberg model for traffic flow

    Science.gov (United States)

    Balouchi, Ashkan; Browne, Dana

    2015-03-01

    The traffic flow problem as a many-particle non-equilibrium system has caught the interest of physicists for decades. Understanding the traffic flow properties and though obtaining the ability to control the transition from the free-flow phase to the jammed phase plays a critical role in the future world of urging self-driven cars technology. We have studied phase transitions in one-lane traffic flow through the mean velocity, distributions of car spacing, dynamic susceptibility and jam persistence -as candidates for an order parameter- using the Nagel-Schreckenberg model to simulate traffic flow. The length dependent transition has been observed for a range of maximum velocities greater than a certain value. Finite size scaling analysis indicates power-law scaling of these quantities at the onset of the jammed phase.

  18. Networks and their traffic in multiplayer games

    Directory of Open Access Journals (Sweden)

    Cristian Andrés Melo López

    2016-06-01

    Full Text Available Computer games called multiplayer real-time, or (MCG are at the forefront of the use of the possibilities of the network. Research on this subject have been made for military simulations, virtual reality systems, computer support teamwork, the solutions diverge on the problems posed by MCG. With this in mind, this document provides an overview of the four issues affecting networking at the MCG. First, network resources (bandwidth, latency and computing capacity, together with the technical limits within which the MCG must operate. Second, the distribution concepts include communication architectures (peer-to-peer, client / server, server / network, and data and control architectures (centralized, distributed and reproduced .Thirdly, scalability allows the MCG to adapt to changes in parameterization resources. Finally, security is intended to fend off the traps and vandalism, which are common in online games; to check traffic, particularly these games we decided to take the massively multiplayer game League of Legends, a scene corresponding to a situation of real life in a network of ADSL access network is deployed has been simulated by using NS2 Three variants of TCP, it means SACK TCP, New Reno TCP, and TCP Vegas, have been considered for the cross traffic. The results show that TCP Vegas is able to maintain a constant speed while racing against the game traffic, since it avoids the packet loss and the delays in the tail caused by high peaks, without increasing the size of the sender window. SACK TCP and TCP New Reno, on the other hand, tend to increase continuously the sender window size, which could allow a greater loss of packages and also to cause unwanted delays for the game traffic.

  19. Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada

    NARCIS (Netherlands)

    M.J. Hodgson (John); K.E. Rosing (Kenneth); A.L.G. Storrier (Leontien)

    1996-01-01

    textabstractTraditional location-allocation models aim to locate network facilities to optimally serve demand expressed as weights at nodes. For some types of facilities demand is not expressed at nodes, but as passing network traffic. The flow-capturing location-allocation model responds to this

  20. Traffic Congestion Evaluation and Signal Control Optimization Based on Wireless Sensor Networks: Model and Algorithms

    Directory of Open Access Journals (Sweden)

    Wei Zhang

    2012-01-01

    Full Text Available This paper presents the model and algorithms for traffic flow data monitoring and optimal traffic light control based on wireless sensor networks. Given the scenario that sensor nodes are sparsely deployed along the segments between signalized intersections, an analytical model is built using continuum traffic equation and develops the method to estimate traffic parameter with the scattered sensor data. Based on the traffic data and principle of traffic congestion formation, we introduce the congestion factor which can be used to evaluate the real-time traffic congestion status along the segment and to predict the subcritical state of traffic jams. The result is expected to support the timing phase optimization of traffic light control for the purpose of avoiding traffic congestion before its formation. We simulate the traffic monitoring based on the Mobile Century dataset and analyze the performance of traffic light control on VISSIM platform when congestion factor is introduced into the signal timing optimization model. The simulation result shows that this method can improve the spatial-temporal resolution of traffic data monitoring and evaluate traffic congestion status with high precision. It is helpful to remarkably alleviate urban traffic congestion and decrease the average traffic delays and maximum queue length.

  1. Switching performance of OBS network model under prefetched real traffic

    Science.gov (United States)

    Huang, Zhenhua; Xu, Du; Lei, Wen

    2005-11-01

    Optical Burst Switching (OBS) [1] is now widely considered as an efficient switching technique in building the next generation optical Internet .So it's very important to precisely evaluate the performance of the OBS network model. The performance of the OBS network model is variable in different condition, but the most important thing is that how it works under real traffic load. In the traditional simulation models, uniform traffics are usually generated by simulation software to imitate the data source of the edge node in the OBS network model, and through which the performance of the OBS network is evaluated. Unfortunately, without being simulated by real traffic, the traditional simulation models have several problems and their results are doubtable. To deal with this problem, we present a new simulation model for analysis and performance evaluation of the OBS network, which uses prefetched IP traffic to be data source of the OBS network model. The prefetched IP traffic can be considered as real IP source of the OBS edge node and the OBS network model has the same clock rate with a real OBS system. So it's easy to conclude that this model is closer to the real OBS system than the traditional ones. The simulation results also indicate that this model is more accurate to evaluate the performance of the OBS network system and the results of this model are closer to the actual situation.

  2. Road traffic flow and impact on environment in Hyderabad city

    International Nuclear Information System (INIS)

    Memon, Zaheer-ud-Din; Ansari, A.K.; Memon, S.A.

    2000-01-01

    In Hyderabad city due to dramatic increase in traffic intensity on the roads, traffic flow have been much beyond the comfortable limits. High values of traffic flow density have been recorded on Court Road (34.05%), Tilak Road (19.87%), Risala Road (22.91%) and Cafe George (23.14%) of Hyderabad city. Above 80% people are found to be annoyed due to traffic congestion, noise and smoke resulting in health ailments. Slow Moving Vehicles (SMVs) comprising of animal and hand drawn vehicles (rehras) cause serious disruption in the traffic stream on city roads, which are ultimately causing traffic-jam condition resulting a serious impact on environment. No definite parking places exist for public vehicles because of encroachment on roads. Proper foot paths are not available for pedestrian, which results in increase in accidents. (author)

  3. Design and Evaluation of a Proxy-Based Monitoring System for OpenFlow Networks.

    Science.gov (United States)

    Taniguchi, Yoshiaki; Tsutsumi, Hiroaki; Iguchi, Nobukazu; Watanabe, Kenzi

    2016-01-01

    Software-Defined Networking (SDN) has attracted attention along with the popularization of cloud environment and server virtualization. In SDN, the control plane and the data plane are decoupled so that the logical topology and routing control can be configured dynamically depending on network conditions. To obtain network conditions precisely, a network monitoring mechanism is necessary. In this paper, we focus on OpenFlow which is a core technology to realize SDN. We propose, design, implement, and evaluate a network monitoring system for OpenFlow networks. Our proposed system acts as a proxy between an OpenFlow controller and OpenFlow switches. Through experimental evaluations, we confirm that our proposed system can capture packets and monitor traffic information depending on administrator's configuration. In addition, we show that our proposed system does not influence significant performance degradation to overall network performance.

  4. Design and Evaluation of a Proxy-Based Monitoring System for OpenFlow Networks

    Directory of Open Access Journals (Sweden)

    Yoshiaki Taniguchi

    2016-01-01

    Full Text Available Software-Defined Networking (SDN has attracted attention along with the popularization of cloud environment and server virtualization. In SDN, the control plane and the data plane are decoupled so that the logical topology and routing control can be configured dynamically depending on network conditions. To obtain network conditions precisely, a network monitoring mechanism is necessary. In this paper, we focus on OpenFlow which is a core technology to realize SDN. We propose, design, implement, and evaluate a network monitoring system for OpenFlow networks. Our proposed system acts as a proxy between an OpenFlow controller and OpenFlow switches. Through experimental evaluations, we confirm that our proposed system can capture packets and monitor traffic information depending on administrator’s configuration. In addition, we show that our proposed system does not influence significant performance degradation to overall network performance.

  5. The impact of traffic-flow patterns on air quality in urban street canyons

    International Nuclear Information System (INIS)

    Thaker, Prashant; Gokhale, Sharad

    2016-01-01

    We investigated the effect of different urban traffic-flow patterns on pollutant dispersion in different winds in a real asymmetric street canyon. Free-flow traffic causes more turbulence in the canyon facilitating more dispersion and a reduction in pedestrian level concentration. The comparison of with and without a vehicle-induced-turbulence revealed that when winds were perpendicular, the free-flow traffic reduced the concentration by 73% on the windward side with a minor increase of 17% on the leeward side, whereas for parallel winds, it reduced the concentration by 51% and 29%. The congested-flow traffic increased the concentrations on the leeward side by 47% when winds were perpendicular posing a higher risk to health, whereas reduced it by 17–42% for parallel winds. The urban air quality and public health can, therefore, be improved by improving the traffic-flow patterns in street canyons as vehicle-induced turbulence has been shown to contribute significantly to dispersion. - Highlights: • CFD is used to study impact of traffic-flow patterns on urban air quality. • Facilitating free-flow patterns induce more turbulence in street canyons. • Traffic-generated turbulence alters pollutant levels in urban street canyons. - This study investigates the effect of vehicle-induced-turbulence generated during free-flow traffic pattern in reduction of air pollutant concentrations in urban street canyons.

  6. Macroscopic Model and Simulation Analysis of Air Traffic Flow in Airport Terminal Area

    Directory of Open Access Journals (Sweden)

    Honghai Zhang

    2014-01-01

    Full Text Available We focus on the spatiotemporal characteristics and their evolvement law of the air traffic flow in airport terminal area to provide scientific basis for optimizing flight control processes and alleviating severe air traffic conditions. Methods in this work combine mathematical derivation and simulation analysis. Based on cell transmission model the macroscopic models of arrival and departure air traffic flow in terminal area are established. Meanwhile, the interrelationship and influential factors of the three characteristic parameters as traffic flux, density, and velocity are presented. Then according to such models, the macro emergence of traffic flow evolution is emulated with the NetLogo simulation platform, and the correlativity of basic traffic flow parameters is deduced and verified by means of sensitivity analysis. The results suggest that there are remarkable relations among the three characteristic parameters of the air traffic flow in terminal area. Moreover, such relationships evolve distinctly with the flight procedures, control separations, and ATC strategies.

  7. Outer Synchronization between Two Coupled Complex Networks and Its Application in Public Traffic Supernetwork

    Directory of Open Access Journals (Sweden)

    Wen-ju Du

    2016-01-01

    Full Text Available The paper presents a new urban public traffic supernetwork model by using the existing bus network modeling method, consisting of the conventional bus traffic network and the urban rail traffic network. We investigate the synchronization problem of urban public traffic supernetwork model by using the coupled complex network’s outer synchronization theory. Analytical and numerical simulations are given to illustrate the impact of traffic dispatching frequency and traffic lines optimization to the urban public traffic supernetwork balance.

  8. From Traffic Flow to Economic System

    Science.gov (United States)

    Bando, M.

    The optimal velocity model which is applied to traffic flow phenomena explains a spontaneous formation of traffic congestion. We discuss why the model works well in describing both free-flow and congested flow states in a unified way. The essential ingredient is that our model takes account of a sort of time delay in reacting to a given stimulus. This causes instability of many-body system, and yields a kind of phase transition above a certain critical density. Especially there appears a limit cycle on the phase space along which individual vehicle moves, and they show cyclic behavior. Once that we recognize the mechanism the same idea can be applied to a variety of phenomena which show cyclic behavior observed in many-body systems. As an example of such applications, we investigate business cycles commonly observed in economic system. We further discuss a possible origin of a kind of cyclic behavior observed in climate change.

  9. Flow control and routing techniques for integrated voice and data networks

    Science.gov (United States)

    Ibe, O. C.

    1981-10-01

    We consider a model of integrated voice and data networks. In this model the network flow problem is formulated as a convex optimization problem. The objective function comprises two types of cost functions: the congestion cost functions, which limit the average input traffic to values compatible with the network conditions; and the rate limitation cost functions, which ensure that all conversations are fairly treated. A joint flow control and routing algorithm is constructed which determines the routes for each conversation, and effects flow control by setting voice packet lengths and data input rates in a manner that achieves optimal tradeoff between each user's satisfaction and the cost of network congestion. An additional congestion control protocol is specified which could be used in conjunction with the algorithm to make the latter respond more dynamically to network congestion.

  10. An analysis of network traffic classification for botnet detection

    DEFF Research Database (Denmark)

    Stevanovic, Matija; Pedersen, Jens Myrup

    2015-01-01

    of detecting botnet network traffic using three methods that target protocols widely considered as the main carriers of botnet Command and Control (C&C) and attack traffic, i.e. TCP, UDP and DNS. We propose three traffic classification methods based on capable Random Forests classifier. The proposed methods...

  11. An Analysis of Vehicular Traffic Flow Using Langevin Equation

    Directory of Open Access Journals (Sweden)

    Çağlar Koşun

    2015-08-01

    Full Text Available Traffic flow data are stochastic in nature, and an abundance of literature exists thereof. One way to express stochastic data is the Langevin equation. Langevin equation consists of two parts. The first part is known as the deterministic drift term, the other as the stochastic diffusion term. Langevin equation does not only help derive the deterministic and random terms of the selected portion of the city of Istanbul traffic empirically, but also sheds light on the underlying dynamics of the flow. Drift diagrams have shown that slow lane tends to get congested faster when vehicle speeds attain a value of 25 km/h, and it is 20 km/h for the fast lane. Three or four distinct regimes may be discriminated again from the drift diagrams; congested, intermediate, and free-flow regimes. At places, even the intermediate regime may be divided in two, often with readiness to congestion. This has revealed the fact that for the selected portion of the highway, there are two main states of flow, namely, congestion and free-flow, with an intermediate state where the noise-driven traffic flow forces the flow into either of the distinct regimes.

  12. Use of a Phase Transition Concept for Traffic Flow Condition Estimation

    Directory of Open Access Journals (Sweden)

    Larin Oleg N.

    2014-12-01

    Full Text Available The article covers the main models of traffic flow conditions, analyzes the condition estimation criteria, and provides the classification of models. The article provides the grounds for the use of the phase transition concept for traffic flow condition estimation. The models of the aggregate condition of free and congested traffic have been developed, the phase boundaries between free and congested traffic have been defined. Applicability conditions for the models of the aggregate condition of have been analyzed.

  13. Failure cascade in interdependent network with traffic loads

    International Nuclear Information System (INIS)

    Hong, Sheng; Wang, Baoqing; Wang, Jianghui; Zhao, Tingdi; Ma, Xiaomin

    2015-01-01

    Complex networks have been widely studied recent years, but most researches focus on the single, non-interacting networks. With the development of modern systems, many infrastructure networks are coupled together and therefore should be modeled as interdependent networks. For interdependent networks, failure of nodes in one network may lead to failure of dependent nodes in the other networks. This may happen recursively and lead to a failure cascade. In the real world, different networks carry different traffic loads. Overload and load redistribution may lead to more nodes’ failure. Considering the dependency between the interdependent networks and the traffic load, a small fraction of fault nodes may lead to complete fragmentation of a system. Based on the robust analysis of interdependent networks, we propose a costless defense strategy to suppress the failure cascade. Our findings highlight the need to consider the load and coupling preference when designing robust interdependent networks. And it is necessary to take actions in the early stage of the failure cascade to decrease the losses caused by the large-scale breakdown of infrastructure networks. (paper)

  14. Impacts of Snowy Weather Conditions on Expressway Traffic Flow Characteristics

    Directory of Open Access Journals (Sweden)

    Jiancheng Weng

    2013-01-01

    Full Text Available Snowy weather will significantly degrade expressway operations, reduce service levels, and increase driving difficulty. Furthermore, the impact of snow varies in different types of roads, diverse cities, and snow densities due to different driving behavior. Traffic flow parameters are essential to decide what should be appropriate for weather-related traffic management and control strategies. This paper takes Beijing as a case study and analyzes traffic flow data collected by detectors in expressways. By comparing the performance of traffic flow under normal and snowy weather conditions, this paper quantitatively describes the impact of adverse weather on expressway volume and average speeds. Results indicate that average speeds on the Beijing expressway under heavy snow conditions decrease by 10–20 km/h when compared to those under normal weather conditions, the vehicle headway generally increases by 2–4 seconds, and the road capacity drops by about 33%. This paper also develops a specific expressway traffic parameter reduction model which proposes reduction coefficients of expressway volumes and speeds under various snow density conditions in Beijing. The conclusions paper provide effective foundational parameters for urban expressway controls and traffic management under snow conditions.

  15. Entropy Based Analysis of DNS Query Traffic in the Campus Network

    Directory of Open Access Journals (Sweden)

    Dennis Arturo Ludeña Romaña

    2008-10-01

    Full Text Available We carried out the entropy based study on the DNS query traffic from the campus network in a university through January 1st, 2006 to March 31st, 2007. The results are summarized, as follows: (1 The source IP addresses- and query keyword-based entropies change symmetrically in the DNS query traffic from the outside of the campus network when detecting the spam bot activity on the campus network. On the other hand (2, the source IP addresses- and query keywordbased entropies change similarly each other when detecting big DNS query traffic caused by prescanning or distributed denial of service (DDoS attack from the campus network. Therefore, we can detect the spam bot and/or DDoS attack bot by only watching DNS query access traffic.

  16. Understanding the context of network traffic alerts

    NARCIS (Netherlands)

    Cappers, B.C.M.; van Wijk, J.J.; Best, D.M.; Staheli, D.; Prigent, N.; Engle, S.; Harrison, L.

    2016-01-01

    For the protection of critical infrastructures against complex virus attacks, automated network traffic analysis and deep packet inspection are unavoidable. However, even with the use of network intrusion detection systems, the number of alerts is still too large to analyze manually. In addition,

  17. Traffic sign recognition with deep convolutional neural networks

    OpenAIRE

    Karamatić, Boris

    2016-01-01

    The problem of detection and recognition of traffic signs is becoming an important problem when it comes to the development of self driving cars and advanced driver assistance systems. In this thesis we will develop a system for detection and recognition of traffic signs. For the problem of detection we will use aggregate channel features and for the problem of recognition we will use a deep convolutional neural network. We will describe how convolutional neural networks work, how they are co...

  18. Wave dynamics in an extended macroscopic traffic flow model with periodic boundaries

    Science.gov (United States)

    Wang, Yu-Qing; Chu, Xing-Jian; Zhou, Chao-Fan; Yan, Bo-Wen; Jia, Bin; Fang, Chen-Hao

    2018-06-01

    Motivated by the previous traffic flow model considering the real-time traffic state, a modified macroscopic traffic flow model is established. The periodic boundary condition is applied to the car-following model. Besides, the traffic state factor R is defined in order to correct the real traffic conditions in a more reasonable way. It is a key step that we introduce the relaxation time as a density-dependent function and provide corresponding evolvement of traffic flow. Three different typical initial densities, namely the high density, the medium one and the low one, are intensively investigated. It can be found that the hysteresis loop exists in the proposed periodic-boundary system. Furthermore, the linear and nonlinear stability analyses are performed in order to test the robustness of the system.

  19. INTELLIGENT TRAFFIC-SAFETY MIRROR BY USING WIRELESS SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    Peter Danišovič

    2014-03-01

    Full Text Available This article is focused on the problematic of traffic safety, dealing with the problem of car intersections with blocked view crossing by a special wireless sensor network (WSN proposed for the traffic monitoring, concretely for vehicle’s detection at places, where it is necessary. Some ultra-low-power TI products were developed due to this reason: microcontroller MSP430F2232, 868MHz RF transceiver CC1101 and LDO voltage regulator TPS7033. The WSN consist of four network nodes supplied with the special safety lightings which serve the function of intelligent traffic safety mirror.

  20. Modeling connected and autonomous vehicles in heterogeneous traffic flow

    Science.gov (United States)

    Ye, Lanhang; Yamamoto, Toshiyuki

    2018-01-01

    The objective of this study was to develop a heterogeneous traffic-flow model to study the possible impact of connected and autonomous vehicles (CAVs) on the traffic flow. Based on a recently proposed two-state safe-speed model (TSM), a two-lane cellular automaton (CA) model was developed, wherein both the CAVs and conventional vehicles were incorporated in the heterogeneous traffic flow. In particular, operation rules for CAVs are established considering the new characteristics of this emerging technology, including autonomous driving through the adaptive cruise control and inter-vehicle connection via short-range communication. Simulations were conducted under various CAV-penetration rates in the heterogeneous flow. The impact of CAVs on the road capacity was numerically investigated. The simulation results indicate that the road capacity increases with an increase in the CAV-penetration rate within the heterogeneous flow. Up to a CAV-penetration rate of 30%, the road capacity increases gradually; the effect of the difference in the CAV capability on the growth rate is insignificant. When the CAV-penetration rate exceeds 30%, the growth rate is largely decided by the capability of the CAV. The greater the capability, the higher the road-capacity growth rate. The relationship between the CAV-penetration rate and the road capacity is numerically analyzed, providing some insights into the possible impact of the CAVs on traffic systems.

  1. Radio resource management for mobile traffic offloading in heterogeneous cellular networks

    CERN Document Server

    Wu, Yuan; Huang, Jianwei; Shen, Xuemin (Sherman)

    2017-01-01

    This SpringerBrief offers two concrete design examples for traffic offloading. The first is an optimal resource allocation for small-cell based traffic offloading that aims at minimizing mobile users’ data cost. The second is an optimal resource allocation for device-to-device assisted traffic offloading that also minimizes the total energy consumption and cellular link usage (while providing an overview of the challenging issues). Both examples illustrate the importance of proper resource allocation to the success of traffic offloading, show the consequent performance advantages of executing optimal resource allocation, and present the methodologies to achieve the corresponding optimal offloading solution for traffic offloading in heterogeneous cellular networks. The authors also include an overview of heterogeneous cellular networks and explain different traffic offloading paradigms ranging from uplink traffic offloading through small cells to downlink traffic offloading via mobile device-to-device cooper...

  2. Cellular automata model for traffic flow with safe driving conditions

    International Nuclear Information System (INIS)

    Lárraga María Elena; Alvarez-Icaza Luis

    2014-01-01

    In this paper, a recently introduced cellular automata (CA) model is used for a statistical analysis of the inner microscopic structure of synchronized traffic flow. The analysis focuses on the formation and dissolution of clusters or platoons of vehicles, as the mechanism that causes the presence of this synchronized traffic state with a high flow. This platoon formation is one of the most interesting phenomena observed in traffic flows and plays an important role both in manual and automated highway systems (AHS). Simulation results, obtained from a single-lane system under periodic boundary conditions indicate that in the density region where the synchronized state is observed, most vehicles travel together in platoons with approximately the same speed and small spatial distances. The examination of velocity variations and individual vehicle gaps shows that the flow corresponding to the synchronized state is stable, safe and highly correlated. Moreover, results indicate that the observed platoon formation in real traffic is reproduced in simulations by the relation between vehicle headway and velocity that is embedded in the dynamics definition of the CA model. (general)

  3. Locating replenishment stations for electric vehicles: Application to Danish traffic data

    DEFF Research Database (Denmark)

    Wen, Min; Laporte, Gilbert; Madsen, Oli B.G.

    2012-01-01

    for electric vehicles on a traffic network with flow-based demand. The objective is to optimize the network performance, for example to maximize the flow covered by a prefixed number of stations, or to minimize the number of stations needed to cover traffic flows. Two mixed integer linear programming......Environment-friendly electric vehicles have gained substantial attention in governments, industry and universities. The deployment of a network of recharging stations is essential given their limited travel range. This paper considers the problem of locating electronic replenishment stations...

  4. Traffic Flow Wide-Area Surveillance system

    Energy Technology Data Exchange (ETDEWEB)

    Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.; Abston, R.A.

    1994-09-01

    Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret a large spatial projection of data originating from multiple sensor suites. This concept is the basis for the development of a Traffic Flow Wide-Area Surveillance (TFWAS) system. This paper presents the results of a study by Oak Ridge National Laboratory to define the operational specifications and characteristics, to determine the constraints, and to examine the state of technology of a TFWAS system in terms of traffic management and control. In doing so, the functions and attributes of a TFWAS system are mapped into an operational structure consistent with the Intelligent Vehicle Highway System (IVHS) concept and the existing highway infrastructure. This mapping includes identifying candidate sensor suites and establishing criteria, requirements, and performance measures by which these systems can be graded in their ability and practicality to meet the operational requirements of a TFWAS system. In light of this, issues such as system integration, applicable technologies, impact on traffic management and control, and public acceptance are addressed.

  5. Traffic flow wide-area surveillance system

    Science.gov (United States)

    Allgood, Glenn O.; Ferrell, Regina K.; Kercel, Stephen W.; Abston, Ruth A.

    1995-01-01

    Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret a large spatial projection of data originating from multiple sensor suites. This concept is the basis for the development of a traffic flow wide-area surveillance (TFWAS) system. This paper presents the results of a study by Oak Ridge National Laboratory to define the operational specifications and characteristics, to determine the constraints, and to examine the state of technology of a TFWAS system in terms of traffic management and control. In doing so, the functions and attributes of a TFWAS system are mapped into an operational structure consistent with the Intelligent Vehicle Highway System (IVHS) concept and the existing highway infrastructure. This mapping includes identifying candidate sensor suites and establishing criteria, requirements, and performance measures by which these systems can be graded in their ability and practicality to meet the operational requirements of a TFWAS system. In light of this, issues such as system integration, applicable technologies, impact on traffic management and control, and public acceptance are addressed.

  6. Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

    International Nuclear Information System (INIS)

    Xie Wei-Hao; Zhou Bin; Liu En-Xiao; Lu Wei-Dang; Zhou Ting

    2015-01-01

    Many real communication networks, such as oceanic monitoring network and land environment observation network, can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue (HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue (HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity. (paper)

  7. Social dilemma structures hidden behind traffic flow with lane changes

    International Nuclear Information System (INIS)

    Tanimoto, Jun; Kukida, Shinji; Hagishima, Aya

    2014-01-01

    Aiming to merge traffic flow analysis with evolutionary game theory, we investigated the question of whether such structures can be formed from frequent lane changes in usual traffic flow without any explicit bottlenecks. In our model system, two classes of driver-agents coexist: C-agents (cooperative strategy) always remain in the lane they are initially assigned, whereas D-agents (defective strategy) try to change lanes to move ahead. In relatively high-density flows, such as the metastable and high-density phases, we found structures that correspond to either n-person prisoner dilemma (n-PD) games or quasi-PD games. In these situations, lane changes by D-agents create heavy traffic jams that reduce social efficiency. (paper)

  8. Impact of Bimodal Traffic on Latency in Optical Burst Switching Networks

    Directory of Open Access Journals (Sweden)

    Yuhua Chen

    2008-01-01

    Full Text Available This paper analyzes the impact of bimodal traffic composition on latency in optical burst switching networks. In particular, it studies the performance degradation to short-length packets caused by longer packets, both of which are part of a heterogeneous traffic model. The paper defines a customer satisfaction index for each of the classes of traffic, and a composite satisfaction index. The impact of higher overall utilization of the network as well as that of the ratio of the traffic mix on each of the customer satisfaction indices is specifically addressed.

  9. Power Consumption Evaluation of Distributed Computing Network Considering Traffic Locality

    Science.gov (United States)

    Ogawa, Yukio; Hasegawa, Go; Murata, Masayuki

    When computing resources are consolidated in a few huge data centers, a massive amount of data is transferred to each data center over a wide area network (WAN). This results in increased power consumption in the WAN. A distributed computing network (DCN), such as a content delivery network, can reduce the traffic from/to the data center, thereby decreasing the power consumed in the WAN. In this paper, we focus on the energy-saving aspect of the DCN and evaluate its effectiveness, especially considering traffic locality, i.e., the amount of traffic related to the geographical vicinity. We first formulate the problem of optimizing the DCN power consumption and describe the DCN in detail. Then, numerical evaluations show that, when there is strong traffic locality and the router has ideal energy proportionality, the system's power consumption is reduced to about 50% of the power consumed in the case where a DCN is not used; moreover, this advantage becomes even larger (up to about 30%) when the data center is located farthest from the center of the network topology.

  10. Modeling self-consistent multi-class dynamic traffic flow

    Science.gov (United States)

    Cho, Hsun-Jung; Lo, Shih-Ching

    2002-09-01

    In this study, we present a systematic self-consistent multiclass multilane traffic model derived from the vehicular Boltzmann equation and the traffic dispersion model. The multilane domain is considered as a two-dimensional space and the interaction among vehicles in the domain is described by a dispersion model. The reason we consider a multilane domain as a two-dimensional space is that the driving behavior of road users may not be restricted by lanes, especially motorcyclists. The dispersion model, which is a nonlinear Poisson equation, is derived from the car-following theory and the equilibrium assumption. Under the concept that all kinds of users share the finite section, the density is distributed on a road by the dispersion model. In addition, the dynamic evolution of the traffic flow is determined by the systematic gas-kinetic model derived from the Boltzmann equation. Multiplying Boltzmann equation by the zeroth, first- and second-order moment functions, integrating both side of the equation and using chain rules, we can derive continuity, motion and variance equation, respectively. However, the second-order moment function, which is the square of the individual velocity, is employed by previous researches does not have physical meaning in traffic flow. Although the second-order expansion results in the velocity variance equation, additional terms may be generated. The velocity variance equation we propose is derived from multiplying Boltzmann equation by the individual velocity variance. It modifies the previous model and presents a new gas-kinetic traffic flow model. By coupling the gas-kinetic model and the dispersion model, a self-consistent system is presented.

  11. A Minimax Network Flow Model for Characterizing the Impact of Slot Restrictions

    Science.gov (United States)

    Lee, Douglas W.; Patek, Stephen D.; Alexandrov, Natalia; Bass, Ellen J.; Kincaid, Rex K.

    2010-01-01

    This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports.

  12. Accurate Traffic Flow Prediction in Heterogeneous Vehicular Networks in an Intelligent Transport System Using a Supervised Non-Parametric Classifier

    Directory of Open Access Journals (Sweden)

    Hesham El-Sayed

    2018-05-01

    Full Text Available Heterogeneous vehicular networks (HETVNETs evolve from vehicular ad hoc networks (VANETs, which allow vehicles to always be connected so as to obtain safety services within intelligent transportation systems (ITSs. The services and data provided by HETVNETs should be neither interrupted nor delayed. Therefore, Quality of Service (QoS improvement of HETVNETs is one of the topics attracting the attention of researchers and the manufacturing community. Several methodologies and frameworks have been devised by researchers to address QoS-prediction service issues. In this paper, to improve QoS, we evaluate various traffic characteristics of HETVNETs and propose a new supervised learning model to capture knowledge on all possible traffic patterns. This model is a refinement of support vector machine (SVM kernels with a radial basis function (RBF. The proposed model produces better results than SVMs, and outperforms other prediction methods used in a traffic context, as it has lower computational complexity and higher prediction accuracy.

  13. Fragmented network subsystem with traffic filtering for microkernel environment

    Directory of Open Access Journals (Sweden)

    Anna Urievna Budkina

    2016-06-01

    Full Text Available The TCP/IP stack in a microkernel operating system executed in a user space, which requires the development of a distributed network infrastructure within a single software environment. Its functions are the organization of interaction between the components of the stack with different processes, as well as the organization of filtering mechanisms and routing of internal network traffic. Use of architectural approaches applicable in monolithic-modular systems is impossible, because the network stack is not a shareable component of the system. As a consequence, the microkernel environment requires development of special network subsystem. In this work we provide overview of major conceptions of network architectures in microkernel environments. Also, we provide own architecture which supports filtering of internal network traffic. We evaluate the architecture by development of high-performance "key-value" store.

  14. Modeling, Identification, Estimation, and Simulation of Urban Traffic Flow in Jakarta and Bandung

    Directory of Open Access Journals (Sweden)

    Herman Y. Sutarto

    2015-06-01

    Full Text Available This paper presents an overview of urban traffic flow from the perspective of system theory and stochastic control. The topics of modeling, identification, estimation and simulation techniques are evaluated and validated using actual traffic flow data from the city of Jakarta and Bandung, Indonesia, and synthetic data generated from traffic micro-simulator VISSIM. The results on particle filter (PF based state estimation and Expectation-Maximization (EM based parameter estimation (identification confirm the proposed model gives satisfactory results that capture the variation of urban traffic flow. The combination of the technique and the simulator platform assembles possibility to develop a real-time traffic light controller.  

  15. Software defined multi-OLT passive optical network for flexible traffic allocation

    Science.gov (United States)

    Zhang, Shizong; Gu, Rentao; Ji, Yuefeng; Zhang, Jiawei; Li, Hui

    2016-10-01

    With the rapid growth of 4G mobile network and vehicular network services mobile terminal users have increasing demand on data sharing among different radio remote units (RRUs) and roadside units (RSUs). Meanwhile, commercial video-streaming, video/voice conference applications delivered through peer-to-peer (P2P) technology are still keep on stimulating the sharp increment of bandwidth demand in both business and residential subscribers. However, a significant issue is that, although wavelength division multiplexing (WDM) and orthogonal frequency division multiplexing (OFDM) technology have been proposed to fulfil the ever-increasing bandwidth demand in access network, the bandwidth of optical fiber is not unlimited due to the restriction of optical component properties and modulation/demodulation technology, and blindly increase the wavelength cannot meet the cost-sensitive characteristic of the access network. In this paper, we propose a software defined multi-OLT PON architecture to support efficient scheduling of access network traffic. By introducing software defined networking technology and wavelength selective switch into TWDM PON system in central office, multiple OLTs can be considered as a bandwidth resource pool and support flexible traffic allocation for optical network units (ONUs). Moreover, under the configuration of the control plane, ONUs have the capability of changing affiliation between different OLTs under different traffic situations, thus the inter-OLT traffic can be localized and the data exchange pressure of the core network can be released. Considering this architecture is designed to be maximum following the TWDM PON specification, the existing optical distribution network (ODN) investment can be saved and conventional EPON/GPON equipment can be compatible with the proposed architecture. What's more, based on this architecture, we propose a dynamic wavelength scheduling algorithm, which can be deployed as an application on control plane

  16. Adaptive traffic control systems for urban networks

    Directory of Open Access Journals (Sweden)

    Radivojević Danilo

    2017-01-01

    Full Text Available Adaptive traffic control systems represent complex, but powerful tool for improvement of traffic flow conditions in locations or zones where applied. Many traffic agencies, especially those that have a large number of signalized intersections with high variability of the traffic demand, choose to apply some of the adaptive traffic control systems. However, those systems are manufactured and offered by multiple vendors (companies that are competing for the market share. Due to that fact, besides the information available from the vendors themselves, or the information from different studies conducted on different continents, very limited amount of information is available about the details how those systems are operating. The reason for that is the protecting of the intellectual property from plagiarism. The primary goal of this paper is to make a brief analysis of the functionalities, characteristics, abilities and results of the most recognized, but also less known adaptive traffic control systems to the professional public and other persons with interest in this subject.

  17. Inter-flow and intra-flow interference mitigation routing in wireless mesh networks

    OpenAIRE

    Houaidia, Chiraz; Idoudi, Hanen; Van den Bossche, Adrien; Saidane, Leila; Val, Thierry

    2017-01-01

    In this paper, we address the problem of QoS support in an heterogeneous multi-rate wireless mesh network. We propose a new routing metric that provides information about link quality, based on PHY and MAC characteristics, including the link availability, the loss rate and the available bandwidth. This metric allows to apprehend inter-flow interferences and avoid bottleneck formation by balancing traffic load on the links. Based on the conflict graph model and calculation of maximal cliques, ...

  18. FLOW PATTERNS OF VEHICULAR TRAFFIC ALONG HIGHWAY TOLL PLAZA IN OGUN STATE

    Directory of Open Access Journals (Sweden)

    Bashiru A. Raji

    2009-06-01

    Full Text Available Congestion on our highways, freeways and arterials are increasing at an alarming rate. This occurs because there is an increase in vehicular growth without a corresponding increase in road size, and this has made free flow of traffic a preponderant problem in our highways. Toll plaza causes delay on our highways and results are formation of queue. This paper examined how simple queuing model can be used to determine traffic intensity and the flow pattern of car traffic at a toll plaza. The study was carried out with twelve field assistants at Ogere toll plaza in Ogun State. Findings show a significant variation in the degree of hourly traffic intensities at the four pay points for cars at the toll plaza. However, variation in the daily traffic intensities at the four pay points for cars showed no significant variation. The study also revealed that bumps constructed to check vehicles speed, hawker’s trading activities are among other factors that constitute hindrance to free flow of traffic other than service time and inter-arrival time of cars at the toll plaza. It is therefore recommended that appropriate authority should look into these factors and take necessary steps towards ensuring free flow of traffic at the plaza.

  19. Study on network traffic forecast model of SVR optimized by GAFSA

    International Nuclear Information System (INIS)

    Liu, Yuan; Wang, RuiXue

    2016-01-01

    There are some problems, such as low precision, on existing network traffic forecast model. In accordance with these problems, this paper proposed the network traffic forecast model of support vector regression (SVR) algorithm optimized by global artificial fish swarm algorithm (GAFSA). GAFSA constitutes an improvement of artificial fish swarm algorithm, which is a swarm intelligence optimization algorithm with a significant effect of optimization. The optimum training parameters used for SVR could be calculated by optimizing chosen parameters, which would make the forecast more accurate. With the optimum training parameters searched by GAFSA algorithm, a model of network traffic forecast, which greatly solved problems of great errors in SVR improved by others intelligent algorithms, could be built with the forecast result approaching stability and the increased forecast precision. The simulation shows that, compared with other models (e.g. GA-SVR, CPSO-SVR), the forecast results of GAFSA-SVR network traffic forecast model is more stable with the precision improved to more than 89%, which plays an important role on instructing network control behavior and analyzing security situation.

  20. Advancing Traffic Flow Theory Using Empirical Microscopic Data

    Science.gov (United States)

    2015-01-01

    As reviewed in Section 1.1, much of traffic flow theory depends a fundamental relationship (FR) between flow, density, and space mean speed; either explicitly, e.g., hydrodynamic models such as LWR (Lighthill and Whitham, 1955, and Richards, 1956) or...

  1. Traffic flow behavior at a single-lane urban roundabout

    Science.gov (United States)

    Lakouari, N.; Oubram, O.; Ez-Zahraouy, H.; Cisneros-Villalobos, L.; Velásquez-Aguilar, J. G.

    In this paper, we propose a stochastic cellular automata model to study the traffic behavior at a single-lane roundabout. Vehicles can enter the interior lane or exit from it via N intersecting lane, the boundary conditions are stochastic. The traffic is controlled by a self-organized scheme. It has turned out that depending on the rules of insertion to the roundabout, five distinct traffic phases can appear, namely, free flow, congestion, maximum current, jammed and gridlock. The transition between the free flow and the gridlock is forbidden. The density profiles are used to study the traffic pattern at the interior lane of the roundabout. In order to quantify the interactions between vehicles in the interior lane of the roundabout, the velocity correlation coefficient (VCC) is also studied. Besides, the spatiotemporal diagrams corresponding to the entry/exit lanes are derived numerically. Furthermore, we have investigated the effect of displaying signal (PIn), as the PIn decreases, the maximum current increases at the expense of the free flow and the jamming phase. Finally, we have investigated the effect of the braking probability P on the interior lane of the roundabout. We have found that the increase of P raises the spontaneous jam formation on the ring. Thus, enlarges the maximum current and the jamming phase while the free flow phase decreases.

  2. Behavioral Profiling of Scada Network Traffic Using Machine Learning Algorithms

    Science.gov (United States)

    2014-03-27

    Acquisition ( SCADA ) System Overview SCADA systems control and monitor processes for water distribution, oil and natural gas pipelines , electrical...the desire for remote control and monitoring of industrial processes. The ability to identify SCADA devices on a mixed traffic network with zero...optimal attribute subset, while maintaining the desired TPR of .99 for SCADA network traffic. The attributes and ML algorithms chosen for

  3. A mixed-mode traffic assignment model with new time-flow impedance function

    Science.gov (United States)

    Lin, Gui-Hua; Hu, Yu; Zou, Yuan-Yang

    2018-01-01

    Recently, with the wide adoption of electric vehicles, transportation network has shown different characteristics and been further developed. In this paper, we present a new time-flow impedance function, which may be more realistic than the existing time-flow impedance functions. Based on this new impedance function, we present an optimization model for a mixed-mode traffic network in which battery electric vehicles (BEVs) and gasoline vehicles (GVs) are chosen. We suggest two approaches to handle the model: One is to use the interior point (IP) algorithm and the other is to employ the sequential quadratic programming (SQP) algorithm. Three numerical examples are presented to illustrate the efficiency of these approaches. In particular, our numerical results show that more travelers prefer to choosing BEVs when the distance limit of BEVs is long enough and the unit operating cost of GVs is higher than that of BEVs, and the SQP algorithm is faster than the IP algorithm.

  4. The impact of traffic-flow patterns on air quality in urban street canyons.

    Science.gov (United States)

    Thaker, Prashant; Gokhale, Sharad

    2016-01-01

    We investigated the effect of different urban traffic-flow patterns on pollutant dispersion in different winds in a real asymmetric street canyon. Free-flow traffic causes more turbulence in the canyon facilitating more dispersion and a reduction in pedestrian level concentration. The comparison of with and without a vehicle-induced-turbulence revealed that when winds were perpendicular, the free-flow traffic reduced the concentration by 73% on the windward side with a minor increase of 17% on the leeward side, whereas for parallel winds, it reduced the concentration by 51% and 29%. The congested-flow traffic increased the concentrations on the leeward side by 47% when winds were perpendicular posing a higher risk to health, whereas reduced it by 17-42% for parallel winds. The urban air quality and public health can, therefore, be improved by improving the traffic-flow patterns in street canyons as vehicle-induced turbulence has been shown to contribute significantly to dispersion. Copyright © 2015 Elsevier Ltd. All rights reserved.

  5. Network analysis of patient flow in two UK acute care hospitals identifies key sub-networks for A&E performance.

    Science.gov (United States)

    Bean, Daniel M; Stringer, Clive; Beeknoo, Neeraj; Teo, James; Dobson, Richard J B

    2017-01-01

    The topology of the patient flow network in a hospital is complex, comprising hundreds of overlapping patient journeys, and is a determinant of operational efficiency. To understand the network architecture of patient flow, we performed a data-driven network analysis of patient flow through two acute hospital sites of King's College Hospital NHS Foundation Trust. Administration databases were queried for all intra-hospital patient transfers in an 18-month period and modelled as a dynamic weighted directed graph. A 'core' subnetwork containing only 13-17% of all edges channelled 83-90% of the patient flow, while an 'ephemeral' network constituted the remainder. Unsupervised cluster analysis and differential network analysis identified sub-networks where traffic is most associated with A&E performance. Increased flow to clinical decision units was associated with the best A&E performance in both sites. The component analysis also detected a weekend effect on patient transfers which was not associated with performance. We have performed the first data-driven hypothesis-free analysis of patient flow which can enhance understanding of whole healthcare systems. Such analysis can drive transformation in healthcare as it has in industries such as manufacturing.

  6. Vehicular traffic flow at an intersection with the possibility of turning

    International Nuclear Information System (INIS)

    Foulaadvand, M Ebrahim; Belbasi, Somayyeh

    2011-01-01

    We have developed a Nagel-Schreckenberg cellular automata model for describing a vehicular traffic flow at a single intersection. A set of traffic lights operating in a fixed-time scheme controls the traffic flow. An open boundary condition is applied to the streets each of which conducts a unidirectional flow. Streets are single lane and cars can turn upon reaching to the intersection with prescribed probabilities. Extensive Monte Carlo simulations are carried out to find the model flow characteristics. In particular, we investigate the flow dependence on signalization parameters, turning probabilities and input rates. It is shown that for each set of parameters, there exists a plateau region inside which the total outflow from the intersection remains almost constant. We also compute total waiting time of vehicles per cycle behind red lights for various control parameters.

  7. DECISION WITH ARTIFICIAL NEURAL NETWORKS IN DISCRETE EVENT SIMULATION MODELS ON A TRAFFIC SYSTEM

    Directory of Open Access Journals (Sweden)

    Marília Gonçalves Dutra da Silva

    2016-04-01

    Full Text Available ABSTRACT This work aims to demonstrate the use of a mechanism to be applied in the development of the discrete-event simulation models that perform decision operations through the implementation of an artificial neural network. Actions that involve complex operations performed by a human agent in a process, for example, are often modeled in simplified form with the usual mechanisms of simulation software. Therefore, it was chosen a traffic system controlled by a traffic officer with a flow of vehicles and pedestrians to demonstrate the proposed solution. From a module built in simulation software itself, it was possible to connect the algorithm for intelligent decision to the simulation model. The results showed that the model elaborated responded as expected when it was submitted to actions, which required different decisions to maintain the operation of the system with changes in the flow of people and vehicles.

  8. Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management.

    Science.gov (United States)

    Cruz-Piris, Luis; Rivera, Diego; Fernandez, Susel; Marsa-Maestre, Ivan

    2018-02-02

    One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network.

  9. Traffic Management as a Service: The Traffic Flow Pattern Classification Problem

    Directory of Open Access Journals (Sweden)

    Carlos T. Calafate

    2015-01-01

    Full Text Available Intelligent Transportation System (ITS technologies can be implemented to reduce both fuel consumption and the associated emission of greenhouse gases. However, such systems require intelligent and effective route planning solutions to reduce travel time and promote stable traveling speeds. To achieve such goal these systems should account for both estimated and real-time traffic congestion states, but obtaining reliable traffic congestion estimations for all the streets/avenues in a city for the different times of the day, for every day in a year, is a complex task. Modeling such a tremendous amount of data can be time-consuming and, additionally, centralized computation of optimal routes based on such time-dependencies has very high data processing requirements. In this paper we approach this problem through a heuristic to considerably reduce the modeling effort while maintaining the benefits of time-dependent traffic congestion modeling. In particular, we propose grouping streets by taking into account real traces describing the daily traffic pattern. The effectiveness of this heuristic is assessed for the city of Valencia, Spain, and the results obtained show that it is possible to reduce the required number of daily traffic flow patterns by a factor of 4210 while maintaining the essence of time-dependent modeling requirements.

  10. EVALUATION OF HUMAN SETTLEMENT INFLUENCE ON SUBURBAN TRAFFIC FLOW DENSITY

    Directory of Open Access Journals (Sweden)

    P. Horbachov

    2017-06-01

    Full Text Available Study results of the human settlement influence on the traffic flow density in suburban service of international, national and regional roads of Ukraine are presented. The possibility of an adequate description of suburban traffic flows in the vicinity of large cities is established, depending on the city population and link remoteness from the city center. The possibility is determined on the basis of obtained models to define the prognosis value of the intensity and specific maintenance of freight and passenger transport flows.

  11. Traffic Rules in Electronic Financial Transactions (EFT Networks

    Directory of Open Access Journals (Sweden)

    Vedran Batoš

    2002-01-01

    Full Text Available This paper presents the traffic rules in the EFT (ElectronicFinancial Transactions networks, based on the implementationof the solution called Gold-Net developed and implementedby Euronet Worldwide Inc. Following the traffic rulesin EFT networks, out of its worldwide experience, Gold-Netevolved a comprehensive and expandable EFT network solutiondesigned to meet an institution's needs today and in the future.It is an ITM (Integrated Transaction Management solution,modular and expandable, and consists of a comprehensiveEFT software modules with ATM and POS driving capabilities.The combination of ATM management and the onlineconnection form the intercept processing control module. Asthe marketplace grows, this solution ensures that an ente1prisemay position itself for future growth and expanded service offerings.

  12. Multilevel Bloom Filters for P2P Flows Identification Based on Cluster Analysis in Wireless Mesh Network

    Directory of Open Access Journals (Sweden)

    Xia-an Bi

    2015-01-01

    Full Text Available With the development of wireless mesh networks and distributed computing, lots of new P2P services have been deployed and enrich the Internet contents and applications. The rapid growth of P2P flows brings great pressure to the regular network operation. So the effective flow identification and management of P2P applications become increasingly urgent. In this paper, we build a multilevel bloom filters data structure to identify the P2P flows through researches on the locality characteristics of P2P flows. Different level structure stores different numbers of P2P flow rules. According to the characteristics values of the P2P flows, we adjust the parameters of the data structure of bloom filters. The searching steps of the scheme traverse from the first level to the last level. Compared with the traditional algorithms, our method solves the drawbacks of previous schemes. The simulation results demonstrate that our algorithm effectively enhances the performance of P2P flows identification. Then we deploy our flow identification algorithm in the traffic monitoring sensors which belong to the network traffic monitoring system at the export link in the campus network. In the real environment, the experiment results demonstrate that our algorithm has a fast speed and high accuracy to identify the P2P flows; therefore, it is suitable for actual deployment.

  13. Dynamic route guidance strategy in a two-route pedestrian-vehicle mixed traffic flow system

    Science.gov (United States)

    Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

    2016-05-01

    With the rapid development of transportation, traffic questions have become the major issue for social, economic and environmental aspects. Especially, during serious emergencies, it is very important to alleviate road traffic congestion and improve the efficiency of evacuation to reduce casualties, and addressing these problems has been a major task for the agencies responsible in recent decades. Advanced road guidance strategies have been developed for homogeneous traffic flows, or to reduce traffic congestion and enhance the road capacity in a symmetric two-route scenario. However, feedback strategies have rarely been considered for pedestrian-vehicle mixed traffic flows with variable velocities and sizes in an asymmetric multi-route traffic system, which is a common phenomenon in many developing countries. In this study, we propose a weighted road occupancy feedback strategy (WROFS) for pedestrian-vehicle mixed traffic flows, which considers the system equilibrium to ease traffic congestion. In order to more realistic simulating the behavior of mixed traffic objects, the paper adopted a refined and dynamic cellular automaton model (RDPV_CA model) as the update mechanism for pedestrian-vehicle mixed traffic flow. Moreover, a bounded rational threshold control was introduced into the feedback strategy to avoid some negative effect of delayed information and reduce. Based on comparisons with the two previously proposed strategies, the simulation results obtained in a pedestrian-vehicle traffic flow scenario demonstrated that the proposed strategy with a bounded rational threshold was more effective and system equilibrium, system stability were reached.

  14. Congestion transition in air traffic networks.

    Directory of Open Access Journals (Sweden)

    Bernardo Monechi

    Full Text Available Air Transportation represents a very interesting example of a complex techno-social system whose importance has considerably grown in time and whose management requires a careful understanding of the subtle interplay between technological infrastructure and human behavior. Despite the competition with other transportation systems, a growth of air traffic is still foreseen in Europe for the next years. The increase of traffic load could bring the current Air Traffic Network above its capacity limits so that safety standards and performances might not be guaranteed anymore. Lacking the possibility of a direct investigation of this scenario, we resort to computer simulations in order to quantify the disruptive potential of an increase in traffic load. To this end we model the Air Transportation system as a complex dynamical network of flights controlled by humans who have to solve potentially dangerous conflicts by redirecting aircraft trajectories. The model is driven and validated through historical data of flight schedules in a European national airspace. While correctly reproducing actual statistics of the Air Transportation system, e.g., the distribution of delays, the model allows for theoretical predictions. Upon an increase of the traffic load injected in the system, the model predicts a transition from a phase in which all conflicts can be successfully resolved, to a phase in which many conflicts cannot be resolved anymore. We highlight how the current flight density of the Air Transportation system is well below the transition, provided that controllers make use of a special re-routing procedure. While the congestion transition displays a universal scaling behavior, its threshold depends on the conflict solving strategy adopted. Finally, the generality of the modeling scheme introduced makes it a flexible general tool to simulate and control Air Transportation systems in realistic and synthetic scenarios.

  15. Congestion transition in air traffic networks.

    Science.gov (United States)

    Monechi, Bernardo; Servedio, Vito D P; Loreto, Vittorio

    2015-01-01

    Air Transportation represents a very interesting example of a complex techno-social system whose importance has considerably grown in time and whose management requires a careful understanding of the subtle interplay between technological infrastructure and human behavior. Despite the competition with other transportation systems, a growth of air traffic is still foreseen in Europe for the next years. The increase of traffic load could bring the current Air Traffic Network above its capacity limits so that safety standards and performances might not be guaranteed anymore. Lacking the possibility of a direct investigation of this scenario, we resort to computer simulations in order to quantify the disruptive potential of an increase in traffic load. To this end we model the Air Transportation system as a complex dynamical network of flights controlled by humans who have to solve potentially dangerous conflicts by redirecting aircraft trajectories. The model is driven and validated through historical data of flight schedules in a European national airspace. While correctly reproducing actual statistics of the Air Transportation system, e.g., the distribution of delays, the model allows for theoretical predictions. Upon an increase of the traffic load injected in the system, the model predicts a transition from a phase in which all conflicts can be successfully resolved, to a phase in which many conflicts cannot be resolved anymore. We highlight how the current flight density of the Air Transportation system is well below the transition, provided that controllers make use of a special re-routing procedure. While the congestion transition displays a universal scaling behavior, its threshold depends on the conflict solving strategy adopted. Finally, the generality of the modeling scheme introduced makes it a flexible general tool to simulate and control Air Transportation systems in realistic and synthetic scenarios.

  16. The Development of the Multi-Center Traffic Management Advisor (MCTMA): Traffic Flow Management Research in a Multi-Facility Environment

    Science.gov (United States)

    Lee, Katharine K.; Davis, Thomas J.; Levin, Kerry M.; Rowe, Dennis W.

    2001-01-01

    The Traffic Management Advisor (TMA) is a decision-support tool for traffic managers and air traffic controllers that provides traffic flow visualization and other flow management tools. TMA creates an efficiently sequenced and safely spaced schedule for arrival traffic that meets but does not exceed specified airspace system constraints. TMA is being deployed at selected facilities throughout the National Airspace System in the US as part of the FAA's Free Flight Phase 1 program. TMA development and testing, and its current deployment, focuses on managing the arrival capacity for single major airports within single terminal areas and single en route centers. The next phase of development for this technology is the expansion of the TMA capability to complex facilities in which a terminal area or airport is fed by multiple en route centers, thus creating a multicenter TMA functionality. The focus of the multi-center TMA (McTMA) development is on the busy facilities in the Northeast comdor of the US. This paper describes the planning and development of McTMA and the challenges associated with adapting a successful traffic flow management tool for a very complex airspace.

  17. Simple cellular automaton model for traffic breakdown, highway capacity, and synchronized flow

    Science.gov (United States)

    Kerner, Boris S.; Klenov, Sergey L.; Schreckenberg, Michael

    2011-10-01

    We present a simple cellular automaton (CA) model for two-lane roads explaining the physics of traffic breakdown, highway capacity, and synchronized flow. The model consists of the rules “acceleration,” “deceleration,” “randomization,” and “motion” of the Nagel-Schreckenberg CA model as well as “overacceleration through lane changing to the faster lane,” “comparison of vehicle gap with the synchronization gap,” and “speed adaptation within the synchronization gap” of Kerner's three-phase traffic theory. We show that these few rules of the CA model can appropriately simulate fundamental empirical features of traffic breakdown and highway capacity found in traffic data measured over years in different countries, like characteristics of synchronized flow, the existence of the spontaneous and induced breakdowns at the same bottleneck, and associated probabilistic features of traffic breakdown and highway capacity. Single-vehicle data derived in model simulations show that synchronized flow first occurs and then self-maintains due to a spatiotemporal competition between speed adaptation to a slower speed of the preceding vehicle and passing of this slower vehicle. We find that the application of simple dependences of randomization probability and synchronization gap on driving situation allows us to explain the physics of moving synchronized flow patterns and the pinch effect in synchronized flow as observed in real traffic data.

  18. SMART VIDEO SURVEILLANCE SYSTEM FOR VEHICLE DETECTION AND TRAFFIC FLOW CONTROL

    Directory of Open Access Journals (Sweden)

    A. A. SHAFIE

    2011-08-01

    Full Text Available Traffic signal light can be optimized using vehicle flow statistics obtained by Smart Video Surveillance Software (SVSS. This research focuses on efficient traffic control system by detecting and counting the vehicle numbers at various times and locations. At present, one of the biggest problems in the main city in any country is the traffic jam during office hour and office break hour. Sometimes it can be seen that the traffic signal green light is still ON even though there is no vehicle coming. Similarly, it is also observed that long queues of vehicles are waiting even though the road is empty due to traffic signal light selection without proper investigation on vehicle flow. This can be handled by adjusting the vehicle passing time implementing by our developed SVSS. A number of experiment results of vehicle flows are discussed in this research graphically in order to test the feasibility of the developed system. Finally, adoptive background model is proposed in SVSS in order to successfully detect target objects such as motor bike, car, bus, etc.

  19. Analysis and Classification of Traffic in Wireless Sensor Network

    National Research Council Canada - National Science Library

    Beng, Wang W

    2007-01-01

    .... Specifically, this thesis studied the traffic generated by wireless sensor networks by setting up two different commonly used network topologies, namely a direct connection to the base and a daisy...

  20. Nonlinearity and chaos in wireless network traffic

    International Nuclear Information System (INIS)

    Mukherjee, Somenath; Ray, Rajdeep; Samanta, Rajkumar; Khondekar, Mofazzal H.; Sanyal, Goutam

    2017-01-01

    The natural complexity of wireless mobile network traffic dynamics has been assessed in this article by tracing the presence of nonlinearity and chaos in the profile of daily peak hour call arrival and daily call drop of a sub-urban local mobile switching centre. The tools like Recurrence Plot and Recurrence Quantification Analysis (RQA) has been used to reveal the probable presence of non-stationarity, nonlinearity and chaosity in the network traffic. Information Entropy (IE) and 0–1 test have been employed to provide the quantitative support to the findings. Both the daily peak hour call arrival profile and the daily call drop profile exhibit non-stationarity, determinism and nonlinearity with the former one being more regular while the later one is chaotic.

  1. Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management

    Directory of Open Access Journals (Sweden)

    Luis Cruz-Piris

    2018-02-01

    Full Text Available One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network.

  2. A Continuous Dynamic Traffic Assignment Model From Plate Scanning Technique

    Energy Technology Data Exchange (ETDEWEB)

    Rivas, A.; Gallego, I.; Sanchez-Cambronero, S.; Ruiz-Ripoll, L.; Barba, R.M.

    2016-07-01

    This paper presents a methodology for the dynamic estimation of traffic flows on all links of a network from observable field data assuming the first-in-first-out (FIFO) hypothesis. The traffic flow intensities recorded at the exit of the scanned links are propagated to obtain the flow waves on unscanned links. For that, the model calculates the flow-cost functions through information registered with the plate scanning technique. The model also responds to the concern about the parameter quality of flow-cost functions to replicate the real traffic flow behaviour. It includes a new algorithm for the adjustment of the parameter values to link characteristics when its quality is questionable. For that, it is necessary the a priori study of the location of the scanning devices to identify all path flows and to measure travel times in all links. A synthetic network is used to illustrate the proposed method and to prove its usefulness and feasibility. (Author)

  3. Delay Bound: Fractal Traffic Passes through Network Servers

    Directory of Open Access Journals (Sweden)

    Ming Li

    2013-01-01

    Full Text Available Delay analysis plays a role in real-time systems in computer communication networks. This paper gives our results in the aspect of delay analysis of fractal traffic passing through servers. There are three contributions presented in this paper. First, we will explain the reasons why conventional theory of queuing systems ceases in the general sense when arrival traffic is fractal. Then, we will propose a concise method of delay computation for hard real-time systems as shown in this paper. Finally, the delay computation of fractal traffic passing through severs is presented.

  4. CoreFlow: Enriching Bro security events using network traffic monitoring data

    NARCIS (Netherlands)

    Koning, R.; Buraglio, N.; de Laat, C.; Grosso, P.

    Attacks against network infrastructures can be detected by Intrusion Detection Systems (IDS). Still reaction to these events are often limited by the lack of larger contextual information in which they occurred. In this paper we present CoreFlow, a framework for the correlation and enrichment of IDS

  5. Analysis on the Correlation of Traffic Flow in Hainan Province Based on Baidu Search

    Science.gov (United States)

    Chen, Caixia; Shi, Chun

    2018-03-01

    Internet search data records user’s search attention and consumer demand, providing necessary database for the Hainan traffic flow model. Based on Baidu Index, with Hainan traffic flow as example, this paper conduct both qualitative and quantitative analysis on the relationship between search keyword from Baidu Index and actual Hainan tourist traffic flow, and build multiple regression model by SPSS.

  6. Traffic Route Guidance using Feedback of Predicted Travel Times : Improving Travel Times in the Berlin Traffic Network

    OpenAIRE

    Bergsten, Arvid; Zetterberg, Daniel

    2008-01-01

    Traffic congestions constitute a problem in many large cities. Congestions can be handled by reducing the network demand, expanding the infrastructure, or by utilizing the road network more efficiently. This master thesis presents a methodology for route guidance, based on automatic feedback control from the current traffic situation. Through variable direction signs or individual in-car devices, all vehicles with a certain origin and destination (which are both normally intermediate) are gui...

  7. Detecting Anomaly in Traffic Flow from Road Similarity Analysis

    KAUST Repository

    Liu, Xinran

    2016-06-02

    Taxies equipped with GPS devices are considered as 24-hour moving sensors widely distributed in urban road networks. Plenty of accurate and realtime trajectories of taxi are recorded by GPS devices and are commonly studied for understanding traffic dynamics. This paper focuses on anomaly detection in traffic volume, especially the non-recurrent traffic anomaly caused by unexpected or transient incidents, such as traffic accidents, celebrations and disasters. It is important to detect such sharp changes of traffic status for sensing abnormal events and planning their impact on the smooth volume of traffic. Unlike existing anomaly detection approaches that mainly monitor the derivation of current traffic status from history in the past, the proposed method in this paper evaluates the abnormal score of traffic on one road by comparing its current traffic volume with not only its historical data but also its neighbors. We define the neighbors as the roads that are close in sense of both geo-location and traffic patterns, which are extracted by matrix factorization. The evaluation results on trajectories data of 12,286 taxies over four weeks in Beijing show that our approach outperforms other baseline methods with higher precision and recall.

  8. Day-to-day evolution of the traffic network with Advanced Traveler Information System

    International Nuclear Information System (INIS)

    Han Linghui; Sun Huijun; Wu Jianjun; Zhu Chengjuan

    2011-01-01

    Highlights: → We develop a dynamical system with Advanced Travelers Information System (ATIS). → We use the dynamical system to study stability of the traffic network with ATIS. → It is found that some periodic attractors appear in some cases. → A road pricing is implemented to alleviate the instability of the traffic network with ATIS. - Abstract: Since the notion of user equilibrium (UE) was proposed by Wardrop , it has become a cornerstone for traffic assignment analysis. But, it is not sufficient to only ask whether equilibrium exists or not; it is equally important to ask whether and how the system can achieve equilibrium. Meanwhile, stability is an important performance in the sense that if equilibrium is unsustainable, both the equilibrium and the trajectory are sensitive to disturbances, even a small perturbation will result in the system evolution away from the equilibrium point. These incentive a growing interest in day-to-day dynamics. In this paper, we develop a dynamical system with Advanced Traveler Information System (ATIS) and study the stability of the network with ATIS. A simple network is used to simulate the model, and the results show that there exist periodic attractors in the traffic network in some cases (for example, the market penetration level of ATIS is 0.25 and traffic demand is 2 unit). It is found that the logit parameter of the dynamical model and the traffic demand can also affect the stability of the traffic network. More periodic attractors appear in the system when the traffic demand is large and the low logit parameter can delay the appearance of periodic attractors. By simulation, it can be concluded that if the range of the periodic attractors' domain of the simple network is known, the road pricing based on the range of the attraction domain is effective to alleviate the instability of the system.

  9. A cellular automata model of traffic flow with variable probability of randomization

    International Nuclear Information System (INIS)

    Zheng Wei-Fan; Zhang Ji-Ye

    2015-01-01

    Research on the stochastic behavior of traffic flow is important to understand the intrinsic evolution rules of a traffic system. By introducing an interactional potential of vehicles into the randomization step, an improved cellular automata traffic flow model with variable probability of randomization is proposed in this paper. In the proposed model, the driver is affected by the interactional potential of vehicles before him, and his decision-making process is related to the interactional potential. Compared with the traditional cellular automata model, the modeling is more suitable for the driver’s random decision-making process based on the vehicle and traffic situations in front of him in actual traffic. From the improved model, the fundamental diagram (flow–density relationship) is obtained, and the detailed high-density traffic phenomenon is reproduced through numerical simulation. (paper)

  10. Cooperative driving in mixed traffic networks - Optimizing for performance

    NARCIS (Netherlands)

    Calvert, S.C.; Broek, T.H.A. van den; Noort, M. van

    2012-01-01

    This paper discusses a cooperative adaptive cruise control application and its effects on the traffic system. In previous work this application has been tested on the road, and traffic simulation has been used to scale up the results of the field test to larger networks and more vehicles. The

  11. THE METHODS OF TRAFFIC ENGINEERING’S OPTIMIZATION IN CASE OF DATA TRANSFER BY TWO ROUTS

    Directory of Open Access Journals (Sweden)

    Vera Petrovna Khoborova

    2018-05-01

    Full Text Available To prevent congestion in certain sections of multi-service networks, data flow management, which leads to a more proportional distribution of resources and improved network functioning, is implemented. The task of selecting routes for individual data streams (traffic class, taking into account requirements of QoS, is solved by the methods of traffic engineering. With the help of these methods, it is strived to load all the network resources maximally and balanced, so that the network, with a given level of service quality, has high total capacity as much as possible. However, at the present time, there are no rigorous well-founded solutions for the problem of distributing data flows between the selected routes, taking into account the possibility of additional control over their capacity. The article proposes a method for optimizing the distribution of data flows and the bandwidth of the channels (routes used in each separate information direction, with different coordination of control actions at adjacent levels of the network architecture. We consider scientific and technical proposals for the implementation of the developed method as part of the mechanisms that implement the traffic engineering in modern multiservice networks. Purpose: increasing the efficiency of the multiservice network by optimizing the traffic engineering. Methodology in article analytical methods for solving optimization problems with a non-linear objective function and linear constraints are used. Results: analytical expressions were obtained for the optimal distribution of data flows and bandwidth of the used channels, which provides the minimum values of delay indicators, and the use of these expressions in calculations in the mechanisms of traffic engineering was suggested. Practical implications: the obtained results should be used in modern multiservice networks, which are implemented data flow management through the traffic engineering in order to improve the

  12. Efficient traffic grooming with dynamic ONU grouping for multiple-OLT-based access network

    Science.gov (United States)

    Zhang, Shizong; Gu, Rentao; Ji, Yuefeng; Wang, Hongxiang

    2015-12-01

    Fast bandwidth growth urges large-scale high-density access scenarios, where the multiple Passive Optical Networking (PON) system clustered deployment can be adopted as an appropriate solution to fulfill the huge bandwidth demands, especially for a future 5G mobile network. However, the lack of interaction between different optical line terminals (OLTs) results in part of the bandwidth resources waste. To increase the bandwidth efficiency, as well as reduce bandwidth pressure at the edge of a network, we propose a centralized flexible PON architecture based on Time- and Wavelength-Division Multiplexing PON (TWDM PON). It can provide flexible affiliation for optical network units (ONUs) and different OLTs to support access network traffic localization. Specifically, a dynamic ONU grouping algorithm (DGA) is provided to obtain the minimal OLT outbound traffic. Simulation results show that DGA obtains an average 25.23% traffic gain increment under different OLT numbers within a small ONU number situation, and the traffic gain will increase dramatically with the increment of the ONU number. As the DGA can be deployed easily as an application running above the centralized control plane, the proposed architecture can be helpful to improve the network efficiency for future traffic-intensive access scenarios.

  13. High-speed and high-fidelity system and method for collecting network traffic

    Science.gov (United States)

    Weigle, Eric H [Los Alamos, NM

    2010-08-24

    A system is provided for the high-speed and high-fidelity collection of network traffic. The system can collect traffic at gigabit-per-second (Gbps) speeds, scale to terabit-per-second (Tbps) speeds, and support additional functions such as real-time network intrusion detection. The present system uses a dedicated operating system for traffic collection to maximize efficiency, scalability, and performance. A scalable infrastructure and apparatus for the present system is provided by splitting the work performed on one host onto multiple hosts. The present system simultaneously addresses the issues of scalability, performance, cost, and adaptability with respect to network monitoring, collection, and other network tasks. In addition to high-speed and high-fidelity network collection, the present system provides a flexible infrastructure to perform virtually any function at high speeds such as real-time network intrusion detection and wide-area network emulation for research purposes.

  14. Stability of Intelligent Transportation Network Dynamics: A Daily Path Flow Adjustment considering Travel Time Differentiation

    Directory of Open Access Journals (Sweden)

    Ming-Chorng Hwang

    2015-01-01

    Full Text Available A theoretic formulation on how traffic time information distributed by ITS operations influences the trajectory of network flows is presented in this paper. The interactions between users and ITS operator are decomposed into three parts: (i travel time induced path flow dynamics (PFDTT; (ii demand induced path flow dynamics (PFDD; and (iii predicted travel time dynamics for an origin-destination (OD pair (PTTDOD. PFDTT describes the collective results of user’s daily route selection by pairwise comparison of path travel time provided by ITS services. The other two components, PTTDOD and PFDD, are concentrated on the evolutions of system variables which are predicted and observed, respectively, by ITS operators to act as a benchmark in guiding the target system towards an expected status faster. In addition to the delivered modelings, the stability theorem of the equilibrium solution in the sense of Lyapunov stability is also provided. A Lyapunov function is developed and employed to the proof of stability theorem to show the asymptotic behavior of the aimed system. The information of network flow dynamics plays a key role in traffic control policy-making. The evaluation of ITS-based strategies will not be reasonable without a well-established modeling of network flow evolutions.

  15. A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

    Directory of Open Access Journals (Sweden)

    Parisa Bazmi

    2016-11-01

    Full Text Available Named Data Networking (NDN is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN Based Traffic-aware Forwarding strategy (NNTF is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.

  16. Robust Traffic Flow Management: Coevolutionary Approach, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — We will develop a Coevolutionary Decision Support Tool (CDST) that explicitly incorporates weather uncertainty (non-probabilistically) into strategic Traffic Flow...

  17. Agent-Based Collaborative Traffic Flow Management, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — We propose agent-based game-theoretic approaches for simulation of strategies involved in multi-objective collaborative traffic flow management (CTFM). Intelligent...

  18. Clustering and Flow Conservation Monitoring Tool for Software Defined Networks

    Directory of Open Access Journals (Sweden)

    Jesús Antonio Puente Fernández

    2018-04-01

    Full Text Available Prediction systems present some challenges on two fronts: the relation between video quality and observed session features and on the other hand, dynamics changes on the video quality. Software Defined Networks (SDN is a new concept of network architecture that provides the separation of control plane (controller and data plane (switches in network devices. Due to the existence of the southbound interface, it is possible to deploy monitoring tools to obtain the network status and retrieve a statistics collection. Therefore, achieving the most accurate statistics depends on a strategy of monitoring and information requests of network devices. In this paper, we propose an enhanced algorithm for requesting statistics to measure the traffic flow in SDN networks. Such an algorithm is based on grouping network switches in clusters focusing on their number of ports to apply different monitoring techniques. Such grouping occurs by avoiding monitoring queries in network switches with common characteristics and then, by omitting redundant information. In this way, the present proposal decreases the number of monitoring queries to switches, improving the network traffic and preventing the switching overload. We have tested our optimization in a video streaming simulation using different types of videos. The experiments and comparison with traditional monitoring techniques demonstrate the feasibility of our proposal maintaining similar values decreasing the number of queries to the switches.

  19. Clustering and Flow Conservation Monitoring Tool for Software Defined Networks.

    Science.gov (United States)

    Puente Fernández, Jesús Antonio; García Villalba, Luis Javier; Kim, Tai-Hoon

    2018-04-03

    Prediction systems present some challenges on two fronts: the relation between video quality and observed session features and on the other hand, dynamics changes on the video quality. Software Defined Networks (SDN) is a new concept of network architecture that provides the separation of control plane (controller) and data plane (switches) in network devices. Due to the existence of the southbound interface, it is possible to deploy monitoring tools to obtain the network status and retrieve a statistics collection. Therefore, achieving the most accurate statistics depends on a strategy of monitoring and information requests of network devices. In this paper, we propose an enhanced algorithm for requesting statistics to measure the traffic flow in SDN networks. Such an algorithm is based on grouping network switches in clusters focusing on their number of ports to apply different monitoring techniques. Such grouping occurs by avoiding monitoring queries in network switches with common characteristics and then, by omitting redundant information. In this way, the present proposal decreases the number of monitoring queries to switches, improving the network traffic and preventing the switching overload. We have tested our optimization in a video streaming simulation using different types of videos. The experiments and comparison with traditional monitoring techniques demonstrate the feasibility of our proposal maintaining similar values decreasing the number of queries to the switches.

  20. Traffic Dynamics of Computer Networks

    Science.gov (United States)

    Fekete, Attila

    2008-10-01

    Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I studied the stochastic behavior of TCP, the primary algorithm governing traffic in the current Internet, in an elementary network scenario consisting of a standalone infinite-sized buffer and an access link. The effect of the fast recovery and fast retransmission (FR/FR) algorithms is also considered. I showed that my model can be extended further to involve the effect of link propagation delay, characteristic of WAN. I continued my thesis with the investigation of finite-sized semi-bottleneck buffers, where packets can be dropped not only at the link, but also at the buffer. I demonstrated that the behavior of the system depends only on a certain combination of the parameters. Moreover, an analytic formula was derived that gives the ratio of packet loss rate at the buffer to the total packet loss rate. This formula makes it possible to treat buffer-losses as if they were link-losses. Finally, I studied computer networks from a structural perspective. I demonstrated through fluid simulations that the distribution of resources, specifically the link bandwidth, has a serious impact on the global performance of the network. Then I analyzed the distribution of edge betweenness in a growing scale-free tree under the condition that a local property, the in-degree of the "younger" node of an arbitrary edge, is known in order to find an optimum distribution of link capacity. The derived formula is exact even for finite-sized networks. I also calculated the conditional expectation of edge betweenness, rescaled for infinite networks.

  1. Nonlinear analysis of an extended traffic flow model in ITS environment

    Energy Technology Data Exchange (ETDEWEB)

    Yu Lei [College of Automation, Northwestern Polytechnical University, Xi' an, Shaanxi 710072 (China)], E-mail: yuleijk@126.com; Shi Zhongke [College of Automation, Northwestern Polytechnical University, Xi' an, Shaanxi 710072 (China)

    2008-05-15

    An extended traffic flow model is proposed by introducing the relative velocity of arbitrary number of cars that precede and that follow into the Newell-Whitham-type car-following model. The stability condition of this model is obtained by using the linear stability theory. The results show that the stability of traffic flow is improved by taking into account the relative velocity of cars ahead and backward. By applying the nonlinear analysis the modified Korteweg-de Vries (mKdV) equation is derived to describe the traffic behavior near the critical point. The kink-antikink soliton, the solution of the mKdV equation, is obtained to describe the traffic jams. From the numerical simulation, it is shown that the traffic jams are suppressed efficiently by taking into account the relative velocity of cars ahead and backward. The analytical results are consistent with the simulation one.

  2. Nonlinear analysis of an extended traffic flow model in ITS environment

    International Nuclear Information System (INIS)

    Yu Lei; Shi Zhongke

    2008-01-01

    An extended traffic flow model is proposed by introducing the relative velocity of arbitrary number of cars that precede and that follow into the Newell-Whitham-type car-following model. The stability condition of this model is obtained by using the linear stability theory. The results show that the stability of traffic flow is improved by taking into account the relative velocity of cars ahead and backward. By applying the nonlinear analysis the modified Korteweg-de Vries (mKdV) equation is derived to describe the traffic behavior near the critical point. The kink-antikink soliton, the solution of the mKdV equation, is obtained to describe the traffic jams. From the numerical simulation, it is shown that the traffic jams are suppressed efficiently by taking into account the relative velocity of cars ahead and backward. The analytical results are consistent with the simulation one

  3. Analysis of mixed traffic flow with human-driving and autonomous cars based on car-following model

    Science.gov (United States)

    Zhu, Wen-Xing; Zhang, H. M.

    2018-04-01

    We investigated the mixed traffic flow with human-driving and autonomous cars. A new mathematical model with adjustable sensitivity and smooth factor was proposed to describe the autonomous car's moving behavior in which smooth factor is used to balance the front and back headway in a flow. A lemma and a theorem were proved to support the stability criteria in traffic flow. A series of simulations were carried out to analyze the mixed traffic flow. The fundamental diagrams were obtained from the numerical simulation results. The varying sensitivity and smooth factor of autonomous cars affect traffic flux, which exhibits opposite varying tendency with increasing parameters before and after the critical density. Moreover, the sensitivity of sensors and smooth factors play an important role in stabilizing the mixed traffic flow and suppressing the traffic jam.

  4. Next generation network based carrier ethernet test bed for IPTV traffic

    DEFF Research Database (Denmark)

    Fu, Rong; Berger, Michael Stübert; Zheng, Yu

    2009-01-01

    This paper presents a Carrier Ethernet (CE) test bed based on the Next Generation Network (NGN) framework. After the concept of CE carried out by Metro Ethernet Forum (MEF), the carrier-grade Ethernet are obtaining more and more interests and being investigated as the low cost and high performanc...... services of transport network to carry the IPTV traffic. This test bed is approaching to support the research on providing a high performance carrier-grade Ethernet transport network for IPTV traffic....

  5. A hierarchical clustering scheme approach to assessment of IP-network traffic using detrended fluctuation analysis

    Science.gov (United States)

    Takuma, Takehisa; Masugi, Masao

    2009-03-01

    This paper presents an approach to the assessment of IP-network traffic in terms of the time variation of self-similarity. To get a comprehensive view in analyzing the degree of long-range dependence (LRD) of IP-network traffic, we use a hierarchical clustering scheme, which provides a way to classify high-dimensional data with a tree-like structure. Also, in the LRD-based analysis, we employ detrended fluctuation analysis (DFA), which is applicable to the analysis of long-range power-law correlations or LRD in non-stationary time-series signals. Based on sequential measurements of IP-network traffic at two locations, this paper derives corresponding values for the LRD-related parameter α that reflects the degree of LRD of measured data. In performing the hierarchical clustering scheme, we use three parameters: the α value, average throughput, and the proportion of network traffic that exceeds 80% of network bandwidth for each measured data set. We visually confirm that the traffic data can be classified in accordance with the network traffic properties, resulting in that the combined depiction of the LRD and other factors can give us an effective assessment of network conditions at different times.

  6. 3D Markov Process for Traffic Flow Prediction in Real-Time

    Directory of Open Access Journals (Sweden)

    Eunjeong Ko

    2016-01-01

    Full Text Available Recently, the correct estimation of traffic flow has begun to be considered an essential component in intelligent transportation systems. In this paper, a new statistical method to predict traffic flows using time series analyses and geometric correlations is proposed. The novelty of the proposed method is two-fold: (1 a 3D heat map is designed to describe the traffic conditions between roads, which can effectively represent the correlations between spatially- and temporally-adjacent traffic states; and (2 the relationship between the adjacent roads on the spatiotemporal domain is represented by cliques in MRF and the clique parameters are obtained by example-based learning. In order to assess the validity of the proposed method, it is tested using data from expressway traffic that are provided by the Korean Expressway Corporation, and the performance of the proposed method is compared with existing approaches. The results demonstrate that the proposed method can predict traffic conditions with an accuracy of 85%, and this accuracy can be improved further.

  7. Correlation dimension based nonlinear analysis of network traffics with different application protocols

    International Nuclear Information System (INIS)

    Wang Jun-Song; Yuan Jing; Li Qiang; Yuan Rui-Xi

    2011-01-01

    This paper uses a correlation dimension based nonlinear analysis approach to analyse the dynamics of network traffics with three different application protocols—HTTP, FTP and SMTP. First, the phase space is reconstructed and the embedding parameters are obtained by the mutual information method. Secondly, the correlation dimensions of three different traffics are calculated and the results of analysis have demonstrated that the dynamics of the three different application protocol traffics is different from each other in nature, i.e. HTTP and FTP traffics are chaotic, furthermore, the former is more complex than the later; on the other hand, SMTP traffic is stochastic. It is shown that correlation dimension approach is an efficient method to understand and to characterize the nonlinear dynamics of HTTP, FTP and SMTP protocol network traffics. This analysis provided insight into and a more accurate understanding of nonlinear dynamics of internet traffics which have a complex mixture of chaotic and stochastic components. (general)

  8. LightFD: A Lightweight Flow Detection Mechanism for Traffic Grooming in Optical Wireless DCNs

    KAUST Repository

    Al-Ghadhban, Amer

    2018-05-05

    State of the art wireless technologies have recently shown a great potential for enabling re-configurable data center network (DCN) topologies by augmenting the cabling complexity and link inflexibility of traditional wired data centers (DCs). In this paper, we propose an optical traffic grooming (TG) method for mice flows (MFs) and elephant flows (EFs) in wireless DCNs which are interconnected with wavelength division multiplexing (WDM) capable free-space optical (FSO) links. Since handling the bandwidth-hungry EFs along with delay-sensitive MFs over the same network resources have undesirable consequences, proposed TG policy handles MFs and EFs over distinctive network resources. MFs/EFs destined to the same rack are groomed into larger rack-to-rack MF/EF flows over dedicated lightpaths whose routes and capacities are jointly determined in a load balancing manner. Performance evaluations of proposed TG policy show a significant throughput improvement thanks to efficient bandwidth utilization of the WDM-FSO links. As MFs and EFs are needed to be separated, proposed TG requires expeditious flow detection mechanisms which can immediately classify EFs with very high accuracy. Since these cannot be met by existing packet-sampling and port-mirroring based solutions, we propose a fast and lightweight in-network flow detection (LightFD) mechanism with perfect accuracy. LightFD is designed as a module on the Virtual-Switch/Hypervisor, which detects EFs based on acknowledgment sequence number of flow packets. Emulation results show that LightFD can provide up to 500 times faster detection speeds than the sampling-based methods with %100 detection precision. We also demonstrate that the EF detection speed has a considerable impact on achievable EF throughput.

  9. A Wavelet Analysis Approach for Categorizing Air Traffic Behavior

    Science.gov (United States)

    Drew, Michael; Sheth, Kapil

    2015-01-01

    In this paper two frequency domain techniques are applied to air traffic analysis. The Continuous Wavelet Transform (CWT), like the Fourier Transform, is shown to identify changes in historical traffic patterns caused by Traffic Management Initiatives (TMIs) and weather with the added benefit of detecting when in time those changes take place. Next, with the expectation that it could detect anomalies in the network and indicate the extent to which they affect traffic flows, the Spectral Graph Wavelet Transform (SGWT) is applied to a center based graph model of air traffic. When applied to simulations based on historical flight plans, it identified the traffic flows between centers that have the greatest impact on either neighboring flows, or flows between centers many centers away. Like the CWT, however, it can be difficult to interpret SGWT results and relate them to simulations where major TMIs are implemented, and more research may be warranted in this area. These frequency analysis techniques can detect off-nominal air traffic behavior, but due to the nature of air traffic time series data, so far they prove difficult to apply in a way that provides significant insight or specific identification of traffic patterns.

  10. Algorithm for queueing networks with multi-rate traffic

    DEFF Research Database (Denmark)

    Iversen, Villy Bæk; Ko, King-Tim

    2011-01-01

    the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolution algorithm to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general, presumes that we have product form between the nodes. Otherwise, we have the state space explosion. Even so, the detailed state space of each node may become very large because there is no product form between chains inside a node. A prerequisite for product form...

  11. Routing strategies in traffic network and phase transition in network ...

    Indian Academy of Sciences (India)

    The dynamics of information traffic over scale-free networks has been investigated systematically. A series of routing strategies of data packets have been proposed, including the local routing strategy, the next-nearest-neighbour routing strategy, and the mixed routing strategy based on local static and dynamic information.

  12. Roads at risk - the impact of debris flows on road network reliability and vulnerability in southern Norway

    Science.gov (United States)

    Meyer, Nele Kristin; Schwanghart, Wolfgang; Korup, Oliver

    2014-05-01

    Norwegian's road network is frequently affected by debris flows. Both damage repair and traffic interruption generate high economic losses and necessitate a rigorous assessment of where losses are expected to be high and where preventive measures should be focused on. In recent studies, we have developed susceptibility and trigger probability maps that serve as input into a hazard calculation at the scale of first-order watersheds. Here we combine these results with graph theory to assess the impact of debris flows on the road network of southern Norway. Susceptibility and trigger probability are aggregated for individual road sections to form a reliability index that relates to the failure probability of a link that connects two network vertices, e.g., road junctions. We define link vulnerability as a function of traffic volume and additional link failure distance. Additional link failure distance is the extra length of the alternative path connecting the two associated link vertices in case the network link fails and is calculated by a shortest-path algorithm. The product of network reliability and vulnerability indices represent the risk index. High risk indices identify critical links for the Norwegian road network and are investigated in more detail. Scenarios demonstrating the impact of single or multiple debris flow events are run for the most important routes between seven large cities in southern Norway. First results show that the reliability of the road network is lowest in the central and north-western part of the study area. Road network vulnerability is highest in the mountainous regions in central southern Norway where the road density is low and in the vicinity of cities where the traffic volume is large. The scenarios indicate that city connections that have their shortest path via routes crossing the central part of the study area have the highest risk of route failure.

  13. Traffic networks as information systems a viability approach

    CERN Document Server

    Aubin, Jean-Pierre

    2017-01-01

    This authored monograph covers a viability to approach to traffic management by advising to vehicles circulated on the network the velocity they should follow for satisfying global traffic conditions;. It presents an investigation of three structural innovations: The objective is to broadcast at each instant and at each position the advised celerity to vehicles, which could be read by auxiliary speedometers or used by cruise control devices. Namely, 1. Construct regulation feedback providing at each time and position advised velocities (celerities) for minimizing congestion or other requirements. 2. Taking into account traffic constraints of different type, the first one being to remain on the roads, to stop at junctions, etc. 3. Use information provided by the probe vehicles equipped with GPS to the traffic regulator; 4. Use other global traffic measures of vehicles provided by different types of sensors; These results are based on convex analysis, intertemporal optimization and viability theory as mathemati...

  14. Traffic Adaptive MAC Protocols in Wireless Body Area Networks

    Directory of Open Access Journals (Sweden)

    Farhan Masud

    2017-01-01

    Full Text Available In Wireless Body Area Networks (WBANs, every healthcare application that is based on physical sensors is responsible for monitoring the vital signs data of patient. WBANs applications consist of heterogeneous and dynamic traffic loads. Routine patient’s observation is described as low-load traffic while an alarming situation that is unpredictable by nature is referred to as high-load traffic. This paper offers a thematic review of traffic adaptive Medium Access Control (MAC protocols in WBANs. First, we have categorized them based on their goals, methods, and metrics of evaluation. The Zigbee standard IEEE 802.15.4 and the baseline MAC IEEE 802.15.6 are also reviewed in terms of traffic adaptive approaches. Furthermore, a comparative analysis of the protocols is made and their performances are analyzed in terms of delay, packet delivery ratio (PDR, and energy consumption. The literature shows that no review work has been done on traffic adaptive MAC protocols in WBANs. This review work, therefore, could add enhancement to traffic adaptive MAC protocols and will stimulate a better way of solving the traffic adaptivity problem.

  15. Traffic Management by Using Admission Control Methods in Multiple Node IMS Network

    Directory of Open Access Journals (Sweden)

    Filip Chamraz

    2016-01-01

    Full Text Available The paper deals with Admission Control methods (AC as a possible solution for traffic management in IMS networks (IP Multimedia Subsystem - from the point of view of an efficient redistribution of the available network resources and keeping the parameters of Quality of Service (QoS. The paper specifically aims at the selection of the most appropriate method for the specific type of traffic and traffic management concept using AC methods on multiple nodes. The potential benefit and disadvantage of the used solution is evaluated.

  16. Forecasting of passenger traffic in Moscow metro applying artificial neural networks

    International Nuclear Information System (INIS)

    Ivanov, V.V.; Natsional'nyj Issledovatel'skij Yadernyj Univ. MIFI, Moscow; FKU Rostransmodernizatsiya, Moscow

    2016-01-01

    Methods for the forecasting of passenger traffic in Moscow metro have been developed using artificial neural networks. To this end, the factors primarily determining passenger traffic in the subway have been analyzed and selected [ru

  17. Optimization of TTEthernet Networks to Support Best-Effort Traffic

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Pop, Paul

    2014-01-01

    This paper focuses on the optimization of the TTEthernet communication protocol, which offers three traffic classes: time-triggered (TT), sent according to static schedules, rate-constrained (RC) that has bounded end-to-end latency, and best-effort (BE), the classic Ethernet traffic, with no timing...... guarantees. In our earlier work we have proposed an optimization approach named DOTTS that performs the routing, scheduling and packing / fragmenting of TT and RC messages, such that the TT and RC traffic is schedulable. Although backwards compatibility with classic Ethernet networks is one of TTEthernet...

  18. An implementation of traffic light system using multi-hop Ad hoc networks

    KAUST Repository

    Ansari, Imran Shafique

    2009-08-01

    In ad hoc networks nodes cooperate with each other to form a temporary network without the aid of any centralized administration. No wired base station or infrastructure is supported, and each host communicates via radio packets. Each host must act as a router, since routes are mostly multi-hop, due to the limited power transmission set by government agencies, (e.g. the Federal Communication Commission (FCC), which is 1 Watt in Industrial Scientific and Medical (ISM) band. The natures of wireless mobile ad hoc networks depend on batteries or other fatiguing means for their energy. A limited energy capacity may be the most significant performance constraint. Therefore, radio resource and power management is an important issue of any wireless network. In this paper, a design for traffic light system employing ad hoc networks is proposed. The traffic light system runs automatically based on signals sent through a multi-hop ad hoc network of \\'n\\' number of nodes utilizing the Token Ring protocol, which is efficient for this application from the energy prospective. The experiment consists of a graphical user interface that simulates the traffic lights and laptops (which have wireless network adapters) are used to run the graphical user interface and are responsible for setting up the ad hoc network between them. The traffic light system has been implemented utilizing A Mesh Driver (which allows for more than one wireless device to be connected simultaneously) and Java-based client-server programs. © 2009 IEEE.

  19. Sensitivity Analysis of Wavelet Neural Network Model for Short-Term Traffic Volume Prediction

    Directory of Open Access Journals (Sweden)

    Jinxing Shen

    2013-01-01

    Full Text Available In order to achieve a more accurate and robust traffic volume prediction model, the sensitivity of wavelet neural network model (WNNM is analyzed in this study. Based on real loop detector data which is provided by traffic police detachment of Maanshan, WNNM is discussed with different numbers of input neurons, different number of hidden neurons, and traffic volume for different time intervals. The test results show that the performance of WNNM depends heavily on network parameters and time interval of traffic volume. In addition, the WNNM with 4 input neurons and 6 hidden neurons is the optimal predictor with more accuracy, stability, and adaptability. At the same time, a much better prediction record will be achieved with the time interval of traffic volume are 15 minutes. In addition, the optimized WNNM is compared with the widely used back-propagation neural network (BPNN. The comparison results indicated that WNNM produce much lower values of MAE, MAPE, and VAPE than BPNN, which proves that WNNM performs better on short-term traffic volume prediction.

  20. Resilience of traffic networks: From perturbation to recovery via a dynamic restricted equilibrium model

    International Nuclear Information System (INIS)

    Nogal, Maria; O'Connor, Alan; Caulfield, Brian; Martinez-Pastor, Beatriz

    2016-01-01

    When a disruptive event takes place in a traffic network some important questions arise, such as how stressed the traffic network is, whether the system is able to respond to this stressful situation, or how long the system needs to recover a new equilibrium position after suffering this perturbation. Quantifying these aspects allows the comparison of different systems, to scale the degree of damage, to identify traffic network weaknesses, and to analyse the effect of user knowledge about the traffic network state. The indicator that accounts for performance and recovery pattern under disruptive events is known as resilience. This paper presents a methodology to assess the resilience of a traffic network when a given perturbation occurs, from the beginning of the perturbation to the total system recovery. To consider the dynamic nature of the problem, a new dynamic equilibrium-restricted assignment model is presented to simulate the network performance evolution, which takes into consideration important aspects, such as the cost increment due to the perturbation, the system impedance to alter its previous state and the user stress level. Finally, this methodology is used to evaluate the resilience indices of a real network. - Highlights: • Method to assess the resilience of a traffic network suffering progressive impacts. • It simulates the dynamic response during the perturbation and system recovery. • The resilience index is based on the travel costs and the stress level of users. • It considers the capacity of adaptation of the system to the new situations. • The model evaluates redundancy, adaptability, ability to recover, etc.

  1. Concept definition of traffic flow wide-area surveillance

    Energy Technology Data Exchange (ETDEWEB)

    Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.

    1994-07-01

    Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret large spatial projections of data originating from multiple sensor suites. The intent of the Wide-Area Surveillance (WAS) Project is to build upon this concept and define the operational specifications and characteristics of a Traffic Flow Wide-Area Surveillance (TFWAS) system in terms of traffic management and control. In doing so, the functional capabilities of a TFWAS will be mapped onto an operational profile that is consistent with the Federal Highway Administration`s Intelligent Vehicle Highway System. This document provides the underlying foundation of this work by offering a concept definition for the TFWAS system. It concentrates on answering the question: ``What is the system?`` In doing so, the report develops a hierarchy of specialized definitions.

  2. A new cellular automata model of traffic flow with negative exponential weighted look-ahead potential

    Science.gov (United States)

    Ma, Xiao; Zheng, Wei-Fan; Jiang, Bao-Shan; Zhang, Ji-Ye

    2016-10-01

    With the development of traffic systems, some issues such as traffic jams become more and more serious. Efficient traffic flow theory is needed to guide the overall controlling, organizing and management of traffic systems. On the basis of the cellular automata model and the traffic flow model with look-ahead potential, a new cellular automata traffic flow model with negative exponential weighted look-ahead potential is presented in this paper. By introducing the negative exponential weighting coefficient into the look-ahead potential and endowing the potential of vehicles closer to the driver with a greater coefficient, the modeling process is more suitable for the driver’s random decision-making process which is based on the traffic environment that the driver is facing. The fundamental diagrams for different weighting parameters are obtained by using numerical simulations which show that the negative exponential weighting coefficient has an obvious effect on high density traffic flux. The complex high density non-linear traffic behavior is also reproduced by numerical simulations. Project supported by the National Natural Science Foundation of China (Grant Nos. 11572264, 11172247, 11402214, and 61373009).

  3. Traffic sign recognition based on deep convolutional neural network

    Science.gov (United States)

    Yin, Shi-hao; Deng, Ji-cai; Zhang, Da-wei; Du, Jing-yuan

    2017-11-01

    Traffic sign recognition (TSR) is an important component of automated driving systems. It is a rather challenging task to design a high-performance classifier for the TSR system. In this paper, we propose a new method for TSR system based on deep convolutional neural network. In order to enhance the expression of the network, a novel structure (dubbed block-layer below) which combines network-in-network and residual connection is designed. Our network has 10 layers with parameters (block-layer seen as a single layer): the first seven are alternate convolutional layers and block-layers, and the remaining three are fully-connected layers. We train our TSR network on the German traffic sign recognition benchmark (GTSRB) dataset. To reduce overfitting, we perform data augmentation on the training images and employ a regularization method named "dropout". The activation function we employ in our network adopts scaled exponential linear units (SELUs), which can induce self-normalizing properties. To speed up the training, we use an efficient GPU to accelerate the convolutional operation. On the test dataset of GTSRB, we achieve the accuracy rate of 99.67%, exceeding the state-of-the-art results.

  4. Algorithm for queueing networks with multi-rate traffic

    DEFF Research Database (Denmark)

    Iversen, Villy Bæk; King-Tim, Ko

    2011-01-01

    the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolutions to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate the detailed......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general presumes that we have product form between the nodes. Other ways we have the state space explosion. Even so the detailed state space of each node may easily become very large because there is no product form between chains inside a node. A prerequisite for product form...

  5. Ant colony optimization algorithm for signal coordination of oversaturated traffic networks.

    Science.gov (United States)

    2010-05-01

    Traffic congestion is a daily and growing problem of the modern era in mostly all major cities in the world. : Increasing traffic demand strains the existing transportation system, leading to oversaturated network : conditions, especially at peak hou...

  6. MODELS OF AIR TRAFFIC CONTROLLERS ERRORS PREVENTION IN TERMINAL CONTROL AREAS UNDER UNCERTAINTY CONDITIONS

    Directory of Open Access Journals (Sweden)

    Volodymyr Kharchenko

    2017-03-01

    Full Text Available Purpose: the aim of this study is to research applied models of air traffic controllers’ errors prevention in terminal control areas (TMA under uncertainty conditions. In this work the theoretical framework descripting safety events and errors of air traffic controllers connected with the operations in TMA is proposed. Methods: optimisation of terminal control area formal description based on the Threat and Error management model and the TMA network model of air traffic flows. Results: the human factors variables associated with safety events in work of air traffic controllers under uncertainty conditions were obtained. The Threat and Error management model application principles to air traffic controller operations and the TMA network model of air traffic flows were proposed. Discussion: Information processing context for preventing air traffic controller errors, examples of threats in work of air traffic controllers, which are relevant for TMA operations under uncertainty conditions.

  7. Main concept of local area network protection on the basis of the SAAM 'TRAFFIC'

    International Nuclear Information System (INIS)

    Vasil'ev, P.M.; Kryukov, Yu.A.; Kuptsov, S.I.; Ivanov, V.V.; Koren'kov, V.V.

    2002-01-01

    In our previous paper we developed a system for acquisition, analysis and management of the network traffic (SAAM 'Traffic') for a segment of the JINR local area computer network (JINR LAN). In our present work we consider well-known scenarios of attacks on local area networks and propose protection methods based on the SAAM 'Traffic'. Although the system for LAN protection is installed on a router computer, it is not analogous to the firewall scheme and, thus, it does not hinder the performance of distributed network applications. This provides a possibility to apply such an approach to GRID-technologies, where network protection on the firewall basis can not be basically used. (author)

  8. Discovering urban mobility patterns with PageRank based traffic modeling and prediction

    Science.gov (United States)

    Wang, Minjie; Yang, Su; Sun, Yi; Gao, Jun

    2017-11-01

    Urban transportation system can be viewed as complex network with time-varying traffic flows as links to connect adjacent regions as networked nodes. By computing urban traffic evolution on such temporal complex network with PageRank, it is found that for most regions, there exists a linear relation between the traffic congestion measure at present time and the PageRank value of the last time. Since the PageRank measure of a region does result from the mutual interactions of the whole network, it implies that the traffic state of a local region does not evolve independently but is affected by the evolution of the whole network. As a result, the PageRank values can act as signatures in predicting upcoming traffic congestions. We observe the aforementioned laws experimentally based on the trajectory data of 12000 taxies in Beijing city for one month.

  9. Distributed traffic signal control using fuzzy logic

    Science.gov (United States)

    Chiu, Stephen

    1992-01-01

    We present a distributed approach to traffic signal control, where the signal timing parameters at a given intersection are adjusted as functions of the local traffic condition and of the signal timing parameters at adjacent intersections. Thus, the signal timing parameters evolve dynamically using only local information to improve traffic flow. This distributed approach provides for a fault-tolerant, highly responsive traffic management system. The signal timing at an intersection is defined by three parameters: cycle time, phase split, and offset. We use fuzzy decision rules to adjust these three parameters based only on local information. The amount of change in the timing parameters during each cycle is limited to a small fraction of the current parameters to ensure smooth transition. We show the effectiveness of this method through simulation of the traffic flow in a network of controlled intersections.

  10. A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

    OpenAIRE

    Parisa Bazmi; Manijeh Keshtgary

    2016-01-01

    Named Data Networking (NDN) is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN) Based Traffic-aware Forwarding ...

  11. Machine learning for identifying botnet network traffic

    DEFF Research Database (Denmark)

    Stevanovic, Matija; Pedersen, Jens Myrup

    2013-01-01

    . Due to promise of non-invasive and resilient detection, botnet detection based on network traffic analysis has drawn a special attention of the research community. Furthermore, many authors have turned their attention to the use of machine learning algorithms as the mean of inferring botnet......-related knowledge from the monitored traffic. This paper presents a review of contemporary botnet detection methods that use machine learning as a tool of identifying botnet-related traffic. The main goal of the paper is to provide a comprehensive overview on the field by summarizing current scientific efforts....... The contribution of the paper is three-fold. First, the paper provides a detailed insight on the existing detection methods by investigating which bot-related heuristic were assumed by the detection systems and how different machine learning techniques were adapted in order to capture botnet-related knowledge...

  12. Visualizing Network Traffic to Understand the Performance of Massively Parallel Simulations

    KAUST Repository

    Landge, A. G.

    2012-12-01

    The performance of massively parallel applications is often heavily impacted by the cost of communication among compute nodes. However, determining how to best use the network is a formidable task, made challenging by the ever increasing size and complexity of modern supercomputers. This paper applies visualization techniques to aid parallel application developers in understanding the network activity by enabling a detailed exploration of the flow of packets through the hardware interconnect. In order to visualize this large and complex data, we employ two linked views of the hardware network. The first is a 2D view, that represents the network structure as one of several simplified planar projections. This view is designed to allow a user to easily identify trends and patterns in the network traffic. The second is a 3D view that augments the 2D view by preserving the physical network topology and providing a context that is familiar to the application developers. Using the massively parallel multi-physics code pF3D as a case study, we demonstrate that our tool provides valuable insight that we use to explain and optimize pF3D-s performance on an IBM Blue Gene/P system. © 1995-2012 IEEE.

  13. Research on traffic flow characteristics at signal intersection

    Science.gov (United States)

    Zeng, Jun-Wei; Yu, Sen-Bin; Qian, Yong-Sheng; Wei, Xu-Ting; Feng, Xiao; Wang, Hui

    2017-09-01

    Based on the cautious driving behavior and the principle of the vehicles at left-side having priority to pass in the intersection, a two-dimensional cellular automata model for planar signalized intersection (NS-STCA) is established. The different turning vehicles are regarded as the research objects and the effect of the left-turn probability, signal cycle, vehicle flow density on traffic flow at the intersection is investigated.

  14. Research on the Application of Wireless Network in Collecting Road Traffic Information

    Institute of Scientific and Technical Information of China (English)

    DU Hui-jiang

    2015-01-01

    Due to the characteristics of variability and dispersion in traffic information, to get the reliable real-time traffic information has been a bottleneck in the development of intelligent transportation systems. However, with the development of wireless network technology and mobile Internet, the mobile phones are rapidly developed and more popular, so it is possible to get road traffic information by locating the mobile phones in vehicles. The system structure for the road traffic information collection is designed based on wireless network and mobile phones in vehicles, and the vehicle recognition and its information computation methods are given and discussed. Also the simulation is done for vehicle recognition and computation based on fuzzy cluster analysis method and the results are obtained and analyzed.

  15. Congestion Control and Traffic Scheduling for Collaborative Crowdsourcing in SDN Enabled Mobile Wireless Networks

    Directory of Open Access Journals (Sweden)

    Dawei Shen

    2018-01-01

    Full Text Available Currently, a number of crowdsourcing-based mobile applications have been implemented in mobile networks and Internet of Things (IoT, targeted at real-time services and recommendation. The frequent information exchanges and data transmissions in collaborative crowdsourcing are heavily injected into the current communication networks, which poses great challenges for Mobile Wireless Networks (MWN. This paper focuses on the traffic scheduling and load balancing problem in software-defined MWN and designs a hybrid routing forwarding scheme as well as a congestion control algorithm to achieve the feasible solution. The traffic scheduling algorithm first sorts the tasks in an ascending order depending on the amount of tasks and then solves it using a greedy scheme. In the proposed congestion control scheme, the traffic assignment is first transformed into a multiknapsack problem, and then the Artificial Fish Swarm Algorithm (AFSA is utilized to solve this problem. Numerical results on practical network topology reveal that, compared with the traditional schemes, the proposed congestion control and traffic scheduling schemes can achieve load balancing, reduce the probability of network congestion, and improve the network throughput.

  16. Carbon emissions tax policy of urban road traffic and its application in Panjin, China

    Science.gov (United States)

    Yang, Longhai; Fang, Lin

    2018-01-01

    How to effectively solve traffic congestion and transportation pollution in urban development is a main research emphasis for transportation management agencies. A carbon emissions tax can affect travelers’ generalized costs and will lead to changes in passenger demand, mode choice and traffic flow equilibrium in road networks, which are of significance in green travel and low-carbon transportation management. This paper first established a mesoscopic model to calculate the carbon emissions tax and determined the value of this charge in China, which was based on road traffic flow, vehicle speed, and carbon emissions. Referring to existing research results to calibrate the value of time, this paper modified the traveler’s generalized cost function, including the carbon emissions tax, fuel surcharge and travel time cost, which can be used in the travel impedance model with the consideration of the carbon emissions tax. Then, a method for analyzing urban road network traffic flow distribution was put forward, and a joint traffic distribution model was established, which considered the relationship between private cars and taxis. Finally, this paper took the city of Panjin as an example to analyze the road traffic carbon emissions tax’s impact. The results illustrated that the carbon emissions tax has a positive effect on road network flow equilibrium and carbon emission reduction. This paper will have good reference value and practical significance for the calculation and implementation of urban traffic carbon emissions taxes in China. PMID:29738580

  17. Carbon emissions tax policy of urban road traffic and its application in Panjin, China.

    Science.gov (United States)

    Yang, Longhai; Hu, Xiaowei; Fang, Lin

    2018-01-01

    How to effectively solve traffic congestion and transportation pollution in urban development is a main research emphasis for transportation management agencies. A carbon emissions tax can affect travelers' generalized costs and will lead to changes in passenger demand, mode choice and traffic flow equilibrium in road networks, which are of significance in green travel and low-carbon transportation management. This paper first established a mesoscopic model to calculate the carbon emissions tax and determined the value of this charge in China, which was based on road traffic flow, vehicle speed, and carbon emissions. Referring to existing research results to calibrate the value of time, this paper modified the traveler's generalized cost function, including the carbon emissions tax, fuel surcharge and travel time cost, which can be used in the travel impedance model with the consideration of the carbon emissions tax. Then, a method for analyzing urban road network traffic flow distribution was put forward, and a joint traffic distribution model was established, which considered the relationship between private cars and taxis. Finally, this paper took the city of Panjin as an example to analyze the road traffic carbon emissions tax's impact. The results illustrated that the carbon emissions tax has a positive effect on road network flow equilibrium and carbon emission reduction. This paper will have good reference value and practical significance for the calculation and implementation of urban traffic carbon emissions taxes in China.

  18. Feasibility of Optical Packet Switched WDM Networks without Packet Synchronisation Under Bursty Traffic Conditions

    DEFF Research Database (Denmark)

    Fjelde, Tina; Hansen, Peter Bukhave; Kloch, Allan

    1999-01-01

    We show that complex packet synchronisation may be avoided in optical packetswitched networks. Detailed traffic analysis demonstrates that packet lossratios of 1e-10 are feasible under bursty traffic conditions for a highcapacity network consisting of asynchronously operated add-drop switch...

  19. SYSTEM ANALYSIS OF MAJOR TRENDS IN DEVELOPMENT OF ADAPTIVE TRAFFIC FLOW MANAGEMENT METHODS

    Directory of Open Access Journals (Sweden)

    A. N. Klimovich

    2017-01-01

    Full Text Available Adaptive algorithms, which current traffic systems are based on, exist for many decades. Information technologies have developed significantly over this period and it makes more relevant their application in the field of transport. This paper analyses modern trends in the development of adaptive traffic flow control methods. Reviewed the most perspective directions in the field of intelligent transport systems, such as high-speed wireless communication between vehicles and road infrastructure based on such technologies as DSRC and WAVE, traffic jams prediction having such features as traffic flow information, congestion, velocity of vehicles using machine learning, fuzzy logic rules and genetic algorithms, application of driver assistance systems to increase vehicle’s autonomy. Advantages of such technologies in safety, efficiency and usability of transport are shown. Described multi-agent approach, which uses V2I-communication between vehicles and intersection controller to improve efficiency of control due to more complete traffic flow information and possibility to give orders to separate vehicles. Presented number of algorithms which use such approach to create new generation of adaptive transport systems.

  20. Energy Saving Scheme Based On Traffic Forwarding For Optical Fiber Access Networks

    DEFF Research Database (Denmark)

    Lopez, G. Arturo Rodes; Estaran Tolosa, Jose Manuel; Vegas Olmos, Juan José

    2013-01-01

    We report on an energy saving block that regroups and powers off OLTs during low traffic periods, resulting in energy savings up to 87,5% in the central office of optical access networks.......We report on an energy saving block that regroups and powers off OLTs during low traffic periods, resulting in energy savings up to 87,5% in the central office of optical access networks....

  1. Improved routing strategies for data traffic in scale-free networks

    International Nuclear Information System (INIS)

    Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

    2008-01-01

    We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

  2. Capacity of Freeway Merge Areas with Different On-Ramp Traffic Flow

    Directory of Open Access Journals (Sweden)

    Jinxing Shen

    2015-06-01

    Full Text Available This paper is aimed at investigating the influence of different types of traffic flows on the capacity of freeway merge areas. Based on the classical gap-acceptance model, two calculating models were established specifically considering randomly arriving vehicles and individual difference in driving behaviours. Monte-Carlo simulation was implemented to reproduce the maximum traffic volume on the designed freeway merge area under different situations. The results demonstrated that the proposed calculating models have better performance than the conventional gap-acceptance theory on accurately predicting the capacity of freeway merge areas. The findings of research could be helpful to improve the microscopic traffic flow simulation model from a more practical perspective and support the designing of freeway merge areas as well.

  3. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

    This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...

  4. Investigation of Roadway Geometric and Traffic Flow Factors for Vehicle Crashes Using Spatiotemporal Interaction

    Science.gov (United States)

    Gill, G.; Sakrani, T.; Cheng, W.; Zhou, J.

    2017-09-01

    Traffic safety is a major concern in the transportation industry due to immense monetary and emotional burden caused by crashes of various severity levels, especially the injury and fatality ones. To reduce such crashes on all public roads, the safety management processes are commonly implemented which include network screening, problem diagnosis, countermeasure identification, and project prioritization. The selection of countermeasures for potential mitigation of crashes is governed by the influential factors which impact roadway crashes. Crash prediction model is the tool widely adopted by safety practitioners or researchers to link various influential factors to crash occurrences. Many different approaches have been used in the past studies to develop better fitting models which also exhibit prediction accuracy. In this study, a crash prediction model is developed to investigate the vehicular crashes occurring at roadway segments. The spatial and temporal nature of crash data is exploited to form a spatiotemporal model which accounts for the different types of heterogeneities among crash data and geometric or traffic flow variables. This study utilizes the Poisson lognormal model with random effects, which can accommodate the yearly variations in explanatory variables and the spatial correlations among segments. The dependency of different factors linked with roadway geometric, traffic flow, and road surface type on vehicular crashes occurring at segments was established as the width of lanes, posted speed limit, nature of pavement, and AADT were found to be correlated with vehicle crashes.

  5. INVESTIGATION OF ROADWAY GEOMETRIC AND TRAFFIC FLOW FACTORS FOR VEHICLE CRASHES USING SPATIOTEMPORAL INTERACTION

    Directory of Open Access Journals (Sweden)

    G. Gill

    2017-09-01

    Full Text Available Traffic safety is a major concern in the transportation industry due to immense monetary and emotional burden caused by crashes of various severity levels, especially the injury and fatality ones. To reduce such crashes on all public roads, the safety management processes are commonly implemented which include network screening, problem diagnosis, countermeasure identification, and project prioritization. The selection of countermeasures for potential mitigation of crashes is governed by the influential factors which impact roadway crashes. Crash prediction model is the tool widely adopted by safety practitioners or researchers to link various influential factors to crash occurrences. Many different approaches have been used in the past studies to develop better fitting models which also exhibit prediction accuracy. In this study, a crash prediction model is developed to investigate the vehicular crashes occurring at roadway segments. The spatial and temporal nature of crash data is exploited to form a spatiotemporal model which accounts for the different types of heterogeneities among crash data and geometric or traffic flow variables. This study utilizes the Poisson lognormal model with random effects, which can accommodate the yearly variations in explanatory variables and the spatial correlations among segments. The dependency of different factors linked with roadway geometric, traffic flow, and road surface type on vehicular crashes occurring at segments was established as the width of lanes, posted speed limit, nature of pavement, and AADT were found to be correlated with vehicle crashes.

  6. Traffic routing for multicomputer networks with virtual cut-through capability

    Science.gov (United States)

    Kandlur, Dilip D.; Shin, Kang G.

    1992-01-01

    Consideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.

  7. A Survey on Urban Traffic Management System Using Wireless Sensor Networks

    Science.gov (United States)

    Nellore, Kapileswar; Hancke, Gerhard P.

    2016-01-01

    Nowadays, the number of vehicles has increased exponentially, but the bedrock capacities of roads and transportation systems have not developed in an equivalent way to efficiently cope with the number of vehicles traveling on them. Due to this, road jamming and traffic correlated pollution have increased with the associated adverse societal and financial effect on different markets worldwide. A static control system may block emergency vehicles due to traffic jams. Wireless Sensor networks (WSNs) have gained increasing attention in traffic detection and avoiding road congestion. WSNs are very trendy due to their faster transfer of information, easy installation, less maintenance, compactness and for being less expensive compared to other network options. There has been significant research on Traffic Management Systems using WSNs to avoid congestion, ensure priority for emergency vehicles and cut the Average Waiting Time (AWT) of vehicles at intersections. In recent decades, researchers have started to monitor real-time traffic using WSNs, RFIDs, ZigBee, VANETs, Bluetooth devices, cameras and infrared signals. This paper presents a survey of current urban traffic management schemes for priority-based signalling, and reducing congestion and the AWT of vehicles. The main objective of this survey is to provide a taxonomy of different traffic management schemes used for avoiding congestion. Existing urban traffic management schemes for the avoidance of congestion and providing priority to emergency vehicles are considered and set the foundation for further research. PMID:26828489

  8. A new lattice model of traffic flow with the consideration of the driver's forecast effects

    Energy Technology Data Exchange (ETDEWEB)

    Peng, G.H., E-mail: pengguanghan@yahoo.com.cn [College of Physics and Electronic Science, Hunan University of Arts and Science, Changde 415000 (China); Cai, X.H.; Liu, C.Q.; Cao, B.F. [College of Physics and Electronic Science, Hunan University of Arts and Science, Changde 415000 (China)

    2011-05-30

    In this Letter, a new lattice model is presented with the consideration of the driver's forecast effects (DFE). The linear stability condition of the extended model is obtained by using the linear stability theory. The analytical results show that the new model can improve the stability of traffic flow by considering DFE. The modified KdV equation near the critical point is derived to describe the traffic jam by nonlinear analysis. Numerical simulation also shows that the new model can improve the stability of traffic flow by adjusting the driver's forecast intensity parameter, which is consistent with the theoretical analysis. -- Highlights: → A new driver's forecast lattice model of traffic flow has been presented. → The driver's forecast effects on the stability of traffic flow have been explored. → The modified KdV equation near the critical point is derived to describe the traffic jam by nonlinear analysis. → The analytical and numerical results show that the driver's forecast effect can improve the stability of traffic flow.

  9. Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.

    Science.gov (United States)

    Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing

    2017-01-01

    Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.

  10. Ethernet Flow Monitoring with IPFIX

    NARCIS (Netherlands)

    Hofstede, R.J.; Drago, Idilio; Sperotto, Anna; Pras, Aiko

    The increasing amount of network traffic and the huge bandwidth needed to carry it requires managers to use scalable solutions to monitor their networks. Nowadays, flow-based techniques, such as Cisco’s NetFlow, provide aggregated network data and an overview of network activity at the IP layer.

  11. Traffic flow behavior at un-signalized intersection with crossings pedestrians

    Science.gov (United States)

    Khallouk, A.; Echab, H.; Ez-Zahraouy, H.; Lakouari, N.

    2018-02-01

    Mixed traffic flux composed of crossing pedestrians and vehicles extensively exists in cities. To study the characteristics of the interference traffic flux, we develop a pedestrian-vehicle cellular automata model to present the interaction behaviors on a simple cross road. By realizing the fundamental parameters (i.e. injecting rates α1, α2, the extracting rate β and the pedestrian arrival rate αP), simulations are carried out. The vehicular traffic flux is calculated in terms of rates. The effect of the crosswalk can be regarded as a dynamic impurity. The system phase diagrams in the (α1 ,αP) plane are built. It is found that the phase diagrams consist essentially of four phases namely Free Flow, Congested, Maximal Current and Gridlock. The value of the Maximal current phase depends on the extracting rate β, while the Gridlock phase is achieved only when the pedestrians generating rate is higher than a critical value. Furthermore, the effect of vehicles changing lane (Pch1 ,Pch2) and the location of the crosswalk XP on the dynamic characteristics of vehicles flow are investigated. It is found that traffic situation in the system is slightly enhanced if the location of the crosswalks XP is far from the intersection. However, when Pch1, Pch2 increase, the traffic becomes congested and the Gridlock phase enlarges.

  12. Capacity planning of link restorable optical networks under dynamic change of traffic

    Science.gov (United States)

    Ho, Kwok Shing; Cheung, Kwok Wai

    2005-11-01

    Future backbone networks shall require full-survivability and support dynamic changes of traffic demands. The Generalized Survivable Networks (GSN) was proposed to meet these challenges. GSN is fully-survivable under dynamic traffic demand changes, so it offers a practical and guaranteed characterization framework for ASTN / ASON survivable network planning and bandwidth-on-demand resource allocation 4. The basic idea of GSN is to incorporate the non-blocking network concept into the survivable network models. In GSN, each network node must specify its I/O capacity bound which is taken as constraints for any allowable traffic demand matrix. In this paper, we consider the following generic GSN network design problem: Given the I/O bounds of each network node, find a routing scheme (and the corresponding rerouting scheme under failure) and the link capacity assignment (both working and spare) which minimize the cost, such that any traffic matrix consistent with the given I/O bounds can be feasibly routed and it is single-fault tolerant under the link restoration scheme. We first show how the initial, infeasible formal mixed integer programming formulation can be transformed into a more feasible problem using the duality transformation of the linear program. Then we show how the problem can be simplified using the Lagrangian Relaxation approach. Previous work has outlined a two-phase approach for solving this problem where the first phase optimizes the working capacity assignment and the second phase optimizes the spare capacity assignment. In this paper, we present a jointly optimized framework for dimensioning the survivable optical network with the GSN model. Experiment results show that the jointly optimized GSN can bring about on average of 3.8% cost savings when compared with the separate, two-phase approach. Finally, we perform a cost comparison and show that GSN can be deployed with a reasonable cost.

  13. Network Physics anounces first product to provide business-level management of the most complex and dynamic networks

    CERN Multimedia

    2003-01-01

    Network Physics, provider of business-level, traffic flow-based network management solutions, today announced the introduction of the Network Physics NP/BizFlow-1000. With the NP/BizFlow-1000, Fortune 1000 companies with complex and dynamic networks can analyze the flows that link business groups, critical applications, and network software and hardware (1 page).

  14. Characteristic Analysis of Mixed Traffic Flow of Regular and Autonomous Vehicles Using Cellular Automata

    Directory of Open Access Journals (Sweden)

    Yangzexi Liu

    2017-01-01

    Full Text Available The technology of autonomous vehicles is expected to revolutionize the operation of road transport systems. The penetration rate of autonomous vehicles will be low at the early stage of their deployment. It is a challenge to explore the effects of autonomous vehicles and their penetration on heterogeneous traffic flow dynamics. This paper aims to investigate this issue. An improved cellular automaton was employed as the modeling platform for our study. In particular, two sets of rules for lane changing were designed to address mild and aggressive lane changing behavior. With extensive simulation studies, we obtained some promising results. First, the introduction of autonomous vehicles to road traffic could considerably improve traffic flow, particularly the road capacity and free-flow speed. And the level of improvement increases with the penetration rate. Second, the lane-changing frequency between neighboring lanes evolves with traffic density along a fundamental-diagram-like curve. Third, the impacts of autonomous vehicles on the collective traffic flow characteristics are mainly related to their smart maneuvers in lane changing and car following, and it seems that the car-following impact is more pronounced.

  15. Inside the Mechanics of Network Development: How Competition and Strategy Reorganize European Air Traffic

    Science.gov (United States)

    Huber, Hans

    2006-01-01

    Air transport forms complex networks that can be measured in order to understand its structural characteristics and functional properties. Recent models for network growth (i.e., preferential attachment, etc.) remain stochastic and do not seek to understand other network-specific mechanisms that may account for their development in a more microscopic way. Air traffic is made up of many constituent airlines that are either privately or publicly owned and that operate their own networks. They follow more or less similar business policies each. The way these airline networks organize among themselves into distinct traffic distributions reveals complex interaction among them, which in turn can be aggregated into larger (macro-) traffic distributions. Our approach allows for a more deterministic methodology that will assess the impact of airline strategies on the distinct distributions for air traffic, particularly inside Europe. One key question this paper is seeking to answer is whether there are distinct patterns of preferential attachment for given classes of airline networks to distinct types of European airports. Conclusions about the advancing degree of concentration in this industry and the airline operators that accelerate this process can be drawn.

  16. A Queuing Model-Based System for Triggering Traffic Flow Management Algorithms, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Next generation air traffic management systems are expected use multiple software tools and quantitative methods for managing traffic flow in the National Airspace....

  17. Methodology for neural networks prototyping. Application to traffic control

    Energy Technology Data Exchange (ETDEWEB)

    Belegan, I.C.

    1998-07-01

    The work described in this report was carried out in the context of the European project ASTORIA (Advanced Simulation Toolbox for Real-World Industrial Application in Passenger Management and Adaptive Control), and concerns the development of an advanced toolbox for complex transportation systems. Our work was focused on the methodology for prototyping a set of neural networks corresponding to specific strategies for traffic control and congestion management. The tool used for prototyping is SNNS (Stuggart Neural Network Simulator), developed at the University of Stuggart, Institute for Parallel and Distributed High Performance Systems, and the real data from the field were provided by ZELT. This report is structured into six parts. The introduction gives some insights about traffic control and its approaches. The second chapter discusses the various control strategies existing. The third chapter is an introduction to the field of neural networks. The data analysis and pre-processing is described in the fourth chapter. In the fifth chapter, the methodology for prototyping the neural networks is presented. Finally, conclusions and further work are presented. (author) 14 refs.

  18. The Entropy Solutions for the Lighthill-Whitham-Richards Traffic Flow Model with a Discontinuous Flow-Density Relationship

    National Research Council Canada - National Science Library

    Lu, Yadong; Wong, S. C; Zhang, Mengping; Shu, Chi-Wang

    2007-01-01

    ...) traffic flow model with a flow-density relationship which is piecewise quadratic, concave, but not continuous at the junction points where two quadratic polynomials meet, and with piecewise linear...

  19. Simulation of traffic capacity of inland waterway network

    NARCIS (Netherlands)

    Chen, L.; Mou, J.; Ligteringen, H.

    2013-01-01

    The inland waterborne transportation is viewed as an economic, safe and environmentally friendly alternative to the congested road network. The traffic capacity are the critical indicator of the inland shipping performance. Actually, interacted under the complicated factors, it is challenging to

  20. Complex traffic flow that allows as well as hampers lane-changing intrinsically contains social-dilemma structures

    Science.gov (United States)

    Iwamura, Yoshiro; Tanimoto, Jun

    2018-02-01

    To investigate an interesting question as to whether or not social dilemma structures can be found in a realistic traffic flow reproduced by a model, we built a new microscopic model in which an intentional driver may try lane-changing to go in front of other vehicles and may hamper others’ lane-changes. Our model consists of twofold parts; cellular automaton emulating a real traffic flow and evolutionary game theory to implement a driver’s decision making-process. Numerical results reveal that a social dilemma like the multi-player chicken game or prisoner’s dilemma game emerges depending on the traffic phase. This finding implies that a social dilemma, which has been investigated by applied mathematics so far, hides behind a traffic flow, which has been explored by fluid dynamics. Highlight - Complex system of traffic flow with consideration of driver’s decision making process is concerned. - A new model dovetailing cellular automaton with game theory is established. - Statistical result from numerical simulations reveals a social dilemma structure underlying traffic flow. - The social dilemma is triggered by a driver’s egocentric actions of lane-changing and hampering other’s lane-change.

  1. Analysis of energy consumption and emission of the heterogeneous traffic flow consisting of traditional vehicles and electric vehicles

    Science.gov (United States)

    Xiao, Hong; Huang, Hai-Jun; Tang, Tie-Qiao

    2017-12-01

    Electric vehicle (EV) has become a potential traffic tool, which has attracted researchers to explore various traffic phenomena caused by EV (e.g. congestion, electricity consumption, etc.). In this paper, we study the energy consumption (including the fuel consumption and the electricity consumption) and emissions of heterogeneous traffic flow (that consists of the traditional vehicle (TV) and EV) under three traffic situations (i.e. uniform flow, shock and rarefaction waves, and a small perturbation) from the perspective of macro traffic flow. The numerical results show that the proportion of electric vehicular flow has great effects on the TV’s fuel consumption and emissions and the EV’s electricity consumption, i.e. the fuel consumption and emissions decrease while the electricity consumption increases with the increase of the proportion of electric vehicular flow. The results can help us better understand the energy consumption and emissions of the heterogeneous traffic flow consisting of TV and EV.

  2. Dynamic traffic grooming with Spectrum Engineering (TG-SE) in flexible grid optical networks

    Science.gov (United States)

    Yu, Xiaosong; Zhao, Yongli; Zhang, Jiawei; Wang, Jianping; Zhang, Guoying; Chen, Xue; Zhang, Jie

    2015-12-01

    Flexible grid has emerged as an evolutionary technology to satisfy the ever increasing demand for higher spectrum efficiency and operational flexibility. To optimize the spectrum resource utilization, this paper introduces the concept of Spectrum Engineering in flex-grid optical networks. The sliceable optical transponder has been proposed to offload IP traffic to the optical layer and reduce the number of IP router ports and transponders. We discuss the impact of sliceable transponder in traffic grooming and propose several traffic-grooming schemes with Spectrum Engineering (TG-SE). Our results show that there is a tradeoff among different traffic grooming policies, which should be adopted based on the network operator's objectives. The proposed traffic grooming with Spectrum Engineering schemes can reduce OPEX as well as increase spectrum efficiency by efficiently utilizing the bandwidth variability and capability of sliceable optical transponders.

  3. Development and application of traffic flow information collecting and analysis system based on multi-type video

    Science.gov (United States)

    Lu, Mujie; Shang, Wenjie; Ji, Xinkai; Hua, Mingzhuang; Cheng, Kuo

    2015-12-01

    Nowadays, intelligent transportation system (ITS) has already become the new direction of transportation development. Traffic data, as a fundamental part of intelligent transportation system, is having a more and more crucial status. In recent years, video observation technology has been widely used in the field of traffic information collecting. Traffic flow information contained in video data has many advantages which is comprehensive and can be stored for a long time, but there are still many problems, such as low precision and high cost in the process of collecting information. This paper aiming at these problems, proposes a kind of traffic target detection method with broad applicability. Based on three different ways of getting video data, such as aerial photography, fixed camera and handheld camera, we develop a kind of intelligent analysis software which can be used to extract the macroscopic, microscopic traffic flow information in the video, and the information can be used for traffic analysis and transportation planning. For road intersections, the system uses frame difference method to extract traffic information, for freeway sections, the system uses optical flow method to track the vehicles. The system was applied in Nanjing, Jiangsu province, and the application shows that the system for extracting different types of traffic flow information has a high accuracy, it can meet the needs of traffic engineering observations and has a good application prospect.

  4. Model for Detection and Classification of DDoS Traffic Based on Artificial Neural Network

    Directory of Open Access Journals (Sweden)

    D. Peraković

    2017-06-01

    Full Text Available Detection of DDoS (Distributed Denial of Service traffic is of great importance for the availability protection of services and other information and communication resources. The research presented in this paper shows the application of artificial neural networks in the development of detection and classification model for three types of DDoS attacks and legitimate network traffic. Simulation results of developed model showed accuracy of 95.6% in classification of pre-defined classes of traffic.

  5. Early Model of Traffic Sign Reminder Based on Neural Network

    Directory of Open Access Journals (Sweden)

    Budi Rahmani

    2012-12-01

    Full Text Available Recognizing the traffic signs installed on the streets is one of the requirements of driving on the road. Laxity in driving may result in traffic accident. This paper describes a real-time reminder model, by utilizing a camera that can be installed in a car to capture image of traffic signs, and is processed and later to inform the driver. The extracting feature harnessing the morphological elements (strel is used in this paper. Artificial Neural Networks is used to train the system and to produce a final decision. The result shows that the accuracy in detecting and recognizing the ten types of traffic signs in real-time is 80%.

  6. Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.

    Directory of Open Access Journals (Sweden)

    Shameng Wen

    Full Text Available Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.

  7. Multiple Vehicle Detection and Segmentation in Malaysia Traffic Flow

    Science.gov (United States)

    Fariz Hasan, Ahmad; Fikri Che Husin, Mohd; Affendi Rosli, Khairul; Norhafiz Hashim, Mohd; Faiz Zainal Abidin, Amar

    2018-03-01

    Vision based system are widely used in the field of Intelligent Transportation System (ITS) to extract a large amount of information to analyze traffic scenes. By rapid number of vehicles on the road as well as significant increase on cameras dictated the need for traffic surveillance systems. This system can take over the burden some task was performed by human operator in traffic monitoring centre. The main technique proposed by this paper is concentrated on developing a multiple vehicle detection and segmentation focusing on monitoring through Closed Circuit Television (CCTV) video. The system is able to automatically segment vehicle extracted from heavy traffic scene by optical flow estimation alongside with blob analysis technique in order to detect the moving vehicle. Prior to segmentation, blob analysis technique will compute the area of interest region corresponding to moving vehicle which will be used to create bounding box on that particular vehicle. Experimental validation on the proposed system was performed and the algorithm is demonstrated on various set of traffic scene.

  8. Detecting Anomaly in Traffic Flow from Road Similarity Analysis

    KAUST Repository

    Liu, Xinran; Liu, Xingwu; Wang, Yuanhong; Pu, Juhua; Zhang, Xiangliang

    2016-01-01

    Taxies equipped with GPS devices are considered as 24-hour moving sensors widely distributed in urban road networks. Plenty of accurate and realtime trajectories of taxi are recorded by GPS devices and are commonly studied for understanding traffic

  9. Controlling P2P File-Sharing Networks Traffic

    OpenAIRE

    García Pineda, Miguel; HAMMOUMI, MOHAMMED; Canovas Solbes, Alejandro; Lloret, Jaime

    2011-01-01

    Since the appearance of Peer-To-Peer (P2P) file-sharing networks some time ago, many Internet users have chosen this technology to share and search programs, videos, music, documents, etc. The total number of P2P file-sharing users has been increasing and decreasing in the last decade depending on the creation or end of some well known P2P file-sharing systems. P2P file-sharing networks traffic is currently overloading some data networks and it is a major headache for netw...

  10. Developing a New HSR Switching Node (SwitchBox for Improving Traffic Performance in HSR Networks

    Directory of Open Access Journals (Sweden)

    Nguyen Xuan Tien

    2016-01-01

    Full Text Available High availability is crucial for industrial Ethernet networks as well as Ethernet-based control systems such as automation networks and substation automation systems (SAS. Since standard Ethernet does not support fault tolerance capability, the high availability of Ethernet networks can be increased by using redundancy protocols. Various redundancy protocols for Ethernet networks have been developed and standardized, such as rapid spanning tree protocol (RSTP, media redundancy protocol (MRP, parallel redundancy protocol (PRP, high-availability seamless redundancy (HSR and others. RSTP and MRP have switchover delay drawbacks. PRP provides zero recovery time, but requires a duplicate network infrastructure. HSR operation is similar to PRP, but HSR uses a single network. However, the standard HSR protocol is mainly applied to ring-based topologies and generates excessively unnecessary redundant traffic in the network. In this paper, we develop a new switching node for the HSR protocol, called SwitchBox, which is used in HSR networks in order to support any network topology and significantly reduce redundant network traffic, including unicast, multicast and broadcast traffic, compared with standard HSR. By using the SwitchBox, HSR not only provides seamless communications with zero switchover time in case of failure, but it is also easily applied to any network topology and significantly reduces unnecessary redundant traffic in HSR networks.

  11. Traffic flow model at fixed control signals with discrete service time distribution

    Directory of Open Access Journals (Sweden)

    Lucky I. Igbinosun

    2016-04-01

    Full Text Available Most of the models of road traffic flow at fixed-cycle controlled intersection assume stationary distributions and provide steady state results. The assumption that a constant number of vehicles can leave the system during the green phase is unrealistic in real life situations. A discrete time queuing model was developed to describe the operation of traffic flow at a road intersection with fixed-cycle signalized control and to account for the randomness in the number of vehicles that can leave the system. The results show the expected queue size in the system when the traffic is light and for a busy period, respectively. For the light period, when the traffic intensity is less than one, it takes a shorter green cycle time for vehicles to clear up than during high traffic intensity (the road junction is saturated. Increasing the number of cars that can leave the junction at the turn of the green phase reduces the number of cycle times before the queue is cleared.

  12. Traffic sharing algorithms for hybrid mobile networks

    Science.gov (United States)

    Arcand, S.; Murthy, K. M. S.; Hafez, R.

    1995-01-01

    In a hybrid (terrestrial + satellite) mobile personal communications networks environment, a large size satellite footprint (supercell) overlays on a large number of smaller size, contiguous terrestrial cells. We assume that the users have either a terrestrial only single mode terminal (SMT) or a terrestrial/satellite dual mode terminal (DMT) and the ratio of DMT to the total terminals is defined gamma. It is assumed that the call assignments to and handovers between terrestrial cells and satellite supercells take place in a dynamic fashion when necessary. The objectives of this paper are twofold, (1) to propose and define a class of traffic sharing algorithms to manage terrestrial and satellite network resources efficiently by handling call handovers dynamically, and (2) to analyze and evaluate the algorithms by maximizing the traffic load handling capability (defined in erl/cell) over a wide range of terminal ratios (gamma) given an acceptable range of blocking probabilities. Two of the algorithms (G & S) in the proposed class perform extremely well for a wide range of gamma.

  13. Wireless Magnetic Sensor Network for Road Traffic Monitoring and Vehicle Classification

    Directory of Open Access Journals (Sweden)

    Velisavljevic Vladan

    2016-12-01

    Full Text Available Efficiency of transportation of people and goods is playing a vital role in economic growth. A key component for enabling effective planning of transportation networks is the deployment and operation of autonomous monitoring and traffic analysis tools. For that reason, such systems have been developed to register and classify road traffic usage. In this paper, we propose a novel system for road traffic monitoring and classification based on highly energy efficient wireless magnetic sensor networks. We develop novel algorithms for vehicle speed and length estimation and vehicle classification that use multiple magnetic sensors. We also demonstrate that, using such a low-cost system with simplified installation and maintenance compared to current solutions, it is possible to achieve highly accurate estimation and a high rate of positive vehicle classification.

  14. On the Use of Machine Learning for Identifying Botnet Network Traffic

    DEFF Research Database (Denmark)

    Stevanovic, Matija; Pedersen, Jens Myrup

    2016-01-01

    contemporary approaches use machine learning techniques for identifying malicious traffic. This paper presents a survey of contemporary botnet detection methods that rely on machine learning for identifying botnet network traffic. The paper provides a comprehensive overview on the existing scientific work thus...... contributing to the better understanding of capabilities, limitations and opportunities of using machine learning for identifying botnet traffic. Furthermore, the paper outlines possibilities for the future development of machine learning-based botnet detection systems....

  15. A Study on the Model of Traffic Flow and Vehicle Exhaust Emission

    Directory of Open Access Journals (Sweden)

    Han Xue

    2013-01-01

    Full Text Available The increase of traffic flow in cities causes traffic congestion and accidents as well as air pollution. Traffic problems have attracted the interest of many researchers from the perspective of theory and engineering. In order to provide a simple and practical method for measuring the exhaust emission and assessing the effect of pollution control, a model is based on the relationship between traffic flow and vehicle exhaust emission under a certain level of road capacity constraints. In the proposed model, the hydrocarbons (HC, carbon monoxide (CO, and nitrogen oxides (NOx are considered as the indexes of total exhaust emission, and the speed is used as an intermediate variable. To verify the rationality and practicality of the model, a case study for Beijing, China, is provided in which the effects of taxi fare regulation and the specific vehicle emission reduction policy are analyzed.

  16. Networked traffic state estimation involving mixed fixed-mobile sensor data using Hamilton-Jacobi equations

    KAUST Repository

    Canepa, Edward S.; Claudel, Christian G.

    2017-01-01

    Nowadays, traffic management has become a challenge for urban areas, which are covering larger geographic spaces and facing the generation of different kinds of traffic data. This article presents a robust traffic estimation framework for highways modeled by a system of Lighthill Whitham Richards equations that is able to assimilate different sensor data available. We first present an equivalent formulation of the problem using a Hamilton–Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton–Jacobi equation are linear ones. We then pose the problem of estimating the traffic density given incomplete and inaccurate traffic data as a Mixed Integer Program. We then extend the density estimation framework to highway networks with any available data constraint and modeling junctions. Finally, we present a travel estimation application for a small network using real traffic measurements obtained obtained during Mobile Century traffic experiment, and comparing the results with ground truth data.

  17. Networked traffic state estimation involving mixed fixed-mobile sensor data using Hamilton-Jacobi equations

    KAUST Repository

    Canepa, Edward S.

    2017-06-19

    Nowadays, traffic management has become a challenge for urban areas, which are covering larger geographic spaces and facing the generation of different kinds of traffic data. This article presents a robust traffic estimation framework for highways modeled by a system of Lighthill Whitham Richards equations that is able to assimilate different sensor data available. We first present an equivalent formulation of the problem using a Hamilton–Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton–Jacobi equation are linear ones. We then pose the problem of estimating the traffic density given incomplete and inaccurate traffic data as a Mixed Integer Program. We then extend the density estimation framework to highway networks with any available data constraint and modeling junctions. Finally, we present a travel estimation application for a small network using real traffic measurements obtained obtained during Mobile Century traffic experiment, and comparing the results with ground truth data.

  18. Effects of scale and efficiency of rural traffic calming on safety, accessibility and wildlife

    NARCIS (Netherlands)

    Jaarsma, C.F.; Langevelde, van F.

    2011-01-01

    This paper examines the effects of scale and efficiency of regional traffic calming on traffic safety, rural accessibility, and survival of wildlife. We distinguish by the scale of road networks affected and considered the efficiencies of various bundling of traffic flows on designated routes.

  19. Hyper-Spectral Networking Concept of Operations and Future Air Traffic Management Simulations

    Science.gov (United States)

    Davis, Paul; Boisvert, Benjamin

    2017-01-01

    The NASA sponsored Hyper-Spectral Communications and Networking for Air Traffic Management (ATM) (HSCNA) project is conducting research to improve the operational efficiency of the future National Airspace System (NAS) through diverse and secure multi-band, multi-mode, and millimeter-wave (mmWave) wireless links. Worldwide growth of air transportation and the coming of unmanned aircraft systems (UAS) will increase air traffic density and complexity. Safe coordination of aircraft will require more capable technologies for communications, navigation, and surveillance (CNS). The HSCNA project will provide a foundation for technology and operational concepts to accommodate a significantly greater number of networked aircraft. This paper describes two of the HSCNA projects technical challenges. The first technical challenge is to develop a multi-band networking concept of operations (ConOps) for use in multiple phases of flight and all communication link types. This ConOps will integrate the advanced technologies explored by the HSCNA project and future operational concepts into a harmonized vision of future NAS communications and networking. The second technical challenge discussed is to conduct simulations of future ATM operations using multi-bandmulti-mode networking and technologies. Large-scale simulations will assess the impact, compared to todays system, of the new and integrated networks and technologies under future air traffic demand.

  20. A cyberciege traffic analysis extension for teaching network security

    OpenAIRE

    Chang, Xuquan Stanley.; Chua, Kim Yong.

    2011-01-01

    CyberCIEGE is an interactive game simulating realistic scenarios that teaches the players Information Assurance (IA) concepts. The existing game scenarios only provide a high-level abstraction of the networked environment, e.g., nodes do not have Internet protocol (IP) addresses or belong to proper subnets, and there is no packet-level network simulation. This research explored endowing the game with network level traffic analysis, and implementing a game scenario to take advantage of this ne...

  1. Detection of Botnet Command and Control Traffic by the Multistage Trust Evaluation of Destination Identifiers

    Directory of Open Access Journals (Sweden)

    Pieter Burghouwt

    2015-10-01

    Full Text Available Network-based detection of botnet Command and Control communication is a difficult task if the traffic has a relatively low volume and if popular protocols, such as HTTP, are used to resemble normal traffic. We present a new network-based detection approach that is capable of detecting this type of Command and Control traffic in an enterprise network by estimating the trustworthiness of the traffic destinations. If the destination identifier of a traffic flow origins directly from: human input, prior traffic from a trusted destination, or a defined set of legitimate applications, the destination is trusted and its associated traffic is classified as normal. Advantages of this approach are: the ability of zero day malicious traffic detection, low exposure to malware by passive host-external traffic monitoring, and the applicability for real-time filtering. Experimental evaluation demonstrates successful detection of diverse types of Command and Control Traffic.

  2. Traffic analysis and signal processing in optical packet switched networks

    DEFF Research Database (Denmark)

    Fjelde, Tina

    2002-01-01

    /s optical packet switched network exploiting the best of optics and electronics, is used as a thread throughout the thesis. An overview of the DAVID network architecture is given, focussing on the MAN and WAN architecture as well as the MPLS-based network hierarchy. Subsequently, the traffic performance...... of the DAVID core optical packet router, which exploits wavelength conversion and fibre delay-line buffers for contention resolution, is analysed using a numerical model developed for that purpose. The robustness of the shared recirculating loop buffer with respect to´bursty traffic is demonstrated...... the injection of an additional clock signal into the IWC is presented. Results show very good transmission capabilities combined with a high-speed response. It is argued that signal regeneration is an inherent attribute of the IWC employed as a wavelength converter due to the sinusoidal transfer function...

  3. Traffic sign classification with dataset augmentation and convolutional neural network

    Science.gov (United States)

    Tang, Qing; Kurnianggoro, Laksono; Jo, Kang-Hyun

    2018-04-01

    This paper presents a method for traffic sign classification using a convolutional neural network (CNN). In this method, firstly we transfer a color image into grayscale, and then normalize it in the range (-1,1) as the preprocessing step. To increase robustness of classification model, we apply a dataset augmentation algorithm and create new images to train the model. To avoid overfitting, we utilize a dropout module before the last fully connection layer. To assess the performance of the proposed method, the German traffic sign recognition benchmark (GTSRB) dataset is utilized. Experimental results show that the method is effective in classifying traffic signs.

  4. Dynamic analysis of pedestrian crossing behaviors on traffic flow at unsignalized mid-block crosswalks

    Science.gov (United States)

    Liu, Gang; He, Jing; Luo, Zhiyong; Yang, Wunian; Zhang, Xiping

    2015-05-01

    It is important to study the effects of pedestrian crossing behaviors on traffic flow for solving the urban traffic jam problem. Based on the Nagel-Schreckenberg (NaSch) traffic cellular automata (TCA) model, a new one-dimensional TCA model is proposed considering the uncertainty conflict behaviors between pedestrians and vehicles at unsignalized mid-block crosswalks and defining the parallel updating rules of motion states of pedestrians and vehicles. The traffic flow is simulated for different vehicle densities and behavior trigger probabilities. The fundamental diagrams show that no matter what the values of vehicle braking probability, pedestrian acceleration crossing probability, pedestrian backing probability and pedestrian generation probability, the system flow shows the "increasing-saturating-decreasing" trend with the increase of vehicle density; when the vehicle braking probability is lower, it is easy to cause an emergency brake of vehicle and result in great fluctuation of saturated flow; the saturated flow decreases slightly with the increase of the pedestrian acceleration crossing probability; when the pedestrian backing probability lies between 0.4 and 0.6, the saturated flow is unstable, which shows the hesitant behavior of pedestrians when making the decision of backing; the maximum flow is sensitive to the pedestrian generation probability and rapidly decreases with increasing the pedestrian generation probability, the maximum flow is approximately equal to zero when the probability is more than 0.5. The simulations prove that the influence of frequent crossing behavior upon vehicle flow is immense; the vehicle flow decreases and gets into serious congestion state rapidly with the increase of the pedestrian generation probability.

  5. Effect of Water Flows on Ship Traffic in Narrow Water Channels Based on Cellular Automata

    Directory of Open Access Journals (Sweden)

    Hu Hongtao

    2017-11-01

    Full Text Available In narrow water channels, ship traffic may be affected by water flows and ship interactions. Studying their effects can help maritime authorities to establish appropriate management strategies. In this study, a two-lane cellular automation model is proposed. Further, the behavior of ship traffic is analyzed by setting different water flow velocities and considering ship interactions. Numerical experiment results show that the ship traffic density-flux relation is significantly different from the results obtained by classical models. Furthermore, due to ship interactions, the ship lane-change rate is influenced by the water flow to a certain degree.

  6. Network Traffic Forensics on Firefox Mobile OS: Facebook, Twitter and Telegram as Case Studies

    OpenAIRE

    Yusoff, Mohd Najwadi; Dehghantanha, Ali; Mahmod, Ramlan

    2017-01-01

    Development of mobile web-centric OS such as Firefox OS has created new challenges, and opportunities for digital investigators. Network traffic forensic plays an important role in cybercrime investigation to detect subject(s) and object(s) of the crime. In this chapter, we detect and analyze residual network traffic artefacts of Firefox OS in relation to two popular social networking applications (Facebook and Twitter) and one instant messaging application (Telegram). We utilized a Firefox O...

  7. Spatiotemporal Context Awareness for Urban Traffic Modeling and Prediction: Sparse Representation Based Variable Selection.

    Directory of Open Access Journals (Sweden)

    Su Yang

    Full Text Available Spatial-temporal correlations among the data play an important role in traffic flow prediction. Correspondingly, traffic modeling and prediction based on big data analytics emerges due to the city-scale interactions among traffic flows. A new methodology based on sparse representation is proposed to reveal the spatial-temporal dependencies among traffic flows so as to simplify the correlations among traffic data for the prediction task at a given sensor. Three important findings are observed in the experiments: (1 Only traffic flows immediately prior to the present time affect the formation of current traffic flows, which implies the possibility to reduce the traditional high-order predictors into an 1-order model. (2 The spatial context relevant to a given prediction task is more complex than what is assumed to exist locally and can spread out to the whole city. (3 The spatial context varies with the target sensor undergoing prediction and enlarges with the increment of time lag for prediction. Because the scope of human mobility is subject to travel time, identifying the varying spatial context against time lag is crucial for prediction. Since sparse representation can capture the varying spatial context to adapt to the prediction task, it outperforms the traditional methods the inputs of which are confined as the data from a fixed number of nearby sensors. As the spatial-temporal context for any prediction task is fully detected from the traffic data in an automated manner, where no additional information regarding network topology is needed, it has good scalability to be applicable to large-scale networks.

  8. Spatiotemporal Context Awareness for Urban Traffic Modeling and Prediction: Sparse Representation Based Variable Selection.

    Science.gov (United States)

    Yang, Su; Shi, Shixiong; Hu, Xiaobing; Wang, Minjie

    2015-01-01

    Spatial-temporal correlations among the data play an important role in traffic flow prediction. Correspondingly, traffic modeling and prediction based on big data analytics emerges due to the city-scale interactions among traffic flows. A new methodology based on sparse representation is proposed to reveal the spatial-temporal dependencies among traffic flows so as to simplify the correlations among traffic data for the prediction task at a given sensor. Three important findings are observed in the experiments: (1) Only traffic flows immediately prior to the present time affect the formation of current traffic flows, which implies the possibility to reduce the traditional high-order predictors into an 1-order model. (2) The spatial context relevant to a given prediction task is more complex than what is assumed to exist locally and can spread out to the whole city. (3) The spatial context varies with the target sensor undergoing prediction and enlarges with the increment of time lag for prediction. Because the scope of human mobility is subject to travel time, identifying the varying spatial context against time lag is crucial for prediction. Since sparse representation can capture the varying spatial context to adapt to the prediction task, it outperforms the traditional methods the inputs of which are confined as the data from a fixed number of nearby sensors. As the spatial-temporal context for any prediction task is fully detected from the traffic data in an automated manner, where no additional information regarding network topology is needed, it has good scalability to be applicable to large-scale networks.

  9. Leveraging spatial abstraction in traffic analysis and forecasting with visual analytics

    OpenAIRE

    Andrienko, N.; Andrienko, G.; Rinzivillo, S.

    2016-01-01

    A spatially abstracted transportation network is a graph where nodes are territory compartments (areas in geographic space) and edges, or links, are abstract constructs, each link representing all possible paths between two neighboring areas. By applying visual analytics techniques to vehicle traffic data from different territories, we discovered that the traffic intensity (a.k.a. traffic flow or traffic flux) and the mean velocity are interrelated in a spatially abstracted transportation net...

  10. A New Macro Model for Traffic Flow on a Highway with Ramps and Numerical Tests

    International Nuclear Information System (INIS)

    Tang Tieqiao; Huang Haijun; Zhang Ying; Wong, S.C.; Gao Ziyou

    2009-01-01

    In this paper, we present a new macro model for traffic flow on a highway with ramps based on the existing models. We use the new model to study the effects of on-off-ramp on the main road traffic during the morning rush period and the evening rush period. Numerical tests show that, during the two rush periods, these effects are often different and related to the status of the main road traffic. If the main road traffic flow is uniform, then ramps always produce stop-and-go traffic when the main road density is between two critical values, and ramps have little effect on the main road traffic when the main road density is less than the smaller critical value or greater than the larger critical value. If a small perturbation appears on the main road, ramp may lead to stop-and-go traffic, or relieve or even eliminate the stop-and-go traffic, under different circumstances. These results are consistent with real traffic, which shows that the new model is reasonable.

  11. Efficient IP Traffic over Optical Network Based on Wavelength Translation Switching

    DEFF Research Database (Denmark)

    Jha, Vikas; Kalia, Kartik; Chowdhary, Bhawani Shankar

    2016-01-01

    With the advent of TCP/IP protocol suite the overall era of communication technologies had been redefined. Now, we can’t ignore the presence of huge amount of IP traffic; data, voice or video increasing day by day creating more pressure on existing communicating media and supporting back bone....... With the humongous popularity of Internet the overall traffic on Internet has the same story. Focusing on transmission of IP traffic in an optical network with signals remaining in their optical nature generated at particular wavelength, proposed is the switching of optically generated IP packets through optical...... cross connects based on translation of wavelength when an IP packet is crossing the optical cross connect. Adding the concepts of layer 3 routing protocols along with the wavelength translation scheme, will help in spanning the overall optical network for a larger area....

  12. Deep Bidirectional and Unidirectional LSTM Recurrent Neural Network for Network-wide Traffic Speed Prediction

    OpenAIRE

    Cui, Zhiyong; Ke, Ruimin; Wang, Yinhai

    2018-01-01

    Short-term traffic forecasting based on deep learning methods, especially long short-term memory (LSTM) neural networks, has received much attention in recent years. However, the potential of deep learning methods in traffic forecasting has not yet fully been exploited in terms of the depth of the model architecture, the spatial scale of the prediction area, and the predictive power of spatial-temporal data. In this paper, a deep stacked bidirectional and unidirectional LSTM (SBU- LSTM) neura...

  13. Minimal-Intrusion Traffic Monitoring And Analysis In Mission-Critical Communication Networks

    Directory of Open Access Journals (Sweden)

    Alberto Domingo Ajenjo

    2003-10-01

    Full Text Available A good knowledge of expected and actual traffic patterns is an essential tool for network planning, design and operation in deployed, mission-critical applications. This paper describes those needs, and explains the Traffic Monitoring and Analysis Platform (TMAP concept, as developed in support of NATO deployed military headquarters Communications and Information Systems. It shows how a TMAP was deployed to a real NATO exercise, to prove the concept and baseline the traffic needs per application, per user community and per time of day. Then, it analyses the obtained results and derives conclusions on how to integrate traffic monitoring and analysis platforms in future deployments.

  14. Development of a Software Based Firewall System for Computer Network Traffic Control

    Directory of Open Access Journals (Sweden)

    Ikhajamgbe OYAKHILOME

    2009-12-01

    Full Text Available The connection of an internal network to an external network such as Internet has made it vulnerable to attacks. One class of network attack is unauthorized penetration into network due to the openness of networks. It is possible for hackers to sum access to an internal network, this pose great danger to the network and network resources. Our objective and major concern of network design was to build a secured network, based on software firewall that ensured the integrity and confidentiality of information on the network. We studied several mechanisms to achieve this; one of such mechanism is the implementation of firewall system as a network defence. Our developed firewall has the ability to determine which network traffic should be allowed in or out of the network. Part of our studied work was also channelled towards a comprehensive study of hardware firewall security system with the aim of developing this software based firewall system. Our software firewall goes a long way in protecting an internal network from external unauthorized traffic penetration. We included an anti virus software which is lacking in most firewalls.

  15. A better understanding of long-range temporal dependence of traffic flow time series

    Science.gov (United States)

    Feng, Shuo; Wang, Xingmin; Sun, Haowei; Zhang, Yi; Li, Li

    2018-02-01

    Long-range temporal dependence is an important research perspective for modelling of traffic flow time series. Various methods have been proposed to depict the long-range temporal dependence, including autocorrelation function analysis, spectral analysis and fractal analysis. However, few researches have studied the daily temporal dependence (i.e. the similarity between different daily traffic flow time series), which can help us better understand the long-range temporal dependence, such as the origin of crossover phenomenon. Moreover, considering both types of dependence contributes to establishing more accurate model and depicting the properties of traffic flow time series. In this paper, we study the properties of daily temporal dependence by simple average method and Principal Component Analysis (PCA) based method. Meanwhile, we also study the long-range temporal dependence by Detrended Fluctuation Analysis (DFA) and Multifractal Detrended Fluctuation Analysis (MFDFA). The results show that both the daily and long-range temporal dependence exert considerable influence on the traffic flow series. The DFA results reveal that the daily temporal dependence creates crossover phenomenon when estimating the Hurst exponent which depicts the long-range temporal dependence. Furthermore, through the comparison of the DFA test, PCA-based method turns out to be a better method to extract the daily temporal dependence especially when the difference between days is significant.

  16. An intelligent vehicular traffic signal control system with state flow chart design and fpga prototyping

    International Nuclear Information System (INIS)

    Solangi, U.S.; Memon, T.D.; Noonari, A.S.; Ansari, O.A.

    2017-01-01

    The problem of vehicular traffic congestion is a persistent constraint in the socio-economic development of Pakistan. This paper presents design and implementation of an intelligent traffic controller based on FPGA (Field Programmable Gate Array) to provide an efficient traffic management by optimizing functioning of traffic lights which will result in minimizing traffic congestion at intersections. The existent Traffic Signal system in Pakistan is fixed-time based and offers only Open Loop method for Traffic Control. The Intelligent Traffic Controller presented here uses feedback sensors to read the Traffic density present at a four way intersection to provide an efficient alternative for better supervisory Control of Traffic flow. The traffic density based control logic has been developed in a State Flow Chart for improved visualization of State Machine based operation, and implemented as a Subsystem in Simulink and transferred into VHDL (Hardware Description Language) code using HDL Coder for reducing development time and time to market, which are essential to capitalize Embedded Systems Market. The VHDL code is synthesized with Altera QUARTUS, simulated timing waveform is obtained to verify correctness of the algorithm for different Traffic Scenarios. For implementation purpose estimations were obtained for Cyclone-III and Stratix-III. (author)

  17. An Intelligent Vehicular Traffic Signal Control System with State Flow Chart Design and FPGA Prototyping

    Directory of Open Access Journals (Sweden)

    UMAIR SAEEDSOLANGI

    2017-04-01

    Full Text Available The problem of vehicular traffic congestion is a persistent constraint in the socio-economic development of Pakistan. This paper presents design and implementation of an intelligent traffic controller based on FPGA (Field Programmable Gate Array to provide an efficient traffic management by optimizing functioning of traffic lights which will result in minimizing traffic congestion at intersections. The existent Traffic Signal system in Pakistan is fixed-time based and offers only Open Loop method for Traffic Control. The Intelligent Traffic Controller presented here uses feedback sensors to read the Traffic density present at a four way intersection to provide an efficient alternative for better supervisory Control of Traffic flow. The traffic density based control logic has been developed in a State Flow Chart for improved visualization of State Machine based operation, and implemented as a Subsystem in Simulink and transferred into VHDL (Hardware Description Language code using HDL Coder for reducing development time and time to market, which are essential to capitalize Embedded Systems Market. The VHDL code is synthesized with Altera QUARTUS, simulated timing waveform is obtained to verify correctness of the algorithm for different Traffic Scenarios. For implementation purpose estimations were obtained for Cyclone-III and Stratix-III.

  18. Adaptive EWMA Method Based on Abnormal Network Traffic for LDoS Attacks

    Directory of Open Access Journals (Sweden)

    Dan Tang

    2014-01-01

    Full Text Available The low-rate denial of service (LDoS attacks reduce network services capabilities by periodically sending high intensity pulse data flows. For their concealed performance, it is more difficult for traditional DoS detection methods to detect LDoS attacks; at the same time the accuracy of the current detection methods for LDoS attacks is relatively low. As the fact that LDoS attacks led to abnormal distribution of the ACK traffic, LDoS attacks can be detected by analyzing the distribution characteristics of ACK traffic. Then traditional EWMA algorithm which can smooth the accidental error while being the same as the exceptional mutation may cause some misjudgment; therefore a new LDoS detection method based on adaptive EWMA (AEWMA algorithm is proposed. The AEWMA algorithm which uses an adaptive weighting function instead of the constant weighting of EWMA algorithm can smooth the accidental error and retain the exceptional mutation. So AEWMA method is more beneficial than EWMA method for analyzing and measuring the abnormal distribution of ACK traffic. The NS2 simulations show that AEWMA method can detect LDoS attacks effectively and has a low false negative rate and a false positive rate. Based on DARPA99 datasets, experiment results show that AEWMA method is more efficient than EWMA method.

  19. Macroscopic discontinuity modeling for multiclass multilane traffic flow operations

    NARCIS (Netherlands)

    Ngoduy, D.

    2006-01-01

    Congestion in traffic networks causes severe problems in and around large cities. It is the source of important economic inefficiencies, both on the level of individual persons and of the society as a whole. However, societal and environmental constraints prohibit large-scale extensions of the

  20. Wavelength converter placement in optical networks with dynamic traffic

    DEFF Research Database (Denmark)

    Buron, Jakob Due; Ruepp, Sarah Renée; Wessing, Henrik

    2008-01-01

    We evaluate the connection provisioning performance of GMPLS-controlled wavelength routed networks under dynamic traffic load and using three different wavelength converter placement heuristics. Results show that a simple uniform placement heuristic matches the performance of complex heuristics...

  1. The improved degree of urban road traffic network: A case study of Xiamen, China

    Science.gov (United States)

    Wang, Shiguang; Zheng, Lili; Yu, Dexin

    2017-03-01

    The complex network theory is applied to the study of urban road traffic network topology, and we constructed a new measure to characterize an urban road network. It is inspiring to quantify the interaction more appropriately between nodes in complex networks, especially in the field of traffic. The measure takes into account properties of lanes (e.g. number of lanes, width, traffic direction). As much, it is a more comprehensive measure in comparison to previous network measures. It can be used to grasp the features of urban street network more clearly. We applied this measure to the road network in Xiamen, China. Based on a standard method from statistical physics, we examined in more detail the distribution of this new measure and found that (1) due to the limitation of space geographic attributes, traditional research conclusions acquired by using the original definition of degree to study the primal approach modeled urban street network are not very persuasive; (2) both of the direction of the network connection and the degree's odd or even classifications need to be analyzed specifically; (3) the improved degree distribution presents obvious hierarchy, and hierarchical values conform to the power-law distribution, and correlation of our new measure shows some significant segmentation of the urban road network.

  2. The wireshark field guide analyzing and troubleshooting network traffic

    CERN Document Server

    Shimonski, Robert

    2013-01-01

    The Wireshark Field Guide provides hackers, pen testers, and network administrators with practical guidance on capturing and interactively browsing computer network traffic. Wireshark is the world's foremost network protocol analyzer, with a rich feature set that includes deep inspection of hundreds of protocols, live capture, offline analysis and many other features. The Wireshark Field Guide covers the installation, configuration and use of this powerful multi-platform tool. The book give readers the hands-on skills to be more productive with Wireshark as they drill

  3. Modelling traffic flows with intelligent cars and intelligent roads

    NARCIS (Netherlands)

    van Arem, Bart; Tampere, Chris M.J.; Malone, Kerry

    2003-01-01

    This paper addresses the modeling of traffic flows with intelligent cars and intelligent roads. It will describe the modeling approach MIXIC and review the results for different ADA systems: Adaptive Cruise Control, a special lane for Intelligent Vehicles, cooperative following and external speed

  4. Deep neural network for traffic sign recognition systems: An analysis of spatial transformers and stochastic optimisation methods.

    Science.gov (United States)

    Arcos-García, Álvaro; Álvarez-García, Juan A; Soria-Morillo, Luis M

    2018-03-01

    This paper presents a Deep Learning approach for traffic sign recognition systems. Several classification experiments are conducted over publicly available traffic sign datasets from Germany and Belgium using a Deep Neural Network which comprises Convolutional layers and Spatial Transformer Networks. Such trials are built to measure the impact of diverse factors with the end goal of designing a Convolutional Neural Network that can improve the state-of-the-art of traffic sign classification task. First, different adaptive and non-adaptive stochastic gradient descent optimisation algorithms such as SGD, SGD-Nesterov, RMSprop and Adam are evaluated. Subsequently, multiple combinations of Spatial Transformer Networks placed at distinct positions within the main neural network are analysed. The recognition rate of the proposed Convolutional Neural Network reports an accuracy of 99.71% in the German Traffic Sign Recognition Benchmark, outperforming previous state-of-the-art methods and also being more efficient in terms of memory requirements. Copyright © 2018 Elsevier Ltd. All rights reserved.

  5. On the Design of Energy Efficient Optical Networks with Software Defined Networking Control Across Core and Access Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Yan, Ying; Dittmann, Lars

    2013-01-01

    This paper presents a Software Defined Networking (SDN) control plane based on an overlay GMPLS control model. The SDN control platform manages optical core networks (WDM/DWDM networks) and the associated access networks (GPON networks), which makes it possible to gather global information...... and enable wider areas' energy efficiency networking. The energy related information of the networks and the types of the traffic flows are collected and utilized for the end-to-end QoS provision. Dynamic network simulation results show that by applying different routing algorithms according to the type...... of traffic in the core networks, the energy efficiency of the network is improved without compromising the quality of service....

  6. Analyzing the Influence of Mobile Phone Use of Drivers on Traffic Flow Based on an Improved Cellular Automaton Model

    Directory of Open Access Journals (Sweden)

    Yao Xiao

    2015-01-01

    Full Text Available This paper aimed to analyze the influence of drivers’ behavior of phone use while driving on traffic flow, including both traffic efficiency and traffic safety. An improved cellular automaton model was proposed to simulate traffic flow with distracted drivers based on the Nagel-Schreckenberg model. The driving characters of drivers using a phone were first discussed and a value representing the probability to use a phone while driving was put into the CA model. Simulation results showed that traffic flow rate was significantly reduced if some drivers used a phone compared to no phone use. The flow rate and velocity decreased as the proportion of drivers using a phone increased. While, under low density, the risk of traffic decreased first and then increased as the distracted drivers increased, the distracted behavior of drivers, like using a phone, could reduce the flow rate by 5 percent according to the simulation.

  7. Towards Mining Latent Client Identifiers from Network Traffic

    Directory of Open Access Journals (Sweden)

    Jain Sakshi

    2016-04-01

    Full Text Available Websites extensively track users via identifiers that uniquely map to client machines or user accounts. Although such tracking has desirable properties like enabling personalization and website analytics, it also raises serious concerns about online user privacy, and can potentially enable illicit surveillance by adversaries who broadly monitor network traffic.

  8. Self-Adapting Routing Overlay Network for Frequently Changing Application Traffic in Content-Based Publish/Subscribe System

    Directory of Open Access Journals (Sweden)

    Meng Chi

    2014-01-01

    Full Text Available In the large-scale distributed simulation area, the topology of the overlay network cannot always rapidly adapt to frequently changing application traffic to reduce the overall traffic cost. In this paper, we propose a self-adapting routing strategy for frequently changing application traffic in content-based publish/subscribe system. The strategy firstly trains the traffic information and then uses this training information to predict the application traffic in the future. Finally, the strategy reconfigures the topology of the overlay network based on this predicting information to reduce the overall traffic cost. A predicting path is also introduced in this paper to reduce the reconfiguration numbers in the process of the reconfigurations. Compared to other strategies, the experimental results show that the strategy proposed in this paper could reduce the overall traffic cost of the publish/subscribe system in less reconfigurations.

  9. Stationary velocity distributions in traffic flows

    International Nuclear Information System (INIS)

    1997-01-01

    We introduce a traffic flow model that incorporates clustering and passing. We obtain analytically the steady state characteristics of the flow from a Boltzmann-like equation. A single dimensionless parameter, R=c 0 v 0 t 0 with c 0 the concentration, v 0 the velocity range, and t 0 -1 the passing rate, determines the nature of the steady state. When R 1, large clusters with average mass left-angle m right-angle ∼R α form, and the flux is J∼R -γ . The initial distribution of slow cars governs the statistics. When P 0 (v)∼v μ as v→0, the scaling exponents are γ=1/(μ+2), α=1/2 when μ>0, and α=(μ+1)/(μ+2) when μ<0. copyright 1997 The American Physical Society

  10. Analyses of Lattice Traffic Flow Model on a Gradient Highway

    International Nuclear Information System (INIS)

    Gupta Arvind Kumar; Redhu Poonam; Sharma Sapna

    2014-01-01

    The optimal current difference lattice hydrodynamic model is extended to investigate the traffic flow dynamics on a unidirectional single lane gradient highway. The effect of slope on uphill/downhill highway is examined through linear stability analysis and shown that the slope significantly affects the stability region on the phase diagram. Using nonlinear stability analysis, the Burgers, Korteweg-deVries (KdV) and modified Korteweg-deVries (mKdV) equations are derived in stable, metastable and unstable region, respectively. The effect of reaction coefficient is examined and concluded that it plays an important role in suppressing the traffic jams on a gradient highway. The theoretical findings have been verified through numerical simulation which confirm that the slope on a gradient highway significantly influence the traffic dynamics and traffic jam can be suppressed efficiently by considering the optimal current difference effect in the new lattice model. (nuclear physics)

  11. Modelling Altitude Information in Two-Dimensional Traffic Networks for Electric Mobility Simulation

    Directory of Open Access Journals (Sweden)

    Diogo Santos

    2016-06-01

    Full Text Available Elevation data is important for electric vehicle simulation. However, traffic simulators are often two-dimensional and do not offer the capability of modelling urban networks taking elevation into account. Specifically, SUMO - Simulation of Urban Mobility, a popular microscopic traffic simulator, relies on networks previously modelled with elevation data as to provide this information during simulations. This work tackles the problem of adding elevation data to urban network models - particularly for the case of the Porto urban network, in Portugal. With this goal in mind, a comparison between different altitude information retrieval approaches is made and a simple tool to annotate network models with altitude data is proposed. The work starts by describing the methodological approach followed during research and development, then describing and analysing its main findings. This description includes an in-depth explanation of the proposed tool. Lastly, this work reviews some related work to the subject.

  12. Carpooling and Driver Responses to Fuel Price Changes: Evidence from Traffic Flows in Los Angeles

    OpenAIRE

    Antonio M. Bento; Jonathan E. Hughes; Daniel T. Kaffine

    2012-01-01

    Understanding how drivers respond to fuel price changes has important implications for highway congestion, accidents, carbon policy, local air pollution and taxation. We examine the underexplored relationship between fuel prices and carpooling. Using a simple theoretical model we show that traffic flows in mainline lanes decrease when fuel prices increase. However in carpool (HOV) lanes, flow can either increase or decrease. Traffic flows in mainline lanes are shown to be more responsive to p...

  13. A Bio-Inspired Approach to Traffic Network Equilibrium Assignment Problem.

    Science.gov (United States)

    Zhang, Xiaoge; Mahadevan, Sankaran

    2018-04-01

    Finding an equilibrium state of the traffic assignment plays a significant role in the design of transportation networks. We adapt the path finding mathematical model of slime mold Physarum polycephalum to solve the traffic equilibrium assignment problem. We make three contributions in this paper. First, we propose a generalized Physarum model to solve the shortest path problem in directed and asymmetric graphs. Second, we extend it further to resolve the network design problem with multiple source nodes and sink nodes. At last, we demonstrate that the Physarum solver converges to the user-optimized (Wardrop) equilibrium by dynamically updating the costs of links in the network. In addition, convergence of the developed algorithm is proved. Numerical examples are used to demonstrate the efficiency of the proposed algorithm. The superiority of the proposed algorithm is demonstrated in comparison with several other algorithms, including the Frank-Wolfe algorithm, conjugate Frank-Wolfe algorithm, biconjugate Frank-Wolfe algorithm, and gradient projection algorithm.

  14. Traffic-aware Elastic Optical Networks to leverage Energy Savings

    DEFF Research Database (Denmark)

    Turus, Ioan; Fagertun, Anna Manolova; Dittmann, Lars

    2014-01-01

    Because of the static nature of the deployed optical networks, large energy wastage is experienced today in production networks such as Telecom networks . With power-adaptive optical interfaces and suitable grooming procedures, we propose the design of more energy efficient transport networks....... Optical network reconfigurations are performed by GMPLS node controllers according to monitored traffic information. The investigated energy reduction strategies are simulated on two large scale transport networks (DT17 and COST37). The results show that the energy savings obtained by these strategies......-Europea n COST37 network, for both symbol-rate and modulation format adaptations significant savings are obtained . Mixed adaptation (jointly performing symbol-rate and modulation format adaptations) used together with optical grooming allows up to 4 4 % and 4 7 % power savings in DT17 and COST37 networks...

  15. Understanding the T2 traffic in CMS during Run-1

    Science.gov (United States)

    T, Wildish

    2015-12-01

    In the run-up to Run-1 CMS was operating its facilities according to the MONARC model, where data-transfers were strictly hierarchical in nature. Direct transfers between Tier-2 nodes was excluded, being perceived as operationally intensive and risky in an era where the network was expected to be a major source of errors. By the end of Run-1 wide-area networks were more capable and stable than originally anticipated. The original data-placement model was relaxed, and traffic was allowed between Tier-2 nodes. Tier-2 to Tier-2 traffic in 2012 already exceeded the amount of Tier-2 to Tier-1 traffic, so it clearly has the potential to become important in the future. Moreover, while Tier-2 to Tier-1 traffic is mostly upload of Monte Carlo data, the Tier-2 to Tier-2 traffic represents data moved in direct response to requests from the physics analysis community. As such, problems or delays there are more likely to have a direct impact on the user community. Tier-2 to Tier-2 traffic may also traverse parts of the WAN that are at the 'edge' of our network, with limited network capacity or reliability compared to, say, the Tier-0 to Tier-1 traffic which goes the over LHCOPN network. CMS is looking to exploit technologies that allow us to interact with the network fabric so that it can manage our traffic better for us, this we hope to achieve before the end of Run-2. Tier-2 to Tier-2 traffic would be the most interesting use-case for such traffic management, precisely because it is close to the users' analysis and far from the 'core' network infrastructure. As such, a better understanding of our Tier-2 to Tier-2 traffic is important. Knowing the characteristics of our data-flows can help us place our data more intelligently. Knowing how widely the data moves can help us anticipate the requirements for network capacity, and inform the dynamic data placement algorithms we expect to have in place for Run-2. This paper presents an analysis of the CMS Tier-2 traffic during Run 1.

  16. Traffic Generator (TrafficGen) Version 1.4.2: Users Guide

    Science.gov (United States)

    2016-06-01

    the network with Transmission Control Protocol and User Datagram Protocol Internet Protocol traffic. Each node generating network traffic in an...TrafficGen Graphical User Interface (GUI) 3 3.1 Anatomy of the User Interface 3 3.2 Scenario Configuration and MGEN Files 4 4. Working with...for public release; distribution is unlimited. vi List of Figures Fig. 1 TrafficGen user interface

  17. Bandwidth Impacts of Localizing Peer-to-Peer IP Video Traffic in Access and Aggregation Networks

    Directory of Open Access Journals (Sweden)

    Kenneth Kerpez

    2008-10-01

    Full Text Available This paper examines the burgeoning impact of peer-to-peer (P2P traffic IP video traffic. High-quality IPTV or Internet TV has high-bandwidth requirements, and P2P IP video could severely strain broadband networks. A model for the popularity of video titles is given, showing that some titles are very popular and will often be available locally; making localized P2P attractive for video titles. The bandwidth impacts of localizing P2P video to try and keep traffic within a broadband access network area or within a broadband access aggregation network area are examined. Results indicate that such highly localized P2P video can greatly lower core bandwidth usage.

  18. Mobile Phone Based RIMS for Traffic Control a Case Study of Tanzania

    OpenAIRE

    Angela-Aida Karugila Runyoro; Jesuk Ko

    2015-01-01

    Vehicles saturation in transportation infrastructure causes traffic congestion, accidents, transportation delays and environment pollution. This problem can be resolved with proper management of traffic flow. Existing traffic management systems are challenged on capturing and processing real-time road data from wide area road networks. The main purpose of this study is to address the gap by implementing a mobile phone based Road Information Management System. The proposed...

  19. A Big Network Traffic Data Fusion Approach Based on Fisher and Deep Auto-Encoder

    Directory of Open Access Journals (Sweden)

    Xiaoling Tao

    2016-03-01

    Full Text Available Data fusion is usually performed prior to classification in order to reduce the input space. These dimensionality reduction techniques help to decline the complexity of the classification model and thus improve the classification performance. The traditional supervised methods demand labeled samples, and the current network traffic data mostly is not labeled. Thereby, better learners will be built by using both labeled and unlabeled data, than using each one alone. In this paper, a novel network traffic data fusion approach based on Fisher and deep auto-encoder (DFA-F-DAE is proposed to reduce the data dimensions and the complexity of computation. The experimental results show that the DFA-F-DAE improves the generalization ability of the three classification algorithms (J48, back propagation neural network (BPNN, and support vector machine (SVM by data dimensionality reduction. We found that the DFA-F-DAE remarkably improves the efficiency of big network traffic classification.

  20. Network Traffic Monitoring Using Poisson Dynamic Linear Models

    Energy Technology Data Exchange (ETDEWEB)

    Merl, D. M. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2011-05-09

    In this article, we discuss an approach for network forensics using a class of nonstationary Poisson processes with embedded dynamic linear models. As a modeling strategy, the Poisson DLM (PoDLM) provides a very flexible framework for specifying structured effects that may influence the evolution of the underlying Poisson rate parameter, including diurnal and weekly usage patterns. We develop a novel particle learning algorithm for online smoothing and prediction for the PoDLM, and demonstrate the suitability of the approach to real-time deployment settings via a new application to computer network traffic monitoring.

  1. Traffic Flow Visualization and Control

    National Research Council Canada - National Science Library

    Larson, Robert

    1999-01-01

    .... Air Force Research Laboratory. It is a video-camera-based, wide-area, traffic surveillance and detection system that provides real-time traffic information to traffic management center operators...

  2. assessment of traffic flow on enugu highways using speed density

    African Journals Online (AJOL)

    HOD

    Corresponding author, tel: +234 – 806 – 435 – 0200 ... construction, maintenance and optimization of the highways using the ...... Research Part A: Policy and Practice 29(4), 273-281. 1995. ... relationships: Quality and Theory of Traffic Flow.

  3. Probabilistic physical characteristics of phase transitions at highway bottlenecks: incommensurability of three-phase and two-phase traffic-flow theories.

    Science.gov (United States)

    Kerner, Boris S; Klenov, Sergey L; Schreckenberg, Michael

    2014-05-01

    Physical features of induced phase transitions in a metastable free flow at an on-ramp bottleneck in three-phase and two-phase cellular automaton (CA) traffic-flow models have been revealed. It turns out that at given flow rates at the bottleneck, to induce a moving jam (F → J transition) in the metastable free flow through the application of a time-limited on-ramp inflow impulse, in both two-phase and three-phase CA models the same critical amplitude of the impulse is required. If a smaller impulse than this critical one is applied, neither F → J transition nor other phase transitions can occur in the two-phase CA model. We have found that in contrast with the two-phase CA model, in the three-phase CA model, if the same smaller impulse is applied, then a phase transition from free flow to synchronized flow (F → S transition) can be induced at the bottleneck. This explains why rather than the F → J transition, in the three-phase theory traffic breakdown at a highway bottleneck is governed by an F → S transition, as observed in real measured traffic data. None of two-phase traffic-flow theories incorporates an F → S transition in a metastable free flow at the bottleneck that is the main feature of the three-phase theory. On the one hand, this shows the incommensurability of three-phase and two-phase traffic-flow theories. On the other hand, this clarifies why none of the two-phase traffic-flow theories can explain the set of fundamental empirical features of traffic breakdown at highway bottlenecks.

  4. Optimizing traffic flow efficiency by controlling lane changes: collective, group and user optima

    NARCIS (Netherlands)

    Yao, S.; Knoop, V.L.; van Arem, B.

    2017-01-01

    Lane changes can lead to disturbances in traffic flow, whilst the uneven distribution of traffic over different lanes as a result of lane changes can also lead to instabilities and congestion on one specific lane. Therefore, giving advice on lane change can be beneficial for both individual drivers

  5. Memory effects in microscopic traffic models and wide scattering in flow-density data

    Science.gov (United States)

    Treiber, Martin; Helbing, Dirk

    2003-10-01

    By means of microscopic simulations we show that noninstantaneous adaptation of the driving behavior to the traffic situation together with the conventional method to measure flow-density data provides a possible explanation for the observed inverse-λ shape and the wide scattering of flow-density data in “synchronized” congested traffic. We model a memory effect in the response of drivers to the traffic situation for a wide class of car-following models by introducing an additional dynamical variable (the “subjective level of service”) describing the adaptation of drivers to the surrounding traffic situation during the past few minutes and couple this internal state to parameters of the underlying model that are related to the driving style. For illustration, we use the intelligent-driver model (IDM) as the underlying model, characterize the level of service solely by the velocity, and couple the internal variable to the IDM parameter “time gap” to model an increase of the time gap in congested traffic (“frustration effect”), which is supported by single-vehicle data. We simulate open systems with a bottleneck and obtain flow-density data by implementing “virtual detectors.” The shape, relative size, and apparent “stochasticity” of the region of the scattered data points agree nearly quantitatively with empirical data. Wide scattering is even observed for identical vehicles, although the proposed model is a time-continuous, deterministic, single-lane car-following model with a unique fundamental diagram.

  6. Flexible Tube-Based Network Control, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — The Innovation Laboratory, Inc. builds a control system which controls the topology of an air traffic flow network and the network flow properties which enables Air...

  7. Advances in dynamic network modeling in complex transportation systems

    CERN Document Server

    Ukkusuri, Satish V

    2013-01-01

    This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.

  8. Dynamic baseline detection method for power data network service

    Science.gov (United States)

    Chen, Wei

    2017-08-01

    This paper proposes a dynamic baseline Traffic detection Method which is based on the historical traffic data for the Power data network. The method uses Cisco's NetFlow acquisition tool to collect the original historical traffic data from network element at fixed intervals. This method uses three dimensions information including the communication port, time, traffic (number of bytes or number of packets) t. By filtering, removing the deviation value, calculating the dynamic baseline value, comparing the actual value with the baseline value, the method can detect whether the current network traffic is abnormal.

  9. Traffic Analysis for Real-Time Communication Networks onboard Ships

    DEFF Research Database (Denmark)

    Schiøler, Henrik; Nielsen, Jens Frederik Dalsgaard; Jørgensen, N.

    1998-01-01

    The paper presents a novel method for establishing worst case estimates of queue lenghts and transmission delays in networks of interconnected segments each of ring topology as defined by the ATOMOS project for marine automation. A non probalistic model for describing traffic is introduced as well...

  10. Traffic Analysis for Real-Time Communication Networks onboard Ships

    DEFF Research Database (Denmark)

    Schiøler, Henrik; Nielsen, Jens Frederik Dalsgaard; Jørgensen, N.

    The paper presents a novel method for establishing worst case estimates of queue lenghts and transmission delays in networks of interconnected segments each of ring topology as defined by the ATOMOS project for marine automation. A non probalistic model for describing traffic is introduced as well...

  11. Bandwidth Impacts of Localizing Peer-to-Peer IP Video Traffic in Access and Aggregation Networks

    Directory of Open Access Journals (Sweden)

    Kerpez Kenneth

    2008-01-01

    Full Text Available Abstract This paper examines the burgeoning impact of peer-to-peer (P2P traffic IP video traffic. High-quality IPTV or Internet TV has high-bandwidth requirements, and P2P IP video could severely strain broadband networks. A model for the popularity of video titles is given, showing that some titles are very popular and will often be available locally; making localized P2P attractive for video titles. The bandwidth impacts of localizing P2P video to try and keep traffic within a broadband access network area or within a broadband access aggregation network area are examined. Results indicate that such highly localized P2P video can greatly lower core bandwidth usage.

  12. Optimal Traffic Allocation for Multi-Stream Aggregation in Heterogeneous Networks

    DEFF Research Database (Denmark)

    Popovska Avramova, Andrijana; Iversen, Villy Bæk

    2015-01-01

    nature of radio access networks are considered as important factors for performance improvement by multi-stream aggregation. Therefore, in our model, the networks are represented by different queueing systems in order to indicate networks with opposite quality of service provisioning, capacity and delay...... variations. Furthermore, services with different traffic characteristics in terms of quality of service requirements are considered. The simulation results show the advantages of our scheme with respect to efficient increase in data rate and delay performance compared to traditional schemes....

  13. Current-flow efficiency of networks

    Science.gov (United States)

    Liu, Kai; Yan, Xiaoyong

    2018-02-01

    Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.

  14. Comparing detection and disclosure of traffic incidents in social networks: an intelligent approach based on Twitter vs. Waze

    Directory of Open Access Journals (Sweden)

    Sebastián Vallejos

    2018-03-01

    Full Text Available Nowadays, social networks have become  in a  communication  medium widely  used to disseminate any type  of  information. In  particular,  the  shared  information  in  social  networks  usually  includes  a  considerable number of traffic incidents reports of specific cities. In light of this, specialized social networks have emerged for detecting and disseminating traffic incidents, differentiating from generic social networks in which a wide variety of  topics  are  communicated.  In this  context,  Twitter  is  a  case  in  point  of  a  generic  social  network  in  which  its users often share information about traffic incidents, while Waze is a social network specialized in traffic. In this paper we present a comparative study between Waze and an intelligent approach that detects traffic incidents by analyzing publications shared in Twitter. The comparative study was carried out considering Ciudad Autónoma de Buenos  Aires  (CABA,  Argentina,  as  the  region  of  interest.  The results of this work suggest that both social networks should be considered as complementary sources of information. This conclusion is based on the fact that the proportion of mutual detections, i.e. traffic incidents detected by both approaches, was considerably low since it did not exceed 6% of the cases. Moreover, the results do not show that any of the approaches tend to anticipate in time to the other one in the detection of traffic incidents.

  15. FORECASTING OF PASSENGER TRAFFIC UPON IMPLEMENTATION OF HIGH-SPEED RUNNING

    Directory of Open Access Journals (Sweden)

    M. B. Kurhan

    2017-02-01

    Full Text Available Purpose. Forecasting of passenger traffic flows in the future is an essential and integral part of the complex process of designing of high-speed network (HSN. HSN direction and its parameters are determined by the volume of passenger traffic, the estimated value of which depends on the economic performance of the country, as well as the material status of citizens living in HSN concentration area, transport mobility of population, development of competing modes of transport and so on. The purpose of this work is to analyse the existing methods of passenger traffic forecasting, to evaluate errors of the existing models concerning determination of traffic volumes and to specify the scientific approach to the development of high-speed rail transport in Ukraine. Methodology. The existing forecasting methods are reduced to the following ones: Delphi approach, extrapolation method, factor and correlation analysis, simulation method. The method described in this paper is based on scientific approaches such as analysis – a comprehensive and detailed study of various aspects of the known forecasting methods, comparing of existing methods for establishing differences and similarities, as well as deduction – use of general knowledge to get the new particular one. Thus, the unified indicators determined for the country as a whole, such as gross domestic product, national income, total population and others cannot be used to forecast the traffic flow on specific areas of HSN construction. Therefore, it is necessary to move from the overall forecast to traffic volume forecast on particular direction. Findings. The conclusions are derived from the analysis of different approaches and methods of passenger flow forecasting. It is proposed to create typical techniques of traffic flow forecasting using modern mathematical methods that would allow avoiding unreasonable decisions and shortening project development time. The resulting recommendations will help

  16. Node Load Balance Multi-flow Opportunistic Routing in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Wang Tao

    2014-04-01

    Full Text Available Opportunistic routing (OR has been proposed to improve the performance of wireless networks by exploiting the multi-user diversity and broadcast nature of the wireless medium. It involves multiple candidate forwarders to relay packets every hop. The existing OR doesn’t take account of the traffic load and load balance, therefore some nodes may be overloaded while the others may not, leading to network performance decline. In this paper, we focus on opportunities routing selection with node load balance which is described as a convex optimization problem. To solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed Node load balance Multi-flow Opportunistic Routing algorithm (NMOR is proposed. With node load balance constraint, NMOR allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunities routing. The simulation results show that NMOR algorithm improves 100 %, 62 % of the aggregative throughput than ETX and EAX, respectively.

  17. SmartCop: Enabling Smart Traffic Violations Ticketing in Vehicular Named Data Networks

    Directory of Open Access Journals (Sweden)

    Syed Hassan Ahmed

    2016-01-01

    Full Text Available Recently, various applications for Vehicular Ad hoc Networks (VANETs have been proposed and smart traffic violation ticketing is one of them. On the other hand, the new Information-Centric Networking (ICN architectures have emerged and been investigated into VANETs, such as Vehicular Named Data Networking (VNDN. However, the existing applications in VANETs are not suitable for VNDN paradigm due to the dependency on a “named content” instead of a current “host-centric” approach. Thus, we need to design the emerging and new architectures for VNDN applications. In this paper, we propose a smart traffic violation ticketing (TVT system for VNDN, named as SmartCop, that enables a cop vehicle (CV to issue tickets for traffic violation(s to the offender(s autonomously, once they are in the transmission range of that CV. The ticket issuing delay, messaging cost, and percentage of violations detected for varying number of vehicles, violators, CVs, and vehicles speeds are estimated through simulations. In addition, we provide a road map of future research directions for enabling safe driving experience in future cars aided with VNDN technology.

  18. Concept for a Satellite-Based Advanced Air Traffic Management System : Volume 8. Operational Logic Flow Diagrams for a Generic Advanced Air Traffic Management system

    Science.gov (United States)

    1974-02-01

    The volume presents a description of the services a generic Advanced Air Traffic Management System (AATMS) should provide to the useres of the system to facilitate the safe, efficient flow of traffic. It provides a definition of the functions which t...

  19. An evolutionary outlook of air traffic flow management techniques

    Science.gov (United States)

    Kistan, Trevor; Gardi, Alessandro; Sabatini, Roberto; Ramasamy, Subramanian; Batuwangala, Eranga

    2017-01-01

    In recent years Air Traffic Flow Management (ATFM) has become pertinent even in regions without sustained overload conditions caused by dense traffic operations. Increasing traffic volumes in the face of constrained resources has created peak congestion at specific locations and times in many areas of the world. Increased environmental awareness and economic drivers have combined to create a resurgent interest in ATFM as evidenced by a spate of recent ATFM conferences and workshops mediated by official bodies such as ICAO, IATA, CANSO the FAA and Eurocontrol. Significant ATFM acquisitions in the last 5 years include South Africa, Australia and India. Singapore, Thailand and Korea are all expected to procure ATFM systems within a year while China is expected to develop a bespoke system. Asia-Pacific nations are particularly pro-active given the traffic growth projections for the region (by 2050 half of all air traffic will be to, from or within the Asia-Pacific region). National authorities now have access to recently published international standards to guide the development of national and regional operational concepts for ATFM, geared to Communications, Navigation, Surveillance/Air Traffic Management and Avionics (CNS+A) evolutions. This paper critically reviews the field to determine which ATFM research and development efforts hold the best promise for practical technological implementations, offering clear benefits both in terms of enhanced safety and efficiency in times of growing air traffic. An evolutionary approach is adopted starting from an ontology of current ATFM techniques and proceeding to identify the technological and regulatory evolutions required in the future CNS+A context, as the aviation industry moves forward with a clearer understanding of emerging operational needs, the geo-political realities of regional collaboration and the impending needs of global harmonisation.

  20. HOW TRAVEL DEMAND AFFECTS DETECTION OF NON-RECURRENT TRAFFIC CONGESTION ON URBAN ROAD NETWORKS

    Directory of Open Access Journals (Sweden)

    B. Anbaroglu

    2016-06-01

    Full Text Available Occurrence of non-recurrent traffic congestion hinders the economic activity of a city, as travellers could miss appointments or be late for work or important meetings. Similarly, for shippers, unexpected delays may disrupt just-in-time delivery and manufacturing processes, which could lose them payment. Consequently, research on non-recurrent congestion detection on urban road networks has recently gained attention. By analysing large amounts of traffic data collected on a daily basis, traffic operation centres can improve their methods to detect non-recurrent congestion rapidly and then revise their existing plans to mitigate its effects. Space-time clusters of high link journey time estimates correspond to non-recurrent congestion events. Existing research, however, has not considered the effect of travel demand on the effectiveness of non-recurrent congestion detection methods. Therefore, this paper investigates how travel demand affects detection of non-recurrent traffic congestion detection on urban road networks. Travel demand has been classified into three categories as low, normal and high. The experiments are carried out on London’s urban road network, and the results demonstrate the necessity to adjust the relative importance of the component evaluation criteria depending on the travel demand level.

  1. Northern and Southern European Traffic Flow Land Segment Analysis as Part of the Redirection Justification

    Directory of Open Access Journals (Sweden)

    SiniŁa Vilke

    2017-12-01

    Full Text Available Natural geotraffic flows act as one of the most important factors directly affecting redirections of the world transportation routes. In terms of door-to-door multimodal transport chain, several routes from Far East toward European destinations exist, with Northern European route acting as prevailing one. The proposed paper elaborates possibilities of redirection of the traffic flow by directing cargoes to an alternative route through the Adriatic Sea. The aim is to justify realisation of mentioned possibility in terms of land transportation segment analysis, i.e. by analysing cargo transportation from ports to final destinations in Central Europe, placed in natural gravitational hinterland of ports of Northern Adriatic Port Association (NAPA. Geo-traffic and logistics’ analyses of NAPA ports are presented in the paper. Container traffic and its trend as compared with Northern European ports are analysed. The development plans of inland connections are presented in function of justification of the traffic flow redirection. A model for the selection and evaluation of the optimal container transport route by using the multiple criteria analysis (MCA has been introduced and developed. The model was applied for the selection of the representative service connecting Far East (origin and the central Europe (destination by detailed analysis of the land transportation segment. The PROMETHEE method was used for the model testing and evaluation. Summarised results are presented and discussed tending to confirmation of the traffic flow redirection justification.

  2. A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

    Directory of Open Access Journals (Sweden)

    Jisheng Zhang

    2015-06-01

    Full Text Available It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks.

  3. A Hybrid Short-Term Traffic Flow Prediction Model Based on Singular Spectrum Analysis and Kernel Extreme Learning Machine.

    Directory of Open Access Journals (Sweden)

    Qiang Shang

    Full Text Available Short-term traffic flow prediction is one of the most important issues in the field of intelligent transport system (ITS. Because of the uncertainty and nonlinearity, short-term traffic flow prediction is a challenging task. In order to improve the accuracy of short-time traffic flow prediction, a hybrid model (SSA-KELM is proposed based on singular spectrum analysis (SSA and kernel extreme learning machine (KELM. SSA is used to filter out the noise of traffic flow time series. Then, the filtered traffic flow data is used to train KELM model, the optimal input form of the proposed model is determined by phase space reconstruction, and parameters of the model are optimized by gravitational search algorithm (GSA. Finally, case validation is carried out using the measured data of an expressway in Xiamen, China. And the SSA-KELM model is compared with several well-known prediction models, including support vector machine, extreme learning machine, and single KLEM model. The experimental results demonstrate that performance of the proposed model is superior to that of the comparison models. Apart from accuracy improvement, the proposed model is more robust.

  4. Delay-feedback control strategy for reducing CO2 emission of traffic flow system

    Science.gov (United States)

    Zhang, Li-Dong; Zhu, Wen-Xing

    2015-06-01

    To study the signal control strategy for reducing traffic emission theoretically, we first presented a kind of discrete traffic flow model with relative speed term based on traditional coupled map car-following model. In the model, the relative speed difference between two successive running cars is incorporated into following vehicle's acceleration running equation. Then we analyzed its stability condition with discrete control system stability theory. Third, we designed a delay-feedback controller to suppress traffic jam and decrease traffic emission based on modern controller theory. Last, numerical simulations are made to support our theoretical results, including the comparison of models' stability analysis, the influence of model type and signal control on CO2 emissions. The results show that the temporal behavior of our model is superior to other models, and the traffic signal controller has good effect on traffic jam suppression and traffic CO2 emission, which fully supports the theoretical conclusions.

  5. Fermi-Dirac statistics and traffic in complex networks.

    Science.gov (United States)

    de Moura, Alessandro P S

    2005-06-01

    We propose an idealized model for traffic in a network, in which many particles move randomly from node to node, following the network's links, and it is assumed that at most one particle can occupy any given node. This is intended to mimic the finite forwarding capacity of nodes in communication networks, thereby allowing the possibility of congestion and jamming phenomena. We show that the particles behave like free fermions, with appropriately defined energy-level structure and temperature. The statistical properties of this system are thus given by the corresponding Fermi-Dirac distribution. We use this to obtain analytical expressions for dynamical quantities of interest, such as the mean occupation of each node and the transport efficiency, for different network topologies and particle densities. We show that the subnetwork of free nodes always fragments into small isolated clusters for a sufficiently large number of particles, implying a communication breakdown at some density for all network topologies. These results are compared to direct simulations.

  6. Modeling mechanical restriction differences between car and heavy truck in two-lane cellular automata traffic flow model

    Science.gov (United States)

    Li, Xin; Li, Xingang; Xiao, Yao; Jia, Bin

    2016-06-01

    Real traffic is heterogeneous with car and truck. Due to mechanical restrictions, the car and the truck have different limited deceleration capabilities, which are important factors in safety driving. This paper extends the single lane safety driving (SD) model with limited deceleration capability to two-lane SD model, in which car-truck heterogeneous traffic is considered. A car has a larger limited deceleration capability while a heavy truck has a smaller limited deceleration capability as a result of loaded goods. Then the safety driving conditions are different as the types of the following and the leading vehicles vary. In order to eliminate the well-known plug in heterogeneous two-lane traffic, it is assumed that heavy truck has active deceleration behavior when the heavy truck perceives the forming plug. The lane-changing decisions are also determined by the safety driving conditions. The fundamental diagram, spatiotemporal diagram, and lane-changing frequency were investigated to show the effect of mechanical restriction on heterogeneous traffic flow. It was shown that there would be still three traffic phases in heterogeneous traffic condition; the active deceleration of the heavy truck could well eliminate the plug; the lane-changing frequency was low in synchronized flow; the flow and velocity would decrease as the proportion of heavy truck grows or the limited deceleration capability of heavy truck drops; and the flow could be improved with lane control measures.

  7. Multi Service Proxy: Mobile Web Traffic Entitlement Point in 4G Core Network

    Directory of Open Access Journals (Sweden)

    Dalibor Uhlir

    2015-05-01

    Full Text Available Core part of state-of-the-art mobile networks is composed of several standard elements like GGSN (Gateway General Packet Radio Service Support Node, SGSN (Serving GPRS Support Node, F5 or MSP (Multi Service Proxy. Each node handles network traffic from a slightly different perspective, and with various goals. In this article we will focus only on the MSP, its key features and especially on related security issues. MSP handles all HTTP traffic in the mobile network and therefore it is a suitable point for the implementation of different optimization functions, e.g. to reduce the volume of data generated by YouTube or similar HTTP-based service. This article will introduce basic features and functions of MSP as well as ways of remote access and security mechanisms of this key element in state-of-the-art mobile networks.

  8. Cross-Layer Scheme to Control Contention Window for Per-Flow in Asymmetric Multi-Hop Networks

    Science.gov (United States)

    Giang, Pham Thanh; Nakagawa, Kenji

    The IEEE 802.11 MAC standard for wireless ad hoc networks adopts Binary Exponential Back-off (BEB) mechanism to resolve bandwidth contention between stations. BEB mechanism controls the bandwidth allocation for each station by choosing a back-off value from one to CW according to the uniform random distribution, where CW is the contention window size. However, in asymmetric multi-hop networks, some stations are disadvantaged in opportunity of access to the shared channel and may suffer severe throughput degradation when the traffic load is large. Then, the network performance is degraded in terms of throughput and fairness. In this paper, we propose a new cross-layer scheme aiming to solve the per-flow unfairness problem and achieve good throughput performance in IEEE 802.11 multi-hop ad hoc networks. Our cross-layer scheme collects useful information from the physical, MAC and link layers of own station. This information is used to determine the optimal Contention Window (CW) size for per-station fairness. We also use this information to adjust CW size for each flow in the station in order to achieve per-flow fairness. Performance of our cross-layer scheme is examined on various asymmetric multi-hop network topologies by using Network Simulator (NS-2).

  9. Human Factors of Automated Driving : Predicting the Effects of Authority Transitions on Traffic Flow Efficiency

    NARCIS (Netherlands)

    Varotto, S.F.; Hoogendoorn, R.G.; Van Arem, B.; Hoogendoorn, S.P.

    2014-01-01

    Automated driving potentially has a significant impact on traffic flow efficiency. Automated vehicles, which possess cooperative capabilities, are expected to reduce congestion levels for instance by increasing road capacity, by anticipating traffic conditions further downstream and also by

  10. Predicting Flow Breakdown Probability and Duration in Stochastic Network Models: Impact on Travel Time Reliability

    Energy Technology Data Exchange (ETDEWEB)

    Dong, Jing [ORNL; Mahmassani, Hani S. [Northwestern University, Evanston

    2011-01-01

    This paper proposes a methodology to produce random flow breakdown endogenously in a mesoscopic operational model, by capturing breakdown probability and duration. Based on previous research findings that probability of flow breakdown can be represented as a function of flow rate and the duration can be characterized by a hazard model. By generating random flow breakdown at various levels and capturing the traffic characteristics at the onset of the breakdown, the stochastic network simulation model provides a tool for evaluating travel time variability. The proposed model can be used for (1) providing reliability related traveler information; (2) designing ITS (intelligent transportation systems) strategies to improve reliability; and (3) evaluating reliability-related performance measures of the system.

  11. High-Speed Optical Wide-Area Data-Communication Network

    Science.gov (United States)

    Monacos, Steve P.

    1994-01-01

    Proposed fiber-optic wide-area network (WAN) for digital communication balances input and output flows of data with its internal capacity by routing traffic via dynamically interconnected routing planes. Data transmitted optically through network by wavelength-division multiplexing in synchronous or asynchronous packets. WAN implemented with currently available technology. Network is multiple-ring cyclic shuffle exchange network ensuring traffic reaches its destination with minimum number of hops.

  12. The loss of efficiency caused by agents' uncoordinated routing in transport networks.

    Science.gov (United States)

    Xu, Zhongzhi; Sun, Li; Wang, Junjie; Wang, Pu

    2014-01-01

    Large-scale daily commuting data were combined with detailed geographical information system (GIS) data to analyze the loss of transport efficiency caused by drivers' uncoordinated routing in urban road networks. We used Price of Anarchy (POA) to quantify the loss of transport efficiency and found that both volume and distribution of human mobility demand determine the POA. In order to reduce POA, a small number of highways require considerable decreases in traffic, and their neighboring arterial roads need to attract more traffic. The magnitude of the adjustment in traffic flow can be estimated using the fundamental measure traffic flow only, which is widely available and easy to collect. Surprisingly, the most congested roads or the roads with largest traffic flow were not those requiring the most reduction of traffic. This study can offer guidance for the optimal control of urban traffic and facilitate improvements in the efficiency of transport networks.

  13. Uncovering the footprints of malicious traffic in cellular data networks

    OpenAIRE

    Raghuramu, A; Zang, H; Chuah, CN

    2015-01-01

    © Springer International Publishing Switzerland 2015. In this paper, we present a comprehensive characterization of malicious traffic generated by mobile devices using Deep Packet Inspection (DPI) records and security event logs from a large US based cellular provider network. Our analysis reveals that 0.17% of mobile devices in the cellular network are affected by security threats. This proportion, while small, is orders of magnitude higher than the last reported (in 2013) infection rate of ...

  14. Enhancing the Quality of Service for Real Time Traffic over Optical Burst Switching (OBS Networks with Ensuring the Fairness for Other Traffics.

    Directory of Open Access Journals (Sweden)

    Mohammed A Al-Shargabi

    Full Text Available Optical burst switching (OBS networks have been attracting much consideration as a promising approach to build the next generation optical Internet. A solution for enhancing the Quality of Service (QoS for high priority real time traffic over OBS with the fairness among the traffic types is absent in current OBS' QoS schemes. In this paper we present a novel Real Time Quality of Service with Fairness Ratio (RT-QoSFR scheme that can adapt the burst assembly parameters according to the traffic QoS needs in order to enhance the real time traffic QoS requirements and to ensure the fairness for other traffic. The results show that RT-QoSFR scheme is able to fulfill the real time traffic requirements (end to end delay, and loss rate ensuring the fairness for other traffics under various conditions such as the type of real time traffic and traffic load. RT-QoSFR can guarantee that the delay of the real time traffic packets does not exceed the maximum packets transfer delay value. Furthermore, it can reduce the real time traffic packets loss, at the same time guarantee the fairness for non real time traffic packets by determining the ratio of real time traffic inside the burst to be 50-60%, 30-40%, and 10-20% for high, normal, and low traffic loads respectively.

  15. A latency analysis for M2M and OG-like traffic patterns in different HSPA core network configurations

    Directory of Open Access Journals (Sweden)

    M. V. Popović

    2014-11-01

    Full Text Available In this paper we present an analysis intended to reveal possible impacts of core network features on latency for modelled M2M and Online Gaming traffic. Simulations were performed in a live 3G/HSPA network. Test traffic simulating multiplayer real-time games and M2M applications was generated on 10 mobile phones in parallel, sending data to a remote server. APNs with different combinations of hardware and features (proxy server, different GGSNs and firewalls, usage of Service Awareness feature were chosen. The traffic was recorded on the Gn interface in the mobile core. The goal of experiments was to evaluate any eventually significant variation of average recorded RTTs in the core part of mobile network that would clearly indicate either the impact of used APN on delay for a specific traffic pattern, or selectivity of the APN towards different traffic patterns.

  16. Acceleration of aircraft-level Traffic Flow Management

    Science.gov (United States)

    Rios, Joseph Lucio

    This dissertation describes novel approaches to solving large-scale, high fidelity, aircraft-level Traffic Flow Management scheduling problems. Depending on the methods employed, solving these problems to optimality can take longer than the length of the planning horizon in question. Research in this domain typically focuses on the quality of the modeling used to describe the problem and the benefits achieved from the optimized solution, often treating computational aspects as secondary or tertiary. The work presented here takes the complementary view and considers the computational aspect as the primary concern. To this end, a previously published model for solving this Traffic Flow Management scheduling problem is used as starting point for this study. The model proposed by Bertsimas and Stock-Patterson is a binary integer program taking into account all major resource capacities and the trajectories of each flight to decide which flights should be held in which resource for what amount of time in order to satisfy all capacity requirements. For large instances, the solve time using state-of-the-art solvers is prohibitive for use within a potential decision support tool. With this dissertation, however, it will be shown that solving can be achieved in reasonable time for instances of real-world size. Five other techniques developed and tested for this dissertation will be described in detail. These are heuristic methods that provide good results. Performance is measured in terms of runtime and "optimality gap." We then describe the most successful method presented in this dissertation: Dantzig-Wolfe Decomposition. Results indicate that a parallel implementation of Dantzig-Wolfe Decomposition optimally solves the original problem in much reduced time and with better integrality and smaller optimality gap than any of the heuristic methods or state-of-the-art, commercial solvers. The solution quality improves in every measureable way as the number of subproblems

  17. Detecting P2P Botnet in Software Defined Networks

    Directory of Open Access Journals (Sweden)

    Shang-Chiuan Su

    2018-01-01

    Full Text Available Software Defined Network separates the control plane from network equipment and has great advantage in network management as compared with traditional approaches. With this paradigm, the security issues persist to exist and could become even worse because of the flexibility on handling the packets. In this paper we propose an effective framework by integrating SDN and machine learning to detect and categorize P2P network traffics. This work provides experimental evidence showing that our approach can automatically analyze network traffic and flexibly change flow entries in OpenFlow switches through the SDN controller. This can effectively help the network administrators manage related security problems.

  18. Advanced Models and Algorithms for Self-Similar IP Network Traffic Simulation and Performance Analysis

    Science.gov (United States)

    Radev, Dimitar; Lokshina, Izabella

    2010-11-01

    The paper examines self-similar (or fractal) properties of real communication network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. Advanced fractal models of sequentional generators and fixed-length sequence generators, and efficient algorithms that are used to simulate self-similar behavior of IP network traffic data are developed and applied. Numerical examples are provided; and simulation results are obtained and analyzed.

  19. Phase dynamics of complex-valued neural networks and its application to traffic signal control.

    Science.gov (United States)

    Nishikawa, Ikuko; Iritani, Takeshi; Sakakibara, Kazutoshi; Kuroe, Yasuaki

    2005-01-01

    Complex-valued Hopfield networks which possess the energy function are analyzed. The dynamics of the network with certain forms of an activation function is de-composable into the dynamics of the amplitude and phase of each neuron. Then the phase dynamics is described as a coupled system of phase oscillators with a pair-wise sinusoidal interaction. Therefore its phase synchronization mechanism is useful for the area-wide offset control of the traffic signals. The computer simulations show the effectiveness under the various traffic conditions.

  20. Flood and Traffic Wireless Monitoring System for Smart Cities

    KAUST Repository

    Moussa, Mustafa

    2016-10-01

    The convergence of computation, communication and sensing has led to the emergence of Wireless Sensor Networks (WSNs), which allow distributed monitoring of physical phenomena over extended areas. In this thesis, we focus on a dual flood and traffic flow WSN applicable to urban environments. This fixed sensing system is based on the combination of ultrasonic range-finding with remote temperature sensing, and can sense both phenomena with a high degree of accuracy. This enables the monitoring of urban areas to lessen the impact of catastrophic flood events, by monitoring flood parameters and traffic flow to enable public evacuation and early warning, allocate the resources efficiently or control the traffic to make cities more productive and smarter. We present an implementation of the device, and illustrate its performance in water level estimation and rain detection using a novel combination of L1 regularized reconstruction and machine learning algorithms on a 6-month dataset involving four different sensors. Our results show that water level can be estimated with an uncertainty of 1 cm using a combination of thermal sensing and ultrasonic distance measurements. The demonstration of the performance included the detection of an actual flash flood event using two sensors located in Umm Al Qura University (Mecca). Finally, we show that Lagrangian (mobile) sensors can be used to inexpensively increase the performance of the system with respect to traffic sensing. These sensors are based on Inertial Measurement Units (IMUs), which have never been investigated in the context of traffic ow monitoring before. We investigate the divergence of the speed estimation process, the lack of the calibration parameters of the system, and the problem of reconstructing vehicle trajectories evolving in a given transportation network. To address these problems, we propose an automatic calibration algorithm applicable to IMU-equipped ground vehicles, and an L1 regularized least squares

  1. From Goods to Traffic:First Steps Toward an Auction-based Traffic Signal Controller

    OpenAIRE

    Raphael, Jeffery; Maskell, Simon; Sklar, Elizabeth Ida

    2015-01-01

    Traffic congestion is a major issue that plagues many urban road networks large and small. Traffic engineers are now leaning towards Intelligent Traffic Systems as many physical changes to road networks are costly or infeasible. Multi-Agent Systems (MAS) have become a popular paradigm for intelligent solutions to traffic management problems. There are many MAS approaches to traffic management that utilise market mechanisms. In market-based approaches, drivers “pay” to use the roadways. Howeve...

  2. Energy Saving: Scaling Network Energy Efficiency Faster than Traffic Growth

    NARCIS (Netherlands)

    Chen, Y.; Blume, O.; Gati, A.; Capone, A.; Wu, C.-E.; Barth, U.; Marzetta, T.; Zhang, H.; Xu, S.

    2013-01-01

    As the mobile traffic is expected to continue its exponential growth in the near future, energy efficiency has gradually become a must criterion for wireless network design. Three fundamental questions need to be answered before the detailed design could be carried out, namely what energy efficiency

  3. The loss of efficiency caused by agents' uncoordinated routing in transport networks.

    Directory of Open Access Journals (Sweden)

    Zhongzhi Xu

    Full Text Available Large-scale daily commuting data were combined with detailed geographical information system (GIS data to analyze the loss of transport efficiency caused by drivers' uncoordinated routing in urban road networks. We used Price of Anarchy (POA to quantify the loss of transport efficiency and found that both volume and distribution of human mobility demand determine the POA. In order to reduce POA, a small number of highways require considerable decreases in traffic, and their neighboring arterial roads need to attract more traffic. The magnitude of the adjustment in traffic flow can be estimated using the fundamental measure traffic flow only, which is widely available and easy to collect. Surprisingly, the most congested roads or the roads with largest traffic flow were not those requiring the most reduction of traffic. This study can offer guidance for the optimal control of urban traffic and facilitate improvements in the efficiency of transport networks.

  4. Traffic breakdown at a signal: classical theory versus the three-phase theory of city traffic

    International Nuclear Information System (INIS)

    Kerner, Boris S; Schreckenberg, Michael; Klenov, Sergey L

    2014-01-01

    Physical reasons for a crucial difference between the results of a three-phase theory developed recently (Kerner 2011 Phys. Rev. E 84 045102(R); 2013 Europhys. Lett. 102 28010; 2014 Physica A 397 76) and the classical theory are explained. Microscopic characteristics of traffic passing a traffic signal during the green signal phase and their dependence on the duration of the green phase have been found. It turns out that a moving synchronized flow pattern (MSP), which occurs in under-saturated traffic at the signal, causes ‘compression’ of traffic flow: the rate of MSP discharge can be considerably larger than the saturation flow rate of the classical traffic theory of city traffic. This leads to a considerably larger rate of traffic passing the signal in comparison with the saturation flow rate. This effect together with traffic behavior at the upstream queue front explains the metastability of under-saturated traffic with respect to a random time-delayed traffic breakdown. (paper)

  5. From trees to forest: relational complexity network and workload of air traffic controllers.

    Science.gov (United States)

    Zhang, Jingyu; Yang, Jiazhong; Wu, Changxu

    2015-01-01

    In this paper, we propose a relational complexity (RC) network framework based on RC metric and network theory to model controllers' workload in conflict detection and resolution. We suggest that, at the sector level, air traffic showing a centralised network pattern can provide cognitive benefits in visual search and resolution decision which will in turn result in lower workload. We found that the network centralisation index can account for more variance in predicting perceived workload and task completion time in both a static conflict detection task (Study 1) and a dynamic one (Study 2) in addition to other aircraft-level and pair-level factors. This finding suggests that linear combination of aircraft-level or dyad-level information may not be adequate and the global-pattern-based index is necessary. Theoretical and practical implications of using this framework to improve future workload modelling and management are discussed. We propose a RC network framework to model the workload of air traffic controllers. The effect of network centralisation was examined in both a static conflict detection task and a dynamic one. Network centralisation was predictive of perceived workload and task completion time over and above other control variables.

  6. Multiobjective Reinforcement Learning for Traffic Signal Control Using Vehicular Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Houli Duan

    2010-01-01

    Full Text Available We propose a new multiobjective control algorithm based on reinforcement learning for urban traffic signal control, named multi-RL. A multiagent structure is used to describe the traffic system. A vehicular ad hoc network is used for the data exchange among agents. A reinforcement learning algorithm is applied to predict the overall value of the optimization objective given vehicles' states. The policy which minimizes the cumulative value of the optimization objective is regarded as the optimal one. In order to make the method adaptive to various traffic conditions, we also introduce a multiobjective control scheme in which the optimization objective is selected adaptively to real-time traffic states. The optimization objectives include the vehicle stops, the average waiting time, and the maximum queue length of the next intersection. In addition, we also accommodate a priority control to the buses and the emergency vehicles through our model. The simulation results indicated that our algorithm could perform more efficiently than traditional traffic light control methods.

  7. Computational network design from functional specifications

    KAUST Repository

    Peng, Chi Han

    2016-07-11

    Connectivity and layout of underlying networks largely determine agent behavior and usage in many environments. For example, transportation networks determine the flow of traffic in a neighborhood, whereas building floorplans determine the flow of people in a workspace. Designing such networks from scratch is challenging as even local network changes can have large global effects. We investigate how to computationally create networks starting from only high-level functional specifications. Such specifications can be in the form of network density, travel time versus network length, traffic type, destination location, etc. We propose an integer programming-based approach that guarantees that the resultant networks are valid by fulfilling all the specified hard constraints and that they score favorably in terms of the objective function. We evaluate our algorithm in two different design settings, street layout and floorplans to demonstrate that diverse networks can emerge purely from high-level functional specifications.

  8. Analysis of the Chinese air route network as a complex network

    Science.gov (United States)

    Cai, Kai-Quan; Zhang, Jun; Du, Wen-Bo; Cao, Xian-Bin

    2012-02-01

    The air route network, which supports all the flight activities of the civil aviation, is the most fundamental infrastructure of air traffic management system. In this paper, we study the Chinese air route network (CARN) within the framework of complex networks. We find that CARN is a geographical network possessing exponential degree distribution, low clustering coefficient, large shortest path length and exponential spatial distance distribution that is obviously different from that of the Chinese airport network (CAN). Besides, via investigating the flight data from 2002 to 2010, we demonstrate that the topology structure of CARN is homogeneous, howbeit the distribution of flight flow on CARN is rather heterogeneous. In addition, the traffic on CARN keeps growing in an exponential form and the increasing speed of west China is remarkably larger than that of east China. Our work will be helpful to better understand Chinese air traffic systems.

  9. Some exact solutions to the Lighthill–Whitham–Richards–Payne traffic flow equations

    International Nuclear Information System (INIS)

    Rowlands, G; Infeld, E; Skorupski, A A

    2013-01-01

    We find a class of exact solutions to the Lighthill–Whitham–Richards–Payne (LWRP) traffic flow equations. Using two consecutive Lagrangian transformations, a linearization is achieved. Next, depending on the initial density, we either apply (again two) Lambert functions and obtain exact formulae for the dependence of the car density and velocity on x, t, or else, failing that, the same result in a parametric representation. The calculation always involves two possible factorizations of a consistency condition. Both must be considered. In physical terms, the lineup usually separates into two offshoots at different velocities. Each velocity soon becomes uniform. This outcome in many ways resembles the two soliton solution to the Korteweg–de Vries equation. We check general conservation requirements. Although traffic flow research has developed tremendously since LWRP, this calculation, being exact, may open the door to solving similar problems, such as gas dynamics or water flow in rivers. With this possibility in mind, we outline the procedure in some detail at the end. (paper)

  10. Traffic Games: Modeling Freeway Traffic with Game Theory.

    Science.gov (United States)

    Cortés-Berrueco, Luis E; Gershenson, Carlos; Stephens, Christopher R

    2016-01-01

    We apply game theory to a vehicular traffic model to study the effect of driver strategies on traffic flow. The resulting model inherits the realistic dynamics achieved by a two-lane traffic model and aims to incorporate phenomena caused by driver-driver interactions. To achieve this goal, a game-theoretic description of driver interaction was developed. This game-theoretic formalization allows one to model different lane-changing behaviors and to keep track of mobility performance. We simulate the evolution of cooperation, traffic flow, and mobility performance for different modeled behaviors. The analysis of these results indicates a mobility optimization process achieved by drivers' interactions.

  11. Heterogeneous Cellular Networks with Spatio-Temporal Traffic: Delay Analysis and Scheduling

    OpenAIRE

    Zhong, Yi; Quek, Tony Q. S.; Ge, Xiaohu

    2016-01-01

    Emergence of new types of services has led to various traffic and diverse delay requirements in fifth generation (5G) wireless networks. Meeting diverse delay requirements is one of the most critical goals for the design of 5G wireless networks. Though the delay of point-to-point communications has been well investigated, the delay of multi-point to multi-point communications has not been thoroughly studied since it is a complicated function of all links in the network. In this work, we propo...

  12. Proposal of Wireless Traffic Control Schemes for Wireless LANs

    Science.gov (United States)

    Hiraguri, Takefumi; Ichikawa, Takeo; Iizuka, Masataka; Kubota, Shuji

    This paper proposes two traffic control schemes to support the communication quality of multimedia streaming services such as VoIP and audio/video over IEEE 802.11 wireless LAN systems. The main features of the proposed scheme are bandwidth control for each flow of the multimedia streaming service and load balancing between access points (APs) of the wireless LAN by using information of data link, network and transport layers. The proposed schemes are implemented on a Linux machine which is called the wireless traffic controller (WTC). The WTC connects a high capacity backbone network and an access network to which the APs are attached. We evaluated the performance of the proposed WTC and confirmed that the communication quality of the multimedia streaming would be greatly improved by using this technique.

  13. Traffic-Adaptive and Energy-Efficient Small Cell Networks-Energy, Delay and Throughput

    OpenAIRE

    Nazrul Alam, Mirza

    2016-01-01

    The low power small cell network has emerged as a promising and feasible solution to address the massive wireless traffic resulting from the aggressive growth of wireless applications. It is also estimated that Internet of things (IoT) will consist of around 50 billion physical objects by 2020. As a result, besides capacity enhancement, other challenges, e.g., energy efficiency, dynamic addressing of UL/DL traffic asymmetry, low latency, multi-hop communications, reliability and coverage have...

  14. A Feature Selection Method for Large-Scale Network Traffic Classification Based on Spark

    Directory of Open Access Journals (Sweden)

    Yong Wang

    2016-02-01

    Full Text Available Currently, with the rapid increasing of data scales in network traffic classifications, how to select traffic features efficiently is becoming a big challenge. Although a number of traditional feature selection methods using the Hadoop-MapReduce framework have been proposed, the execution time was still unsatisfactory with numeral iterative computations during the processing. To address this issue, an efficient feature selection method for network traffic based on a new parallel computing framework called Spark is proposed in this paper. In our approach, the complete feature set is firstly preprocessed based on Fisher score, and a sequential forward search strategy is employed for subsets. The optimal feature subset is then selected using the continuous iterations of the Spark computing framework. The implementation demonstrates that, on the precondition of keeping the classification accuracy, our method reduces the time cost of modeling and classification, and improves the execution efficiency of feature selection significantly.

  15. An efficient flow-based botnet detection using supervised machine learning

    DEFF Research Database (Denmark)

    Stevanovic, Matija; Pedersen, Jens Myrup

    2014-01-01

    Botnet detection represents one of the most crucial prerequisites of successful botnet neutralization. This paper explores how accurate and timely detection can be achieved by using supervised machine learning as the tool of inferring about malicious botnet traffic. In order to do so, the paper...... introduces a novel flow-based detection system that relies on supervised machine learning for identifying botnet network traffic. For use in the system we consider eight highly regarded machine learning algorithms, indicating the best performing one. Furthermore, the paper evaluates how much traffic needs...... to accurately and timely detect botnet traffic using purely flow-based traffic analysis and supervised machine learning. Additionally, the results show that in order to achieve accurate detection traffic flows need to be monitored for only a limited time period and number of packets per flow. This indicates...

  16. Using mobile probes to inform and measure the effectiveness of traffic control strategies on urban networks.

    Science.gov (United States)

    2015-07-01

    Urban traffic congestion is a problem that plagues many cities in the United States. Testing strategies to alleviate this : congestion is especially challenging due to the difficulty of modeling complex urban traffic networks. However, recent work ha...

  17. FlowIDS

    OpenAIRE

    Sabolčák, Peter

    2006-01-01

    FlowIDS is system which can detect some of the undesirable traffi c in computer networks (undesirable traffic could be also ie. virus activity or overloading of network) and mostly doing counteraction which are set by administrator. Information about data ows are provided by hardware of network infrastructure, eliminitaion of undesirable activity is done through changes in network hardware settings. Regarding the quantity of solution which are provided on market, I decided to focus on Cisco n...

  18. Traffic flow impacts of adaptive cruise control deactivation and (Re)activation with cooperative driver behavior

    NARCIS (Netherlands)

    Klunder, G.; Li, M.; Minderhoud, M.

    2009-01-01

    In 2006 in the Netherlands, a field operational test was carried out to study the effect of adaptive cruise control (ACC) and lane departure warning on driver behavior and traffic flow in real traffic. To estimate the effect for larger penetration rates, simulations were needed. For a reliable

  19. Fiber fault location utilizing traffic signal in optical network.

    Science.gov (United States)

    Zhao, Tong; Wang, Anbang; Wang, Yuncai; Zhang, Mingjiang; Chang, Xiaoming; Xiong, Lijuan; Hao, Yi

    2013-10-07

    We propose and experimentally demonstrate a method for fault location in optical communication network. This method utilizes the traffic signal transmitted across the network as probe signal, and then locates the fault by correlation technique. Compared with conventional techniques, our method has a simple structure and low operation expenditure, because no additional device is used, such as light source, modulator and signal generator. The correlation detection in this method overcomes the tradeoff between spatial resolution and measurement range in pulse ranging technique. Moreover, signal extraction process can improve the location result considerably. Experimental results show that we achieve a spatial resolution of 8 cm and detection range of over 23 km with -8-dBm mean launched power in optical network based on synchronous digital hierarchy protocols.

  20. An Interference-Aware Traffic-Priority-Based Link Scheduling Algorithm for Interference Mitigation in Multiple Wireless Body Area Networks

    Directory of Open Access Journals (Sweden)

    Thien T. T. Le

    2016-12-01

    Full Text Available Currently, wireless body area networks (WBANs are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference.

  1. A new lattice hydrodynamic traffic flow model with a consideration of multi-anticipation effect

    International Nuclear Information System (INIS)

    Tian Chuan; Sun Di-Hua; Yang Shu-Hong

    2011-01-01

    We present a new multi-anticipation lattice hydrodynamic model based on the traffic anticipation effect in the real world. Applying the linear stability theory, we obtain the linear stability condition of the model. Through nonlinear analysis, we derive the modified Korteweg-de Vries equation to describe the propagating behaviour of a traffic density wave near the critical point. The good agreement between the simulation results and the analytical results shows that the stability of traffic flow can be enhanced when the multi-anticipation effect is considered. (interdisciplinary physics and related areas of science and technology)

  2. An Improved Macro Model of Traffic Flow with the Consideration of Ramps and Numerical Tests

    Directory of Open Access Journals (Sweden)

    Zhongke Shi

    2015-01-01

    Full Text Available We present an improved macro model for traffic flow based on the existing models. The equilibrium point equation of the model is obtained. The stop-and-go traffic phenomenon is described in phase plane and the relationship between traffic jams and system instability is clearly shown in the phase plane diagrams. Using the improved model, some traffic phenomena on a highway with ramps are found in this paper. The numerical simulation is carried out to investigate various nonlinear traffic phenomena with a single ramp generated by different initial densities and vehicle generation rates. According to the actual road sections of Xi’an-Baoji highways, the situations of morning peak with several ramps are also analyzed. All these results are consistent with real traffic, which shows that the improved model is reasonable.

  3. A Spike Neural Controller for Traffic Load Parameter with Priority-Based Rate in Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nadia Adnan Shiltagh

    2015-11-01

    Full Text Available Wireless Multimedia Sensor Networks (WMSNs are a type of sensor network that contains sensor nodes equipped with cameras, microphones; therefore the WMSNS are able to produce multimedia data such as video and audio streams, still images, and scalar data from the surrounding environment. Most multimedia applications typically produce huge volumes of data, this leads to congestion. To address this challenge, This paper proposes Modify Spike Neural Network control for Traffic Load Parameter with Exponential Weight of Priority Based Rate Control algorithm (MSNTLP with EWBPRC. The Modify Spike Neural Network controller (MSNC can calculate the appropriate traffic load parameter μ for each parent node and then use in the EWPBRC algorithm to estimate the transmission rate of parent nodes and then assign a suitable transmission rate for each child node. A comparative study between (MSNTLP with EWBPRC and fuzzy logic controller for traffic load parameter with Exponential Weight of Priority Based Rate Control algorithm (FTLP with EWBPRC algorithm shows that the (MSNTLP with EWBPRC is more efficient than (FTLP with EWBPRC algorithm in terms of packet loss, queue delay and throughput. Another comparative study between (MSNTLP with EWBPRC and EWBPRC with fixed traffic load parameter (µ shows that the MSNTLP with EWBPRC is more efficient than EWBPRC with fixed traffic load parameter (µ in terms of packet loss ratio and queue delay. A simulation process is developed and tested using the network simulator _2 (NS2 in a computer having the following properties: windows 7 (64-bit, core i7, RAM 8GB, hard 1TB.

  4. Density waves in a lattice hydrodynamic traffic flow model with the anticipation effect

    International Nuclear Information System (INIS)

    Zhao Min; Sun Di-Hua; Tian Chuan

    2012-01-01

    By introducing the traffic anticipation effect in the real world into the original lattice hydrodynamic model, we present a new anticipation effect lattice hydrodynamic (AELH) model, and obtain the linear stability condition of the model by applying the linear stability theory. Through nonlinear analysis, we derive the Burgers equation and Korteweg-de Vries (KdV) equation, to describe the propagating behaviour of traffic density waves in the stable and the metastable regions, respectively. The good agreement between simulation results and analytical results shows that the stability of traffic flow can be enhanced when the anticipation effect is considered. (interdisciplinary physics and related areas of science and technology)

  5. Continuous traffic flow modeling of driver support systems in multiclass traffic with intervehicle communication and drivers in the loop

    NARCIS (Netherlands)

    Tampere, C.; Hoogendoorn, S.P.; van Arem, Bart

    2009-01-01

    This paper presents a continuous traffic-flow model for the explorative analysis of advanced driver-assistance systems (ADASs). Such systems use technology (sensors and intervehicle communication) to support the task of the driver, who retains full control over the vehicle. Based on a review of

  6. Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata.

    Science.gov (United States)

    Chen, Yangzhou; Guo, Yuqi; Wang, Ying

    2017-03-29

    In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research.

  7. A sensor network architecture for urban traffic state estimation with mixed eulerian/lagrangian sensing based on distributed computing

    KAUST Repository

    Canepa, Edward S.; Odat, Enas M.; Dehwah, Ahmad H.; Mousa, Mustafa; Jiang, Jiming; Claudel, Christian G.

    2014-01-01

    This article describes a new approach to urban traffic flow sensing using decentralized traffic state estimation. Traffic sensor data is generated both by fixed traffic flow sensor nodes and by probe vehicles equipped with a short range transceiver. The data generated by these sensors is sent to a local coordinator node, that poses the problem of estimating the local state of traffic as a mixed integer linear program (MILP). The resulting optimization program is then solved by the nodes in a distributed manner, using branch-and-bound methods. An optimal amount of noise is then added to the maps before dissemination to a central database. Unlike existing probe-based traffic monitoring systems, this system does not transmit user generated location tracks nor any user presence information to a centralized server, effectively preventing privacy attacks. A simulation of the system performance on computer-generated traffic data shows that the system can be implemented with currently available technology. © 2014 Springer International Publishing Switzerland.

  8. Dynamic segment shared protection for multicast traffic in meshed wavelength-division-multiplexing optical networks

    Science.gov (United States)

    Liao, Luhua; Li, Lemin; Wang, Sheng

    2006-12-01

    We investigate the protection approach for dynamic multicast traffic under shared risk link group (SRLG) constraints in meshed wavelength-division-multiplexing optical networks. We present a shared protection algorithm called dynamic segment shared protection for multicast traffic (DSSPM), which can dynamically adjust the link cost according to the current network state and can establish a primary light-tree as well as corresponding SRLG-disjoint backup segments for a dependable multicast connection. A backup segment can efficiently share the wavelength capacity of its working tree and the common resources of other backup segments based on SRLG-disjoint constraints. The simulation results show that DSSPM not only can protect the multicast sessions against a single-SRLG breakdown, but can make better use of the wavelength resources and also lower the network blocking probability.

  9. A robust algorithm to solve the signal setting problem considering different traffic assignment approaches

    Directory of Open Access Journals (Sweden)

    Adacher Ludovica

    2017-12-01

    Full Text Available In this paper we extend a stochastic discrete optimization algorithm so as to tackle the signal setting problem. Signalized junctions represent critical points of an urban transportation network, and the efficiency of their traffic signal setting influences the overall network performance. Since road congestion usually takes place at or close to junction areas, an improvement in signal settings contributes to improving travel times, drivers’ comfort, fuel consumption efficiency, pollution and safety. In a traffic network, the signal control strategy affects the travel time on the roads and influences drivers’ route choice behavior. The paper presents an algorithm for signal setting optimization of signalized junctions in a congested road network. The objective function used in this work is a weighted sum of delays caused by the signalized intersections. We propose an iterative procedure to solve the problem by alternately updating signal settings based on fixed flows and traffic assignment based on fixed signal settings. To show the robustness of our method, we consider two different assignment methods: one based on user equilibrium assignment, well established in the literature as well as in practice, and the other based on a platoon simulation model with vehicular flow propagation and spill-back. Our optimization algorithm is also compared with others well known in the literature for this problem. The surrogate method (SM, particle swarm optimization (PSO and the genetic algorithm (GA are compared for a combined problem of global optimization of signal settings and traffic assignment (GOSSTA. Numerical experiments on a real test network are reported.

  10. Assembly and offset assignment scheme for self-similar traffic in optical burst switched networks

    CSIR Research Space (South Africa)

    Muwonge, KB

    2007-10-01

    Full Text Available at the Label Edge Router (LER) to buffer traffic in the electronic domain. Burst assembly and offset assignment schemes are implemented in a complementary manner to improve QoS of an OBS network. The authors show that OBS network performance is directly related...

  11. Using mobile probes to inform and measure the effectiveness of macroscopic traffic control strategies on urban networks.

    Science.gov (United States)

    2015-06-01

    Urban traffic congestion is a problem that plagues many cities in the United States. Testing strategies to alleviate this : congestion is especially challenging due to the difficulty of modeling complex urban traffic networks. However, recent work ha...

  12. Comparison between genetic algorithm and self organizing map to detect botnet network traffic

    Science.gov (United States)

    Yugandhara Prabhakar, Shinde; Parganiha, Pratishtha; Madhu Viswanatham, V.; Nirmala, M.

    2017-11-01

    In Cyber Security world the botnet attacks are increasing. To detect botnet is a challenging task. Botnet is a group of computers connected in a coordinated fashion to do malicious activities. Many techniques have been developed and used to detect and prevent botnet traffic and the attacks. In this paper, a comparative study is done on Genetic Algorithm (GA) and Self Organizing Map (SOM) to detect the botnet network traffic. Both are soft computing techniques and used in this paper as data analytics system. GA is based on natural evolution process and SOM is an Artificial Neural Network type, uses unsupervised learning techniques. SOM uses neurons and classifies the data according to the neurons. Sample of KDD99 dataset is used as input to GA and SOM.

  13. Admission Control for Multiservices Traffic in Hierarchical Mobile IPv6 Networks by Using Fuzzy Inference System

    Directory of Open Access Journals (Sweden)

    Jung-Shyr Wu

    2012-01-01

    Full Text Available CAC (Call Admission Control plays a significant role in providing QoS (Quality of Service in mobile wireless networks. In addition to much research that focuses on modified Mobile IP to get better efficient handover performance, CAC should be introduced to Mobile IP-based network to guarantee the QoS for users. In this paper, we propose a CAC scheme which incorporates multiple traffic types and adjusts the admission threshold dynamically using fuzzy control logic to achieve better usage of resources. The method can provide QoS in Mobile IPv6 networks with few modifications on MAP (Mobility Anchor Point functionality and slight change in BU (Binding Update message formats. According to the simulation results, the proposed scheme presents good performance of voice and video traffic at the expenses of poor performance on data traffic. It is evident that these CAC schemes can reduce the probability of the handoff dropping and the cell overload and limit the probability of the new call blocking.

  14. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

    KAUST Repository

    Canepa, Edward S.; Claudel, Christian G.

    2012-01-01

    This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

  15. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

    KAUST Repository

    Canepa, Edward S.

    2012-09-01

    This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

  16. Passive performance monitoring and traffic characteristics on the SLAC internet border

    International Nuclear Information System (INIS)

    Logg, C.; Cottrell, L.

    2001-01-01

    Understanding how the Internet is used by HEP is critical to optimizing the performance of the inter-lab computing environment. Typically use requirements have been defined by discussions between collaborators. However, later analysis of the actual traffic has show this is often misunderstood and actual use is significantly different to that predicted. Passive monitoring of the real traffic provides insight into the true communications requirements and the performance of a large number of inter-communicating nodes. It may be useful in identifying performance problems that are due to factors other than Internet congestion, especially when compared to other methods such as active monitoring where traffic is generated specifically to measure its performance. Controlled active monitoring between dedicated servers often gives an indication of what can be achieved on a network. Passive monitoring of the real traffic gives a picture of the true performance. The authors will discuss the method and results of collecting and analyzing flows of data obtained from the SLAC Internet border. The insights this has brought to understanding the network will be reviewed and the benefit it can bring to engineering networks will be discussed

  17. An auxiliary graph based dynamic traffic grooming algorithm in spatial division multiplexing enabled elastic optical networks with multi-core fibers

    Science.gov (United States)

    Zhao, Yongli; Tian, Rui; Yu, Xiaosong; Zhang, Jiawei; Zhang, Jie

    2017-03-01

    A proper traffic grooming strategy in dynamic optical networks can improve the utilization of bandwidth resources. An auxiliary graph (AG) is designed to solve the traffic grooming problem under a dynamic traffic scenario in spatial division multiplexing enabled elastic optical networks (SDM-EON) with multi-core fibers. Five traffic grooming policies achieved by adjusting the edge weights of an AG are proposed and evaluated through simulation: maximal electrical grooming (MEG), maximal optical grooming (MOG), maximal SDM grooming (MSG), minimize virtual hops (MVH), and minimize physical hops (MPH). Numeric results show that each traffic grooming policy has its own features. Among different traffic grooming policies, an MPH policy can achieve the lowest bandwidth blocking ratio, MEG can save the most transponders, and MSG can obtain the fewest cores for each request.

  18. SOME EMPIRICAL RELATIONS BETWEEN TRAVEL SPEED, TRAFFIC VOLUME AND TRAFFIC COMPOSITION IN URBAN ARTERIALS

    Directory of Open Access Journals (Sweden)

    Eleni I. VLAHOGIANNI, Ph.D.

    2007-01-01

    Full Text Available The effects of traffic mix (the percentage of cars, trucks, buses and so on are of particular interest in the speed-volume relationship in urban signalized arterials under various geometric and control characteristics. The paper presents some empirical observations on the relation between travel speed, traffic volume and traffic composition in urban signalized arterials. A methodology based on emerging self-organizing structures of neural networks to identify regions in the speed-volume relationship with respect to traffic composition and Bayesian networks to evaluate the effect of different types of motorized vehicles on prevailing traffic conditions is proposed. Results based on data from a large urban network indicate that the variability in traffic conditions can be described by eight regions in speed-volume relationship with respect to traffic composition. Further evaluation of the effect of motorized vehicles in each region separately indicates that the effect of traffic composition decreases with the onset of congestion. Moreover, taxis and motorcycles are the primary affecting parameter of the form of the speed-volume relationship in urban arterials.

  19. Lightweight link dimensioning using sFlow sampling

    DEFF Research Database (Denmark)

    de Oliviera Schmidt, Ricardo; Sadre, Ramin; Sperotto, Anna

    2013-01-01

    not be trivial in high-speed links. Aiming scalability, operators often deploy packet sampling on monitoring, but little is known how it affects link dimensioning. In this paper we assess the feasibility of lightweight link dimensioning using sFlow, which is a widely-deployed traffic monitoring tool. We...... implement sFlow sampling algorithm and use a previously proposed and validated dimensioning formula that needs traffic variance. We validate our approach using packet captures from real networks. Results show that the proposed procedure is successful for a range of sampling rates and that, due to randomness...... of sampling algorithm, the error introduced by scaling the traffic variance yields more conservative results that cope with short-term traffic fluctuations....

  20. Noise-Assisted Concurrent Multipath Traffic Distribution in Ad Hoc Networks

    Science.gov (United States)

    Murata, Masayuki

    2013-01-01

    The concept of biologically inspired networking has been introduced to tackle unpredictable and unstable situations in computer networks, especially in wireless ad hoc networks where network conditions are continuously changing, resulting in the need of robustness and adaptability of control methods. Unfortunately, existing methods often rely heavily on the detailed knowledge of each network component and the preconfigured, that is, fine-tuned, parameters. In this paper, we utilize a new concept, called attractor perturbation (AP), which enables controlling the network performance using only end-to-end information. Based on AP, we propose a concurrent multipath traffic distribution method, which aims at lowering the average end-to-end delay by only adjusting the transmission rate on each path. We demonstrate through simulations that, by utilizing the attractor perturbation relationship, the proposed method achieves a lower average end-to-end delay compared to other methods which do not take fluctuations into account. PMID:24319375

  1. Simulation Study of the Effect of Decreasing Truck Traffic Flow on Safety on Almeria-Barcelona Corridor

    Energy Technology Data Exchange (ETDEWEB)

    Dadashova, B.

    2016-07-01

    In this paper the effect of truck traffic on road safety has been analyzed through simulation study. The main objective of the study is to quantify the effect of the decreasing average annual daily traffic of heavy duty vehicles (trucks) on road safety. As the road safety indicators the frequency road accidents is considered. The data used in the study were collected from one of the most crowded routes in Spain which connects Almeria (south-east) with Barcelona (northeast). The observed data covers year 2010 and were classified into 2 road types: dual carriageways and toll roads. The estimation was carried out using negative binomial model and Markov Chain Monte Carlo simulation. Using the estimation results new traffic scenarios were proposed where the traffic flow is assumed to change its values. A total of 33 scenarios were proposed and new accidents data were generated through MCMC sampling. The comparison of the simulated and observed accident data shows that the effect of decreasing truck traffic flow could meliorate road safety in the route. The simulation tool could be applied to evaluate the effects of freight modal shift from road to rail. (Author)

  2. Information flow analysis of interactome networks.

    Directory of Open Access Journals (Sweden)

    Patrycja Vasilyev Missiuro

    2009-04-01

    Full Text Available Recent studies of cellular networks have revealed modular organizations of genes and proteins. For example, in interactome networks, a module refers to a group of interacting proteins that form molecular complexes and/or biochemical pathways and together mediate a biological process. However, it is still poorly understood how biological information is transmitted between different modules. We have developed information flow analysis, a new computational approach that identifies proteins central to the transmission of biological information throughout the network. In the information flow analysis, we represent an interactome network as an electrical circuit, where interactions are modeled as resistors and proteins as interconnecting junctions. Construing the propagation of biological signals as flow of electrical current, our method calculates an information flow score for every protein. Unlike previous metrics of network centrality such as degree or betweenness that only consider topological features, our approach incorporates confidence scores of protein-protein interactions and automatically considers all possible paths in a network when evaluating the importance of each protein. We apply our method to the interactome networks of Saccharomyces cerevisiae and Caenorhabditis elegans. We find that the likelihood of observing lethality and pleiotropy when a protein is eliminated is positively correlated with the protein's information flow score. Even among proteins of low degree or low betweenness, high information scores serve as a strong predictor of loss-of-function lethality or pleiotropy. The correlation between information flow scores and phenotypes supports our hypothesis that the proteins of high information flow reside in central positions in interactome networks. We also show that the ranks of information flow scores are more consistent than that of betweenness when a large amount of noisy data is added to an interactome. Finally, we

  3. Continuous traffic flow modeling of driver support systems in multiclass traffic with inter-vehicle communication and drivers in the loop

    NARCIS (Netherlands)

    Tampere, C.M.J.; Hoogendoorn, S.P.; Arem, B. van

    2009-01-01

    This paper presents a continuous traffic-flow model for the explorative analysis of advanced driver-assistance systems (ADASs). Such systems use technology (sensors and intervehicle communication) to support the task of the driver, who retains full control over the vehicle. Based on a review of

  4. Effect and Analysis of Sustainable Cell Rate using MPEG video Traffic in ATM Networks

    Directory of Open Access Journals (Sweden)

    Sakshi Kaushal

    2006-04-01

    Full Text Available The broadband networks inhibit the capability to carry multiple types of traffic – voice, video and data, but these services need to be controlled according to the traffic contract negotiated at the time of the connection to maintain desired Quality of service. Such control techniques use traffic descriptors to evaluate its performance and effectiveness. In case of Variable Bit Rate (VBR services, Peak Cell Rate (PCR and its Cell Delay Variation Tolerance (CDVTPCR are mandatory descriptors. In addition to these, ATM Forum proposed Sustainable Cell Rate (SCR and its Cell delay variation tolerance (CDVTSCR. In this paper, we evaluated the impact of specific SCR and CDVTSCR values on the Usage Parameter Control (UPC performance in case of measured MPEG traffic for improving the efficiency

  5. Visualization of Traffic Accidents

    Science.gov (United States)

    Wang, Jie; Shen, Yuzhong; Khattak, Asad

    2010-01-01

    Traffic accidents have tremendous impact on society. Annually approximately 6.4 million vehicle accidents are reported by police in the US and nearly half of them result in catastrophic injuries. Visualizations of traffic accidents using geographic information systems (GIS) greatly facilitate handling and analysis of traffic accidents in many aspects. Environmental Systems Research Institute (ESRI), Inc. is the world leader in GIS research and development. ArcGIS, a software package developed by ESRI, has the capabilities to display events associated with a road network, such as accident locations, and pavement quality. But when event locations related to a road network are processed, the existing algorithm used by ArcGIS does not utilize all the information related to the routes of the road network and produces erroneous visualization results of event locations. This software bug causes serious problems for applications in which accurate location information is critical for emergency responses, such as traffic accidents. This paper aims to address this problem and proposes an improved method that utilizes all relevant information of traffic accidents, namely, route number, direction, and mile post, and extracts correct event locations for accurate traffic accident visualization and analysis. The proposed method generates a new shape file for traffic accidents and displays them on top of the existing road network in ArcGIS. Visualization of traffic accidents along Hampton Roads Bridge Tunnel is included to demonstrate the effectiveness of the proposed method.

  6. Modelling information flow along the human connectome using maximum flow.

    Science.gov (United States)

    Lyoo, Youngwook; Kim, Jieun E; Yoon, Sujung

    2018-01-01

    The human connectome is a complex network that transmits information between interlinked brain regions. Using graph theory, previously well-known network measures of integration between brain regions have been constructed under the key assumption that information flows strictly along the shortest paths possible between two nodes. However, it is now apparent that information does flow through non-shortest paths in many real-world networks such as cellular networks, social networks, and the internet. In the current hypothesis, we present a novel framework using the maximum flow to quantify information flow along all possible paths within the brain, so as to implement an analogy to network traffic. We hypothesize that the connection strengths of brain networks represent a limit on the amount of information that can flow through the connections per unit of time. This allows us to compute the maximum amount of information flow between two brain regions along all possible paths. Using this novel framework of maximum flow, previous network topological measures are expanded to account for information flow through non-shortest paths. The most important advantage of the current approach using maximum flow is that it can integrate the weighted connectivity data in a way that better reflects the real information flow of the brain network. The current framework and its concept regarding maximum flow provides insight on how network structure shapes information flow in contrast to graph theory, and suggests future applications such as investigating structural and functional connectomes at a neuronal level. Copyright © 2017 Elsevier Ltd. All rights reserved.

  7. Traffic of indistinguishable particles in complex networks

    International Nuclear Information System (INIS)

    Qing-Kuan, Meng; Jian-Yang, Zhu

    2009-01-01

    In this paper, we apply a simple walk mechanism to the study of the traffic of many indistinguishable particles in complex networks. The network with particles stands for a particle system, and every vertex in the network stands for a quantum state with the corresponding energy determined by the vertex degree. Although the particles are indistinguishable, the quantum states can be distinguished. When the many indistinguishable particles walk randomly in the system for a long enough time and the system reaches dynamic equilibrium, we find that under different restrictive conditions the particle distributions satisfy different forms, including the Bose–Einstein distribution, the Fermi–Dirac distribution and the non-Fermi distribution (as we temporarily call it). As for the Bose–Einstein distribution, we find that only if the particle density is larger than zero, with increasing particle density, do more and more particles condense in the lowest energy level. While the particle density is very low, the particle distribution transforms from the quantum statistical form to the classically statistical form, i.e., transforms from the Bose distribution or the Fermi distribution to the Boltzmann distribution. The numerical results fit well with the analytical predictions

  8. Fault Tolerant Mechanism for Multimedia Flows in Wireless Ad Hoc Networks Based on Fast Switching Paths

    Directory of Open Access Journals (Sweden)

    Juan R. Diaz

    2014-01-01

    Full Text Available Multimedia traffic can be forwarded through a wireless ad hoc network using the available resources of the nodes. Several models and protocols have been designed in order to organize and arrange the nodes to improve transmissions along the network. We use a cluster-based framework, called MWAHCA architecture, which optimizes multimedia transmissions over a wireless ad hoc network. It was proposed by us in a previous research work. This architecture is focused on decreasing quality of service (QoS parameters like latency, jitter, and packet loss, but other network features were not developed, like load balance or fault tolerance. In this paper, we propose a new fault tolerance mechanism, using as a base the MWAHCA architecture, in order to recover any multimedia flow crossing the wireless ad hoc network when there is a node failure. The algorithm can run independently for each multimedia flow. The main objective is to keep the QoS parameters as low as possible. To achieve this goal, the convergence time must be controlled and reduced. This paper provides the designed protocol, the analytical model of the algorithm, and a software application developed to test its performance in a real laboratory.

  9. Congestion Control in Data Transmission Networks Sliding Mode and Other Designs

    CERN Document Server

    Ignaciuk, Przemysław

    2013-01-01

    Congestion Control in Data Transmission Networks details the modeling and control of data traffic in communication networks. It shows how various networking phenomena can be represented in a consistent mathematical framework suitable for rigorous formal analysis. The monograph differentiates between fluid-flow continuous-time traffic models, discrete-time processes with constant sampling rates, and sampled-data systems with variable discretization periods. The authors address a number of difficult real-life problems, such as: • optimal control of flows with disparate, time-varying delay; • the existence of source and channel nonlinearities; • the balancing of quality of service and fairness requirements; and • the incorporation of variable rate allocation policies. Appropriate control mechanisms which can handle congestion and guarantee high throughput in various traffic scenarios (with different networking phenomena being considered) are proposed. Systematic design procedures using sound control-theo...

  10. Power laws and fragility in flow networks.

    Science.gov (United States)

    Shore, Jesse; Chu, Catherine J; Bianchi, Matt T

    2013-01-01

    What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by flow. We show that flow networks tend to the power law degree distribution (PLDD) due to a self-reinforcing process involving position within the global network structure, and thus present the first random graph model for PLDDs that does not depend on a rich-get-richer function of nodal degree. We also show that in contrast to non-flow networks, PLDD flow networks are dramatically more vulnerable to catastrophic failure than non-PLDD flow networks, a finding with potential explanatory power in our age of resource- and financial-interdependence and turbulence.

  11. Strategic Air Traffic Planning Using Eulerian Route Based Modeling and Optimization

    Science.gov (United States)

    Bombelli, Alessandro

    Due to a soaring air travel growth in the last decades, air traffic management has become increasingly challenging. As a consequence, planning tools are being devised to help human decision-makers achieve a better management of air traffic. Planning tools are divided into two categories, strategic and tactical. Strategic planning generally addresses a larger planning domain and is performed days to hours in advance. Tactical planning is more localized and is performed hours to minutes in advance. An aggregate route model for strategic air traffic flow management is presented. It is an Eulerian model, describing the flow between cells of unidirectional point-to-point routes. Aggregate routes are created from flight trajectory data based on similarity measures. Spatial similarity is determined using the Frechet distance. The aggregate routes approximate actual well-traveled traffic patterns. By specifying the model resolution, an appropriate balance between model accuracy and model dimension can be achieved. For a particular planning horizon, during which weather is expected to restrict the flow, a procedure for designing airborne reroutes and augmenting the traffic flow model is developed. The dynamics of the traffic flow on the resulting network take the form of a discrete-time, linear time-invariant system. The traffic flow controls are ground holding, pre-departure rerouting and airborne rerouting. Strategic planning--determining how the controls should be used to modify the future traffic flow when local capacity violations are anticipated--is posed as an integer programming problem of minimizing a weighted sum of flight delays subject to control and capacity constraints. Several tests indicate the effectiveness of the modeling and strategic planning approach. In the final, most challenging, test, strategic planning is demonstrated for the six western-most Centers of the 22-Center national airspace. The planning time horizon is four hours long, and there is

  12. Information-Aided Smart Schemes for Vehicle Flow Detection Enhancements of Traffic Microwave Radar Detectors

    Directory of Open Access Journals (Sweden)

    Tan-Jan Ho

    2016-07-01

    Full Text Available For satisfactory traffic management of an intelligent transport system, it is vital that traffic microwave radar detectors (TMRDs can provide real-time traffic information with high accuracy. In this study, we develop several information-aided smart schemes for traffic detection improvements of TMRDs in multiple-lane environments. Specifically, we select appropriate thresholds not only for removing noise from fast Fourier transforms (FFTs of regional lane contexts but also for reducing FFT side lobes within each lane. The resulting FFTs of reflected vehicle signals and those of clutter are distinguishable. We exploit FFT and lane-/or time stamp-related information for developing smart schemes, which mitigate adverse effects of lane-crossing FFT side lobes of a vehicle signal. As such, the proposed schemes can enhance the detection accuracy of both lane vehicle flow and directional traffic volume. On-site experimental results demonstrate the advantages and feasibility of the proposed methods, and suggest the best smart scheme.

  13. A novel fair active queue management algorithm based on traffic delay jitter

    Science.gov (United States)

    Wang, Xue-Shun; Yu, Shao-Hua; Dai, Jin-You; Luo, Ting

    2009-11-01

    In order to guarantee the quantity of data traffic delivered in the network, congestion control strategy is adopted. According to the study of many active queue management (AQM) algorithms, this paper proposes a novel active queue management algorithm named JFED. JFED can stabilize queue length at a desirable level by adjusting output traffic rate and adopting a reasonable calculation of packet drop probability based on buffer queue length and traffic jitter; and it support burst packet traffic through the packet delay jitter, so that it can traffic flow medium data. JFED impose effective punishment upon non-responsible flow with a full stateless method. To verify the performance of JFED, it is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that the proposed JFED algorithm outperforms RED and CHOKe in stabilizing instantaneous queue length and in fairness. It is also shown that JFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

  14. Packet traffic features of IPv6 and IPv4 protocol traffic

    OpenAIRE

    ÇİFLİKLİ, Cebrail; GEZER, Ali; ÖZŞAHİN, Abdullah Tuncay

    2012-01-01

    Nowadays, the IPv6 protocol is in a transition phase in operational networks. The ratio of its traffic volume is increasing day by day. The many provided facilities for IPv6 connection increasethe total IPv6 traffic load. IPv6-over-IPv4 tunnels, pilot programsto provide IPv6 connections, IPv6/IPv4 dual stack operating systems,and free IPv6 tunnel brokers cause the IPv6 protocol to expand quickly. For efficient resource utilization, the characteristics of network traffic should be determ...

  15. A wireless sensor network for urban traffic characterization and trend monitoring.

    Science.gov (United States)

    Fernández-Lozano, J J; Martín-Guzmán, Miguel; Martín-Ávila, Juan; García-Cerezo, A

    2015-10-15

    Sustainable mobility requires a better management of the available infrastructure resources. To achieve this goal, it is necessary to obtain accurate data about road usage, in particular in urban areas. Although a variety of sensor alternates for urban traffic exist, they usually require extensive investments in the form of construction works for installation, processing means, etc. Wireless Sensor Networks (WSN) are an alternative to acquire urban traffic data, allowing for flexible, easy deployment. Together with the use of the appropriate sensors, like Bluetooth identification, and associate processing, WSN can provide the means to obtain in real time data like the origin-destination matrix, a key tool for trend monitoring which previously required weeks or months to be completed. This paper presents a system based on WSN designed to characterize urban traffic, particularly traffic trend monitoring through the calculation of the origin-destination matrix in real time by using Bluetooth identification. Additional sensors are also available integrated in different types of nodes. Experiments in real conditions have been performed, both for separate sensors (Bluetooth, ultrasound and laser), and for the whole system, showing the feasibility of this approach.

  16. Droplet Traffic Control at a simple T junction

    Science.gov (United States)

    Panizza, Pascal; Engl, Wilfried; Colin, Annie; Ajdari, Armand

    2006-03-01

    A basic yet essential element of every traffic flow control is the effect of a junction where the flow is separated into several streams. How do pedestrians, vehicles or blood cells divide when they reach a junction? How does the outcome depend on their density? Similar fundamental questions hold for much simpler systems: in this paper, we have studied the behaviour of periodic trains of water droplets flowing in oil through a channel as they reach a simple, locally symmetric, T junction. Depending on their dilution, we observe that the droplets are either alternately partitioned between both outlets or sorted exclusively into the shortest one. We show that this surprising behaviour results from the hydrodynamic feed-back of drops in the two outlets on the selection process occurring at the junction. Our results offer a first guide for the design and modelling of droplet traffic in complex branched networks, a necessary step towards parallelized droplet-based ``lab-on-chip'' devices.

  17. Optimized Virtual Machine Placement with Traffic-Aware Balancing in Data Center Networks

    Directory of Open Access Journals (Sweden)

    Tao Chen

    2016-01-01

    Full Text Available Virtualization has been an efficient method to fully utilize computing resources such as servers. The way of placing virtual machines (VMs among a large pool of servers greatly affects the performance of data center networks (DCNs. As network resources have become a main bottleneck of the performance of DCNs, we concentrate on VM placement with Traffic-Aware Balancing to evenly utilize the links in DCNs. In this paper, we first proposed a Virtual Machine Placement Problem with Traffic-Aware Balancing (VMPPTB and then proved it to be NP-hard and designed a Longest Processing Time Based Placement algorithm (LPTBP algorithm to solve it. To take advantage of the communication locality, we proposed Locality-Aware Virtual Machine Placement Problem with Traffic-Aware Balancing (LVMPPTB, which is a multiobjective optimization problem of simultaneously minimizing the maximum number of VM partitions of requests and minimizing the maximum bandwidth occupancy on uplinks of Top of Rack (ToR switches. We also proved it to be NP-hard and designed a heuristic algorithm (Least-Load First Based Placement algorithm, LLBP algorithm to solve it. Through extensive simulations, the proposed heuristic algorithm is proven to significantly balance the bandwidth occupancy on uplinks of ToR switches, while keeping the number of VM partitions of each request small enough.

  18. Traffic Accident Propagation Properties and Control Measures for Urban Links Based on Cellular Automata

    Directory of Open Access Journals (Sweden)

    Xian-sheng Li

    2013-01-01

    Full Text Available With the rapid development of urban transport and the sharp increase in vehicle population, traffic accidents form one of the most important causes of urban traffic congestion other than the imbalance between traffic supply and demand. Traffic congestion causes severe problems, such as environment contamination and energy dissipation. Therefore, it would be useful to analyze the congestion propagation characteristics after traffic accidents. Numerical analysis and computer simulation were two of the typical methods used at present to study the traffic congestion propagation properties. The latter was more widespread as it is more consistent with the actual traffic flow and more visual than the former. In this paper, an improved cellular automata (CA model was presented to analyze traffic congestion propagation properties and to evaluate control strategies. In order to apply them to urban traffic flow simulation, the CA models have been improved and expanded on. Computer simulations were built for congestion not only extending to the upstream intersection, but also the upstream intersection and the entire road network, respectively. Congestion propagation characteristics after road traffic accidents were obtained, and controls of different severities and durations were analyzed. The results provide the theoretical foundation and practical means for the control of congestion.

  19. Stochastic cycle selection in active flow networks

    Science.gov (United States)

    Woodhouse, Francis; Forrow, Aden; Fawcett, Joanna; Dunkel, Jorn

    2016-11-01

    Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such non-equilibrium networks. By connecting concepts from lattice field theory, graph theory and transition rate theory, we show how topology controls dynamics in a generic model for actively driven flow on a network. Through theoretical and numerical analysis we identify symmetry-based rules to classify and predict the selection statistics of complex flow cycles from the network topology. Our conceptual framework is applicable to a broad class of biological and non-biological far-from-equilibrium networks, including actively controlled information flows, and establishes a new correspondence between active flow networks and generalized ice-type models.

  20. Combination Adaptive Traffic Algorithm and Coordinated Sleeping in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    M. Udin Harun Al Rasyid

    2014-12-01

    Full Text Available Wireless sensor network (WSN uses a battery as its primary power source, so that WSN will be limited to battery power for long operations. The WSN should be able to save the energy consumption in order to operate in a long time.WSN has the potential to be the future of wireless communications solutions. WSN are small but has a variety of functions that can help human life. WSN has the wide variety of sensors and can communicate quickly making it easier for people to obtain information accurately and quickly. In this study, we combine adaptive traffic algorithms and coordinated sleeping as power‐efficient WSN solution. We compared the performance of our proposed ideas combination adaptive traffic and coordinated sleeping algorithm with non‐adaptive scheme. From the simulation results, our proposed idea has good‐quality data transmission and more efficient in energy consumption, but it has higher delay than that of non‐adaptive scheme. Keywords:WSN,adaptive traffic,coordinated sleeping,beacon order,superframe order.