An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network
From MaRDI portal
(Redirected from Publication:5346432)
Abstract: We consider allcast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected links whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate without network coding.
Recommendations
- Optimal and near-optimal broadcast in random graphs
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Close-to-optimal and near-optimal broadcasting in random graphs
- scientific article; zbMATH DE number 5454665
- Randomized broadcast in networks
- A Random Linear Network Coding Approach to Multicast
- On Randomized Broadcasting in Power Law Networks
This page was built for publication: An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346432)
