Tight bounds on the upload capacity to enable two-hop delivery in peer-to-peer video streaming systems

DOI10.1142/S0129054120500124MaRDI QIDQ4983544zbMATH OpenOpenAlexFDO

Authors Hironori Ando, Satoshi Fujita

Publication date 20 April 2021

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054120500124

zbMATH Keywords

low latency video streamingmultiple treeP2Ptight lower bound

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Recommendations

• Performance tradeoffs in structured peer to peer streaming
• Optimal peer-to-peer network for streaming multimedia broadcast
• PPPC--peer-2-peer streaming and algorithm for creating spanning trees for peer-2-peer networks
• Optimal serial broadcast of successive chunks
• Optimal file distribution in peer-to-peer networks

Cites work

• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• Optimal serial broadcast of successive chunks

Cited in

(1)

• Peer-to-Peer Streaming Capacity

Describes a project that uses

Uses Software

• SCRIBE

This page was built for publication: Tight bounds on the upload capacity to enable two-hop delivery in peer-to-peer video streaming systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983544)