Concept

Best effort (réseau)

Publications associées (60)

Field effect modulated nanofluidic diode membrane based on Al2O3/W heterogeneous nanopore arrays

Jürgen Brugger, Philippe Renaud, Arnaud Bertsch, Fabien Patrick Wildhaber, Songmei Wu

We developed Al2O3/W heterogeneous nanopore arrays for field effect modulated nanofluidic diodes. They are fabricated by transferring self-organized nanopores of anodic aluminium oxide into a W thin film. The nanopores are ∼20 nm in diameter and 400 nm in ...

American Institute of Physics2013

Network coding node placement for delay minimization in streaming overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...

2010

QoS-ocMPI: QoS-aware on-chip Message Passing Library for NoC-based Many-Core MPSoCs

Giovanni De Micheli, Federico Angiolini, Jaime Joven Murillo

Homogeneous and heterogeneous NoC-based manycore MPSoCs are becoming widespread in many application areas. The diversity and spare network traffic characteristics generated by the IPs makes mandatory to provide certain Quality of Service (QoS) support for ...

2010

Mobility-Centric Geocasting For Mobile Partitioned Networks

We describe our design of a geocast service for mobile partitioned networks (MPNs). We focus mainly on minimizing the delivery latency. Our approach exploits the time-stability of the collective mobility pattern. In MPNs, in contrast to MANETs, the end-to- ...

IEEE2008

Balanced multiple description coding in image communications

Ivana Radulovic

Latest developments in video coding technology on one side, and a continuous growth in size and bandwidth in lossy networks on the other side, have undoubtedly created a whole new world of multimedia communications. However, nowadays networks, which are be ...

EPFL2008

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

2007

MFACE: A Multicast Backbone-Assisted Face Traversal Algorithm for Arbitrary Planar Ad Hoc and Sensor Network Topologies

François Ingelrest

Face is a well-known localized routing protocol for ad hoc and sensor networks which guarantees delivery of the message as long as a path exists between the source and the destination. This is achieved by employing a left/right hand rule to route the messa ...

2007

The Perfectly-Synchronized Round-based Model of Distributed Computing

Rachid Guerraoui, Bastian Pochon

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy.We describe a technique to automatically transform ...

2007

Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels

Sanket Dusad

In this paper, we present an efficient protocol for the delay-limited fading ARQ single relay half duplex channel. The source is using an ARQ retransmission protocol to send data to the relay and the destination. When the relay is able to decode, both the ...

2007

Packet Media Streaming with Imprecise Rate Estimation

Pascal Frossard, Dan Jurca

We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...

2007

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search