Publication

Distributed rate allocation for network-coded systems

Related publications (112)

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.

Renegotiable VBR service

In this work we address the problem of supporting the QoS requirements for applications while efficiently allocating the network resources. We analyse this problem at the source node where the traffic profile is negotiated with the network and the traffic ...

EPFL1999

Failure Detectors: implementation issues and impact on consensus performance

André Schiper, Xavier Défago, Nicoleta Sergent

Due to their nature, distributed systems are vulnerable to failures of some of their parts. Conversely, distribution also provides a way to increase the fault tolerance of the overall system. However, achieving fault tolerance is not a simple problem and r ...

1999

Fault Localization at the WDM Layer

Jean-Yves Le Boudec, Patrick Thiran, Carmen Mas

A single failure in a communication network may trigger many alarms. When the communication network uses optical fibres as transmission medium and increases its capacity by using Wavelength Division Multiplexing (WDM), the number of alarms and the difficul ...

1999

Efficient network transmission of virtual human bodies

Daniel Thalmann, Amaury Aubel, Joaquim Esmerado

Integrating virtual human animation in networked virtual environments (NVEs) has the potential to create severe network load issues. In NVEs, users are represented by their virtual embodiments. The articulated structure of these embodiments introduces a ne ...

1998

A Survey of Distributed Network and Systems Management Paradigms

Jean-Pierre Hubaux, Jean-Philippe Martin-Flatin

Since the mid 1990s, network and systems management has steadily evolved from a centralized paradigm, where all the management processing takes place in a single management station, to distributed paradigms, where management is distributed over a potential ...

1998

Evaluating Latency of Distributed Algorithms Using Petri Nets

Nicoleta Sergent

Evaluating Latency of Distributed Algorithms Using Petri Nets N. Sergent The time it takes to a distributed algorithm to finish (the distributed algorithm latency) cannot be directly measured in asynchronous systems if the algorithm starts and ends on diff ...

1997

An Alarm Filtering Algorithm For Optical Communication Networks

Jean-Yves Le Boudec, Carmen Mas

A single failure in a communication network can trigger many alarms. We propose an alarm filtering algorithm for the management of an optical network using Wavelength Division Multiplexing (WDM). The algorithm supports: (i) multiple failures and (ii) passi ...

1997

An Alarm Filtering Algorithm for Optical Communication Networks

Jean-Yves Le Boudec, Carmen Mas

1997

A Path Selection Method in ATM using Pre-Computation

Jean-Yves Le Boudec, Olivier Crochat

An algorithm that pre-computes a list of routes for each node in the network. An alternate route is also computed in case of overload of the primary one. Simulations show that this algorithm provides routes as good as On-Demand ones. ...

1996

Two variants of the FxLMS algorithm

Ali H. Sayed

We present a time-domain feedback analysis of the FxLMS algorithm, which has been receiving increasing attention in the literature due to its potential application in the active control of noise. In particular, we introduce a generalized FxLMS variant and ...

1995