Collaborative video streaming with Raptor network coding
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.
Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of interest is the loss rate of individual links. There is a significant body of wo ...
Designing a communication protocol for sensor networks often involves obtaining the "right" trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present th ...
We consider the problem of mesh-pull based video broadcast in peer-to-peer networks. We propose a novel algorithm for constructing the distribution overlay, where peers are arranged in neighborhoods that exhibit similar latency values from the origin media ...
We consider rate-distortion (RD) optimized multi-flow video delivery in unstructured overlay networks. We show that this problem can be studied as a distributed rate allocation. To solve the problem over the participating peers in the overlay, we apply cla ...
In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes per ...
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 ...
The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N >= 1 receivers can also be achieved using pack ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
A method is proposed to robabilistically map location observations to the underlying network. Instead of generating a single path as the map matching algorithms do, this method aims at calculating a likelihood for each potentially true path to have been th ...
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 ...
A method is proposed to probabilistically map location observations to the underlying network. Instead of generating a single path as the map matching algorithms do, this method aims at calculating a likelihood for each potentially true path to have been t ...
