Analyzing network coding (gossip) made easy

DOI10.1145/2629696MaRDI QIDQ3177799zbMATH OpenOpenAlexFDO

Authors Bernhard Haeupler

Publication date 2 August 2018

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2629696

zbMATH Keywords

dynamic networksmulticastrandom linear network codinggossip

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• Analyzing network coding gossip made easy
• Bounds for algebraic gossip on graphs
• Faster information dissemination in dynamic networks via network coding
• A Random Linear Network Coding Approach to Multicast
• Simple, fast and deterministic gossip and rumor spreading

Cited in

(2)

• Analyzing network coding gossip made easy
• Bounds for algebraic gossip on graphs

This page was built for publication: Analyzing network coding (gossip) made easy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177799)