Recent Internet studies have reported on continued traffic growth, changes in applications usage, and a proliferation in the adoption of high-speed access links. Any adverse impact that these observed trends may have on Internet traffic flows can result in sub par performance, which in turn results in unsatisfactory user experience. To study such adverse impacts, we examine in this paper the fl...

WirelessHART networks are gaining ground as a real-time communication infrastructure in industrial wireless control systems. Because wireless communication is often susceptible to transmission failures in industrial environments, it is essential to account for failures in the delay analysis for realtime flows between sensors and actuators in process control. WirelessHART networks handle transmi...

The traditional “data” applications in the Internet, such as web browsing, peer-to-peer file sharing, ftp, e-mail and others, transfer discrete messages or “documents” (a web request, a basic web file, an embedded image, an ftp file, an ftp command, etc.). They are all built on top of TCP. Documents are partitioned into blocks and sent through the network into a sequence of packets or “flows” w...

High-rate large-sized (α) flows have adverse effects on delay-sensitive flows. Research-andeducation network providers are interested in identifying such flows within their networks, and directing these flows to virtual circuits. To achieve this goal, a design is proposed for a hybrid network traffic engineering system (HNTES) that would run on an external server, gather NetFlow records from ro...

In this paper we describe a method to estimate the overflow probability at an arbitrary queue in a network. This work is motivated by the assumption that most network routers will have the capacity to multiplex a moderate to large number of network flows. We first provide our main results on the workload of a queue fed with a large number of traffic flows in a network. Under fairly general cond...

We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge-capacities distributed like a random variable C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support sim...

We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge capacities distributed like C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicom...

This document contains recommendations to be taken into account when using methods which optimize bandwidth utilization through Tunneling Compressing and Multiplexing (TCM) traffic flows over a network path. Different multiplexing policies and implementation issues which are service and link specific are discussed. Additionally, this document describes policies which can be used for detecting, ...

The paper designs a new technique for correlating network flows, which they call RAINBOW. The core idea of RAINBOW is to slightly delay network packets in a way to modulate a secret signal, called the watermark signal, into the packet timings of network flows. The proposed technique is different from previous designs by being “non-blind”, i.e., the traffic analysis parties use a side channel to...

A key aspect of traffic classification is the early identification of individual flows which may utilise strategies such as ephemeral ports and transport later encryption to ‘hide’ on the network. This paper focuses on P2P and HTTP – the two main producers of network traffic – to determine the characteristics of their individual flows. We propose a heuristic based classification system to disti...