Publication

Balanced relay allocation on heterogeneous unstructured overlays

Related publications (32)

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.

Medial axis approximation from inner Voronoi balls: A demo of the Mesecina tool

Mark Pauly

We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general approximation method that builds on the same idea, namely, to approximate the ...

2007

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...

2007

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi

2007

Self-organizing structured peer-to-peer overlay networks

A peer-to-peer overlay network is a logical network, built on top of a physical network. In contrast to classical client-server distributed architectures, peer-to-peer overlay networks allow location of resources without centralized control. Existing overl ...

EPFL2006

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

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

Indexing data-oriented overlay networks

Karl Aberer, Manfred Hauswirth, Anwitaman Datta, Roman Schmidt

We address the problem of how a data-oriented, structured overlay networks can be constructed efficiently from scratch in a self-organized way, a problem that has so far not been addressed in the literature. This problem occurs when using overlay networks ...

2005

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005

Theory and methodology for estimation and control of errors due to modeling, approximation, and uncertainty

Fabio Nobile

The reliability of computer predictions of physical events depends on several factors: the mathematical model of the event, the numerical approximation of the model, and the random nature of data characterizing the model. This paper addresses the mathemati ...

Elsevier2005

A new relaying scheme for cheap wireless relay nodes

Ramin Khalili

In this paper we will propose a relaying scheme for wireless multi-hop networks. It is based on collaboration of intermediate relays at network layer to forward useful side information in place of dumbly forwarding packets. In our scheme we assume that the ...

2005