Optimal backup parent pools for resilient multicast trees on peer-to-peer networks

Due to churn as well as node and link failures in peer-to-peer (P2P) networks, providing resilient multicast is a challenging issue, particularly for overlay trees. In this work, we first study analytical properties of the backup parent pool that aims at improving the resilience of overlay multicast trees in P2P video streaming. We then present a novel greedy degree-constrained multicast tree construction algorithm that addresses the tradeoffs between maximizing resiliency, maximizing bandwidth utilization, and minimizing delay. The choice of essential design parameters is studied together with seamlessness of the streaming under a variety of fault scenarios. Simulation results indicate that the overhead introduced by the mechanism is negligible if there is sufficient bandwidth in the system. Both analytic and simulation results indicate that the proposed approach improves resiliency, bandwidth utilization, and delay. Comparisons with an algorithm from the literature are carried out and it is observed that the proposed method is superior under a wide range of conditions.

Optimal backup parent pools for resilient multicast trees on peer-to-peer networks

Due to churn as well as node and link failures in peer-to-peer (P2P) networks, providing resilient multicast is a challenging issue, particularly for overlay trees. In this work, we first study analytical properties of the backup parent pool that aims at improving the resilience of overlay multicast trees in P2P video streaming. We then present a novel greedy degree-constrained multicast tree construction algorithm that addresses the tradeoffs between maximizing resiliency, maximizing bandwidth utilization, and minimizing delay. The choice of essential design parameters is studied together with seamlessness of the streaming under a variety of fault scenarios. Simulation results indicate that the overhead introduced by the mechanism is negligible if there is sufficient bandwidth in the system. Both analytic and simulation results indicate that the proposed approach improves resiliency, bandwidth utilization, and delay. Comparisons with an algorithm from the literature are carried out and it is observed that the proposed method is superior under a wide range of conditions.

___

  • Conclusion
  • Overall, experimental results of the proposed system showed that error resiliency techniques used in a P2P communication system should be adaptive since nodes in the system can join or leave the system unexpectedly. The backup parent pool and ratio of backup slots provide a quick response to the unexpected failures by means of adaptive properties.
  • Y. Chu, S. Rao, S. Seshan, H. Zhang, “A case for end system multicast”, IEEE Journal on Selected Areas in Communications, Vol. 20, pp. 1456–1471, 2002.
  • S. Birrer, F.E. Bustamante, “A comparison of resilient overlay multicast approaches”, IEEE Journal on Selected Areas in Communications, Vol. 25, pp. 1695–1705, 2007.
  • S. Xie, B. Li, G.Y. Keung, X. Zhang, “CoolStreaming: design, theory and practice”, IEEE Transactions on Multimedia, Vol. 9, pp. 1661–1671, 2007.
  • H. Jeon, S.C. Son, J.S. Nam, “Overlay multicast tree recovery scheme using a proactive approach”, Computer Communications, Vol. 31, pp. 3163–3168, 2008.
  • Z. Fei, M. Yang, “A proactive tree recovery mechanism for resilient overlay multicast”, IEEE/ACM Transactions on Networking, Vol. 15, pp. 173–186, 2007.
  • Z. Wang, J. Crowcroft, “Bandwidth-delay based routing algorithms”, in IEEE GLOBECOMM, pp. 2129–2133, 1995. [7] F. Bauer, A. Varma, “Degree-constrained multicasting in point-to-point networks”, in IEEE INFOCOM, pp. 369– 376, 1995.
  • G. Raidl, “An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem”, in Congress on Evolutionary Computation, pp. 104–111, 2000.
  • X. Jin, W.P.K Yiu, S.H.G Chan, Y. Wang, “On maximizing tree bandwidth for topology-aware peer-to-peer streaming”, IEEE Transactions on Multimedia, Vol. 9, pp. 1580–1592, 2007.
  • D.A. Tran, K.A. Hua, T.T. Do, “A peer-to-peer architecture for media streaming”, IEEE Journal on Selected Areas in Communications, Vol. 22, pp. 121–133, 2004.
  • S. Banerjee, S. Lee, B. Bhattacharjee, A. Srinivasan, ”Resilient multicast using overlays”, IEEE/ACM Transactions on Networking, Vol. 14, pp. 237–248, 2006.
  • V.K. Goyal, “Multiple description coding: compression meets the network”, IEEE Signal Processing Magazine, Vol. 18, pp. 74–94, 2001.
  • V.N. Padmanabhan, H.J. Wang, P.A. Chou, “Resilient peer to peer streaming”, in IEEE International Conference on Network Protocols, pp. 16–27, 2003.
  • P. Baccichet, T. Schierl, T. Wiegand, B. Girod, “Low-delay peer-to-peer streaming using scalable video coding”, in IEEE Packet Video Workshop, pp. 173–181, 2007.
  • Y. Okada, M. Oguro, J. Katto, S. Okubo, “A new approach for the construction of ALM trees using layered video coding”, in ACM Workshop on Advances in Peer-To-Peer Multimedia Streaming, pp. 59–68, 2005.
  • T. Kusumoto, Y. Kunichika, J. Katto, S. Okubo, “Tree-based application layer multicast using proactive route maintenance and its implementation”, in ACM Workshop on Advances in Peer-To-Peer Multimedia Streaming, pp. 49–58, 2005.
  • J. Kim, Y. Lee, S. Bahk, “SALSA: Super-peer assisted live streaming architecture”, in IEEE International Confer- ence on Communications, pp. 1–5, 2009.
  • at http://www.cc.gatech.edu/projects/gtitm/, date of last access: October 2012.
Turkish Journal of Electrical Engineering and Computer Science-Cover
  • ISSN: 1300-0632
  • Yayın Aralığı: Yılda 6 Sayı
  • Yayıncı: TÜBİTAK