Publications de Patrick Thiran

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust mes- sage-passing schemes for distributed information processing over networks. However, for many topologies that are realistic for wire- less ...

Efficient multihop traffic management is a need for successful Wireless Mesh Networks (WMNs) deployment. Using an analogy with fluid mechanism, we classify a flow as laminar if the packets flow smoothly from the Wired Access Point (WAP) over the mesh netwo ...

We consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users grows. Following the physical model of Gupta and Kumar, we show that randomly scattered nodes can achieve the optimal 1/sqrt(n) per-node transmission rate of arbitrarily located nodes. This contrasts with previous achievable results suggesting that a 1/sqrt(n log(n)) reduced rate is the price to pay for the additional randomness introduced into the system. Of independent interest is that

A body of law is an example of a dynamic corpus of text documents that are jointly maintained by a group of editors who compete and collaborate in complex constellations. Our goal is to develop predictive models for this process, thereby shedding light on ...

We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of maybe less throughput. ABE retains the best-effort context by protecting flows that value higher throughput more than low bounded delay, whose packets are marked blue. DSD optimises green traffic performance while satisfying the constraint that blue traffic

Aziala-net is a flexible and scalable experimental testbed for wireless multi-hop networks based on simple off-the-shelf hardware that is able to adapt to various research purposes. It is composed of more than 50 Asus wireless routers that have been adapted to either work as fixed base station or as mobile nodes. After describing the technical details of Aziala-net, we illustrate the potential of the testbed by showing two samples of works that are currently under study in the testbed. The first example foc

We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of maybe less throughput. ABE retains the best-effort context by protecting flows that value higher throughput more than low bounded delay, those packets are marked blue. DSD optimises green traffic performance while satisfying the constraint that blue traffic

Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range to each other have been extensively studied. This paper considers a variation in which a connection between two poi ...

This paper (in Frensh) summarizes recent results obtained by using shot noise processes for two applications in communication networks: first, TCP/IP traffic models for backbone networks; and next the study of connectivity under rate constraints in wireless ad hoc networks.

We develop a channel model for errors originated from over-aggressive operation of a communication link. Such a situation arises in the context of on-chip self-calibrating communication, where a link controller has to determine adaptively the operating voltage and frequency. Based on this channel model, we derive an analytical expression for the undetection error probability of linear codes, and alternating-phase codes, the latter being an extension of the former.

Bayesian Optimization (BO) is a powerful framework for optimizing noisy, expensive-to-evaluate black-box functions. When the objective exhibits invariances under a group action, exploiting these symmetries can substantially improve BO efficiency. While using maximum similarity across group orbits has long been considered in other domains, the fact that the max kernel is not positive semidefinite (PSD) has prevented its use in BO. In this work, we revisit this idea by considering a PSD projection of the max

Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, f ...

Fault identification and location in optical networks must cope with a multitude of factors: (i) the redundancy and the lack of coordination (internetworking) of the managements at the different layers (WDM, SDH/SONET, ATM, IP)

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of the protocol in small network topologie ...

Variance-reduced gradient estimators for policy gradient methods have been one of the main focus of research in the reinforcement learning in recent years as they allow acceleration of the estimation process. We propose a variance-reduced policy-gradient m ...

We propose a mechanism for reliable broadcasting in wireless networks, that consists of two components: a method for bandwidth efficient acknowledgment collection, and a coding scheme that uses acknowledgments. Our approach combines ideas from network codi ...

When an epidemic spreads in a given network of individuals or communities, can we detect its source using only the information provided by a small set of nodes? We propose a general framework that incorporates two dimensions. First, we can either rely excl ...

We investigate both theoretically and experimentally the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that impac ...

We study the impact of interferences on the connectivity of large-scale ad-hoc networks, using percolation theory. We assume that a bi-directional connection can be set up between two nodes if the signal to noise ratio at the receiver is larger than some t ...

We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...

Patrick Thiran

Chattez avec Graph Search

Order-Optimal Consensus Through Randomized Path Averaging

Effect of 802.11 Adaptive Exponential Backoffs on the Fluidity of Downlink Flows in Mesh Networks

Closing the gap in the capacity of random wireless networks

War of Words: The Competitive Dynamics of Legislative Processes

A Novel Scheduler For a Low Delay Service Within Best-Effort

Aziala-net: Deploying a Scalable Multi-hop Wireless Testbed Platform for Research Purposes

A Novel Scheduler for a Low Delay Service Within Best-Effort

Percolation in the signal to interference ratio graph

Deux applications de processus ponctuels aux réseaux de communication

Undetection error probability of linear and alternating-phase codes over the timing error channel

Symmetry-Aware Bayesian Optimization via Max Kernels

Coordinate Descent with Bandit Sampling

Failure Location in WDM Networks

Border effects, fairness, and phase transition in large wireless networks

Momentum-Based Policy Gradient with Second-Order Information

Towards Reliable Broadcasting using ACKs

A General Framework for Sensor Placement in Source Localization

Elucidating the Instability of Random Access Wireless Mesh Networks

Impact of Interferences on Connectivity in Ad Hoc Networks

Budgeted sensor placement for source localization on trees