Network coding node placement for delay minimization in streaming overlays
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.
Airlines schedules are built such as to maximize expected profit. Such schedules turn out to be more sensitive to delay propagation and have lower on-time performance. Robust schedules are thus used instead. In this paper, we compare two different approach ...
We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...
In this paper, we consider the problem of streaming video information on lossy packet networks with path and source diversity, such as wireless mesh networks or more generally overlay architectures. We propose to distribute the video information between se ...
The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...
The paper addresses the media-specific rate allocation problem in multipath networks. The streaming rate on each path is determined such that the end- to-end media distortion is minimized, when the receiving client aggregates packets received via multiple ...
We study networks of FIFO nodes, where flows are constrained by arrival curves. A crucial question with these networks is: Can we derive a bound to the maximum delay that a packet can experience when traversing the network, and to the maximum queue size at ...
Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently, adopted proposal to mitigate this problem is to use relay nodes, end-hosts that act as ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
We investigate the problem of collaborative video streaming with Raptor network coding over overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes to increase the overall throughput and improve the ...
The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays. By focusing on agents with integrator dynamics, the accent is put here on the study of the time-delays influence: ...
