Hop by hop multicast routing protocol

  • Authors:

  • Lu Henrique M. K. Costa;Serge Fdida;Otto Duarte

  • Affiliations:

  • Laboratoire d'Informatique de Paris 6, Université Pierre et Marie Curie 4, place Jussieu, 75252, Paris Cedex 05, France and Grupo de Teleinformática e Automaçãao, Universidade ...;Laboratoire d'Informatique de Paris 6, Université Pierre et Marie Curie 4, place Jussieu, 75252, Paris Cedex 05, France;Grupo de Teleinformática e Automaçãao, Universidade Federal do Rio de Janeiro, P.O. Box 68504, 21945-970, Rio de Janeiro, RJ, Brasil

  • Venue:
  • Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

IP Multicast is facing a slow take-off although it is a hotly debated topic since more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper proposes HBH (Hop-By-Hop multicast routing protocol). HBH adopts the source-specific channel abstraction to simplify address allocation and implements data distribution using recursive unicast trees, which allow the transparent support of unicast-only routers. Additionally, HBH is original because its tree construction algorithm takes into account the unicast routing asymmetries. As most multicast routing protocols rely on the unicast infrastructure, these asymmetries impact the structure of the multicast trees. We show through simulation that HBH outperforms other multicast routing protocols in terms of the delay experienced by the receivers and the bandwidth consumption of the multicast trees.