Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (RTT) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distributed paradigm is shown. Performance evaluation results prove that the proposed approach considerably improves the overlay efficiency from the viewpoint of end-users and content providers. Moreover, the proposed technique ensures a high level of resilience against gateway-link failures and adaptively reorganizes the overlay topology in case of dynamic, transient network fluctuations. 1. Introduction For previous few years peer-to-peer (P2P) related flows (overlay traffic) have represented a vast majority of the whole Internet traffic. Thus, P2P networking has become an important branch of today’s telecommunications. It involves not only file-sharing (BitTorrent, Ares Galaxy, Gnutella), but also multimedia streaming (PPLive, SopCast), Internet telephony (Skype), anonymous routing (Tor), and many aspects of content distribution networks or cloud networking. With the increased interest in quality-requiring applications, the problem of the quality of service (QoS) assurance is a real challenge in P2P-based streaming. Live streaming transfers based on the P2P paradigm impose strict constraints on latency between a video server and peers (end-users). Since the requirements are not fully addressed by the characteristics of P2P networking, a considerable attention has been put on the overcoming techniques. One of the most basic parameters that highly influence the quality experienced by end-users is the effective downloading speed and its stability over time. A buffering process, observed by end-users as a transient interruption of content delivery, can be minimized, or even avoided, when oscillations of the downloading speed are small. To accomplish the gapless playback, the P2P application-layer links should be set over short distances with additional care about the available capacity. This task is a nontrivial problem as P2P systems were invented to be underlay-agnostic. In practice, they have not usually recognized proximity between the candidate peers nor estimate
References
[1]
S. Tang, Y. Lu, J. M. Hernández, F. Kuipers, and P. van Mieghem, “Topology dynamics in a P2PTV network,” in Proceedings of the IFIP-TC6 International Conference on Networking (NETWORKING '09), Aachen, Germany, May 2009.
[2]
R. J. Lobb, A. P. Couto da Silva, E. Leonardi, M. Mellia, and M. Meo, “Adaptive overlay topology for mesh-based P2P-TV systems,” in Proceedings of the 19th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '09), pp. 31–36, Williamsburg, Va, USA, June 2009.
[3]
F. Picconi and L. Massoulié, “ISP-friend or foe? Making P2P live streaming ISP-aware,” in Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS '09), Montreal, Canada, June 2009.
[4]
W. Liang, J. Bi, R. Wu, Z. Li, and C. Li, “On characterizing PPStream: measurement and analysis of P2P IPTV under large-scale broadcasting,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '09), Honlulu, Hawaii, USA, November-December 2009.
[5]
E. K. Lua, X. Zhou, J. Crowcroft, and P. van Mieghem, “Scalable multicasting with network-aware geometric overlay,” Computer Communications, vol. 31, no. 3, pp. 464–488, 2008.
[6]
T. Peng, Q. Zheng, W. Lv, S. Jiang, and J. Gao, “Network friendly tree for peer-to-peer streaming,” in Proceedings of the 12th International Conference on Computer Supported Cooperative Work in Design (CSCWD '08), pp. 1024–1028, Xi’an, China, April 2008.
[7]
R. Besharati, M. Bag-Mohammadi, and M. A. Dezfouli, “A topology-aware application layer multicast protocol,” in Proceedings of the 7th IEEE Consumer Communications and Networking Conference (CCNC '10), Las Vegas, Nev, USA, January 2010.
[8]
T. Kikkawa, T. Miyata, and K. Yamaoka, “Maximum-bandwidth ALM tree on tree network,” in Proceedings of the 7th IEEE Consumer Communications and Networking Conference (CCNC '10), Las Vegas, Nev, USA, January 2010.
[9]
I. Rimac, V. Hilt, M. Tomsu, V. Gurbani, and E. Marocco, “A Survey on Research on the Application-Layer Traffic Optimization (ALTO) Problem,” IETF RFC 6029, October 2010.
[10]
G. Dán, T. Ho？feld, S. Oechsner et al., “Interaction patterns between P2P content distribution systems and ISPs,” IEEE Communications Magazine, vol. 42, no. 5, pp. 222–230, 2011.
[11]
J. Seedorf and E. W. Burger, “Application-Layer Traffic Optimization (ALTO) Problem Statement,” IETF RFC 5693, October 2009.
[12]
O. Abboud, A. Kova？evi？, K. Graffi, K. Pussep, and R. Steinmetz, “Underlay awareness in P2P systems: techniques and challenges,” in Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS '09), Rome, Italy, May 2009.
[13]
A. Kova？evi？, O. Heckmann, N. C. Liebau, and R. Steinmetz, “Location awareness-improving distributed multimedia communication,” Proceedings of the IEEE, vol. 96, no. 1, pp. 131–142, 2008.
[14]
X. Tu, H. Jin, X. Liao, and J. Cao, “Nearcast: a locality-aware P2P live streaming approach for distance education,” ACM Transactions on Internet Technology, vol. 8, no. 2, 2008.
[15]
D. A. Huffman, “A method for the construction of minimum-redundancy codes,” Proceedings of the IRE, vol. 40, no. 9, pp. 1098–1101, 1952.
[16]
R. Gallager, “Variations on a theme by Huffman,” IEEE Transactions on Information Theory, vol. 24, no. 6, pp. 668–674, 1978.
[17]
D. E. Knuth, “Dynamic Huffman coding,” Journal of Algorithms, vol. 6, no. 2, pp. 163–180, 1985.
[18]
J. S. Vitter, “Design and analysis of dynamic Huffman codes,” Journal of the ACM, vol. 34, no. 4, pp. 825–845, 1987.
[19]
E. W. Zegura, K. L. Calvert, and S. Bhattacharjee, “How to model an internetwork,” in Proceedings of the 15th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '96), San Francisco, Calif, USA, March 1996.
[20]
J. Tyszer, Object-Oriented Computer Simulation of Discrete-Event Systems, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999.
[21]
B. Polaczyk, P. Cho？da, and A. Jajszczyk, “Huffman coding inspired peer-to-peer multicasting,” in Proceedings of the 10th International Symposium on Electronics and Telecommunications (ISETC '12), Timisoara, Romania, November 2012.
