Publication

Practical Network Tomography

Related publications (96)

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.

A Fault-Tolerant Token based Atomic Broadcast Algorithm

André Schiper, Nils Richard Ekwall

Many atomic broadcast algorithms have been published in the last twenty years. Token based algorithms represent a large class of these algorithms. Interestingly, all the token based atomic broadcast algorithms rely on a group membership service and none of ...

2010

Routing and search on large scale networks

Dominique Florian Tschopp

In this thesis, we address two seemingly unrelated problems, namely routing in large wireless ad hoc networks and comparison based search in image databases. However, the underlying problem is in essence similar and we can use the same strategy to attack t ...

EPFL2010

Maximizing the net present value of a project under uncertainty

Daniel Kuhn, Wolfram Wiesemann

We address the maximization of a project’s expected net present value when the activity durations and cash flows are described by a discrete set of alternative scenarios with associated occurrence probabilities. In this setting, the choice of scenario-inde ...

Elsevier2010

Trustful Cumulus Clouds

Rachid Guerraoui, Maysam Yabandeh

Cloud computing offers an appealing business model and it is tempting for companies to delegate their IT services to the cloud. Yet, a company might ﬁnd it risky to do so for sensible services and to depend entirely on a single provider, which can be vulne ...

2010

Distributed Rate Allocation for Network-coded Systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009

Distributed rate allocation for network-coded systems

Christina Fragouli, Amin Jafarian

2009

A method of calculating path observation likelihood from GPS data

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

A method is proposed to probabilistically map location observations to the underlying network. Instead of generating a single path as the map matching algorithms do, this method aims at calculating a likelihood for each potentially true path to have been t ...

2009

A method of probabilistic map distribution of path likelihood

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

A method is proposed to robabilistically map location observations to the underlying network. Instead of generating a single path as the map matching algorithms do, this method aims at calculating a likelihood for each potentially true path to have been th ...

2009

Extended Navigability of Small World Networks: Exact Results and New Insights

Paolo De Los Rios, Cécile Caretta Cartozo

Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a ...

American Physical Society2009

Nonlinear Average Consensus

Martin Hasler, Leonidas Georgopoulos

We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorith ...

IEICE2009