Subscribe

Issue No.06 - June (2010 vol.21)

pp: 857-871

Giuseppe Bianchi , Universitá di Roma, Tor Vergata, Rome

Nicola Blefari Melazzi , Universitá di Roma, Tor Vergata, Rome

Lorenzo Bracciale , Universitá di Roma, Tor Vergata, Rome

Francesca Lo Piccolo , Universitá di Roma, Tor Vergata, Rome

Stefano Salsano , Universitá di Roma, Tor Vergata, Rome

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.114

ABSTRACT

In this paper, we propose and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divided in chunks; chunks are delivered by each node in a store-and-forward way. A relaying node starts distributing a chunk only when it has completed its reception from another node. Peers are logically organized in a forest of trees, where each tree includes all peers. The source periodically distributes different chunks to each tree for their delivery. Our key idea consists in employing serial transmission: for each tree, and thus, for each chunk, the source node sends the chunk to its children in series; the same holds for each peer node of the tree, excluding the leaves. Besides this basic idea, the contributions of this paper are: 1) we demonstrate the feasibility of serial transmission over a forest of trees, which is not a trivial problem, unlike the case of parallel transmission; 2) we derive an analytical model to evaluate the system performance; 3) we derive a theoretical bound for the number of nodes reachable in a given time interval or equivalently for the time required to reach a given number of nodes; 4) we prove the optimality of our approach in terms of its capability to reach such bound; and 5) we develop a general simulation package for P2P streaming systems and use it to compare our solution to literature results. Finally, we stress that this paper is focused on the theoretical properties and performance understanding of the proposed distribution algorithm, rather than on its practical implementation in a real system. However, we also briefly describe a practical workable implementation of our algorithm.

INDEX TERMS

Distributed systems, distributed applications, performance of systems, performance attributes.

CITATION

Giuseppe Bianchi, Nicola Blefari Melazzi, Lorenzo Bracciale, Francesca Lo Piccolo, Stefano Salsano, "Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming",

*IEEE Transactions on Parallel & Distributed Systems*, vol.21, no. 6, pp. 857-871, June 2010, doi:10.1109/TPDS.2009.114REFERENCES

- [1] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, "Scalable Application Layer Multicast,"
Proc. ACM SIGCOMM, 2002.- [2] D.A. Tran, K.A. Hua, and T. Do, "ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,"
Proc. IEEE INFOCOM, 2003.- [3] M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "Splitstream: High-Bandwidth Multicast in Cooperative Environments,"
Proc. 19th ACM Symp. Operating Systems Principles, 2003.- [4] X. Zhang, J.C. Liu, B. Li, and P. Yum, "CoolStreaming/DONet: A Data-Driven Overlay Network for Efficient Live Media Streaming,"
Proc. IEEE INFOCOM, 2005.- [5] M. Zhang, Y. Xiong, Q. Zhang, and S. Yang, "On the Optimal Scheduling for Media Streaming in Data-Driven Overlay Networks,"
Proc. IEEE Global Telecomm. Conf. (GLOBECOM), 2006.- [6] N. Magharei and R. Rejaie, "PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming,"
Proc. IEEE INFOCOM, 2007.- [7] F. Pianese, D. Perino, J. Keller, and E. Biersack, "PULSE: An Adaptive, Incentive-Based, Unstructured P2P Live Streaming System,"
IEEE Trans. Multimedia, Special Issue on Content Storage and Delivery in Peer-to-Peer Networks, vol. 9, no. 8, pp. 1645-1660, Dec. 2007.- [8] L. Bracciale, F.L. Piccolo, D. Luzzi, and S. Salsano, "OPSS: An Overlay Peer-to-Peer Streaming Simulator for Large-Scale Networks,"
ACM SIGMETRICS Performance Evaluation Rev., vol. 35, no. 3, 2007.- [9] L. Bracciale, D. Luzzi, F.L. Piccolo, N.B. Melazzi, G. Bianchi, and S. Salsano, "A Theory-Driven Distribution Algorithm for Peer-to-Peer Real Time Streaming,"
Proc. IEEE Global Telecomm. Conf. (GLOBECOM), 2008.- [10] G. Bianchi, N.B. Melazzi, L. Bracciale, F.L. Piccolo, and S. Salsano, "Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming," technical report, http://netgroup. uniroma2.it/p2pstreamline-tech-rep.pdf , 2009.
- [11] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, "SCRIBE: A Large-Scale and Decentralized Application-Level Multicast Infrastructure,"
IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1489-1499, Oct. 2002.- [12] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,"
Proc. IFIP/ACM Int'l Conf. Middleware, 2001.- [13] Y. Liu, "On the Minimum Delay Peer-to-Peer Video Streaming: How Realtime Can It Be?,"
Proc. ACM Int'l Conf. Multimedia, 2007.- [14] R. Kumar, Y. Liu, and K. Ross, "Stochastic Fluid Theory for P2P Streaming Systems,"
Proc. IEEE INFOCOM, 2007.- [15] E.W. Weisstein, "Fibonacci n-Step Number," http://mathworld. wolfram.comFibonaccin-StepNumber.html , 2009.
- [16] E.P. Miles, "Generalized Fibonacci Numbers and Associated Matrices,"
The Am. Math. Monthly, vol. 67, no. 8, pp. 745-752, Oct. 1960.- [17] S. Liu, R. Zhang-Shen, W. Jiang, J. Rexford, and M. Chiang, "Performance Bounds for Peer-Assisted Live Streaming,"
Proc. ACM SIGMETRICS, 2008.- [18] Z. Li, B. Li, D. Jiang, and L.C. Lau, "On Achieving Optimal Throughput with Network Coding,"
Proc. IEEE INFOCOM, 2005.- [19] M. Zhang, Q. Zhang, L. Sun, and S. Yang, "Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?,"
IEEE J. Selected Areas in Comm., vol. 25, no. 9, pp. 1678-1694, Dec. 2007. |