Person

Patrick Thiran

Graph Chatbot

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.

Impact of Interferences on Connectivity in Ad Hoc Networks

Patrick Thiran, Olivier Dousse

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 reception is larger than some thre ...

2003

Network Availability Based Service Differentiation

Patrick Thiran, Mathilde Durvy

Numerous approaches have been proposed to manage Quality of Service in the Internet. However, none of them was successfully deployed in a commercial IP backbone, mostly because of their complexity. In this paper, we take advantage of the excess network ban ...

2003

Modeling Internet backbone traffic at the flow level

Patrick Thiran

Our goal is to design a traffic model for non congested IP backbone links, which is simple enough to be used in network operation, while being as general as possible. The proposed solution is to model the traffic at the flow level by a Poisson shot-noise p ...

2003

Measurement and Analysis of Single-Hop Delay on an IP Backbone Network

Patrick Thiran

We measure and analyze the single-hop packet delay through operational routers in the Sprint Internet protocol (IP) backbone network. After presenting our delay measurements through a single router for OC-3 and OC-12 link speeds, we propose a methodology t ...

2003

Connectivity in ad-hoc and hybrid networks

Patrick Thiran, Martin Hasler, Olivier Dousse

We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where f ...

2002

Min-plus System Theory Applied to Communication Networks

Jean-Yves Le Boudec, Patrick Thiran

Network Calculus is a set of recent developments, which provide a deep insight into flow problems encountered in networking. It can be viewed as the system theory that applies to computer networks. Contrary to traditional system theory, it relies on max-pl ...

2002

Network Calculus

Jean-Yves Le Boudec, Patrick Thiran

Network Calculus is a collection of results based on Min-Plus algebra, which applies to deterministic queuing systems found in communication networks. It can be used for example to understand - the computations for delays used in the IETF guaranteed servic ...

Springer Verlag2001

Network Calculus applied to Optimal Multimedia Smoothing

Jean-Yves Le Boudec, Patrick Thiran, Frédéric Worm

We consider a scenario where multimedia data are sent over a network offering a guaranteed service. A smoothing device writes the stream into a transmitting device with limited input buffer ...

2001

ABE: providing a low-delay service within best effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

Alternative best effort (ABE) is a novel service for IP networks, which relies on the idea of providing low delay at the expense of possibly less throughput. The objective is to retain the simplicity of the original Internet single-class best-effort servic ...

2001

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

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

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

2001