Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems
Related publications (158)
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.
Based on the recent compute-and-forward technique [1], a novel communication strategy is proposed under which functions of the channel state information are forwarded along the network. Those functions are chosen such that on the one hand, they can be effi ...
Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...
Browse Conference Publications > Information Theory and Applic ... Back to Results | Next » Help Random access with physical-layer network coding This paper appears in: Information Theory and Applications Workshop (ITA), 2013 Date of Conference: 10-15 Feb. ...
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 and multicast and/or unicast end- ...
Institute of Electrical and Electronics Engineers2013
In free viewpoint applications, the images are cap- tured by an array of cameras that acquire a scene of interest from different perspectives. Any intermediate viewpoint not included in the camera array can be virtually synthesized by the decoder, at a qua ...
We consider a physical-layer network coding strat- egy for the random-access channel, based on compute-and- forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmiss ...
This work shows how the combination weights of diffusion strategies for adaptation and learning over networks can be chosen in order for the network mean-square-error performance to match that of an optimized centralized (or batch) solution. The results sh ...
Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of geometrically irreducibl ...
Many peer-to-peer communities, including private BitTorrent communities that serve hundreds of thousands of users, utilize credit-based or sharing ratio enforcement schemes to incentivize their members to contribute. In this paper, we analyze the performan ...
Institute of Electrical and Electronics Engineers2013
This paper presents a method for plug-and-play distributed MPC of a network of interacting linear systems. The previously introduced idea of plug and play control addresses the challenge of performing network changes in the form of subsystems that are join ...