Piece selection algorithms for layered video streaming in P2P networks
From MaRDI portal
(Redirected from Publication:2440125)
Recommendations
- Optimizing the quality of scalable video streams on P2P networks
- Optimum piece selection strategies for a peer-to-peer video streaming platform
- Data allocation algorithms in layered P2P streaming
- Optimal and heuristic network coding algorithms for multi-layered video broadcast
- A robust P2P streaming architecture and its application to a high quality live-video service
Cites work
- Discrete-variable extremum problems
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2043492 (Why is no real title available?)
- Unbounded knapsack problem: Dynamic programming revisited
Cited in
(7)- Optimal node-selection algorithm for parallel download in overlay content-distribution networks
- LVMSR: An efficient algorithm to multicast layered video.
- Optimizing the quality of scalable video streams on P2P networks
- A distributed dynamic super peer selection method based on evolutionary game for heterogeneous P2P streaming systems
- A dynamic SGP selection algorithm based on evolutionary game for hybrid P2P streaming system
- Optimum piece selection strategies for a peer-to-peer video streaming platform
- Data allocation algorithms in layered P2P streaming
This page was built for publication: Piece selection algorithms for layered video streaming in P2P networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440125)