Concept

Limitation de bande passante

Publications associées (90)

Utility-based Packet Scheduling in P2P Mesh-based Multicast

We consider streaming video content over an overlay network of peer nodes. We propose a novel streaming strategy that is built on utility-based packet scheduling and proportional resource sharing in order to fight against free- riders. Each of the peers em ...

2009

Delay-based overlay construction in P2P video broadcast

Pascal Frossard

We consider streaming video content over an overlay network of peer nodes. Each of the nodes employs a mesh-pull mechanism to organize the download of data units from its neighbours. We propose a novel algorithm for constructing the distribution overlay, w ...

2009

Heterogeneous Gossip

Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Davide Frey

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distribut ...

2009

Design Considerations of Bandwidth Reconfigurable Input Multiplexers

Marco Letizia

In this paper consideration is given to the design of bandwidth (and frequency) reconfigurable input multiplexers. Different channel filter architectures are discussed and important RF parameters including spectral efficiency and cochannel interference are ...

2008

Loss-resilient window-based congestion control

Pascal Frossard, Christophe De Vleeschouwer

This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window-based congestion control to support non-congestion related losses. We invest ...

2008

Distributed Sender-Driven Video Streaming

Pascal Frossard

A system for sender-driven video streaming from multiple servers to a single receiver is considered in this paper. The receiver monitors incoming packets on each network path and returns, to the senders, estimates of the available bandwidth on all the netw ...

INTEL2006

Convergence analysis for sequential Monte Carlo receivers in communications applications

Volkan Cevher

Recently, sequential Monte Carlo methods have been used in the telecommunications field, finding application in receiver design. Several properties of these receivers make their designs very attractive. These receivers do not require channel state informat ...

2006

A Multi-Path Routing Strategy with Guaranteed In-order Packet Delivery and Fault Tolerance for Networks on Chips

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali

In this work we present a multi-path routing strategy that guarantees in-order packet delivery for Networks on Chips (NoCs). We present a design methodology that uses the routing strategy to optimally spread the traffic in the NoC to minimize the network b ...

2006

Streaming of Scalable Video from Multiple Servers using Rateless Codes

Pascal Frossard, Jean-Paul Wagner

This paper presents a framework for efficiently streaming scalable video from multiple servers over heterogeneous network paths. We propose to use rateless codes, or Fountain codes, such that each server acts as an independent source, without the need to c ...

2006

A Bandwidth Sharing Approach to Improve Licensed Spectrum Utilization

Panagiotis Papadimitratos

The spectrum of deployed wireless cellular communication systems is found to be under-utilized, even though licensed spectrum is at a premium. To efficiently utilize the bandwidth left unused in a cellular system, which we denote as the primary system (PRI ...

2005

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