Publication

Functional Forwarding of Channel State Information

Related publications (95)

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.

Information Flow Decomposition for Network Coding

Christina Fragouli, Emina Soljanin

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

2004

Decentralized Network Coding

Christina Fragouli, Emina Soljanin

This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the ...

2004

Connectivity vs Capacity in Dense Ad Hoc Networks

Patrick Thiran, Olivier Dousse

We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuat ...

2004

Network Availability Based Service Differentiation

Patrick Thiran, Mathilde Durvy

Numerous approaches have been proposed to manage Quality of Service in the Internet. However, none of them was successfully deployed in a commercial IP backbone, mostly because of their complexity. In this paper, we take advantage of the excess network ban ...

2003

Strategic maintenance and renewal policy of a railway corridors, taking into account the value of capacity

Yves Putallaz

The paper presents a research 1that aims to develop a methodology that supports the elaboration and the optimisation of long term maintenance and renewal policies for railway infrastructure (strategic planning level, up to 20 years). The elaboration proces ...

2003

Oxygen diffusion through the disordered oxide network during silicon oxidation

Alfredo Pasquarello, Angelo Bongiorno

An atomic-scale description is provided for the long-range oxygen migration through the disordered SiO2 oxide during silicon oxidation. First-principles calculations, classical molecular dynamics, and Monte Carlo simulations are used in sequence to span th ...

2002

A Protection-based Approach to QoS in Packet over Fiber Networks

Patrick Thiran

We propose a novel approach to Quality of Service, intended for IP over SONET (or IP over WDM) networks, that offers end-users the choice between two service classes defined according to their level of transmission protection. The first service class (call ...

2001

A Proven Delay Bound for a Network with Aggregate Scheduling

Jean-Yves Le Boudec

We consider a network implementing scheduling per aggregate flow. We show that the derivation of bounds that was published in [1] is false. We give a worst case bound which is valid for any network topology, given the maximum hop count for every flow and t ...

2000

Optimal smoothing for guaranteed service

Jean-Yves Le Boudec, Olivier Verscheure

We consider the transmission of variable bit rate (VBR) video over a network offering a guaranteed service such as ATM VBR or the guaranteed service of the IETF. The guaranteed service requires that the flow accepted by the network has to be conforming wit ...

2000

Scalable Content-aware Request Distribution in Cluster-based Network Servers

Willy Zwaenepoel

In network (e.g., Web) servers, it is often desirable to isolate the performance of different classes of requests from each other. That is, one seeks to achieve that a certain minimal proportion of server resources are available for a class of requests, in ...

2000