Recherche

Afficher tous les résultats pour

Accueil

Personne

Patrick Thiran

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (104)

Population Size Estimation Using a Few Individuals as Agents

Olivier Dousse, Patrick Thiran, Martin Vetterli, Farid Movahedi Naini

We conduct an experiment where ten attendees of an open-air music festival are acting as Bluetooth probes. We then construct a parametric statistical model to estimate the total number of visible Bluetooth devices in the festival area. By comparing our est ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

The Distributed Multiple Voting Problem

Patrick Thiran, Martin Vetterli, Florence Bénézit

A networked set of agents holding binary opinions does not seem to be able to compute its majority opinion by means of local binary interactions only. However, the majority problem can be solved using two or more bits, instead of one [1]. Pairs of agents a ...

2011

Understanding and Tackling the Root Causes of Instability in Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

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

2011

Towards Unbiased BFS Sampling

Patrick Thiran, Maciej Kurant

Breadth First Search (BFS) is a widely used approach for sampling large graphs. However, it has been empirically observed that BFS sampling is biased toward high-degree nodes, which may strongly affect the measurement results. In this paper, we quantify an ...

Institute of Electrical and Electronics Engineers2011

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Patrick Thiran, Julien Pierre Sacha Herzen

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

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

Patrick Thiran, Ruben Merz, Adel Aziz, Julien Pierre Sacha Herzen

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

2011

Models of 802.11 Multi-Hop Networks: Theoretical Insights and Experimental Validation

Olivier Dousse, Patrick Thiran, Mathilde Durvy, Adel Aziz

Wireless Multi-Hop CSMA/CA Networks are challenging to analyze. On the one hand, their dynamics are complex and rather subtle effects may severely affect their performance. Yet, understanding these effects is critical to operate upper layer protocols, such ...

2011

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

Patrick Thiran, Martin Vetterli, Florence Bénézit

This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip [1]. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any conn ...

IEEE2010

Order-Optimal Consensus Through Randomized Path Averaging

Patrick Thiran, Martin Vetterli, Florence Bénézit

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

Institute of Electrical and Electronics Engineers2010

Self-Synchronizing Properties of CSMA Wireless Multi-hop Networks

Olivier Dousse, Patrick Thiran, Kuang Xu

We show that CSMA is able to spontaneously synchronize transmissions in a wireless network with constant-size packets, and that this property can be used to devise efficient synchronized CSMA scheduling mechanisms without message passing. Using tools from ...

2010

Netscope: Practical Network Loss Tomography

Patrick Thiran, Xuan Hung Nguyen, Maciej Kurant, Denisa Gabriela Ghita, Aikaterini Argyraki

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

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Network Tomography on Correlated Links

Patrick Thiran, Denisa Gabriela Ghita, Aikaterini Argyraki

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

Demo Abstract of Net-Controller: a Network Visualization and Management Tool

Patrick Thiran, Adel Aziz, Julien Pierre Sacha Herzen

Net-Controller is a user-friendly network visualization and management tool developed at EPFL in order to easily retrieve and display in real time network statistics, such as link throughput and queue occupancy from a large testbed composed of wireless rou ...

2010

Interval consensus: from quantized gossip to voting

Patrick Thiran, Martin Vetterli, Florence Bénézit

We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Instead, our algorithm reaches consensus on the quantized interval that contains ...

2009

EZ-Flow: Removing Turbulence in IEEE 802.11 Wireless Mesh Networks without Message Passing

Patrick Thiran, Adel Aziz, Alaeddine El Fawal, David Starobinski

Recent analytical and experimental work demonstrate that IEEE 802.11-based wireless mesh networks are prone to turbulence. Manifestations of such turbulence take the form of large buffer build-up at relay nodes, end-to-end delay fluctuations, and traffic c ...

2009

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

Olivier Dousse, Patrick Thiran, Mathilde Durvy

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

Institute of Electrical and Electronics Engineers2009

On the Fairness of Large CSMA Networks

Olivier Dousse, Patrick Thiran, Mathilde Durvy

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

Institute of Electrical and Electronics Engineers2009

Elucidating the Instability of Random Access Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

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

2009

Balanced relay allocation on heterogeneous unstructured overlays

Patrick Thiran, Xuan Hung Nguyen, Matthias Grossglauser

Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently, adopted proposal to mitigate this problem is to use relay nodes, end-hosts that act as ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

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

Patrick Thiran, Adel Aziz

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

WinMee2008

Page 4 sur 6