Publication

Algebraic gossip on Arbitrary Networks

Shrinivas Kudekar
2009
Conference Papers

Abstract

Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied by Shah et al where a bound to the dissemination time based on the spectral properties of the underlying communication graph is provided. Our contribution is a uniform bound that holds for arbitrary networks.

Official source

Graph Chat

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.

Algebraic gossip on Arbitrary Networks

Chat with Graph Search

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

3D diffractive optics for linear interconnects and nonlinear processing

Fast and Future: Towards Efficient Forecasting in Video Semantic Segmentation