We consider a routing overlay in which the delay of a path can be obtained at some fixed
cost by sending probe packets, and investigate the joint minimization of the probing cost and …

Finding a maximum-weight matching is a classical and well-studied problem in computer
science, solvable in cubic time in general graphs. We introduce and consider in this work the …

We consider the SFC embedding (SFCE) problem in the Slice as a Service (SlaaS) model.
In this model, a slice provider leases resources from multiple cloud and network providers in …

In this dissertation, we focus on large-scale infectious disease screening in dynamic and
highly variable environments. Large-scale screening is crucial to any well-functioning …

La forte variabilité des trafics est devenue l'un des problèmes majeurs auxquels doivent
faire face les gestionnaires d'infrastructures réseau. Dans ces conditions, l'optimisation du …

This document describes the proposed approach for shielding distributed services deployed
in multiple clouds from path outages and performance degradations of the Internet. This …

We model the tradeoff between the monitoring costs and gain in throughput for overlay-
based routing in the Internet. A Markovian model is shown to fit the real throughput traces …

PANACEA D4.3 Deliverable Page 1 Grant Agreement No.: 610764 Instrument:
Collaborative Project Call Identifier: FP7-ICT-2013-10 PANACEA Proactive Autonomic …

La mesure de la performance des réseaux informatiques est un élément crucial pour
l'administration, la sécurisation et l'optimisation des réseaux. Des changements inattendus …

Séminaire STORE [0.5cm] Parsimonious Active Monitoring and Overlay Routing Page 1
Séminaire STORE Parsimonious Active Monitoring and Overlay Routing Olivier Brun LAAS–CNRS …