This paper describes a network flow analyzer that is capable of attribution and aggregation of different flows into single activity events for the purposes of identifying suspicious and illegitimate behaviors. Flows are correlated with security events using the Process Query System (PQS) infrastructure. We show results from initial experiments and describe plans for extending the effort. The co...

This document contains recommendations to be taken into account when using methods which optimize bandwidth utilization through compression, multiplexing, and tunneling traffic flows (TCMTF) 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 detecti...

Modern data centres provide large aggregate capacity in the backbone of networks so that servers can theoretically communicate with each other at their maximum rates. However, the Transport Control Protocol (TCP) cannot efficiently use this large capacity even if Equal-Cost Multi-Path (ECMP) routing is enabled to exploit the existence of parallel paths. MultiPath TCP (MPTCP) can effectively use...

Buffer sizing in Internet routers is a fundamental problem that has major consequences in design, implementation, and the economy of the routers, as well as on the performance observed by the end users. Recently, there have been some seemingly contradictory results on buffer sizing. On one hand, Appenzeller et al. show that as a direct consequence of desynchronization of flows in the core of th...

The ever growing amount of transferred data and the constantly increasing expectance on reliability and performance in the Internet pose a fundamental problem for network designers. Traditionally these problems have been tackled by overprovisioning link and router capacity to ensure enough spare room. More recently however careful steering of traffic flows has been deployed as a more sophistica...

The end-to-end nature of Internet congestion control is an important factor in its scalability and robustness. However, end-to-end congestion control algorithms alone are incapable of preventing the congestion collapse and unfair bandwidth allocations created by applications that are unresponsive to network congestion. To address this flaw, we propose and investigate a novel congestion avoidanc...

The dimensioning of telecommunication networks that carry elastic traffic requires the fulfillment of two conflicting goals: maximizing the total network throughput and providing fairness to all flows. Fairness in telecommunication network design is usually provided using the so-called max-min fairness (MMF) approach. However, this approach maximizes the performance of the worst (most expensive...

Network flows should adjust their sending rates to avoid a congestion collapse. Congestion collapses can be mitigated using improved packet scheduling based on a crowd control or an active queue management. However, the problem is associated with dynamic conditions such as underlying network topology, network load, and the reactions of transport protocols to congestion. Therefore, we have to ev...

The robustness and integrity of IP networks require efficient tools for traffic monitoring and analysis, which scale well with traffic volume and network size. We address the problem of optimal large-scale flow monitoring of computer networks under resource constraints. We propose a stochastic optimization framework where traffic measurements are done by exploiting the spatial (across network l...

This paper discusses key properties of the N-form corporation or internal network forms of organizing from three mutually related perspectives: structure, knowledge flows and management processes. To operationalize knowledge flows, a key property of N-forms, the paper suggests a new measure, the H/V ratio, to empirically assess the configuration of knowledge flows. The argument is illustrated b...