Publications by Patrick Thiran

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.

Understanding the large-scale structural network formed by neurons is a major challenge in system neuroscience. A detailed connectivity map covering the entire brain would therefore be of great value. Based on diffusion MRI, we propose an efficient methodo ...

We present Asymmetric Best-Effort, a novel service to provide a throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-time applications such as interactive audio, receive more losses during bouts of congestion than blue ones. In return, they receive less delay jitter. Both green and blue services are best-effort. The incentive to choose one or other is based on the nature

The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a single edge to t ...

Source localization in graphs involves identifying the origin of a phenomenon or event, such as an epidemic outbreak or a misinformation source, by leveraging structural graph properties. One key concept in this context is the metric dimension, which quant ...

The metric backbone of a weighted graph is the union of all-pairs shortest paths. It is obtained by removing all edges

(u,v)

that are not the shortest path between

u

and

v

. In networks with well-separated communities, the metric backbone tends to pre ...

The goal of jointly providing efficiency and fairness in wireless networks can be seen as the problem of maximizing a given utility function. In contrast with wired networks, the capacity of wireless networks is typically time-varying and not known explici ...

Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology connected. Such a mapping is called survivable. Finding a survivable mapping is known to be NP-complete, making it impossible in practice to assess the existence or absence of such a mapping for large networks. (i) We first introduce a new concept of piecewise survivability, which makes the problem much easier, and allows us to f

We propose a system and method for providing a throughput versus delay differentiated service for IP packets. We distinguish two types of traffic: type A and type B. It is expected that type A traffic receives less throughput per flow than type B. On the other hand, type A packets experience considerably smaller delay. The method is intended to be implemented in Internet routers. No bandwidth or buffer reservation is assumed in this system. The service remains a Best Effort service, thus supporting flat

Simultaneous link failures are common in IP networks \cite{Markopoulou04}. In this paper, we develop a technique for locating multiple failures in Service Provider or Enterprise IP networks using active measurement. We propose a two-phased approach that minimizes both the additional traffic due to probe messages and the measurement infrastructure costs. In the first phase, using elements from max-plus algebra theory, we show that the optimal set of probes can be determined in polynomial time, and we provide

We analyze some queueing problems arising in guaranteed service and controlled load networks using min-plus algebra. We find an explicit representation for the sub-additive closure of the minimum of two operators, and we introduce a new, useful family of idempotent, time-varying, and min-plus linear operators. We model queueing systems arising in networks networks as non-linear min-plus systems that can be bounded by linear systems, and apply our concepts to: the optimal shaper studied by Anantharam and Kon

We propose a system and method for providing a ``throughput versus delay'' differentiated service for IP packets. We distinguish two types of traffic: type A and type B. It is expected that type A traffic receives less throughput per flow than type B. On the other hand, type A packets experience considerably smaller delay. The method is intended to be implemented in Internet routers. No bandwidth or buffer reservation is assumed in this system. The service remains a Best Effort service, thus supporting flat

Decentralized medium access control schemes for wireless networks based on CSMA/CA, such as the IEEE 802.11 protocol, are known to be unfair. In multihop networks, they can even favor some links to such an extent that the others suffer from virtually compl ...

For Graph Neural Networks, oversmoothing denotes the homogenization of vertex embeddings as the number of layers increases. To better understand this phenomenon, we study community detection with a linearized Graph Convolutional Network on the Contextual S ...

We propose Alternative Best-Effort (ABE), a novel service for IP networks, which relies on the idea of providing low-delay at the expense of maybe less throughput. The objective is to retain the simplicity of the original Internet single class, best effort service, while providing low delay to interactive, adaptive applications. With ABE, every best effort packet is marked as either green or blue. Green packets are guaranteed a low bounded delay in every router. In exchange, green packets are more likely to

The European Union law-making process is an instance of a peer- production system. We mine a rich dataset of law edits and intro- duce models predicting their adoption by parliamentary committees. Edits are proposed by parliamentarians, and they can be in ...

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 ...

We propose a novel approach to Quality of Service, intended for IP over SONET (or IP over WDM) networks, that offers end-users the choice between two service classes defined according to their level of transmission protection. The first service class (called Fully Protected (FP)) offers end-users a guarantee of survivability: all FP traffic is protected in the case of a (single) failure. The second service class (called Best-Effort Protected (BEP)) does not offer any specific level of protection but is chea

We present Netscope, a tomographic technique that infers the loss rates of network links from unicast end-to-end measurements. Netscope uses a novel combination of first- and second-order moments of end-to-end measurements to identify and characterize the ...

Crowdfunding websites such as Kickstarter are becoming increasingly popular, allowing project creators to raise hundreds of millions of dollars every year. However, only one out of two Kickstarter campaigns reaches its funding goal and is successful. It is ...

Patrick Thiran

Chat with Graph Search

Mapping Human Whole-Brain Structural Networks with Diffusion MRI

The Asymmetric Best-Effort Service

Asymmetric Best Effort Service for Packet Networks

On the robustness of the metric dimension of grid graphs to adding a single edge

Reducing Sensor Requirements by Relaxing the Network Metric Dimension

Why the Metric Backbone Preserves Community Structure

Enhance & Explore: an Adaptive Algorithm to Maximize the Utility of Wireless Networks

On Survivable Routing of Mesh Topologies in IP-over-WDM Networks

Asymmetric Best Effort Service for Packet Networks

Active measurement for multiple link failure diganosis in IP networks

Network Calculus viewed as a Min-plus System Theory

Asymmetric Best Effort Service for Packet Networks

Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness

Optimal performance of Graph Convolutional Networks on the Contextual Stochastic Block Model

ABE: Providing a Low-Delay Service within best-effort

War of Words II: Enriched Models of Law-Making Processes

Network Tomography on Correlated Links

A Protection-based Approach to QoS in Packet over Fiber Networks

Netscope: Practical Network Loss Tomography

Launch Hard or Go Home! Predicting the Success of Kickstarter Campaigns