Abstract
In this paper, we devise a streaming scheme, called iStream, to achieve the minimum average end-to-end P2P streaming delay by optimally allocating the bandwidth resource among peers. We first develop a generic analytical framework to model the minimum average delay P2P streaming problem, called the MADPS problem. We then present iStream to solve the MADPS problem. The core part of iStream is a fast approximation algorithm, called iStream-APX, based on primal-dual schema. We prove that the performance of iStream-APX is bounded by a ratio of 1 + ω, where ω is an adjustable input parameter. Furthermore, we show that the flexibility of ω provides a trade-off between the approximation factor and the running time of iStream.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tomozei, D.-C., Massoulie, L.: Flow control for cost-efficient peer-to-peer streaming. In: 2010 Proceedings IEEE INFOCOM, 14-19, pp. 1–9 (2010)
Sentinelli, A., Marfia, G., Gerla, M., Kleinrock, L., Tewari, S.: Will IPTV ride the peer-to-peer stream? IEEE Communications Magazine 45(6), 86–92 (2007)
Liu, Z., Shen, Y., Panwar, S.S., Ross, K.W., Wang, Y.: Using layered video to provide incentives in p2p live streaming. In: Proceedings of the 2007 Workshop on Peer-to-Peer Streaming and IP-TV, P2P-TV 2007 (2007)
Ren, D., Li, Y.-T., Chan, S.-H.: On reducing mesh delay for peer-to-peer live streaming. In: INFOCOM 2008 (2008)
Huang, F., Ravindran, B., Kumar, V.A.: An approximation algorithm for minimum-delay peer-to-peer streaming. In: Peer-to-Peer Computing 2009 (2009)
Wu, C., Li, B.: rstream: Resilient and optimal peer-to-peer streaming with rateless codes. IEEE Transactions on Parallel and Distributed Systems 19(1), 77–92 (2008)
Bianchi, G., Blefari Melazzi, N., Bracciale, L., Lo Piccolo, F., Salsano, S.: Streamline: An optimal distribution algorithm for peer-to-peer real-time streaming. IEEE Transactions on Parallel and Distributed Systems (99), 1 (2010)
Chen, Z., Xue, K., Hong, P.: A study on reducing chunk scheduling delay for mesh-based P2P live streaming. In: GCC 2008 (2008)
Liu, Y.: On the minimum delay peer-to-peer video streaming: how realtime can it be? In: ACM Multimedia 2007 (2007)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630–652 (2007)
Karakostas, G.: Faster approximation schemes for fractional multicommodity flow problems. ACM Trans. Algorithms 4(1), 1–17 (2008)
Hei, X., Liang, C., Liang, J., Liu, Y., Ross, K.: A measurement study of a large-scale P2P IPTV system. IEEE Transactions on Multimedia 9(8) (December 2007)
Hefeeda, M., Saleh, O.: Traffic modeling and proportional partial caching for peer-to-peer systems. IEEE/ACM Transactions on Networking 16(6), 1447–1460 (2008)
Vazirani, V.V.: Approximation Algorithm. Springer, New York (2007)
Fei Huang, B.R., Khan, M.: Technical report: On minimizing average end-to-end delay in p2p live streaming systems, Tech. Rep. (2010), http://staff.vbi.vt.edu/maleq/papers/APX_P2P_average_delay.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, F., Khan, M., Ravindran, B. (2010). On Minimizing Average End-to-End Delay in P2P Live Streaming Systems. In: Lu, C., Masuzawa, T., Mosbah, M. (eds) Principles of Distributed Systems. OPODIS 2010. Lecture Notes in Computer Science, vol 6490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17653-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-17653-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17652-4
Online ISBN: 978-3-642-17653-1
eBook Packages: Computer ScienceComputer Science (R0)