Broadcasting in unstructured peer-to-peer overlay networks
From MaRDI portal
Publication:2368962
Recommendations
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
- On coverage bounds of unstructured peer-to-peer networks
- PercolationNET: A multi-tree P2P overlay network supporting high coverage search
- Fault-tolerant routing in peer-to-peer systems
Cites work
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- Collective dynamics of `small-world' networks
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- NEIGHBOR AWARE ADAPTIVE POWER FLOODING (NAAP) IN MOBILE AD HOC NETWORKS
- The small-world phenomenon: an algorithmic perspective
Cited in
(8)- scientific article; zbMATH DE number 6469246 (Why is no real title available?)
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
- scientific article; zbMATH DE number 2043436 (Why is no real title available?)
- On coverage bounds of unstructured peer-to-peer networks
- Reliable and efficient way to broadcast messages in a group by trust-based broadcast (TBB) scheme
- scientific article; zbMATH DE number 2144119 (Why is no real title available?)
- PercolationNET: A multi-tree P2P overlay network supporting high coverage search
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
This page was built for publication: Broadcasting in unstructured peer-to-peer overlay networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368962)