Algorithms for overlay networks.
From MaRDI portal
Recommendations
Cited in
(21)- On graph-based characteristics of optimal overlay topologies
- Algorithms for next generation networks
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
- A modified algorithm of multiplex networks generation based on overlapped links
- TR-clustering: Alleviating the impact of false clustering on P2P overlay networks
- A fully distributed Lagrangean solution for a peer-to-peer overlay network design problem
- Twins: scalable 2-hop structured overlay network
- Using uncertainty DHT to solve non-transitive connectivity problems in overlay network
- Araneola: a scalable reliable multicast system for dynamic environments
- scientific article; zbMATH DE number 1950682 (Why is no real title available?)
- Merging ring-structured overlay indices: toward network-data transparency
- scientific article; zbMATH DE number 1931790 (Why is no real title available?)
- scientific article; zbMATH DE number 1931808 (Why is no real title available?)
- scientific article; zbMATH DE number 2088142 (Why is no real title available?)
- A generalized algorithm for publish/subscribe overlay design and its fast implementation
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
- Towards fast decentralized construction of locality-aware overlay networks
- Global Computing
- Global Computing
- An adaptive overlay network inspired by social behaviour
- Towards a platform for wide-area overlay network deployment and management
This page was built for publication: Algorithms for overlay networks.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396637)
