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...

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.

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.

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.

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.

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...

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....

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.

Partial Cooperative Equilibria: Existence and Characterization

Directory of Open Access Journals (Sweden)

Amandine Ghintran

2010-09-01

Full Text Available We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.

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.

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.

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...

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 ...

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.

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

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.

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.

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.

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.

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

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.

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

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.

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.

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...

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

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.

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.

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...

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.

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)

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

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...

Equilibria, information and frustration in heterogeneous network games with conflicting preferences

Science.gov (United States)

Mazzoli, M.; Sánchez, A.

2017-11-01

Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has addressed this issue by combining the physics of complex networks with a description of interactions in terms of evolutionary game theory. We here take this research a step further by introducing a most salient societal factor such as the individuals’ preferences, a characteristic that is key to understanding much of the social phenomenology these days. We consider a heterogeneous, agent-based model in which agents interact strategically with their neighbors, but their preferences and payoffs for the possible actions differ. We study how such a heterogeneous network behaves under evolutionary dynamics and different strategic interactions, namely coordination games and best shot games. With this model we study the emergence of the equilibria predicted analytically in random graphs under best response dynamics, and we extend this test to unexplored contexts like proportional imitation and scale free networks. We show that some theoretically predicted equilibria do not arise in simulations with incomplete information, and we demonstrate the importance of the graph topology and the payoff function parameters for some games. Finally, we discuss our results with the available experimental evidence on coordination games, showing that our model agrees better with the experiment than standard economic theories, and draw hints as to how to maximize social efficiency in situations of conflicting preferences.

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)

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....

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...

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.

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 ...

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)

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.

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.

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.

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.

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...

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.

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.

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.

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.

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...

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)

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.

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.

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.

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,

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...

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.

Intermediates and Generic Convergence to Equilibria

DEFF Research Database (Denmark)

Marcondes de Freitas, Michael; Wiuf, Carsten; Feliu, Elisenda

2017-01-01

Known graphical conditions for the generic and global convergence to equilibria of the dynamical system arising from a reaction network are shown to be invariant under the so-called successive removal of intermediates, a systematic procedure to simplify the network, making the graphical conditions...

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...

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.

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)

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.

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.

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.

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.

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

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

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.

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

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.

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.

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.

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.

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.

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

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.

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.

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...

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.

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.

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.

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...

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.

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

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.

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.

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.

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.

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...

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.

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

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.

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....

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.

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

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)

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...

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 ...

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.

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...

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.

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.

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

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

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.

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...

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.

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.

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.

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.

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.

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...

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...

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...

On Pure and (approximate) Strong Equilibria of Facility Location Games

DEFF Research Database (Denmark)

Hansen, Thomas Dueholm; Telelis, Orestis A.

2008-01-01

We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed by a non-negative weight per agent). Agents using the same facility share fairly its installation cost, but every...... agent pays individually a (weighted) connection cost to the chosen location. We study the Price of Stability (PoS) of pure Nash equilibria and the Price of Anarchy of strong equilibria (SPoA), that generalize pure equilibria by being resilient to coalitional deviations. For unweighted agents on metric...

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)

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 ...

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...

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.

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.

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.

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.

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...

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....

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

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...

Equilibria of perceptrons for simple contingency problems.

Science.gov (United States)

Dawson, Michael R W; Dupuis, Brian

2012-08-01

The contingency between cues and outcomes is fundamentally important to theories of causal reasoning and to theories of associative learning. Researchers have computed the equilibria of Rescorla-Wagner models for a variety of contingency problems, and have used these equilibria to identify situations in which the Rescorla-Wagner model is consistent, or inconsistent, with normative models of contingency. Mathematical analyses that directly compare artificial neural networks to contingency theory have not been performed, because of the assumed equivalence between the Rescorla-Wagner learning rule and the delta rule training of artificial neural networks. However, recent results indicate that this equivalence is not as straightforward as typically assumed, suggesting a strong need for mathematical accounts of how networks deal with contingency problems. One such analysis is presented here, where it is proven that the structure of the equilibrium for a simple network trained on a basic contingency problem is quite different from the structure of the equilibrium for a Rescorla-Wagner model faced with the same problem. However, these structural differences lead to functionally equivalent behavior. The implications of this result for the relationships between associative learning, contingency theory, and connectionism are discussed.

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.

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

Attractive evolutionary equilibria

NARCIS (Netherlands)

Joosten, Reinoud A.M.G.; Roorda, Berend

2011-01-01

We present attractiveness, a refinement criterion for evolutionary equilibria. Equilibria surviving this criterion are robust to small perturbations of the underlying payoff system or the dynamics at hand. Furthermore, certain attractive equilibria are equivalent to others for certain evolutionary

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.

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.

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.

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.

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.

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

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.

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.

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%.

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.

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...

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.

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...

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.

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.

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....

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...

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.

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.

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.

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...

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...

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.

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...

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....

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...

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.

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.

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.

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.

Attractive evolutionary equilibria

OpenAIRE

Roorda, Berend; Joosten, Reinoud

2011-01-01

We present attractiveness, a refinement criterion for evolutionary equilibria. Equilibria surviving this criterion are robust to small perturbations of the underlying payoff system or the dynamics at hand. Furthermore, certain attractive equilibria are equivalent to others for certain evolutionary dynamics. For instance, each attractive evolutionarily stable strategy is an attractive evolutionarily stable equilibrium for certain barycentric ray-projection dynamics, and vice versa.

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...

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.

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

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.

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.

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.

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.

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.

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.

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

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...

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.

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

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.

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.

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.

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.

Multi-Equilibria Regulation Agent-Based Model of Opinion Dynamics in Social Networks

Directory of Open Access Journals (Sweden)

Andreas Koulouris

2013-01-01

