Hop by hop multicast routing protocol
Authors:
Open Access
- 27 August 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 31 (4) , 249-259
Abstract
International audienceIP 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 treesKeywords
This publication has 11 references indexed in Scilit:
- Internet Group Management Protocol, Version 32002
- Deployment issues for the IP multicast service and architectureIEEE Network, 2000
- IP multicast channels1999
- End-to-end routing behavior in the InternetIEEE/ACM Transactions on Networking, 1997
- Multipoint communication: a survey of protocols, functions, and mechanismsIEEE Journal on Selected Areas in Communications, 1997
- The PIM architecture for wide-area multicast routingIEEE/ACM Transactions on Networking, 1996
- Generic Routing Encapsulation (GRE)1994
- Multicast Extensions to OSPF1994
- Host extensions for IP multicasting1989
- Distance Vector Multicast Routing Protocol1988