Gilles Tredan

Gilles Tredan

Auto-generated profile, based on publicly available information

Gilles Tredan

LAAS-CNRS, Toulouse, Occitanie, FRANCE

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 April 2018 in ACM SIGCOMM Computer Communication Review
Verified
Journal Article
Open access
PDF file
KFKlaus-Tycho Foerster
Klaus-Tycho Foerster
YPYvonne-Anne Pignolet
Yvonne-Anne Pignolet
SSStefan Schmid
Stefan Schmid
GTGilles Tredan
Gilles Tredan
Network failures are frequent and disruptive, and can significantly reduce the throughput even in highly connected and regular networks such as datacenters. While many modern networks support some kind of local fast failover to quickly reroute flows encountering link failures to new paths, employing such mechanisms is known to be non-trivial, as conditional failover rules can only depend on local failure information. While over the last years, important insights have been gained on how to design failover schemes providing high resiliency, existing approaches have the shortcoming that the resulting failover routes may be unnecessarily long, i.e., they have a large stretch compared to the original route length. This is a serious drawback, as long routes entail higher latencies and introduce loads, which may cause the rerouted flows to interfere with existing flows and harm throughput. This paper presents the first deterministic local fast failover algorithms providing provable resiliency and failover route lengths, even in the presence of many concurrent failures. We present stretch-optimal failover algorithms for different network topologies, including multi-dimensional grids, hypercubes and Clos networks, as they are frequently deployed in the context of HPC clusters and datacenters. We show that the computed failover routes are optimal in the sense that no failover algorithm can provide shorter paths for a given number of link failures.

28 September 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
MBMichael Borokhovich
Michael Borokhovich
YPYvonne-Anne Pignolet
Yvonne-Anne Pignolet
SSStefan Schmid
Stefan Schmid
GTGilles Tredan
Gilles Tredan
Reliable and highly available computer networks must implement resilient fast rerouting mechanisms: upon a link or node failure, an alternative route is determined quickly, without involving the network control plane. Designing such fast failover mechanisms capable of dealing with multiple concurrent failures, however, is challenging, as failover rules need to be installed proactively, i.e., ahead of time, without knowledge of the actual failures happening at runtime. Indeed, only little is known today about the design of resilient routing algorithms. This paper introduces a general framework to reason about and design local failover algorithms that minimize the resulting load after failover on dense networks, beyond destination-based routing. We show that due to the inherent locality of the failover decisions at runtime, the problem is fundamentally related to the field of distributed algorithms without coordination. We derive an intriguing lower bound on the inherent network load overhead any local fast failover scheme that will introduce in the worst case, even though globally seen, much more balanced traffic allocations exist. We then present different randomized and deterministic failover algorithms and analyze their overhead load. In particular, we build upon the theory of combinatorial designs and develop a novel deterministic failover mechanism based on symmetric block design theory, which tolerates a maximal number of link failures while ensuring low loads.

1 January 2024
Verified
Book Chapter
Open access
EMErwan Le Merrer
Erwan Le Merrer
CPCamilla Penzo
Camilla Penzo
GTGilles Tredan
Gilles Tredan
LVLucas Verney
Lucas Verney
The decision-making algorithms embedded within online platforms are determining content shown to users. This personalization steers the dissemination of information, in contrast with the idea of a universal World Wide Web. Personalization thus generates a combinatorial explosion of different versions of the web, rendering each user’s experience distinct. This raises critical questions: what elements of a personalized web should be archived? How can the collected user journeys capture a representative picture of our times? Navigating personalization is essential to capture the contemporary web experience, yet it presents methodological and technical challenges. In this chapter, we identify key challenges in performing a representative sampling of personalization within online platforms.

22 July 2026 in Communications of the ACM
Verified
Journal Article
Open access
EMErwan Le Merrer
Erwan Le Merrer
GTGilles Tredan
Gilles Tredan
Shifting the central focus in AI auditing from assuming truthful model responses to considering the antagonistic interests of an auditor and the AI model being scrutinized.