Full Text Available This article investigates the Multiple Equilibria Regulation (MER model, i.e., an agent-based simulation model, to represent opinion dynamics in social networks. It relies on a small set of micro-prerequisites (intra-individual balance and confidence bound, leading to emergence of (nonstationary macro-outcomes. These outcomes may refer to consensus, polarization or fragmentation of opinions about taxation (e.g., congestion pricing or other policy measures, according to the way communication is structured. In contrast with other models of opinion dynamics, it allows for the impact of both the regulation of intra-personal discrepancy and the interpersonal variability of opinions on social learning and network dynamics. Several simulation experiments are presented to demonstrate, through the MER model, the role of different network structures (complete, star, cellular automata, small-world and random graphs on opinion formation dynamics and the overall evolution of the system. The findings can help to identify specific topological characteristics, such as density, number of neighbourhoods and critical nodes-agents, that affect the stability and system dynamics. This knowledge can be used to better organize the information diffusion and learning in the community, enhance the predictability of outcomes and manage possible conflicts. It is shown that a small-world organization, which depicts more realistic aspects of real-life and virtual social systems, provides increased predictability and stability towards a less fragmented and more manageable grouping of opinions, compared to random networks. Such macro-level organizations may be enhanced with use of web-based technologies to increase the density of communication and public acceptability of policy measures.

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.

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.

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...

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...

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.

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....

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.

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.

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.

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.

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.

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.

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.

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.

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 ...

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.

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.

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.

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.

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.

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...

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.

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

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.

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.

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.

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...

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...

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.

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...

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...

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.

Learning efficient correlated equilibria

KAUST Repository

Borowski, Holly P.

2014-12-15

The majority of distributed learning literature focuses on convergence to Nash equilibria. Correlated equilibria, on the other hand, can often characterize more efficient collective behavior than even the best Nash equilibrium. However, there are no existing distributed learning algorithms that converge to specific correlated equilibria. In this paper, we provide one such algorithm which guarantees that the agents\\' collective joint strategy will constitute an efficient correlated equilibrium with high probability. The key to attaining efficient correlated behavior through distributed learning involves incorporating a common random signal into the learning environment.

Learning efficient correlated equilibria

KAUST Repository

Borowski, Holly P.; Marden, Jason R.; Shamma, Jeff S.

2014-01-01

The majority of distributed learning literature focuses on convergence to Nash equilibria. Correlated equilibria, on the other hand, can often characterize more efficient collective behavior than even the best Nash equilibrium. However, there are no existing distributed learning algorithms that converge to specific correlated equilibria. In this paper, we provide one such algorithm which guarantees that the agents' collective joint strategy will constitute an efficient correlated equilibrium with high probability. The key to attaining efficient correlated behavior through distributed learning involves incorporating a common random signal into the learning environment.

Exogenous empirical-evidence equilibria in perfect-monitoring repeated games yield correlated equilibria

KAUST Repository

Dudebout, Nicolas; Shamma, Jeff S.

2014-01-01

This paper proves that exogenous empirical-evidence equilibria (xEEEs) in perfect-monitoring repeated games induce correlated equilibria of the associated one-shot game. An empirical-evidence equilibrium (EEE) is a solution concept for stochastic games. At equilibrium, agents' strategies are optimal with respect to models of their opponents. These models satisfy a consistency condition with respect to the actual behavior of the opponents. As such, EEEs replace the full-rationality requirement of Nash equilibria by a consistency-based bounded-rationality one. In this paper, the framework of empirical evidence is summarized, with an emphasis on perfect-monitoring repeated games. A less constraining notion of consistency is introduced. The fact that an xEEE in a perfect-monitoring repeated game induces a correlated equilibrium on the underlying one-shot game is proven. This result and the new notion of consistency are illustrated on the hawk-dove game. Finally, a method to build specific correlated equilibria from xEEEs is derived.

Exogenous empirical-evidence equilibria in perfect-monitoring repeated games yield correlated equilibria

KAUST Repository

Dudebout, Nicolas

2014-12-15

This paper proves that exogenous empirical-evidence equilibria (xEEEs) in perfect-monitoring repeated games induce correlated equilibria of the associated one-shot game. An empirical-evidence equilibrium (EEE) is a solution concept for stochastic games. At equilibrium, agents\\' strategies are optimal with respect to models of their opponents. These models satisfy a consistency condition with respect to the actual behavior of the opponents. As such, EEEs replace the full-rationality requirement of Nash equilibria by a consistency-based bounded-rationality one. In this paper, the framework of empirical evidence is summarized, with an emphasis on perfect-monitoring repeated games. A less constraining notion of consistency is introduced. The fact that an xEEE in a perfect-monitoring repeated game induces a correlated equilibrium on the underlying one-shot game is proven. This result and the new notion of consistency are illustrated on the hawk-dove game. Finally, a method to build specific correlated equilibria from xEEEs is derived.

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.

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.

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

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.

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.

A Continuous Family of Equilibria in Ferromagnetic Media are Ground States

Science.gov (United States)

Su, Xifeng; de la Llave, Rafael

2017-09-01

We show that a foliation of equilibria (a continuous family of equilibria whose graph covers all the configuration space) in ferromagnetic transitive models are ground states. The result we prove is very general, and it applies to models with long range and many-body interactions. As an application, we consider several models of networks of interacting particles including models of Frenkel-Kontorova type on Z^d and one-dimensional quasi-periodic media. The result above is an analogue of several results in the calculus of variations (fields of extremals) and in PDE's. Since the models we consider are discrete and long range, new proofs need to be given. We also note that the main hypothesis of our result (the existence of foliations of equilibria) is the conclusion (using KAM theory) of several recent papers. Hence, we obtain that the KAM solutions recently established are minimizers when the interaction is ferromagnetic and transitive (these concepts are defined later).

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

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.

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.

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...

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...

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.

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.

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.

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.

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

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

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.

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

Coexistence of Cognitive Small Cell and WiFi System: A Traffic Balancing Dual-Access Resource Allocation Scheme

Directory of Open Access Journals (Sweden)

Xiaoge Huang

2018-01-01

Full Text Available We consider a holistic approach for dual-access cognitive small cell (DACS networks, which uses the LTE air interface in both licensed and unlicensed bands. In the licensed band, we consider a sensing-based power allocation scheme to maximize the sum data rate of DACSs by jointly optimizing the cell selection, the sensing operation, and the power allocation under the interference constraint to macrocell users. Due to intercell interference and the integer nature of the cell selection, the resulting optimization problems lead to a nonconvex integer programming. We reformulate the problem to a nonconvex power allocation game and find the relaxed equilibria, quasi-Nash equilibrium. Furthermore, in order to guarantee the fairness of the whole system, we propose a dynamic satisfaction-based dual-band traffic balancing (SDTB algorithm over licensed and unlicensed bands for DACSs which aims at maximizing the overall satisfaction of the system. We obtain the optimal transmission time in the unlicensed band to ensure the proportional fair coexistence with WiFi while guaranteeing the traffic balancing of DACSs. Simulation results demonstrate that the SDTB algorithm could achieve a considerable performance improvement relative to the schemes in literature, while providing a tradeoff between maximizing the total data rate and achieving better fairness among networks.

Phase equilibria and phase structures of polymer blends

International Nuclear Information System (INIS)

Chalykh, Anatolii E; Gerasimov, Vladimir K

2004-01-01

Experimental, methodical and theoretical studies dealing with phase equilibria and phase structures of polymer blends are generalised. The general and specific features of the change in solubility of polymers with changes in the molecular mass and copolymer composition and upon the formation of three-dimensional cross-linked networks are described. The results of the effect of the prehistory on the phase structure and the non-equilibrium state of polymer blends are considered in detail.

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...

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.

Convergent dynamics for multistable delayed neural networks

International Nuclear Information System (INIS)

Shih, Chih-Wen; Tseng, Jui-Pin

2008-01-01

This investigation aims at developing a methodology to establish convergence of dynamics for delayed neural network systems with multiple stable equilibria. The present approach is general and can be applied to several network models. We take the Hopfield-type neural networks with both instantaneous and delayed feedbacks to illustrate the idea. We shall construct the complete dynamical scenario which comprises exactly 2 n stable equilibria and exactly (3 n − 2 n ) unstable equilibria for the n-neuron network. In addition, it is shown that every solution of the system converges to one of the equilibria as time tends to infinity. The approach is based on employing the geometrical structure of the network system. Positively invariant sets and componentwise dynamical properties are derived under the geometrical configuration. An iteration scheme is subsequently designed to confirm the convergence of dynamics for the system. Two examples with numerical simulations are arranged to illustrate the present theory

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.

Adsorption analysis equilibria and kinetics

CERN Document Server

Do, Duong D

1998-01-01

This book covers topics of equilibria and kinetics of adsorption in porous media. Fundamental equilibria and kinetics are dealt with for homogeneous as well as heterogeneous particles. Five chapters of the book deal with equilibria and eight chapters deal with kinetics. Single component as well as multicomponent systems are discussed. In kinetics analysis, we deal with the various mass transport processes and their interactions inside a porous particle. Conventional approaches as well as the new approach using Maxwell-Stefan equations are presented. Various methods to measure diffusivity, such

Quantum equilibria for macroscopic systems

International Nuclear Information System (INIS)

Grib, A; Khrennikov, A; Parfionov, G; Starkov, K

2006-01-01

Nash equilibria are found for some quantum games with particles with spin-1/2 for which two spin projections on different directions in space are measured. Examples of macroscopic games with the same equilibria are given. Mixed strategies for participants of these games are calculated using probability amplitudes according to the rules of quantum mechanics in spite of the macroscopic nature of the game and absence of Planck's constant. A possible role of quantum logical lattices for the existence of macroscopic quantum equilibria is discussed. Some examples for spin-1 cases are also considered

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.

A Fair Contention Access Scheme for Low-Priority Traffic in Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Shagufta Henna

2017-08-01

Full Text Available Recently, wireless body area networks (WBANs have attracted significant consideration in ubiquitous healthcare. A number of medium access control (MAC protocols, primarily derived from the superframe structure of the IEEE 802.15.4, have been proposed in literature. These MAC protocols aim to provide quality of service (QoS by prioritizing different traffic types in WBANs. A contention access period (CAPwith high contention in priority-based MAC protocols can result in higher number of collisions and retransmissions. During CAP, traffic classes with higher priority are dominant over low-priority traffic; this has led to starvation of low-priority traffic, thus adversely affecting WBAN throughput, delay, and energy consumption. Hence, this paper proposes a traffic-adaptive priority-based superframe structure that is able to reduce contention in the CAP period, and provides a fair chance for low-priority traffic. Simulation results in ns-3 demonstrate that the proposed MAC protocol, called traffic- adaptive priority-based MAC (TAP-MAC, achieves low energy consumption, high throughput, and low latency compared to the IEEE 802.15.4 standard, and the most recent priority-based MAC protocol, called priority-based MAC protocol (PA-MAC.

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.

Some stable hydromagnetic equilibria

Energy Technology Data Exchange (ETDEWEB)

Johnson, J L; Oberman, C R; Kulsrud, R M; Frieman, E A [Project Matterhorn, Princeton University, Princeton, NJ (United States)

1958-07-01

We have been able to find and investigate the properties of equilibria which are hydromagnetically stable. These equilibria can be obtained, for example, by wrapping conductors helically around the stellarator tube. Systems with I = 3 or 4 are indicated to be optimum for stability purposes. In some cases an admixture of I = 2 fields can be advantageous for achieving equilibrium. (author)

Travelers ability to observe changes in traffic intensities and traffic light settings

NARCIS (Netherlands)

Vreeswijk, Jacob Dirk; Do, Michael; Middag, Wilco; Martens, Marieke Hendrikje; van Berkum, Eric C.; van Arem, Bart; ITSC,

2011-01-01

Travel choice behavior is an important determinant in traffic and subject to human imperfection and bounded rationality. In decision-making processes travelers seldom act perfectly rational. Traffic models and traffic network management measure could become more realistic and effective, if

Performance Evaluation of Hadoop-based Large-scale Network Traffic Analysis Cluster

Directory of Open Access Journals (Sweden)

Tao Ran

2016-01-01

Full Text Available As Hadoop has gained popularity in big data era, it is widely used in various fields. The self-design and self-developed large-scale network traffic analysis cluster works well based on Hadoop, with off-line applications running on it to analyze the massive network traffic data. On purpose of scientifically and reasonably evaluating the performance of analysis cluster, we propose a performance evaluation system. Firstly, we set the execution times of three benchmark applications as the benchmark of the performance, and pick 40 metrics of customized statistical resource data. Then we identify the relationship between the resource data and the execution times by a statistic modeling analysis approach, which is composed of principal component analysis and multiple linear regression. After training models by historical data, we can predict the execution times by current resource data. Finally, we evaluate the performance of analysis cluster by the validated predicting of execution times. Experimental results show that the predicted execution times by trained models are within acceptable error range, and the evaluation results of performance are accurate and reliable.

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.

Effective distance adaptation traffic dispatching in software defined IP over optical network

Science.gov (United States)

Duan, Zhiwei; Li, Hui; Liu, Yuze; Ji, Yuefeng; Li, Hongfa; Lin, Yi

2017-10-01

The rapid growth of IP traffic has contributed to the wide deployment of optical devices (ROADM/OXC, etc.). Meanwhile, with the emergence and application of high-performance network services such as ultra-high video transmission, people are increasingly becoming more and more particular about the quality of service (QoS) of network. However, the pass-band shape of WSSs which is utilized in the ROADM/OXC is not ideal, causing narrowing of spectrum. Spectral narrowing can lead to signal impairment. Therefore, guard-bands need to be inserted between adjacent paths. In order to minimize the bandwidth waste due to guard bands, we propose an effective distance-adaptation traffic dispatching algorithm in IP over optical network based on SDON architecture. We use virtualization technology to set up virtual resources direct links by extracting part of the resources on paths which meet certain specific constraints. We also assign different bandwidth to each IP request based on path length. There is no need for guard-bands between the adjacent paths on the virtual link, which can effectively reduce the number of guard-bands and save the spectrum.

Distributed Traffic Control for Reduced Fuel Consumption and Travel Time in Transportation Networks

Science.gov (United States)

2018-04-01

Current technology in traffic control is limited to a centralized approach that has not paid appropriate attention to efficiency of fuel consumption and is subject to the scale of transportation networks. This project proposes a transformative approa...

Jump conditions in transonic equilibria

International Nuclear Information System (INIS)

Guazzotto, L.; Betti, R.; Jardin, S. C.

2013-01-01

In the present paper, the numerical calculation of transonic equilibria, first introduced with the FLOW code in Guazzotto et al.[Phys. Plasmas 11, 604 (2004)], is critically reviewed. In particular, the necessity and effect of imposing explicit jump conditions at the transonic discontinuity are investigated. It is found that “standard” (low-β, large aspect ratio) transonic equilibria satisfy the correct jump condition with very good approximation even if the jump condition is not explicitly imposed. On the other hand, it is also found that high-β, low aspect ratio equilibria require the correct jump condition to be explicitly imposed. Various numerical approaches are described to modify FLOW to include the jump condition. It is proved that the new methods converge to the correct solution even in extreme cases of very large β, while they agree with the results obtained with the old implementation of FLOW in lower-β equilibria.

File Detection On Network Traffic Using Approximate Matching

Directory of Open Access Journals (Sweden)

Frank Breitinger

2014-09-01

Full Text Available In recent years, Internet technologies changed enormously and allow faster Internet connections, higher data rates and mobile usage. Hence, it is possible to send huge amounts of data / files easily which is often used by insiders or attackers to steal intellectual property. As a consequence, data leakage prevention systems (DLPS have been developed which analyze network traffic and alert in case of a data leak. Although the overall concepts of the detection techniques are known, the systems are mostly closed and commercial.Within this paper we present a new technique for network trac analysis based on approximate matching (a.k.a fuzzy hashing which is very common in digital forensics to correlate similar files. This paper demonstrates how to optimize and apply them on single network packets. Our contribution is a straightforward concept which does not need a comprehensive conguration: hash the file and store the digest in the database. Within our experiments we obtained false positive rates between 10-4 and 10-5 and an algorithm throughput of over 650 Mbit/s.

Quantum equilibria for macroscopic systems

Energy Technology Data Exchange (ETDEWEB)

Grib, A [Department of Theoretical Physics and Astronomy, Russian State Pedagogical University, St. Petersburg (Russian Federation); Khrennikov, A [Centre for Mathematical Modelling in Physics and Cognitive Sciences Vaexjoe University (Sweden); Parfionov, G [Department of Mathematics, St. Petersburg State University of Economics and Finances (Russian Federation); Starkov, K [Department of Mathematics, St. Petersburg State University of Economics and Finances (Russian Federation)

2006-06-30

Nash equilibria are found for some quantum games with particles with spin-1/2 for which two spin projections on different directions in space are measured. Examples of macroscopic games with the same equilibria are given. Mixed strategies for participants of these games are calculated using probability amplitudes according to the rules of quantum mechanics in spite of the macroscopic nature of the game and absence of Planck's constant. A possible role of quantum logical lattices for the existence of macroscopic quantum equilibria is discussed. Some examples for spin-1 cases are also considered.

Using Generalized Entropies and OC-SVM with Mahalanobis Kernel for Detection and Classification of Anomalies in Network Traffic

Directory of Open Access Journals (Sweden)

Jayro Santiago-Paz

2015-09-01

Full Text Available Network anomaly detection and classification is an important open issue in network security. Several approaches and systems based on different mathematical tools have been studied and developed, among them, the Anomaly-Network Intrusion Detection System (A-NIDS, which monitors network traffic and compares it against an established baseline of a “normal” traffic profile. Then, it is necessary to characterize the “normal” Internet traffic. This paper presents an approach for anomaly detection and classification based on Shannon, Rényi and Tsallis entropies of selected features, and the construction of regions from entropy data employing the Mahalanobis distance (MD, and One Class Support Vector Machine (OC-SVM with different kernels (Radial Basis Function (RBF and Mahalanobis Kernel (MK for “normal” and abnormal traffic. Regular and non-regular regions built from “normal” traffic profiles allow anomaly detection, while the classification is performed under the assumption that regions corresponding to the attack classes have been previously characterized. Although this approach allows the use of as many features as required, only four well-known significant features were selected in our case. In order to evaluate our approach, two different data sets were used: one set of real traffic obtained from an Academic Local Area Network (LAN, and the other a subset of the 1998 MIT-DARPA set. For these data sets, a True positive rate up to 99.35%, a True negative rate up to 99.83% and a False negative rate at about 0.16% were yielded. Experimental results show that certain q-values of the generalized entropies and the use of OC-SVM with RBF kernel improve the detection rate in the detection stage, while the novel inclusion of MK kernel in OC-SVM and k-temporal nearest neighbors improve accuracy in classification. In addition, the results show that using the Box-Cox transformation, the Mahalanobis distance yielded high detection rates with

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.

Cybersecurity and Network Forensics: Analysis of Malicious Traffic towards a Honeynet with Deep Packet Inspection

OpenAIRE

Gabriel Arquelau Pimenta Rodrigues; Robson de Oliveira Albuquerque; Flávio Elias Gomes de Deus; Rafael Timóteo de Sousa Jr.; Gildásio Antônio de Oliveira Júnior; Luis Javier García Villalba; Tai-Hoon Kim

2017-01-01

Any network connected to the Internet is subject to cyber attacks. Strong security measures, forensic tools, and investigators contribute together to detect and mitigate those attacks, reducing the damages and enabling reestablishing the network to its normal operation, thus increasing the cybersecurity of the networked environment. This paper addresses the use of a forensic approach with Deep Packet Inspection to detect anomalies in the network traffic. As cyber attacks may occur on any laye...

Pierce instability and bifurcating equilibria

International Nuclear Information System (INIS)

Godfrey, B.B.

1981-01-01

The report investigates the connection between equilibrium bifurcations and occurrence of the Pierce instability. Electrons flowing from one ground plane to a second through an ion background possess a countable infinity of static equilibria, of which only one is uniform and force-free. Degeneracy of the uniform and simplest non-uniform equilibria at a certain ground plan separation marks the onset of the Pierce instability, based on a newly derived dispersion relation appropriate to all the equilibria. For large ground plane separations the uniform equilibrium is unstable and the non-uniform equilibrium is stable, the reverse of their stability properties at small separations. Onset of the Pierce instability at the first bifurcation of equilibria persists in more complicated geometries, providing a general criterion for marginal stability. It seems probable that bifurcation analysis can be a useful tool in the overall study of stable beam generation in diodes and transport in finite cavities

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

Traffic Command Gesture Recognition for Virtual Urban Scenes Based on a Spatiotemporal Convolution Neural Network

Directory of Open Access Journals (Sweden)

Chunyong Ma

2018-01-01

Full Text Available Intelligent recognition of traffic police command gestures increases authenticity and interactivity in virtual urban scenes. To actualize real-time traffic gesture recognition, a novel spatiotemporal convolution neural network (ST-CNN model is presented. We utilized Kinect 2.0 to construct a traffic police command gesture skeleton (TPCGS dataset collected from 10 volunteers. Subsequently, convolution operations on the locational change of each skeletal point were performed to extract temporal features, analyze the relative positions of skeletal points, and extract spatial features. After temporal and spatial features based on the three-dimensional positional information of traffic police skeleton points were extracted, the ST-CNN model classified positional information into eight types of Chinese traffic police gestures. The test accuracy of the ST-CNN model was 96.67%. In addition, a virtual urban traffic scene in which real-time command tests were carried out was set up, and a real-time test accuracy rate of 93.0% was achieved. The proposed ST-CNN model ensured a high level of accuracy and robustness. The ST-CNN model recognized traffic command gestures, and such recognition was found to control vehicles in virtual traffic environments, which enriches the interactive mode of the virtual city scene. Traffic command gesture recognition contributes to smart city construction.

Modelling of H.264 MPEG2 TS Traffic Source

Directory of Open Access Journals (Sweden)

Stanislav Klucik

2013-01-01

Full Text Available This paper deals with IPTV traffic source modelling. Traffic sources are used for simulation, emulation and real network testing. This model is made as a derivation of known recorded traffic sources that are analysed and statistically processed. As the results show the proposed model causes in comparison to the known traffic source very similar network traffic parameters when used in a simulated network.

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.

Performance Evaluation of IEEE 802.11ah Networks With High-Throughput Bidirectional Traffic.

Science.gov (United States)

Šljivo, Amina; Kerkhove, Dwight; Tian, Le; Famaey, Jeroen; Munteanu, Adrian; Moerman, Ingrid; Hoebeke, Jeroen; De Poorter, Eli

2018-01-23

So far, existing sub-GHz wireless communication technologies focused on low-bandwidth, long-range communication with large numbers of constrained devices. Although these characteristics are fine for many Internet of Things (IoT) applications, more demanding application requirements could not be met and legacy Internet technologies such as Transmission Control Protocol/Internet Protocol (TCP/IP) could not be used. This has changed with the advent of the new IEEE 802.11ah Wi-Fi standard, which is much more suitable for reliable bidirectional communication and high-throughput applications over a wide area (up to 1 km). The standard offers great possibilities for network performance optimization through a number of physical- and link-layer configurable features. However, given that the optimal configuration parameters depend on traffic patterns, the standard does not dictate how to determine them. Such a large number of configuration options can lead to sub-optimal or even incorrect configurations. Therefore, we investigated how two key mechanisms, Restricted Access Window (RAW) grouping and Traffic Indication Map (TIM) segmentation, influence scalability, throughput, latency and energy efficiency in the presence of bidirectional TCP/IP traffic. We considered both high-throughput video streaming traffic and large-scale reliable sensing traffic and investigated TCP behavior in both scenarios when the link layer introduces long delays. This article presents the relations between attainable throughput per station and attainable number of stations, as well as the influence of RAW, TIM and TCP parameters on both. We found that up to 20 continuously streaming IP-cameras can be reliably connected via IEEE 802.11ah with a maximum average data rate of 160 kbps, whereas 10 IP-cameras can achieve average data rates of up to 255 kbps over 200 m. Up to 6960 stations transmitting every 60 s can be connected over 1 km with no lost packets. The presented results enable the fine tuning

Green provisioning of the traffic partition grooming in robust, reconfigurable and heterogeneous optical networks

Science.gov (United States)

Hou, Weigang; Yu, Yao; Song, Qingyang; Gong, Xiaoxue

2013-01-01

In recent years, various high-speed network architectures have been widespread deployed. Dense Wavelength Division Multiplexing (DWDM) has gained favor as a terabit solution. The optical circuit switching has also been provided for "sub-rate" aggregation. Such that, the granular types of demands tend to be diverse and must be evaluated. However, current dedicated optical networks do not offer sufficient flexibility to satisfy the requirements of demands with such wide range of granularities. The traffic grooming becomes a power-efficient one only when it does not utilize the aggregation of Coarse-Granularity (CG) demands. The waveband switching merely provides port-cost-effective connections for CG demands regardless of fine-granularity ones. Consequently, in this paper, we devise a heterogeneous grooming method called traffic partition grooming. It combines the power efficiency advantage of the traffic grooming under fine-granularity environment and the port savings advantage of the waveband switching under coarse-granularity environment to provide green provisioning. In addition, the optical virtual topology self-reconfigures along with various optimization objectives variation and has the robustness to determine the pre-unknown information. This paper is also the first work on investigating the issue of Robust, Reconfigurable and Heterogeneous Optical Networking (R2HON). The effective green provisioning and OPEX savings of our R2HON have been demonstrated by numerical simulations.

Axisymmetric ideal magnetohydrodynamic equilibria with incompressible flows

International Nuclear Information System (INIS)

Tasso, H.; Throumoulopoulos, G.N.

1997-12-01

It is shown that the ideal MHD equilibrium states of an axisymmetric plasma with incompressible flows are governed by an elliptic partial differential equation for the poloidal magnetic flux function ψ containing five surface quantities along with a relation for the pressure. Exact equilibria are constructed including those with non vanishing poloidal and toroidal flows and differentially varying radial electric fields. Unlike the case in cylindrical incompressible equilibria with isothermal magnetic surfaces which should have necessarily circular cross sections [G. N. Throumoulopoulos and H. Tasso, Phys. Plasmas 4, 1492 (1997)], no restriction appears on the shapes of the magnetic surfaces in the corresponding axisymmetric equilibria. The latter equilibria satisfy a set of six ordinary differential equations which for flows parallel to the magnetic field B can be solved semianalytically. In addition, it is proved the non existence of incompressible axisymmetric equilibria with (a) purely poloidal flows and (b) non-parallel flows with isothermal magnetic surfaces and vertical stroke B vertical stroke = vertical stroke B vertical stroke (ψ) (omnigenous equilibria). (orig.)

The Impact of Traffic Prioritization on Deep Space Network Mission Traffic

Science.gov (United States)

Jennings, Esther; Segui, John; Gao, Jay; Clare, Loren; Abraham, Douglas

2011-01-01

A select number of missions supported by NASA's Deep Space Network (DSN) are demanding very high data rates. For example, the Kepler Mission was launched March 7, 2009 and at that time required the highest data rate of any NASA mission, with maximum rates of 4.33 Mb/s being provided via Ka band downlinks. The James Webb Space Telescope will require a maximum 28 Mb/s science downlink data rate also using Ka band links; as of this writing the launch is scheduled for a June 2014 launch. The Lunar Reconnaissance Orbiter, launched June 18, 2009, has demonstrated data rates at 100 Mb/s at lunar-Earth distances using NASA's Near Earth Network (NEN) and K-band. As further advances are made in high data rate space telecommunications, particularly with emerging optical systems, it is expected that large surges in demand on the supporting ground systems will ensue. A performance analysis of the impact of high variance in demand has been conducted using our Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE) simulation tool. A comparison is made regarding the incorporation of Quality of Service (QoS) mechanisms and the resulting ground-to-ground Wide Area Network (WAN) bandwidth necessary to meet latency requirements across different user missions. It is shown that substantial reduction in WAN bandwidth may be realized through QoS techniques when low data rate users with low-latency needs are mixed with high data rate users having delay-tolerant traffic.

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.

Implementation of a FPGA-Based Feature Detection and Networking System for Real-time Traffic Monitoring

OpenAIRE

Chen, Jieshi; Schafer, Benjamin Carrion; Ho, Ivan Wang-Hei

2016-01-01

With the growing demand of real-time traffic monitoring nowadays, software-based image processing can hardly meet the real-time data processing requirement due to the serial data processing nature. In this paper, the implementation of a hardware-based feature detection and networking system prototype for real-time traffic monitoring as well as data transmission is presented. The hardware architecture of the proposed system is mainly composed of three parts: data collection, feature detection,...

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

Multivariate correlation analysis technique based on euclidean distance map for network traffic characterization

NARCIS (Netherlands)

Tan, Zhiyuan; Jamdagni, Aruna; He, Xiangjian; Nanda, Priyadarsi; Liu, Ren Ping; Qing, Sihan; Susilo, Willy; Wang, Guilin; Liu, Dongmei

2011-01-01

The quality of feature has significant impact on the performance of detection techniques used for Denial-of-Service (DoS) attack. The features that fail to provide accurate characterization for network traffic records make the techniques suffer from low accuracy in detection. Although researches

Multiple equilibria of divertor plasmas

International Nuclear Information System (INIS)

Vu, H.X.; Prinja, A.K.

1993-01-01

A one-dimensional, two-fluid transport model with a temperature-dependent neutral recycling coefficient is shown to give rise to multiple equilibria of divertor plasmas (bifurcation). Numerical techniques for obtaining these multiple equilibria and for examining their stability are presented. Although these numerical techniques have been well known to the scientific community, this is the first time they have been applied to divertor plasma modeling to show the existence of multiple equilibria as well as the stability of these solutions. Numerical and approximate analytical solutions of the present one-dimensional transport model both indicate that there exists three steady-state solutions corresponding to (1) a high-temperature, low-density equilibrium, (2) a low-temperature, high-density equilibrium, and (3) an intermediate-temperature equilibrium. While both the low-temperature and the high-temperature equilibria are stable, with respect to small perturbations in the plasma conditions, the intermediate-temperature equilibrium is physically unstable, i.e., any small perturbation about this equilibrium will cause a transition toward either the high-temperature or low-temperature equilibrium

Ontology-Based Architecture for Intelligent Transportation Systems Using a Traffic Sensor Network

Directory of Open Access Journals (Sweden)

Susel Fernandez

2016-08-01

Full Text Available Intelligent transportation systems are a set of technological solutions used to improve the performance and safety of road transportation. A crucial element for the success of these systems is the exchange of information, not only between vehicles, but also among other components in the road infrastructure through different applications. One of the most important information sources in this kind of systems is sensors. Sensors can be within vehicles or as part of the infrastructure, such as bridges, roads or traffic signs. Sensors can provide information related to weather conditions and traffic situation, which is useful to improve the driving process. To facilitate the exchange of information between the different applications that use sensor data, a common framework of knowledge is needed to allow interoperability. In this paper an ontology-driven architecture to improve the driving environment through a traffic sensor network is proposed. The system performs different tasks automatically to increase driver safety and comfort using the information provided by the sensors.

Pattern Recognition and Classification of Fatal Traffic Accidents in Israel A Neural Network Approach

DEFF Research Database (Denmark)

Prato, Carlo Giacomo; Gitelman, Victoria; Bekhor, Shlomo

2011-01-01

on 1,793 fatal traffic accidents occurred during the period between 2003 and 2006 and applies Kohonen and feed-forward back-propagation neural networks with the objective of extracting from the data typical patterns and relevant factors. Kohonen neural networks reveal five compelling accident patterns....... Feed-forward back-propagation neural networks indicate that sociodemographic characteristics of drivers and victims, accident location, and period of the day are extremely relevant factors. Accident patterns suggest that countermeasures are necessary for identified problems concerning mainly vulnerable...

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.

Monitor Network Traffic with Packet Capture (pcap) on an Android Device

Science.gov (United States)

2015-09-01

administrative privileges . Under the current design Android development requirement, an Android Graphical User Interface (GUI) application cannot directly...build an Android application to monitor network traffic using open source packet capture (pcap) libraries. 15. SUBJECT TERMS ELIDe, Android , pcap 16...Building Application with Native Codes 5 8.1 Calling Native Codes Using JNI 5 8.2 Calling Native Codes from an Android Application 8 9. Retrieve Live

Testing Application (End-to-End Performance of Networks With EFT Traffic

Directory of Open Access Journals (Sweden)

Vlatko Lipovac

2009-01-01

Full Text Available This paper studies how end-to-end application peiformance(of Electronic Financial Transaction traffic, in particulardepends on the actual protocol stacks, operating systemsand network transmission rates. With this respect, the respectivesimulation tests of peiformance of TCP and UDP protocolsrunning on various operating systems, ranging from Windows,Sun Solmis, to Linux have been implemented, and thedifferences in peiformance addressed focusing on throughputand response time.

A Two-Stage Fuzzy Logic Control Method of Traffic Signal Based on Traffic Urgency Degree

OpenAIRE

Yan Ge

2014-01-01

City intersection traffic signal control is an important method to improve the efficiency of road network and alleviate traffic congestion. This paper researches traffic signal fuzzy control method on a single intersection. A two-stage traffic signal control method based on traffic urgency degree is proposed according to two-stage fuzzy inference on single intersection. At the first stage, calculate traffic urgency degree for all red phases using traffic urgency evaluation module and select t...

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...

Stability and attraction domains of traffic equilibria in a day-to-day dynamical system formulation.

NARCIS (Netherlands)

Bie, Jing; Lo, Hong K.

2010-01-01

We formulate the traffic assignment problem from a dynamical system approach. All exogenous factors are considered to be constant over time and user equilibrium is being pursued through a day-to-day adjustment process. The traffic dynamics is represented by a recurrence function, which governs the

Real time network traffic monitoring for wireless local area networks based on compressed sensing

Science.gov (United States)

Balouchestani, Mohammadreza

2017-05-01

A wireless local area network (WLAN) is an important type of wireless networks which connotes different wireless nodes in a local area network. WLANs suffer from important problems such as network load balancing, large amount of energy, and load of sampling. This paper presents a new networking traffic approach based on Compressed Sensing (CS) for improving the quality of WLANs. The proposed architecture allows reducing Data Delay Probability (DDP) to 15%, which is a good record for WLANs. The proposed architecture is increased Data Throughput (DT) to 22 % and Signal to Noise (S/N) ratio to 17 %, which provide a good background for establishing high qualified local area networks. This architecture enables continuous data acquisition and compression of WLAN's signals that are suitable for a variety of other wireless networking applications. At the transmitter side of each wireless node, an analog-CS framework is applied at the sensing step before analog to digital converter in order to generate the compressed version of the input signal. At the receiver side of wireless node, a reconstruction algorithm is applied in order to reconstruct the original signals from the compressed signals with high probability and enough accuracy. The proposed algorithm out-performs existing algorithms by achieving a good level of Quality of Service (QoS). This ability allows reducing 15 % of Bit Error Rate (BER) at each wireless node.

Analysis of Roadway Traffic Accidents Based on Rough Sets and Bayesian Networks

Directory of Open Access Journals (Sweden)

Xiaoxia Xiong

2018-02-01

Full Text Available The paper integrates Rough Sets (RS and Bayesian Networks (BN for roadway traffic accident analysis. RS reduction of attributes is first employed to generate the key set of attributes affecting accident outcomes, which are then fed into a BN structure as nodes for BN construction and accident outcome classification. Such RS-based BN framework combines the advantages of RS in knowledge reduction capability and BN in describing interrelationships among different attributes. The framework is demonstrated using the 100-car naturalistic driving data from Virginia Tech Transportation Institute to predict accident type. Comparative evaluation with the baseline BNs shows the RS-based BNs generally have a higher prediction accuracy and lower network complexity while with comparable prediction coverage and receiver operating characteristic curve area, proving that the proposed RS-based BN overall outperforms the BNs with/without traditional feature selection approaches. The proposed RS-based BN indicates the most significant attributes that affect accident types include pre-crash manoeuvre, driver’s attention from forward roadway to centre mirror, number of secondary tasks undertaken, traffic density, and relation to junction, most of which feature pre-crash driver states and driver behaviours that have not been extensively researched in literature, and could give further insight into the nature of traffic accidents.

Design Issues for Traffic Management for the ATM UBR + Service for TCP Over Satellite Networks

Science.gov (United States)

Jain, Raj

1999-01-01

This project was a comprehensive research program for developing techniques for improving the performance of Internet protocols over Asynchronous Transfer Mode (ATM) based satellite networks. Among the service categories provided by ATM networks, the most commonly used category for data traffic is the unspecified bit rate (UBR) service. UBR allows sources to send data into the network without any feedback control. The project resulted in the numerous ATM Forum contributions and papers.

A Unified Monitoring Framework for Energy Consumption and Network Traffic

Directory of Open Access Journals (Sweden)

Florentin Clouet

2015-08-01

Full Text Available Providing experimenters with deep insight about the effects of their experiments is a central feature of testbeds. In this paper, we describe Kwapi, a framework designed in the context of the Grid'5000 testbed, that unifies measurements for both energy consumption and network traffic. Because all measurements are taken at the infrastructure level (using sensors in power and network equipment, using this framework has no dependencies on the experiments themselves. Initially designed for OpenStack infrastructures, the Kwapi framework allows monitoring and reporting of energy consumption of distributed platforms. In this article, we present the extension of Kwapi to network monitoring, and outline how we overcame several challenges: scaling to a testbed the size of Grid'5000 while still providing high-frequency measurements; providing long-term loss-less storage of measurements; handling operational issues when deploying such a tool on a real infrastructure.

Oscillations and Multiple Equilibria in Microvascular Blood Flow.

Science.gov (United States)

Karst, Nathaniel J; Storey, Brian D; Geddes, John B

2015-07-01

We investigate the existence of oscillatory dynamics and multiple steady-state flow rates in a network with a simple topology and in vivo microvascular blood flow constitutive laws. Unlike many previous analytic studies, we employ the most biologically relevant models of the physical properties of whole blood. Through a combination of analytic and numeric techniques, we predict in a series of two-parameter bifurcation diagrams a range of dynamical behaviors, including multiple equilibria flow configurations, simple oscillations in volumetric flow rate, and multiple coexistent limit cycles at physically realizable parameters. We show that complexity in network topology is not necessary for complex behaviors to arise and that nonlinear rheology, in particular the plasma skimming effect, is sufficient to support oscillatory dynamics similar to those observed in vivo.

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.

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,...

Phase equilibria basic principles, applications, experimental techniques

CERN Document Server

Reisman, Arnold

2013-01-01

Phase Equilibria: Basic Principles, Applications, Experimental Techniques presents an analytical treatment in the study of the theories and principles of phase equilibria. The book is organized to afford a deep and thorough understanding of such subjects as the method of species model systems; condensed phase-vapor phase equilibria and vapor transport reactions; zone refining techniques; and nonstoichiometry. Physicists, physical chemists, engineers, and materials scientists will find the book a good reference material.

VBR video traffic models

CERN Document Server

Tanwir, Savera

2014-01-01

There has been a phenomenal growth in video applications over the past few years. An accurate traffic model of Variable Bit Rate (VBR) video is necessary for performance evaluation of a network design and for generating synthetic traffic that can be used for benchmarking a network. A large number of models for VBR video traffic have been proposed in the literature for different types of video in the past 20 years. Here, the authors have classified and surveyed these models and have also evaluated the models for H.264 AVC and MVC encoded video and discussed their findings.

Traffic intensity monitoring using multiple object detection with traffic surveillance cameras

Science.gov (United States)

Hamdan, H. G. Muhammad; Khalifah, O. O.

2017-11-01

Object detection and tracking is a field of research that has many applications in the current generation with increasing number of cameras on the streets and lower cost for Internet of Things(IoT). In this paper, a traffic intensity monitoring system is implemented based on the Macroscopic Urban Traffic model is proposed using computer vision as its source. The input of this program is extracted from a traffic surveillance camera which has another program running a neural network classification which can identify and differentiate the vehicle type is implanted. The neural network toolbox is trained with positive and negative input to increase accuracy. The accuracy of the program is compared to other related works done and the trends of the traffic intensity from a road is also calculated. relevant articles in literature searches, great care should be taken in constructing both. Lastly the limitation and the future work is concluded.

Neoclassical MHD equilibria with ohmic current

International Nuclear Information System (INIS)

Tokuda, Shinji; Takeda, Tatsuoki; Okamoto, Masao.

1989-01-01

MHD equilibria of tokamak plasmas with neoclassical current effects (neoclassical conductivity and bootstrap current) were calculated self-consistently. Neoclassical effects on JFT-2M tokamak plasmas, sustained by ohmic currents, were studied. Bootstrap currents flow little for L-mode type equilibria because of low attainable values of poloidal beta, β J . H-mode type equilibria give bootstrap currents of 30% ohmic currents for β J attained by JFT-2M and 100% for β J ≥ 1.5, both of which are sufficient to change the current profiles and the resultant MHD equilibria. Neoclassical conductivity which has roughly half value of the classical Spitzer conductivity brings peaked ohmic current profiles to yield low safety factor at the magnetic axis. Neoclassical conductivity reduces the value of effective Z(Z eff ) which is necessary to give the observed one-turn voltage but it needs impurities accumulating at the center when such peaked current profiles are not observed. (author)

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...

Energy-minimized design in all-optical networks using unicast/multicast traffic grooming

Science.gov (United States)

Puche, William S.; Amaya, Ferney O.; Sierra, Javier E.

2013-09-01

The increased bandwidth required by applications, tends to raise the amount of optical equipment, for this reason, it is essential to maintain a balance between the wavelength allocation, available capacity and number of optical devices to achieve the lowest power consumption. You could say that we propose a model that minimizes energy consumption, using unicast / multicast traffic grooming in optical networks.

A Traffic Restriction Scheme for Enhancing Carpooling

Directory of Open Access Journals (Sweden)

Dong Ding

2017-01-01

Full Text Available For the purpose of alleviating traffic congestion, this paper proposes a scheme to encourage travelers to carpool by traffic restriction. By a variational inequity we describe travelers’ mode (solo driving and carpooling and route choice under user equilibrium principle in the context of fixed demand and detect the performance of a simple network with various restriction links, restriction proportions, and carpooling costs. Then the optimal traffic restriction scheme aiming at minimal total travel cost is designed through a bilevel program and applied to a Sioux Fall network example with genetic algorithm. According to various requirements, optimal restriction regions and proportions for restricted automobiles are captured. From the results it is found that traffic restriction scheme is possible to enhance carpooling and alleviate congestion. However, higher carpooling demand is not always helpful to the whole network. The topology of network, OD demand, and carpooling cost are included in the factors influencing the performance of the traffic system.

Learning to Play Efficient Coarse Correlated Equilibria

KAUST Repository

Borowski, Holly P.; Marden, Jason R.; Shamma, Jeff S.

2018-01-01

The majority of the distributed learning literature focuses on convergence to Nash equilibria. Coarse correlated equilibria, on the other hand, can often characterize more efficient collective behavior than even the best Nash equilibrium. However

Supervised learning from human performance at the computationally hard problem of optimal traffic signal control on a network of junctions.

Science.gov (United States)

Box, Simon

2014-12-01

Optimal switching of traffic lights on a network of junctions is a computationally intractable problem. In this research, road traffic networks containing signallized junctions are simulated. A computer game interface is used to enable a human 'player' to control the traffic light settings on the junctions within the simulation. A supervised learning approach, based on simple neural network classifiers can be used to capture human player's strategies in the game and thus develop a human-trained machine control (HuTMaC) system that approaches human levels of performance. Experiments conducted within the simulation compare the performance of HuTMaC to two well-established traffic-responsive control systems that are widely deployed in the developed world and also to a temporal difference learning-based control method. In all experiments, HuTMaC outperforms the other control methods in terms of average delay and variance over delay. The conclusion is that these results add weight to the suggestion that HuTMaC may be a viable alternative, or supplemental method, to approximate optimization for some practical engineering control problems where the optimal strategy is computationally intractable.

A cost-effective traffic data collection system based on the iDEN mobile telecommunication network.

Science.gov (United States)

2008-10-01

This report describes a cost-effective data collection system for Caltrans 170 traffic signal : controller. The data collection system is based on TCP/IP communication over existing : low-cost mobile communication networks and Motorola iDEN1 mobile...

Multistability in bidirectional associative memory neural networks

International Nuclear Information System (INIS)

Huang Gan; Cao Jinde

2008-01-01

In this Letter, the multistability issue is studied for Bidirectional Associative Memory (BAM) neural networks. Based on the existence and stability analysis of the neural networks with or without delay, it is found that the 2n-dimensional networks can have 3 n equilibria and 2 n equilibria of them are locally exponentially stable, where each layer of the BAM network has n neurons. Furthermore, the results has been extended to (n+m)-dimensional BAM neural networks, where there are n and m neurons on the two layers respectively. Finally, two numerical examples are presented to illustrate the validity of our results

Multistability in bidirectional associative memory neural networks

Science.gov (United States)

Huang, Gan; Cao, Jinde

2008-04-01

In this Letter, the multistability issue is studied for Bidirectional Associative Memory (BAM) neural networks. Based on the existence and stability analysis of the neural networks with or without delay, it is found that the 2 n-dimensional networks can have 3 equilibria and 2 equilibria of them are locally exponentially stable, where each layer of the BAM network has n neurons. Furthermore, the results has been extended to (n+m)-dimensional BAM neural networks, where there are n and m neurons on the two layers respectively. Finally, two numerical examples are presented to illustrate the validity of our results.

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

Learning to Play Efficient Coarse Correlated Equilibria

KAUST Repository

Borowski, Holly P.

2018-03-10

The majority of the distributed learning literature focuses on convergence to Nash equilibria. Coarse correlated equilibria, on the other hand, can often characterize more efficient collective behavior than even the best Nash equilibrium. However, there are no existing distributed learning algorithms that converge to specific coarse correlated equilibria. In this paper, we provide one such algorithm, which guarantees that the agents’ collective joint strategy will constitute an efficient coarse correlated equilibrium with high probability. The key to attaining efficient correlated behavior through distributed learning involves incorporating a common random signal into the learning environment.

Ternary equilibria in bismuth--indium--lead alloys

International Nuclear Information System (INIS)

Liao, K.C.; Johnson, D.L.; Nelson, R.C.

1975-01-01

The liquidus surface is characterized by three binary equilibria. One binary extends from the Pb--Bi peritectic to the Pb--In peritectic. The other two extend from In--Bi eutectics, merge at 50 at. percent Bi and 30 at. percent Pb, and end at the Bi--Pb eutectic. Based on analysis of ternary liquidus contours and vertical sections, it is suggested that solidification for high lead and very high indium alloys occurs from two-phase equilibria. Solidification from all other alloys occurs from three-phase equilibria. Four-phase solidification does not occur in this system

Multiple Equilibria in Noisy Rational Expectations Economies

DEFF Research Database (Denmark)

Pálvölgyi, Dömötör; Venter, Gyuri

with a continuous price function. However, we also construct a tractable class of equilibria with discontinuous prices that have very different economic implications, including (i) jumps and crashes, (ii) significant revisions in uninformed belief due to small changes in the market price, (iii) “upward......-sloping” demand curves, (iv) higher prices leading to future returns that are higher in expectation (price drift) and (v) more positively skewed. Discontinuous equilibria can be arbitrarily close to being fully-revealing. Finally, discontinuous equilibria with the same construction also exist in Hellwig (1980)....

High-pressure fluid-phase equilibria: Experimental methods and systems investigated (2000-2004)

DEFF Research Database (Denmark)

Dohrn, Ralf; Peper, Stephanie; Fonseca, José

2010-01-01

As a part of a series of reviews, a compilation of systems for which high-pressure phase-equilibrium data were published between 2000 and 2004 is given. Vapor-liquid equilibria, liquid-liquid equilibria, vapor-liquid-liquid equilibria,solid-liquid equilibria, solid-vapor equilibria, solid-vapor-l...

Stability of relative equilibria of three vortices

DEFF Research Database (Denmark)

Aref, Hassan

2009-01-01

Three point vortices on the unbounded plane have relative equilibria wherein the vortices either form an equilateral triangle or are collinear. While the stability analysis of the equilateral triangle configurations is straightforward, that of the collinear relative equilibria is considerably mor...

Adaptive traffic signal control with actor-critic methods in a real-world traffic network with different traffic disruption events

NARCIS (Netherlands)

Aslani, Mohammad; Mesgari, Mohammad Saadi; Wiering, Marco

2017-01-01

The transportation demand is rapidly growing in metropolises, resulting in chronic traffic con-gestions in dense downtown areas. Adaptive traffic signal control as the principle part of in-telligent transportation systems has a primary role to effectively reduce traffic congestion by making a

Downlink Performance of a Multi-Carrier MIMO System in a Bursty Traffic Cellular Network

DEFF Research Database (Denmark)

Nguyen, Hung Tuan; Kovacs, Istvan; Wang, Yuanye

2011-01-01

In this paper we analyse the downlink performance of a rank adaptive multiple input multiple output (MIMO) system in a busty traffic cellular network. A LTE-Advanced system with multiple component carriers was selected as a study case. To highlight the advantage of using MIMO techniques, we used ...

Efficient disk-to-disk copy through long-distance high-speed networks with background traffic

International Nuclear Information System (INIS)

Tanida, Naoki; Hiraki, Kei; Inaba, Mary

2010-01-01

We propose 'ICDC - InterContinental Disk Copy', a data sharing facility between distant places. ICDC aims to transfer huge amount of data files easily on Long Fat-pipe Networks with some background traffic. ICDC consists of commodity PCs and Solid State Drives and we apply Inter Packet Gap tuning technique to it. Using 'ICDC-1 Gbps model', we transferred data between Tokyo and Cadarache via New York. We attained about 860 Mbps, i.e., 86% usage of the network bottleneck bandwidth.

STUDY ON SUPPORTING FOR DRAWING UP THE BCP FOR URBAN EXPRESSWAY NETWORK USING BY TRAFFIC SIMULATION SYSTEM

Science.gov (United States)

Yamawaki, Masashi; Shiraki, Wataru; Inomo, Hitoshi; Yasuda, Keiichi

The urban expressway network is an important infrastructure to execute a disaster restoration. Therefore, it is necessary to draw up the BCP (Business Continuity Plan) to enable securing of road user's safety and restoration of facilities, etc. It is important that each urban expressway manager execute decision and improvement of effective BCP countermeasures when disaster occurs by assuming various disaster situations. Then, in this study, we develop the traffic simulation system that can reproduce various disaster situations and traffic actions, and examine some methods supporting for drawing up the BCP for an urban expressway network. For disaster outside assumption such as tsunami generated by a huge earthquake, we examine some approaches securing safety of users and cars on the Hanshin Expressway Network as well as on general roads. And, we aim to propose a tsunami countermeasure not considered in the current urban expressway BCP.

Exploiting Spatial Abstraction in Predictive Analytics of Vehicle Traffic

Directory of Open Access Journals (Sweden)

Natalia Andrienko

2015-04-01

Full Text Available By applying visual analytics techniques to vehicle traffic data, we found a way to visualize and study the relationships between the traffic intensity and movement speed on links of a spatially abstracted transportation network. We observed that the traffic intensities and speeds in an abstracted network are interrelated in the same way as they are in a detailed street network at the level of street segments. We developed interactive visual interfaces that support representing these interdependencies by mathematical models. To test the possibility of utilizing them for performing traffic simulations on the basis of abstracted transportation networks, we devised a prototypical simulation algorithm employing these dependency models. The algorithm is embedded in an interactive visual environment for defining traffic scenarios, running simulations, and exploring their results. Our research demonstrates a principal possibility of performing traffic simulations on the basis of spatially abstracted transportation networks using dependency models derived from real traffic data. This possibility needs to be comprehensively investigated and tested in collaboration with transportation domain specialists.

An efficient strategy for enhancing traffic capacity by removing links in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chow, Tommy W S

2010-01-01

An efficient link-removal strategy, called the variance-of-neighbor-degree-reduction (VNDR) strategy, for enhancing the traffic capacity of scale-free networks is proposed in this paper. The VNDR strategy, which considers the important role of hub nodes, balances the amounts of packets routed from each node to the node's neighbors. Compared against the outcomes of strategies that remove links among hub nodes, our results show that the traffic capacity can be greatly enhanced, especially under the shortest path routing strategy. It is also found that the average transport time is effectively reduced by using the VNDR strategy only under the shortest path routing strategy

Reliable Path Selection Problem in Uncertain Traffic Network after Natural Disaster

Directory of Open Access Journals (Sweden)

Jing Wang

2013-01-01

Full Text Available After natural disaster, especially for large-scale disasters and affected areas, vast relief materials are often needed. In the meantime, the traffic networks are always of uncertainty because of the disaster. In this paper, we assume that the edges in the network are either connected or blocked, and the connection probability of each edge is known. In order to ensure the arrival of these supplies at the affected areas, it is important to select a reliable path. A reliable path selection model is formulated, and two algorithms for solving this model are presented. Then, adjustable reliable path selection model is proposed when the edge of the selected reliable path is broken. And the corresponding algorithms are shown to be efficient both theoretically and numerically.

Existence of pareto equilibria for multiobjective games without compactness

OpenAIRE

Shiraishi, Yuya; Kuroiwa, Daishi

2013-01-01

In this paper, we investigate the existence of Pareto and weak Pareto equilibria for multiobjective games without compactness. By employing an existence theorem of Pareto equilibria due to Yu and Yuan([10]), several existence theorems of Pareto and weak Pareto equilibria for the multiobjective games are established in a similar way to Flores-B´azan.

Computing Nash equilibria through computational intelligence methods

Science.gov (United States)

Pavlidis, N. G.; Parsopoulos, K. E.; Vrahatis, M. N.

2005-03-01

Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, to compute Nash equilibria of finite strategic games, as global minima of a real-valued, nonnegative function. An issue of particular interest is to detect more than one Nash equilibria of a game. The performance of the considered computational intelligence methods on this problem is investigated using multistart and deflection.

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.

Large graph visualization of millions of connections in the CERN control system network traffic: analysis and design of routing and firewall rules with a new approach

CERN Document Server

Gallerani, Luigi

2015-01-01

Abstract The CERN Technical Network (TN) TN was intended to be a network for accelerator and infrastructure operations. However, today, more than 60 million IP packets are routed every hour between the General Purpose Network (GPN) and the TN, involving more than 6000 different hosts. In order to improve the security of the accelerator control system, it is fundamental to understand the network traffic between the two networks and to define new appropriate routing and firewall rules without impacting operations. The complexity and huge size of the infrastructure and the number of protocols and services involved, have discouraged for years any attempt to understand and control the network traffic between the GPN and the TN. In this paper, we show a new way to solve the problem graphically. Combining the network traffic analysis with the use of large graph visualization algorithms we produced usable 2D large color topology maps of the network identifying the inter-relations of the control system machines and s...

Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games

Directory of Open Access Journals (Sweden)

Patricia Bouyer

2016-09-01

Full Text Available We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need not exist when players are given arbitrary terminal-reward objectives, and their existence is undecidable with qualitative reachability objectives (and only three players. However, these results rely on the fact that the players can enforce infinite plays while trying to improve their payoffs. In this paper, we introduce a relaxed notion of equilibria, where deviations are imprecise. We prove that contrary to Nash equilibria, such (stationary equilibria always exist, and we develop a PSPACE algorithm to compute one.

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

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.

Millifluidics as a simple tool to optimize droplet networks: Case study on drop traffic in a bifurcated loop

Science.gov (United States)

Wang, William S.; Vanapalli, Siva A.

2014-01-01

We report that modular millifluidic networks are simpler, more cost-effective alternatives to traditional microfluidic networks, and they can be rapidly generated and altered to optimize designs. Droplet traffic can also be studied more conveniently and inexpensively at the millimeter scale, as droplets are readily visible to the naked eye. Bifurcated loops, ladder networks, and parking networks were made using only Tygon® tubing and plastic T-junction fittings and visualized using an iPod® camera. As a case study, droplet traffic experiments through a millifluidic bifurcated loop were conducted, and the periodicity of drop spacing at the outlet was mapped over a wide range of inlet drop spacing. We observed periodic, intermittent, and aperiodic behaviors depending on the inlet drop spacing. The experimentally observed periodic behaviors were in good agreement with numerical simulations based on the simple network model. Our experiments further identified three main sources of intermittency between different periodic and/or aperiodic behaviors: (1) simultaneous entering and exiting events, (2) channel defects, and (3) equal or nearly equal hydrodynamic resistances in both sides of the bifurcated loop. In cases of simultaneous events and/or channel defects, the range of input spacings where intermittent behaviors are observed depends on the degree of inherent variation in input spacing. Finally, using a time scale analysis of syringe pump fluctuations and experiment observation times, we find that in most cases, more consistent results can be generated in experiments conducted at the millimeter scale than those conducted at the micrometer scale. Thus, millifluidic networks offer a simple means to probe collective interactions due to drop traffic and optimize network geometry to engineer passive devices for biological and material analysis. PMID:25553188

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.

Busy hour traffic congestion analysis in mobile macrocells | Ozovehe ...

African Journals Online (AJOL)

In this work, real live traffic data from integrated GSM/GPRS network was used for traffic congestion analysis. The analysis was carried out on 10 congesting cells using network management system (NMS) statistics data span for three years period. Correlation test showed that traffic channel (TCH) congestion depend only ...

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.

Noxious substances in the air - traffic planning measures - traffic of the future

Energy Technology Data Exchange (ETDEWEB)

Koestenberger, H

1985-01-01

Necessary bundle of measures: Extension of public transport and restriction of individual traffic, extension and activation of large main roads (by-passes) to unload inhabited areas, building garages, creation of residential streets, pedestrian precincts and cycle paths. The best possible traffic system can only be achieved if all means of transport are used efficiently. It is the duty of traffic planners to develop an overall traffic system with the aims of benefiting the whole community. Due to wrong slowing down of traffic, the reduction of emitted quantities of noxious substances from private cars can be counteracted by general slowing down of traffic; frequent braking and restarting. The functional separation of residential areas for living, areas for working, supply, education and leisure pursuits which has been aimed at in recent decades must be slowly changed. This could reduce the traffic and mobility (mixed functions). The aims for traffic of the future are: suitability for the environment, economy, safety and capacity. In an integrated road network, the traffic must take over the correct purpose of traffic. (orig.).

The performance evaluation of a new neural network based traffic management scheme for a satellite communication network

Science.gov (United States)

Ansari, Nirwan; Liu, Dequan

1991-01-01

A neural-network-based traffic management scheme for a satellite communication network is described. The scheme consists of two levels of management. The front end of the scheme is a derivation of Kohonen's self-organization model to configure maps for the satellite communication network dynamically. The model consists of three stages. The first stage is the pattern recognition task, in which an exemplar map that best meets the current network requirements is selected. The second stage is the analysis of the discrepancy between the chosen exemplar map and the state of the network, and the adaptive modification of the chosen exemplar map to conform closely to the network requirement (input data pattern) by means of Kohonen's self-organization. On the basis of certain performance criteria, whether a new map is generated to replace the original chosen map is decided in the third stage. A state-dependent routing algorithm, which arranges the incoming call to some proper path, is used to make the network more efficient and to lower the call block rate. Simulation results demonstrate that the scheme, which combines self-organization and the state-dependent routing mechanism, provides better performance in terms of call block rate than schemes that only have either the self-organization mechanism or the routing mechanism.

Spatial correlation analysis of urban traffic state under a perspective of community detection

Science.gov (United States)

Yang, Yanfang; Cao, Jiandong; Qin, Yong; Jia, Limin; Dong, Honghui; Zhang, Aomuhan

2018-05-01

Understanding the spatial correlation of urban traffic state is essential for identifying the evolution patterns of urban traffic state. However, the distribution of traffic state always has characteristics of large spatial span and heterogeneity. This paper adapts the concept of community detection to the correlation network of urban traffic state and proposes a new perspective to identify the spatial correlation patterns of traffic state. In the proposed urban traffic 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 correlation of traffic state. Further, the process of community detection in the urban traffic network (named GWPA-K-means) is applied to analyze the spatial dependency of traffic state. The proposed method extends the traditional K-means algorithm in two steps: (i) redefines the initial cluster centers by two properties of nodes (the GWPA value and the minimum shortest path length); (ii) utilizes the weight signal propagation process to transfer the topological information of the urban traffic network into a node similarity matrix. Finally, numerical experiments are conducted on a simple network and a real urban road network in Beijing. The results show that GWPA-K-means algorithm is valid in spatial correlation analysis of traffic state. The network science and community structure analysis perform well in describing the spatial heterogeneity of traffic state on a large spatial scale.

Strong Nash Equilibria and the Potential Maimizer

NARCIS (Netherlands)

van Megen, F.J.C.; Facchini, G.; Borm, P.E.M.; Tijs, S.H.

1996-01-01

A class of non cooperative games characterized by a `congestion e ect' is studied, in which there exists a strong Nash equilibrium, and the set of Nash equilibria, the set of strong Nash equilibria and the set of strategy pro les maximizing the potential function coincide.The structure of the class

Deep Neural Network for Structural Prediction and Lane Detection in Traffic Scene.

Science.gov (United States)

Li, Jun; Mei, Xue; Prokhorov, Danil; Tao, Dacheng

2017-03-01

Hierarchical neural networks have been shown to be effective in learning representative image features and recognizing object classes. However, most existing networks combine the low/middle level cues for classification without accounting for any spatial structures. For applications such as understanding a scene, how the visual cues are spatially distributed in an image becomes essential for successful analysis. This paper extends the framework of deep neural networks by accounting for the structural cues in the visual signals. In particular, two kinds of neural networks have been proposed. First, we develop a multitask deep convolutional network, which simultaneously detects the presence of the target and the geometric attributes (location and orientation) of the target with respect to the region of interest. Second, a recurrent neuron layer is adopted for structured visual detection. The recurrent neurons can deal with the spatial distribution of visible cues belonging to an object whose shape or structure is difficult to explicitly define. Both the networks are demonstrated by the practical task of detecting lane boundaries in traffic scenes. The multitask convolutional neural network provides auxiliary geometric information to help the subsequent modeling of the given lane structures. The recurrent neural network automatically detects lane boundaries, including those areas containing no marks, without any explicit prior knowledge or secondary modeling.

POLLING AND DUAL-LEVEL TRAFFIC ANALYSIS FOR IMPROVED DOS DETECTION IN IEEE 802.21 NETWORKS

Directory of Open Access Journals (Sweden)

Nygil Alex Vadakkan

2014-06-01

Full Text Available The IEEE 802.21 standard was developed for communication of devices in a heterogeneous environment which included greater support for handoffs. This paper focuses on the denial of service (DoS vulnerabilities faced by such Media Independent Handover (MIH networks & various effective countermeasures that can be deployed to prevent their impact on such heterogeneous networks. The use of polling mechanism coupled with real time as well as offline traffic analysis can keep a good number of attacks at bay. The use of offline traffic analysis is to use the model and compare it with a lighter model and see if any of the excluded features in the lighter model have had suspicious variations which could be a varied form of DoS attack or an attack that is completely new. The countermeasures that have been developed also allows for the increase in efficiency of data transfer as well as higher rates of success in handoffs.

Towards Scalable Distributed Framework for Urban Congestion Traffic Patterns Warehousing

Directory of Open Access Journals (Sweden)

A. Boulmakoul

2015-01-01

Full Text Available We put forward architecture of a framework for integration of data from moving objects related to urban transportation network. Most of this research refers to the GPS outdoor geolocation technology and uses distributed cloud infrastructure with big data NoSQL database. A network of intelligent mobile sensors, distributed on urban network, produces congestion traffic patterns. Congestion predictions are based on extended simulation model. This model provides traffic indicators calculations, which fuse with the GPS data for allowing estimation of traffic states across the whole network. The discovery process of congestion patterns uses semantic trajectories metamodel given in our previous works. The challenge of the proposed solution is to store patterns of traffic, which aims to ensure the surveillance and intelligent real-time control network to reduce congestion and avoid its consequences. The fusion of real-time data from GPS-enabled smartphones integrated with those provided by existing traffic systems improves traffic congestion knowledge, as well as generating new information for a soft operational control and providing intelligent added value for transportation systems deployment.

Free-boundary perturbed MHD equilibria

International Nuclear Information System (INIS)

Nührenberg, C

2012-01-01

The concept of perturbed ideal MHD equilibria [Boozer A H and Nuhrenberg C 2006 Phys. Plasmas 13 102501] is employed to study the influence of external error-fields and of small plasma-pressure changes on toroidal plasma equilibria. In tokamak and stellarator free-boundary calculations, benchmarks were successful of the perturbed-equilibrium version of the CAS3D stability code [Nührenberg C et al. 2009 Phys. Rev. Lett. 102 235001] with the ideal MHD equilibrium code NEMEC [Hirshman S P et al. 1986 Comput. Phys. Commun. 43 143].

Surface current equilibria from a geometric point of view

International Nuclear Information System (INIS)

Kaiser, R.; Salat, A.

1993-04-01

This paper addresses the inverse problem of the existence of surface current MHD equilibria in toroidal geometry with vanishing magnetic field inside. Inverse means that the plasma-vacuum interface rather than the external wall or conductors are given and the latter remain to be determined. This makes a reformulation of the problem possible in geometric terms: What toroidal surfaces with analytic parameterization allow a simple analytic covering by geodesics? If such a covering by geodesics (field lines) exists, their orthogonal trajectories (current lines) also form a simple covering and are described by a function satisfying a nonlinear partial differential equation of the Hamilton-Jacobi type whose coefficients are combinations of the metric elements of the surface. All known equilibria - equilibria with zero and infinite rotational transform and the symmetric ones in the case of finite rotational transform - turn out to be solutions of separable cases of that equation and allow a unified description if the toroidal surface is parametrized in the moving trihedral associated with a closed curve. Analogously to volume current equilibria, the only continuous symmetries compatible with separability are plane, helical and axial symmetry. In the nonseparable case numerical evidence is presented for cases with chaotic behaviour of geodesics, thus restricting possible equilibria for these surfaces. For weak deviation from axisymmetry KAM-type behaviour is observed, i.e. destruction of geodesic coverings with a low rational rotational transform and preservation of those with irrational rotational transform. A previous attempt to establish three-dimensional surface current equilibria on the basis of the KAM theorem is rejected as incomplete, and a complete proof of the existence of equilibria in the weakly nonaxisymmetric case, based on the twist theorem for mappings, is given. Finally, for a certain class of strong deviations from axisymmetry an analytic criterion is

Value of Information for Optimal Adaptive Routing in Stochastic Time-Dependent Traffic Networks: Algorithms and Computational Tools

Science.gov (United States)

2010-10-25

Real-time information is important for travelers' routing decisions in uncertain networks by enabling online adaptation to revealed traffic conditions. Usually there are spatial and/or temporal limitations in traveler information. In this research, a...

Research on Congestion Pricing in Multimode Traffic considering Delay and Emission

Directory of Open Access Journals (Sweden)

Hongna Dai

2015-01-01

Full Text Available Rapid development of urbanization and automation has resulted in serious urban traffic congestion and air pollution problems in many Chinese cities recently. As a traffic demand management strategy, congestion pricing is acknowledged to be effective in alleviating the traffic congestion and improving the efficiency of traffic system. This paper proposes an urban traffic congestion pricing model based on the consideration of transportation network efficiency and environment effects. First, the congestion pricing problem under multimode (i.e., car mode and bus mode urban traffic network condition is investigated. Second, a traffic congestion pricing model based on bilevel programming is formulated for a dual-mode urban transportation network, in which the delay and emission of vehicles are considered. Third, an improved mathematical algorithm combining successive average method with the genetic algorithm is proposed to solve the bilevel programming problem. Finally, a numerical experiment based on a hypothetical network is performed to validate the proposed congestion pricing model and algorithm.

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.

Nash Equilibria in Fisher Market

Science.gov (United States)

Adsul, Bharat; Babu, Ch. Sobhan; Garg, Jugal; Mehta, Ruta; Sohoni, Milind

Much work has been done on the computation of market equilibria. However due to strategic play by buyers, it is not clear whether these are actually observed in the market. Motivated by the observation that a buyer may derive a better payoff by feigning a different utility function and thereby manipulating the Fisher market equilibrium, we formulate the Fisher market game in which buyers strategize by posing different utility functions. We show that existence of a conflict-free allocation is a necessary condition for the Nash equilibria (NE) and also sufficient for the symmetric NE in this game. There are many NE with very different payoffs, and the Fisher equilibrium payoff is captured at a symmetric NE. We provide a complete polyhedral characterization of all the NE for the two-buyer market game. Surprisingly, all the NE of this game turn out to be symmetric and the corresponding payoffs constitute a piecewise linear concave curve. We also study the correlated equilibria of this game and show that third-party mediation does not help to achieve a better payoff than NE payoffs.

Isotope effects in ion-exchange equilibria in aqueous and mixed solvent systems

International Nuclear Information System (INIS)

Gupta, A.R.

1979-01-01

Isotope effects in ion-exchange equilibria in aqueous and mixed solvents are analyzed in terms of the general features of ion-exchange equilibria and of isotope effects in chemical equilibria. The special role of solvent fractionation effects in ion-exchange equilibria in mixed solvents is pointed out. The various situations arising in isotope fractionation in ion exchange in mixed solvents due to solvent fractionation effects are theoretically discussed. The experimental data on lithium isotope effects in ion-exchange equilibria in mixed solvents are shown to conform to the above situations. The limitations of ion-exchange equilibria in mixed solvents for isotope fractionation are pointed out. 3 tables

Removing Ambiguities of IP Telephony Traffic Using Protocol Scrubbers

Directory of Open Access Journals (Sweden)

Bazara I. A. Barry

2012-10-01

Full Text Available Network intrusion detection systems (NIDSs face the serious challenge of attacks such as insertion and evasion attacks that are caused by ambiguous network traffic. Such ambiguity comes as a result of the nature of network traffic which includes protocol implementation variations and errors alongside legitimate network traffic. Moreover, attackers can intentionally introduce further ambiguities in the traffic. Consequently, NIDSs need to be aware of these ambiguities when detection is performed and make sure to differentiate between true attacks and protocol implementation variations or errors; otherwise, detection accuracy can be affected negatively. In this paper we present the design and implementation of tools that are called protocol scrubbers whose main functionality is to remove ambiguities from network traffic before it is presented to the NIDS. The proposed protocol scrubbers are designed for session initiation and data transfer protocols in IP telephony systems. They guarantee that the traffic presented to NIDSs is unambiguous by eliminating ambiguous behaviors of protocols using well-designed protocol state machines, and walking through packet headers of protocols to make sure packets will be interpreted in the desired way by the NIDS. The experimental results shown in this paper demonstrate the good quality and applicability of the introduced scrubbers.

Urban Road Traffic Simulation Techniques

Directory of Open Access Journals (Sweden)

Ana Maria Nicoleta Mocofan

2011-09-01

Full Text Available For achieving a reliable traffic control system it is necessary to first establish a network parameter evaluation system and also a simulation system for the traffic lights plan. In 40 years of history, the computer aided traffic simulation has developed from a small research group to a large scale technology for traffic systems planning and development. In the following thesis, a presentation of the main modeling and simulation road traffic applications will be provided, along with their utility, as well as the practical application of one of the models in a case study.

On Nash-Equilibria of Approximation-Stable Games

Science.gov (United States)

Awasthi, Pranjal; Balcan, Maria-Florina; Blum, Avrim; Sheffet, Or; Vempala, Santosh

One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are far apart, or ɛ-equilibria that are far in variation distance from the true Nash equilibrium strategies, then this prediction may not be possible even in principle. Motivated by this consideration, in this paper we define the notion of games that are approximation stable, meaning that all ɛ-approximate equilibria are contained inside a small ball of radius Δ around a true equilibrium, and investigate a number of their properties. Many natural small games such as matching pennies and rock-paper-scissors are indeed approximation stable. We show furthermore there exist 2-player n-by-n approximation-stable games in which the Nash equilibrium and all approximate equilibria have support Ω(log n). On the other hand, we show all (ɛ,Δ) approximation-stable games must have an ɛ-equilibrium of support O(Δ^{2-o(1)}/ɛ2{log n}), yielding an immediate n^{O(Δ^{2-o(1)}/ɛ^2log n)}-time algorithm, improving over the bound of [11] for games satisfying this condition. We in addition give a polynomial-time algorithm for the case that Δ and ɛ are sufficiently close together. We also consider an inverse property, namely that all non-approximate equilibria are far from some true equilibrium, and give an efficient algorithm for games satisfying that condition.

Survivable Impairment-Aware Traffic Grooming

NARCIS (Netherlands)

Beshir, A.; Nuijts, R.; Malhotra, R.; Kuipers, F.

2011-01-01

Traffic grooming allows efficient utilization of network capacity by aggregating several independent traffic streams into a wavelength. In addition, survivability and impairment-awareness (i.e., taking into account the effect of physical impairments) are two important issues that have gained a lot

Road safety and bicycle usage impacts of unbundling vehicular and cycle traffic in Dutch urban networks

NARCIS (Netherlands)

Schepers, Paul; Heinen, Eva; Methorst, Rob; Wegman, Fred

2013-01-01

Bicycle-motor vehicle crashes are concentrated along distributor roads where cyclists are exposed to greater volumes of high-speed motorists than they would experience on access roads. This study examined the road safety impact of network-level separation of vehicular and cycle traffic in Dutch

Road safety and bicycle usage impacts of unbundling vehicular and cycle traffic in Dutch urban networks.

NARCIS (Netherlands)

Schepers, P. Heinen, E. Methorst, R. & Wegman, F.

2015-01-01

Bicycle-motor vehicle crashes are concentrated along distributor roads where cyclists are exposed to greater volumes of high-speed motorists than they would experience on access roads. This study examined the road safety impact of network-level separation of vehicular and cycle traffic in Dutch

On the Impact of Zero-padding in Network Coding Efficiency with Internet Traffic and Video Traces

DEFF Research Database (Denmark)

Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

2016-01-01

Random Linear Network Coding (RLNC) theoretical results typically assume that packets have equal sizes while in reality, data traffic presents a random packet size distribution. Conventional wisdom considers zero-padding of original packets as a viable alternative, but its effect can reduce the e...

Implicit methods for equation-free analysis: convergence results and analysis of emergent waves in microscopic traffic models

DEFF Research Database (Denmark)

Marschler, Christian; Sieber, Jan; Berkemer, Rainer

2014-01-01

We introduce a general formulation for an implicit equation-free method in the setting of slow-fast systems. First, we give a rigorous convergence result for equation-free analysis showing that the implicitly defined coarse-level time stepper converges to the true dynamics on the slow manifold...... against the direction of traffic. Equation-free analysis enables us to investigate the behavior of the microscopic traffic model on a macroscopic level. The standard deviation of cars' headways is chosen as the macroscopic measure of the underlying dynamics such that traveling wave solutions correspond...... to equilibria on the macroscopic level in the equation-free setup. The collapse of the traffic jam to the free flow then corresponds to a saddle-node bifurcation of this macroscopic equilibrium. We continue this bifurcation in two parameters using equation-free analysis....

Scalable data-driven short-term traffic prediction

NARCIS (Netherlands)

Friso, K.; Wismans, L. J.J.; Tijink, M. B.

2017-01-01

Short-term traffic prediction has a lot of potential for traffic management. However, most research has traditionally focused on either traffic models-which do not scale very well to large networks, computationally-or on data-driven methods for freeways, leaving out urban arterials completely. Urban

A computerized traffic control algorithm to determine optimal traffic signal settings. Ph.D. Thesis - Toledo Univ.

Science.gov (United States)

Seldner, K.

1977-01-01

An algorithm was developed to optimally control the traffic signals at each intersection using a discrete time traffic model applicable to heavy or peak traffic. Off line optimization procedures were applied to compute the cycle splits required to minimize the lengths of the vehicle queues and delay at each intersection. The method was applied to an extensive traffic network in Toledo, Ohio. Results obtained with the derived optimal settings are compared with the control settings presently in use.

Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks.

Science.gov (United States)

Wei, Yunkai; Ma, Xiaohui; Yang, Ning; Chen, Yijin

2017-09-15

Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs) are an inexorable trend for Wireless Sensor Networks (WSNs), including Wireless Rechargeable Sensor Network (WRSNs). However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS) algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN) controller's direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE) protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20-40% while ensuring feasible data delay.

Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks

Directory of Open Access Journals (Sweden)

Yunkai Wei

2017-09-01

Full Text Available Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs are an inexorable trend for Wireless Sensor Networks (WSNs, including Wireless Rechargeable Sensor Network (WRSNs. However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN controller’s direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20–40% while ensuring feasible data delay.

A Practical Method for Multilevel Classification and Accounting of Traffic in Computer Networks

DEFF Research Database (Denmark)

Bujlow, Tomasz; Pedersen, Jens Myrup

Learning Algorithms (MLAs) require good quality training data, which are difficult to obtain. MLAs usually cannot properly deal with other types of traffic, than they are trained to work with -- such traffic is identified as the most probable class, instead of being left unclassified. Another drawback...... Learning Algorithm. Finally, content and service provider levels are identified based on IP addresses. The training data for the statistical classifier and the mappings between the different types of content and the IP addresses are created based on the data collected by Volunteer-Based System, while...... the service provider (as Facebook, YouTube, or Google). Furthermore, Deep Packet Inspection (DPI), which seems to be the most accurate technique, in addition to the extensive needs for resources, often cannot be used by ISPs in their networks due to privacy or legal reasons. Techniques based on Machine...

Intelligent Traffic Quantification System

Science.gov (United States)

Mohanty, Anita; Bhanja, Urmila; Mahapatra, Sudipta

2017-08-01

Currently, city traffic monitoring and controlling is a big issue in almost all cities worldwide. Vehicular ad-hoc Network (VANET) technique is an efficient tool to minimize this problem. Usually, different types of on board sensors are installed in vehicles to generate messages characterized by different vehicle parameters. In this work, an intelligent system based on fuzzy clustering technique is developed to reduce the number of individual messages by extracting important features from the messages of a vehicle. Therefore, the proposed fuzzy clustering technique reduces the traffic load of the network. The technique also reduces congestion and quantifies congestion.

Simulation of traffic control signal systems

Science.gov (United States)

Connolly, P. J.; Concannon, P. A.; Ricci, R. C.

1974-01-01

In recent years there has been considerable interest in the development and testing of control strategies for networks of urban traffic signal systems by simulation. Simulation is an inexpensive and timely method for evaluating the effect of these traffic control strategies since traffic phenomena are too complex to be defined by analytical models and since a controlled experiment may be hazardous, expensive, and slow in producing meaningful results. This paper describes the application of an urban traffic corridor program, to evaluate the effectiveness of different traffic control strategies for the Massachusetts Avenue TOPICS Project.

On Equilibria of the Two-fluid Model in Magnetohydrodynamics

International Nuclear Information System (INIS)

Frantzeskakis, Dimitri J.; Stratis, Ioannis G.; Yannacopoulos, Athanasios N.

2004-01-01

We show how the equilibria of the two-fluid model in magnetohydrodynamics can be described by the double curl equation and through the study of this equation we study some properties of these equilibria

A unifying approach to existence of Nash equilibria

NARCIS (Netherlands)

Balder, E.J.

1997-01-01

An approach initiated in [4] is shown to unify results about the existence of (i) Nash equilibria in games with at most countably many players, (ii) Cournot-Nash equilibrium distributions for large, anonymous games, and (iii) Nash equilibria (both mixed and pure) for continuum games. A new, central

Cyber-Threat Assessment for the Air Traffic Management System: A Network Controls Approach

Science.gov (United States)

Roy, Sandip; Sridhar, Banavar

2016-01-01

Air transportation networks are being disrupted with increasing frequency by failures in their cyber- (computing, communication, control) systems. Whether these cyber- failures arise due to deliberate attacks or incidental errors, they can have far-reaching impact on the performance of the air traffic control and management systems. For instance, a computer failure in the Washington DC Air Route Traffic Control Center (ZDC) on August 15, 2015, caused nearly complete closure of the Centers airspace for several hours. This closure had a propagative impact across the United States National Airspace System, causing changed congestion patterns and requiring placement of a suite of traffic management initiatives to address the capacity reduction and congestion. A snapshot of traffic on that day clearly shows the closure of the ZDC airspace and the resulting congestion at its boundary, which required augmented traffic management at multiple locations. Cyber- events also have important ramifications for private stakeholders, particularly the airlines. During the last few months, computer-system issues have caused several airlines fleets to be grounded for significant periods of time: these include United Airlines (twice), LOT Polish Airlines, and American Airlines. Delays and regional stoppages due to cyber- events are even more common, and may have myriad causes (e.g., failure of the Department of Homeland Security systems needed for security check of passengers, see [3]). The growing frequency of cyber- disruptions in the air transportation system reflects a much broader trend in the modern society: cyber- failures and threats are becoming increasingly pervasive, varied, and impactful. In consequence, an intense effort is underway to develop secure and resilient cyber- systems that can protect against, detect, and remove threats, see e.g. and its many citations. The outcomes of this wide effort on cyber- security are applicable to the air transportation infrastructure

Traffic Congestion Detection and Avoidance using Vehicular Communication

Directory of Open Access Journals (Sweden)

Ajay Narendrabhai Upadhyaya

2015-01-01

Full Text Available Traffic congestion is a serious problem in big cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. Drivers, unaware of congestion ahead eventually join it and increase the severity of it. The ability of a driver to know the traffic conditions on the roads ahead enables him/her to seek alternate routes through which time and fuel can be saved. Due to recent advancements in vehicular technologies, vehicular communication has emerged. The objective of this work is to check feasibility of using infrastructure based vehicular communication for detecting and avoiding traffic congestion. In this paper we propose a Signal Agent (SA and Car Agent(CAbased approach for detecting and avoiding traffic congestion. We analyze performance of the proposed approach for two different road network scenarios using simulations: structured grid network (like Gandhinagar City of Gujarat, India and apart of typical city road network ( Tiwan city. With the proposed approach we get reduction of 10.05% in trip duration of vehicles, reduction of 10.08% in number of vehicles in entire traffic road network and 9.82% in heavy traffic area. In an accident scenario, about 72.63% vehicles changed their route due to awareness of congestion. Error in trip time estimation and vehicle count estimation is observed to be less than 1%.

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.

Two-fluid equilibria with flow

International Nuclear Information System (INIS)

Steinhauer, L.

1999-01-01

The formalism is developed for flowing two-fluid equilibria. The equilibrium system is governed by a pair of second order partial differential equations for the magnetic stream function and the ion stream function plus a Bernoulli-like equation for the density. There are six arbitrary surface function. There are separate characteristic surfaces for each species, which are the guiding-center surfaces. This system is a generalization of the familiar Grad-Shafranov system for a single-fluid equilibrium without flow, which has only one equation and two arbitrary surface functions. In the case of minimum energy equilibria, the six surface functions take on particular forms. (author)

The Pierce diode with an external circuit: II, Non-uniform equilibria

International Nuclear Information System (INIS)

Lawson, W.S.

1987-01-01

The non-uniform (non-linear) equilibria of the classical (short circuit) Pierce diode and the extended (series RLC external circuit) Pierce diode are described theoretically, and explored via computer simulation. It is found that most equilibria are correctly predicted by theory, but that the continuous set of equilibria of the classical Pierce diode at α = 2π are not observed. The stability characteristics of the non-uniform equilibria are also worked out, and are consistent with the simulations. 8 refs., 22 figs., 3 tabs

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.

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.

A game theoretic investigation of deception in network security

Energy Technology Data Exchange (ETDEWEB)

Carroll, Thomas E.; Grosu, Daniel

2010-12-03

We perform a game theoretic investigation of the effects of deception on the interactions between an attacker and a defender of a computer network. The defender can employ camouflage by either disguising a normal system as a honeypot or by disguising a honeypot as a normal system. We model the interactions between defender and attacker using a signaling game, a non-cooperative two player dynamic game of incomplete information. For this model, we determine which strategies admit perfect Bayesian equilibria. These equilibria are refined Nash equilibria in which neither the defender nor the attacker will unilaterally choose to deviate from their strategies. Finally, we discuss the benefits of employing deceptive equilibrium strategies in the defense of a computer network.

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...

Evaluation of a Mathematical Model for Single Component Adsorption Equilibria with Reference to the Prediction of Multicomponent Adsorption Equilibria

DEFF Research Database (Denmark)

Krøll, Annette Elisabeth; Marcussen, Lis

1997-01-01

An equilibrium equation for pure component adsorption is compared to experiments and to the vacancy solution theory. The investigated equilibrium equation is a special case of a model for prediction of multicomponent adsorption equilibria.The vacancy solution theory for multicomponent systems...... requires binary experimental data for determining the interaction parameters of the Wilson equation; thus a large number of experiments are needed. The multicomponent equilibria model which is investigated for single component systems in this work is based on pure component data only. This means...... that the requirement for experimental data is reduced significantly.The two adsorption models are compared, using experimental pure gas adsorption data found in literature. The results obtained by the models are in close agreement for pure component equilibria and they give a good description of the experimental data...

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.

Shallow-water vortex equilibria and their stability

Energy Technology Data Exchange (ETDEWEB)

Plotka, H; Dritschel, D G, E-mail: hanna@mcs.st-andrews.ac.uk, E-mail: dgd@mcs.st-andrews.ac.uk [School of Mathematics and Statistics, University of St Andrews, North Haugh, St. Andrews KY16 9SS (United Kingdom)

2011-12-22

We first describe the equilibrium form and stability of steadily-rotating simply-connected vortex patches in the single-layer quasi-geostrophic model of geophysical fluid dynamics. This model, valid for rotating shallow-water flow in the limit of small Rossby and Froude numbers, has an intrinsic length scale L{sub D} called the 'Rossby deformation length' relating the strength of stratification to that of the background rotation rate. Specifically, L{sub D} = c/f where c={radical}gH is a characteristic gravity-wave speed, g is gravity (or 'reduced' gravity in a two-layer context where one layer is infinitely deep), H is the mean active layer depth, and f is the Coriolis frequency (here constant). We next introduce ageostrophic effects by using the full shallow-water model to generate what we call 'quasi-equilibria'. These equilibria are not strictly steady, but radiate such weak gravity waves that they are steady for all practical purposes. Through an artificial ramping procedure, we ramp up the potential vorticity anomaly of the fluid particles in our quasi-geostrophic equilibria to obtain shallow-water quasi-equilibria at finite Rossby number. We show a few examples of these states in this paper.

Uniqueness of Nash equilibria in a quantum Cournot duopoly game

International Nuclear Information System (INIS)

Sekiguchi, Yohei; Sakahara, Kiri; Sato, Takashi

2010-01-01

A quantum Cournot game whose classical form game has multiple Nash equilibria is examined. Although the classical equilibria fail to be Pareto optimal, the quantum equilibrium exhibits the following two properties: (i) if the measurement of entanglement between strategic variables chosen by the competing firms is sufficiently large, the multiplicity of equilibria vanishes, and (ii) the more strongly the strategic variables are entangled, the more closely the unique equilibrium approaches to the optimal one.

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.

Energy-efficient multicast traffic grooming strategy based on light-tree splitting for elastic optical networks

Science.gov (United States)

Liu, Huanlin; Yin, Yarui; Chen, Yong

2017-07-01

In order to address the problem of optimizing the spectrum resources and power consumption in elastic optical networks (EONs), we investigate the potential gains by jointly employing the light-tree splitting and traffic grooming for multicast requests. An energy-efficient multicast traffic grooming strategy based on light-tree splitting (EED-MTGS-LS) is proposed in this paper. Firstly, we design a traffic pre-processing mechanism to decide the multicast requests' routing order, which considers the request's bandwidth requirement and physical hops synthetically. Then, by dividing a light-tree to some sub-light-trees and grooming the request to these sub-light-trees, the light-tree sharing ratios of multicast requests can be improved. What's more, a priority scheduling vector is constructed, which aims to improve the success rate of spectrum assignment for grooming requests. Finally, a grooming strategy is designed to optimize the total power consumption by reducing the use of transponders and IP routers during routing. Simulation results show that the proposed strategy can significantly improve the spectrum utilization and save the power consumption.

McMAC: Towards a MAC Protocol with Multi-Constrained QoS Provisioning for Diverse Traffic in Wireless Body Area Networks

OpenAIRE

Monowar, Muhammad; Hassan, Mohammad; Bajaber, Fuad; Al-Hussein, Musaed; Alamri, Atif

2012-01-01

The emergence of heterogeneous applications with diverse requirements for resource-constrained Wireless Body Area Networks (WBANs) poses significant challenges for provisioning Quality of Service (QoS) with multi-constraints (delay and reliability) while preserving energy efficiency. To address such challenges, this paper proposes McMAC, a MAC protocol with multi-constrained QoS provisioning for diverse traffic classes in WBANs. McMAC classifies traffic based on their multi-constrained QoS de...

Quality of Service Model on Data Link Layer for Mission Critical Traffic on IEEE 802.11g Networks in Infrastructure Mode

Directory of Open Access Journals (Sweden)

Gerald B. Fuenmayor-Rivadeneira

2013-11-01

Full Text Available This article presents a synthesized review as state of the art of the study of QoS for mission-critical traffic in wireless local area networks that use the IEEE 802.11g protocol. This is to highlight previous research for their contribution will constitute a reference to guide a proposed new approach to ensuring the quality of service for this type of traffic using the above protocol. The review is based on academic and business items made during the current five years. As a result of this review it is evident that there have been many efforts to address the issue but there are still gaps in the characterization of mission-critical traffic and ensuring quality of service for the same, due the new applications and the large host of WiFi networks in business and government, which has led to increased demand for access channels and, therefore, a challenge to the progress already known, such as IEEE 802.1q.

Two-dimensional magnetohydrodynamic equilibria with flow and studies of equilibria fluctuations

International Nuclear Information System (INIS)

Agim, Y.Z.

1989-08-01

A set of reduced ideal MHD equations is derived to investigate equilibria of plasmas with mass flow in general two-dimensional geometry. These equations provide a means of investigating the effects of flow on self-consistent equilibria in a number of new two-dimensional configurations such as helically symmetric configurations with helical axis, which are relevant to stellarators, as well as axisymmetric configurations. It is found that as in the axisymmetric case, general two-dimensional flow equilibria are governed by a second-order quasi-linear partial differential equation for a magnetic flux function, which is coupled to a Bernoulli-type equation for the density. The equation for the magnetic flux function becomes hyperbolic at certain critical flow speeds which follow from its characteristic equation. When the equation is hyperbolic, shock phenomena may exist. As a particular example, unidirectional flow along the lines of symmetry is considered. In this case, the equation mentioned above is always elliptic. An exact solution for the case of helically symmetric unidirectional flow is found and studied to determine flow effects on the magnetic topology. In second part of this thesis, magnetic fluctuations due to the thermally excited MHD waves are investigated using fluid and kinetic models to describe stable, uniform, compressible plasma in the range above the drift wave frequency and below the ion cyclotron frequency. It is shown that the fluid model with resistivity yields spectral densities which are roughly Lorentzian, exhibit equipartition with no apparent cutoff in wavenumber space and a Bohm-type diffusion coefficient. Under certain conditions, the ensuing transport may be comparable to classical values. For a phenomenological cutoff imposed on the spectrum, the typical fluctuating-to-equilibrium magnetic field ratio is found to be of the order of 10 -10

On tokamak equilibria with a zero current or negative current central region

International Nuclear Information System (INIS)

Chu, M.S.; Parks, P.B.

2002-01-01

Several tokamak experiments have reported the development of a central region with vanishing currents (the current hole). The straightforward application of results from the work of Greene, Johnson and Weimer [Phys. Fluids 14, 671 (1971)] on a tokamak equilibrium to these plasmas leads to the apparent singularities in several physical quantities including the Shafranov shift and casts doubts on the existence of this type of equilibria. In this paper, the above quoted equilibrium theory is re-examined and extended to include equilibria with a current hole. It is shown that singularities can be circumvented and that equilibria with a central current hole do satisfy the magnetohydrodynamic equilibrium condition with regular behavior for all the physical quantities and do not lead to infinitely large Shafranov shifts. Isolated equilibria with negative current in the central region could exist. But equilibria with negative currents in general do not have neighboring equilibria and thus cannot have experimental realization, i.e., no negative currents can be driven in the central region

The Pierce diode with an external circuit. I. Oscillations about nonuniform equilibria

International Nuclear Information System (INIS)

Lawson, W.S.

1989-01-01

The nonuniform (nonlinear) equilibria of the classical (short circuit) Pierce diode and the extended (series RLC external circuit) Pierce diode are described, and the spectrum of oscillations (stable and unstable) about these equilibria are worked out. It is found that only the external capacitance alters the equilibria, though all elements alter the spectrum. In particular, the introduction of an external capacitor destabilizes some equilibria that are marginally stable without the capacitor. Computer simulations are performed to test the theoretical predictions for the case of an external capacitor only. It is found that most equilibria are correctly predicted by theory, but that the continuous set of equilibria of the classical Pierce diode at Pierce parameters (α=ω/sub pL//v 0 ) that are multiples of 2π are not observed. This appears to be a failure of the simulation method under the rather singular conditions rather than a failure of the theory

Nematic Equilibria on a Two-Dimensional Annulus

KAUST Repository

Lewis, A. H.; Aarts, D. G. A. L.; Howell, P. D.; Majumdar, A.

2017-01-01

We study planar nematic equilibria on a two-dimensional annulus with strong and weak tangent anchoring, in the Oseen–Frank theoretical framework. We analyze a radially invariant defect-free state and compute analytic stability criteria for this state in terms of the elastic anisotropy, annular aspect ratio, and anchoring strength. In the strong anchoring case, we define and characterize a new spiral-like equilibrium which emerges as the defect-free state loses stability. In the weak anchoring case, we compute stability diagrams that quantify the response of the defect-free state to radial and azimuthal perturbations. We study sector equilibria on sectors of an annulus, including the effects of weak anchoring and elastic anisotropy, giving novel insights into the correlation between preferred numbers of boundary defects and the geometry. We numerically demonstrate that these sector configurations can approximate experimentally observed equilibria with boundary defects.

Nematic Equilibria on a Two-Dimensional Annulus

KAUST Repository

Lewis, A. H.

2017-01-16

We study planar nematic equilibria on a two-dimensional annulus with strong and weak tangent anchoring, in the Oseen–Frank theoretical framework. We analyze a radially invariant defect-free state and compute analytic stability criteria for this state in terms of the elastic anisotropy, annular aspect ratio, and anchoring strength. In the strong anchoring case, we define and characterize a new spiral-like equilibrium which emerges as the defect-free state loses stability. In the weak anchoring case, we compute stability diagrams that quantify the response of the defect-free state to radial and azimuthal perturbations. We study sector equilibria on sectors of an annulus, including the effects of weak anchoring and elastic anisotropy, giving novel insights into the correlation between preferred numbers of boundary defects and the geometry. We numerically demonstrate that these sector configurations can approximate experimentally observed equilibria with boundary defects.

Application of machine learning methods for traffic signs recognition

Science.gov (United States)

Filatov, D. V.; Ignatev, K. V.; Deviatkin, A. V.; Serykh, E. V.

2018-02-01

This paper focuses on solving a relevant and pressing safety issue on intercity roads. Two approaches were considered for solving the problem of traffic signs recognition; the approaches involved neural networks to analyze images obtained from a camera in the real-time mode. The first approach is based on a sequential image processing. At the initial stage, with the help of color filters and morphological operations (dilatation and erosion), the area containing the traffic sign is located on the image, then the selected and scaled fragment of the image is analyzed using a feedforward neural network to determine the meaning of the found traffic sign. Learning of the neural network in this approach is carried out using a backpropagation method. The second approach involves convolution neural networks at both stages, i.e. when searching and selecting the area of the image containing the traffic sign, and when determining its meaning. Learning of the neural network in the second approach is carried out using the intersection over union function and a loss function. For neural networks to learn and the proposed algorithms to be tested, a series of videos from a dash cam were used that were shot under various weather and illumination conditions. As a result, the proposed approaches for traffic signs recognition were analyzed and compared by key indicators such as recognition rate percentage and the complexity of neural networks’ learning process.

Numerical calculation of axisymmetric non-neutral plasma equilibria

International Nuclear Information System (INIS)

Spencer, R.L.; Rasband, S.N.; Vanfleet, R.R.

1993-01-01

Efficient techniques for computing axisymmetric non-neutral plasma equilibria are described. These equilibria may be obtained either by requiring global thermal equilibrium, by specifying the midplane radial density profile, or by specifying the radial profile of ∫n dz. Both splines and finite-differences are used, and the accuracy of the two is compared by using a new characterization of the thermal equilibrium density profile which gives a simple formula for estimating the radial and axial gradient scale lengths of thermal equilibria. It is found that for global thermal equilibrium 1% accuracy is achieved with splines if the distance between neighboring splines is about two Debye lengths while finite differences require a grid spacing of about one-half Debye length to achieve the same accuracy

GIS-based methods for establishing the datafoundation for traffic models

DEFF Research Database (Denmark)

Nielsen, Otto Anker

1997-01-01

Traffic models demand large amounts of data - some of which are: Traffic network topology, traffic network data, zone-data and trip matrices. GIS is a natural tool for handling most of these data as it can ease the work process and improve the quality control. However, traffic models demand a com......-plex topology not very well covered by the traditional GIS-topology. The paper describes a number of applications where ARC/INFO and ArcView have been used to automate the process of building a traffic network topology. The methodology has been used on a number of full-scale models, from medium sized urban...... areas to metropolitan areas (Copenhagen, Denmark and Bandung, Indonesia). The paper covers key subjects in the work process which has been eased considerably by using AML and Avenue scripts or by using the information from ARC/INFO in external applications:· Semi-automatic procedures for attaching zones...

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.

Analysis of Malicious Traffic in Modbus/TCP Communications

Science.gov (United States)

Kobayashi, Tiago H.; Batista, Aguinaldo B.; Medeiros, João Paulo S.; Filho, José Macedo F.; Brito, Agostinho M.; Pires, Paulo S. Motta

This paper presents the results of our analysis about the influence of Information Technology (IT) malicious traffic on an IP-based automation environment. We utilized a traffic generator, called MACE (Malicious trAffic Composition Environment), to inject malicious traffic in a Modbus/TCP communication system and a sniffer to capture and analyze network traffic. The realized tests show that malicious traffic represents a serious risk to critical information infrastructures. We show that this kind of traffic can increase latency of Modbus/TCP communication and that, in some cases, can put Modbus/TCP devices out of communication.