Network traffic simulation

About: Network traffic simulation is a research topic. Over the lifetime, 4535 publications have been published within this topic receiving 74606 citations.

A Microscopic Traffic Simulation Model for Transportation Planning in Cyprus

Abstract: Traffic management has become an issue of big concern in the last few decades. Especially nowadays living in the information age and the networked digital society the issue of traffic management becomes the main problem of computer networks as well. Traffic simulation is an important tool for analyzing and solving the problem of traffic congestion. Further any suggested solutions regarding traffic control and Intelligent Transportation Systems may be tested using traffic simulation prior to their implementation. This paper presents the microscopic simulation model development of a major traffic network of Nicosia, Cyprus. Further, the first steps towards validating the model are illustrated. Finally, this paper demonstrates a wider spectrum of understanding on the principles of traffic flow theory and how a traffic flow simulation model is developed and utilized for transportation planning.

Load analysis of packet switched networks in control systems

Abstract: Analysis and design of switched networks in control systems often comes in close connection with the load analysis problem. Given the volume and pattern of traffic among the network end nodes, the problem can be defined as computing the amount of traffic or load on the network internal nodes, corresponding to network switch devices. We discuss a systematic solution to this problem using the graph model of the network coupled with a compact representation of the network traffic in the form of a traffic matrix. In particular, we present an iterative solution for a special class of switched networks, namely, networks with free topology. Beginning with the graph model and the traffic matrix of the original network, the loads on end nodes of the network are computed through simple matrix operations. The graph model is then trimmed by removing a group of end nodes and an equivalent traffic matrix is computed for the new graph. The procedure is repeated until the network is reduced to a single node, which typically happens to be the backbone switch of the network.

Behaviours in a dynamical model of traffic assignment with elastic demand

Abstract: This paper investigates the dynamical behaviour of network traffic flow. Assume that trip rates may be influenced by the level of service on the network and travellers are willing to take a faster route. A discrete dynamical model for the day-to-day adjustment process of route choice is presented. The model is then applied to a simple network for analysing the day-to-day behaviours of network flow. It finds that equilibrium is arrived if network flow consists of travellers not very sensitive to the differences of travel cost. Oscillations and chaos of network traffic flow are also found when travellers are sensitive to the travel cost and travel demand in a simple network.

Towards minimising the coefficient vector overhead in random linear Network Coding

Abstract: Network Coding is a promising approach to increase network throughput and robustness to facilitate high volume traffic. Performing network coding in dynamic network structures requires transmitting coding coefficients for information sinks to decode network coded packets. Compared to the packet sizes used in practical networks, the size of coefficient vectors can be significant. This paper exploits the properties of small and medium sized networks and proposes a novel approach to minimise the coefficient vector size of network coded packets. Simulation results exhibit better compression of coefficient vectors over existing algorithms for small and medium sized networks.

Capacity Drop in First-Order Traffic Flow Models: Overview and Real-Data Validation

Abstract: First-order traffic flow models are known for their simplicity and computational efficiency and have, for this reason, been widely used for various traffic engineering tasks. However, first-order models are not able to reproduce significant traffic phenomena of great interest such as the capacity-drop and stop-and-go waves. This paper presents an overview of the, so far, proposed modelling approaches which aim to introduce the capacity-drop phenomenon into first-order traffic flow models. The background and main characteristics of each approach are analyzed with a particular emphasis on the practical applicability of such models for traffic management and control. The presented modelling approaches are calibrated and tested using real data from a motorway network in U.K.