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.

Scale-free user-network approach to telephone network traffic analysis.

Abstract: The effect of the user network on the telephone network traffic is studied in this paper. Unlike classical traffic analysis, where users are assumed to be connected uniformly, our proposed method employs a scale-free network to model the behavior of telephone users. Each user has a fixed set of acquaintances with whom the user may communicate, and the number of acquaintances follows a power-law distribution. We show that compared to conventional analysis based upon a fully connected user network, the network traffic is significantly different when the user network assumes a scale-free property. Specifically, network blocking (call failure) is generally more severe in the case of a scale-free user network. It is also shown that the carried traffic is practically limited by the scale-free property of the user network, rather than by the network capacity.

Back-tracing and event-driven techniques in high-level simulation with decision diagrams

Abstract: The paper addresses the problem of the cycle-based simulation performance of synchronous digital systems modeled by High-Level Decision Diagrams (DDs). A new class of DD representation, called Register-Oriented DDs (RODD) is introduced. The RODD model appears to be an efficient and compact representation of the system behavior for the high-level cycle simulation. In order to fully exploit the advantages of RODDs a new simulation algorithm, which is a combination of cycle-based forward event-driven and recursive back-tracing techniques is proposed. The characteristics of the simulation algorithms used to efficiently execute the evaluation of the DD network are discussed. Further the experimental results carried out on the real case examples demonstrating the gain in simulation performance of the proposed approach and a comparison of four cycle-based simulation algorithms are presented. Additionally, a comparison with the commercial event-driven and cycle-based HDL simulation tools is included.

A cooperative multi-agent system simulation model for urban traffic intelligent control

Abstract: Agent-based urban traffic simulation has been looked as an efficient tool for traffic planning. However, the main problem is how to build an agent-based model for traffic simulation. This research presents an urban traffic information intelligent control model, which adopts a multi-agents coordination approach for urban traffic information control to coordinate the traffic network. In this paper, we propose a new traffic information intelligent control hybrid model based on multi-agent system that performs the basic interface, planning and supports services for managing different types of demand responsive transportation. In this research, we expose the main features and the behaviors exhibited of the multi-agent system. Based on this model, a simplified multi-agent traffic information control system can be developed that is effective for reducing traffic congestion and air pollution.

A graph theoretical approach to traffic engineering and network control problem

Abstract: This paper looks at the problem of traffic engineering and network control from a new perspective. A graph-theoretical metric, betweenness, in combination with a network weight matrix is used to characterize the robustness of a network. Theoretical results lead to a definition of ”criticality” for nodes and links. It is shown that this quantity is a global network quantity and depends on the weight matrix of the graph. Strict convexity of network criticality is proved and an optimization problem is solved to minimize the network criticality as a function of weight matrix which in turn provides maximum robustness. Investigation of the condition of optimality suggests directions to design appropriate control laws and traffic engineering methods to robustly assign traffic flows. The choice of the path for routing the flow in these traffic engineering methods is in the direction of preserving the robustness of the network to the unforeseen changes in topology and traffic demands. The proposed method is useful in situations like MPLS and Ethernet networks where path assignment is required.

Network traffic characterisation using flow-based statistics

Abstract: Performing research on live network traffic requires the traffic to be well documented and described. The results of such research are heavily dependent on the particular network. This paper presents a study of network characteristics, which can be used to describe the behaviour of a network. We propose a number of characteristics that can be collected from the networks and evaluate them on five different networks of Masaryk University. The proposed characteristics cover IP, transport and application layers of the network traffic. Moreover, they reflect strong day-night and weekday patterns that are present in most of the networks. Variation in the characteristics between the networks indicates that they can be used for the description and differentiation of the networks. Furthermore, a weak correlation between the chosen characteristics implies their independence and contribution to network description.