The analysis of packet payload is mandatory for network security and traffic monitoring applications. The computational cost of this activity pushed the industry towards hardware-assisted deep packet inspection (DPI) that have the disadvantage of being more expensive and less flexible. This paper covers the design and implementation of a new DPI framework using FastFlow, a skeleton-based parall...

Inverted index is a core element of current text retrieval systems. They can be dynamically constructed using online indexing approaches in the environment which even a small delay in timeliness cannot be tolerated, and the index must always be queryable and up to date. Recently, efficient online index construction schemes have been proposed, however, previous works have not focused on scalabil...

Multi-core CPUs, along with recent advances in memory and buses, render commodity hardware a strong candidate for software router virtualization. In this context, we present the design of a new platform for virtual routers on x86 hardware. We also elaborate on our design choices in order to achieve both high performance and flexibility for packet processing.

We present a unified analytical framework within which power control, routing, and congestion control for wireless networks can be optimized on a node-by-node basis. We consider a multi-commodity flow model for interference-limited wireless networks, and develop distributed scaled gradient projection algorithms which iteratively adjust power control and routing schemes at individual nodes to mi...

We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the `1 → `1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing.

Recent research shows that traditional database technology does not efficiently exploit the features of modern computer hardware. This problem is especially visible in the area of computationally-intensive applications, where specialized programs achieve performance orders of magnitude higher than DBMSs. In this article we present techniques that aim at bridging this gap. Three issues are discu...

We address the Multi Layer Hierarchical Ring Network Design Problem. The aim of this problem is to connect nodes that are assigned to different layers using a hierarchy of rings of bounded length. We present a multi-commodity flow based mixed integer linear programming formulation and experimentally evaluate it on various graphs. Instances up to 76 nodes and 281 edges could be solved to optimal...

We provide formal matched asymptotic expansions for ancient convex solutions to MCF. The formal analysis leading to the solutions is analogous to that for the generic MCF neck pinch in [1]. For any p, q with p + q = n, p ≥ 1, q ≥ 2 we find a formal ancient solution which is a small perturbation of an ellipsoid. For t→ −∞ the solution becomes increasingly astigmatic: q of its major axes have len...

This paper proposes the first model for toll enforcement optimization on German motorways. The enforcement is done by mobile control teams and our goal is to produce a schedule achieving network-wide control, proportional to spatial and time-dependent traffic distributions. Our model consists of two parts. The first plans control tours using a vehicle routing approach with profits and some side...