Optimal file distribution in peer-to-peer networks
DOI10.1007/978-3-642-25591-5_23zbMATH Open1350.68022OpenAlexW1798588645MaRDI QIDQ3104615FDOQ3104615
Authors: Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.2555
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cited In (17)
- Optimal File Sharing in Distributed Networks
- Overlay architectures for file distribution: Fundamental performance analysis for homogeneous and heterogeneous cases
- Optimal scheduling of peer-to-peer file dissemination
- Fair and distributed peer-to-peer allocation of a common, refillable resource
- The program download problem: complexity and algorithms
- Perfect pipelining for streaming large file in peer-to-peer networks
- Complexity analysis and algorithms for the program download problem
- Give-and-take based peer-to-peer content distribution networks
- Dogfish: decentralized optimistic game-theoretic file sharing
- Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks
- Optimal node-selection algorithm for parallel download in overlay content-distribution networks
- Tight bounds on the upload capacity to enable two-hop delivery in peer-to-peer video streaming systems
- Broadcasting a file in a communication network
- Probing high-capacity peers to reduce download times in P2P file sharing systems with stochastic service capacities
- Structured overlay network for file distribution
- The topology aware file distribution problem
- The topology aware file distribution problem
This page was built for publication: Optimal file distribution in peer-to-peer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104615)