Optimal File Sharing in Distributed Networks
From MaRDI portal
Recommendations
Cited in
(15)- General information dispersal algorithms
- Competitive distributed file allocation.
- Dogfish: decentralized optimistic game-theoretic file sharing
- Broadcasting a file in a communication network
- Optimal seamless self-assembly of files in linear networks
- Approximation algorithms for covering/packing integer programs
- Structured overlay network for file distribution
- Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks
- The topology aware file distribution problem
- Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Three optimisations for sharing
- Approximation algorithms for stochastic and risk-averse optimization
- Region-based fault-tolerant distributed file storage system design in networks
- On the stability of two-chunk file-sharing systems
This page was built for publication: Optimal File Sharing in Distributed Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4326860)