Topic
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.
Papers published on a yearly basis
Papers
More filters
TL;DR: A novel approach is presented to predict the traffic flow in a large-scale traffic network in an asynchronous, parallel, and distributed way at two or more subnetworks combined with a consistency check at the network level within a reasonable-small computation time.
17 citations
05 Nov 2015
TL;DR: This paper evaluates the accuracy of developing meaningful user traffic profiles from application usage trends based on traffic flow analysis using k-means clustering algorithm and explores their applicability to software defined networks for real-time traffic management.
Abstract: Traffic classification and statistical trend analysis are critical steps for workload characterization, capacity planning and network policy configuration in computer networks. Additionally application level traffic classification aids in profiling user traffic based on application usage trends. However, user traffic profiling integration in real-time network resource management remains challenging due to variation in user traffic behaviour, requiring repeated manual configuration updates in traditional fixed topology networks. Software defined networks (SDN) on the other hand, due to their centralized control and real-time programmability of network elements, may offer a potential avenue for application based user traffic profiles to effectively allocate and control network resources. In this paper we evaluate the accuracy of developing meaningful user traffic profiles from application usage trends based on traffic flow analysis using k-means clustering algorithm and explore their applicability to software defined networks for real-time traffic management. The results show a considerable variation in application usage trends and associated network statistics among user traffic profiles leading to further propose implementing per profile flow metering and re-routing of resource intensive traffic profiles via different links for effective real-time network resource management in software defined networks.
17 citations
19 May 2013
TL;DR: The importance of topology in the performance of synchronization protocols when developing parallel discrete event simulations involving scale-free networks is demonstrated, and important challenges such as performance bottlenecks that must be addressed to achieve efficient parallel execution are highlighted.
Abstract: Scale-free networks have received much attention in recent years due to their prevalence in many important applications such as social networks, biological systems, and the Internet. We consider the use of conservative parallel discrete event simulation techniques in network simulation applications involving scale-free networks. An analytical model is developed to study the parallelism available in simulations using a conservative time window synchronization algorithm. The performance of scale-free network simulations using two variants of the Chandy/Misra/Bryant synchronization algorithm are evaluated. These results demonstrate the importance of topology in the performance of synchronization protocols when developing parallel discrete event simulations involving scale-free networks, and highlight important challenges such as performance bottlenecks that must be addressed to achieve efficient parallel execution. These results suggest that new approaches to parallel simulation of scale-free networks may offer significant benefit.
17 citations
10 Jun 2014
TL;DR: This work claims that Information-Centric Networks can therefore provide a better handle to perform traffic engineering, resulting in significant performance gain and presents a mechanism to perform such resource allocation.
Abstract: Current Internet performs traffic engineering (TE) by estimating traffic matrices on a regular schedule, and allocating flows based upon weights computed from these matrices. This means the allocation is based upon a guess of the traffic in the network based on its history. Information-Centric Networks on the other hand provide a finer-grained description of the traffic: a content between a client and a server is uniquely identified by its name, and the network can therefore learn the size of different content items, and perform traffic engineering and resource allocation accordingly. We claim that Information-Centric Networks can therefore provide a better handle to perform traffic engineering, resulting in significant performance gain. We present a mechanism to perform such resource allocation. We see that our traffic engineering method only requires knowledge of the flow size (which, in ICN, can be learned from previous data transfers) and outperforms a min-MLU allocation in terms of response time. We also see that our method identifies the traffic allocation patterns similar to that of min-MLU without having access to the traffic matrix ahead of time. We show a very significant gain in response time where min-MLU is almost 50% slower than our ICN-based TE method.
17 citations
Patent•
12 Dec 2002
TL;DR: In this paper, a method of modelling network traffic behavior comprises transmitting network traffic through a communications network at a transmission rate and receiving at a traffic receiver the network traffic from the communications network.
Abstract: A method of modelling network traffic behaviour comprises transmitting network traffic through a communications network at a transmission rate and receiving at a traffic receiver the network traffic from the communications network. Feedback data is then derived from the network traffic received by the traffic receiver and used to generate instructions for altering the network traffic transmission rate. The network traffic is then transmitted through the network at the altered transmission rate according to the instructions.
17 citations