CliqueStream: an efficient and fault-resilient live streaming network on a clustered peer-to-peer overlay
Shah Asaduzzaman, Ying Qiao, Gregor v. Bochmann

TL;DR
This paper presents CliqueStream, a peer-to-peer live streaming network that combines proximity-aware overlay construction with fault resilience, improving efficiency and robustness in multimedia streaming.
Contribution
It introduces a novel overlay network using clique-based clustering to enhance efficiency and fault tolerance in peer-to-peer live streaming.
Findings
Efficient data transmission with minimal latency.
Robustness against node failures with low outage time.
Good locality properties demonstrated through simulation.
Abstract
Several overlay-based live multimedia streaming platforms have been proposed in the recent peer-to-peer streaming literature. In most of the cases, the overlay neighbors are chosen randomly for robustness of the overlay. However, this causes nodes that are distant in terms of proximity in the underlying physical network to become neighbors, and thus data travels unnecessary distances before reaching the destination. For efficiency of bulk data transmission like multimedia streaming, the overlay neighborhood should resemble the proximity in the underlying network. In this paper, we exploit the proximity and redundancy properties of a recently proposed clique-based clustered overlay network, named eQuus, to build efficient as well as robust overlays for multimedia stream dissemination. To combine the efficiency of content pushing over tree structured overlays and the robustness of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
