Publication

Distributed rate allocation for network-coded systems

Related publications (112)

Optimizing Streaming Applications with Self-Interested Users using MDPOP

In this paper we deal with the problem of optimally placing a set of query operators in an overlay network. Each user is interested in performing a query on streaming data and each query has an associated set of in-network operators that filter, aggregate ...

2006

New approaches for virtual private network design

Friedrich Eisenbrand

Virtual private network design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent the amount of flow that a node can send to and receive from the network. The ...

2005

An improved approximation algorithm for virtual private network design

Friedrich Eisenbrand

Virtual private network design deals with the reservation of capacities in a network, such that the nodes can share communication. Each node in the network has associated upper bounds on the amount of flow that it can send to the network and receive from t ...

2005

Structure from motion in dynamic scenes with multiple motions

Engin Tola

In this study, an algorithm is proposed to solve the multi-body structure from motion (SfM) problem for the single camera case. The algorithm uses the epipolar criterion to segment the features belonging to independently moving objects. Once the features a ...

2005

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2005

Synchronizing Method for Impulse Radio Network

Jean-Yves Le Boudec, Alaeddine El Fawal

In IR (Impulse Radio) network, the conventional synchronization (also called signal acquisition) method becomes inefficient and results in a certain failure of synchronization when concurrent transmissions are allowed without controlling their powers. The ...

2005

Synchronizing Method for Impulse Radio Network

Jean-Yves Le Boudec, Alaeddine El Fawal

2005

Large scale selective event dissemination

Sidath Handurukande

Event-based systems usually denote distributed infrastructures that are used to asynchronously disseminate information among geographically distant computing units. In these systems, the information sources (a.k.a. publishers) produce events and the system ...

EPFL2005

Minimizing Generalized Buchi Automata

Sudeep Juvekar

We consider the problem of minimization of generalized Buchi automata. We show how to extend fair simulation and delayed simulation to the case where the Buchi automaton has multiple acceptance conditions. For fair simulation, we show how to efficiently co ...

2005

Consensus with Unknown Participants or Fundamental Self-Organization

André Schiper, David Cavin, Yoav Sasson

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...

2004

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.