Publication

Global, Passive Detection of Connection Tampering

Related publications (61)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A NICE Way to Test OpenFlow Applications

Dejan Kostic, Marco Canini, Peter Peresini, Jennifer Rexford

The emergence of OpenFlow-capable switches enables exciting new network functionality, at the risk of programming errors that make communication less reliable. The centralized programming model, where a single controller program manages the network, seems ...

2012

The effect of variability of urban systems characteristics in the network capacity

Nikolaos Geroliminis, Burak Boyaci

Recent experimental analysis has shown that some types of urban networks exhibit a low scatter reproducible relationship between average network flow and density, known as the macroscopic fundamental diagram (MFD). It has also been shown that heterogeneity ...

Elsevier2012

Practical Network Tomography

Denisa Gabriela Ghita

In this thesis, we investigate methods for the practical and accurate localization of Internet performance problems. The methods we propose belong to the field of network loss tomography, that is, they infer the loss characteristics of links from end-to-en ...

EPFL2012

Traffic Anomaly Detection and Diagnosis on the Network Flow Level

Marc Philippe Stöcklin

Monitoring traffic events in computer network has become a critical task for operators to maintain an accurate view of a network's condition, to detect emerging security threats, and to safeguard the availability of resources. Conditions detrimental to a n ...

EPFL2011

On the capacity of non-coherent network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Soheil Mohajerzefreh

We consider the problem of multicasting information from a source to a set of receivers over a network where interme- diate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoher ...

2011

On the Capacity of Noncoherent Network Coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoheren ...

Institute of Electrical and Electronics Engineers2011

Is Your OpenFlow Application Correct?

Marco Canini, Peter Peresini

OpenFlow enables third-party programs to dynamically reconfigure the network by installing, modifying and deleting packet processing rules as well as collecting statistics from individual switches. But how can we know if such programs are correct? While th ...

2011

Relational network-service clustering analysis with set evidences

Boi Faltings, Li Pu

Network administrators are faced with a large amount of network data that they need to sift through to analyze user behaviors and detect anomalies. Through a network monitoring tool, we obtained TCP and UDP connection records together with additional infor ...

2010

Network coding node placement for delay minimization in streaming overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...

2010

Network Tomography on Correlated Links

Patrick Thiran, Denisa Gabriela Ghita

Network tomography establishes linear relationships between the characteristics of individual links and those of end-to-end paths. It has been proved that these relationships can be used to infer the characteristics of links from end-to-end measurements, p ...

2010