Publication

In-Network Packet Scheduling and Rate Allocation: A Content Delivery Perspective

Publications associées (51)

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

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

Evaluating Top-k Queries over Incomplete Data Streams

Karl Aberer, Sebastian Michel, Parisa Haghani

We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addressed research topic in recent years. However, most approaches assume the strea ...

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

Randomized network coding for UEP video delivery in overlay networks

Pascal Frossard, Nikolaos Thomos

This paper presents a receiver-driven video delivery algorithm that exploits a novel Randomized Network Coding (RNC) scheme for unequal error protection (UEP). The main idea of our approach is to account for the unequal importance of media packets in the n ...

2009

Multimodal Data Flow Controller

Danil Korchagin

In this paper, we describe a multimodal data flow controller capable of reading most multichannel sound cards and web cameras, synchronising media streams, being a server to stream captured media over TCP in raw format, being a client to receive media stre ...

Idiap2009

Stretching Gossip with Live Streaming

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. They are also considered highly ﬂexible, namely tunable at will to increase their robustness and adapt to churn. So far however, the ...

2009

Resource allocation and adaptive scheduling for scalable video streaming

Jean-Paul Wagner

The obvious recent advances in areas such as video compression and network architectures allow for the deployment of novel video distribution applications. These have the potential to provide ubiquitous media access to end users. In recent years, applicati ...

EPFL2008

Multiscale video applied to surveillance and video conferencing systems

David Leroux

In the following study is presented two research works: the first is concerned with the elaboration of an intelligent meeting room while the second is about the development of a real time high definition video server capable of advanced accessibility optio ...

EPFL2008

Gossiping Capabilities

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

Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HE ...

2008

A fast local descriptor for dense matching

Pascal Fua, Vincent Lepetit, Engin Tola

We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm and this yields better wide-baseline performance than the commonly used corre ...

2008