Abstract | ||
---|---|---|
In Peer-to-Peer (P2P) video streaming systems, a stream of chunks is delivered from the source to all participant peers by utilizing upload bandwidth of the participants. The given stream is generally divided into several sub-streams and those sub-streams are delivered through different spanning trees. In this paper, we consider the delivery of a sub-streams to n subscribers through a spanning trees of depth two each. We call such a delivery of sub-streams a 2-hop delivery of the given video stream. The main contribution of the current paper is that it completely identifies a function Θ(a,n) such that the 2-hop delivery of a sub-streams to n subscribers is possible if and only if the upload bandwidth of each peer is at least Θ(a,n). |
Year | DOI | Venue |
---|---|---|
2016 | 10.1109/CANDAR.2016.0018 | 2016 Fourth International Symposium on Computing and Networking (CANDAR) |
Keywords | Field | DocType |
P2P video streaming,multiple tree,2-hop delivery of video stream,tight lower bound | Homogeneous,Upper and lower bounds,Computer science,Video streaming,Upload,Computer network,Network topology,Bandwidth (signal processing),Spanning tree,Hop (networking),Distributed computing | Conference |
ISSN | ISBN | Citations |
2379-1888 | 978-1-5090-2656-2 | 1 |
PageRank | References | Authors |
0.37 | 11 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hironori Ando | 1 | 18 | 3.50 |
Satoshi Fujita | 2 | 46 | 18.99 |