The directed reverse path join (DRPJ) protocol: an efficient multicast routing protocol

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Computer Communications

• Publication date

  2001-07-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1016/S0140-3664(00)00368-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Multicast Source Discovery Protocol (MSDP)

  2003cited by this paper
• Anycast Rendevous Point (RP) mechanism using Protocol Independent Multicast (PIM) and Multicast Source Discovery Protocol (MSDP)

  2003cited by this paper
• A routing algorithm for dynamic multicast trees with end-to-end path length control

  2000cited by this paper
• The evolution of multicast: from the MBone to interdomain multicast to Internet2 deployment

  2000cited by this paper
• The new shortest best path tree (SBPT) algorithm for dynamic multicast trees

  1999cited by this paper
• IP multicast channels: EXPRESS support for large-scale single-source applications

  1999cited by this paper
• OSPF Version 2

  1998cited by this paper
• An overview of quality of service routing for next-generation high-speed networks: problems and solutions

  1998cited by this paper
• On routes and multicast trees in the Internet

  1998cited by this paper
• Multiprotocol Extensions for BGP-4

  1998influential reference
• An analysis of Internet inter-domain topology and route stability

  1997cited by this paper
• Multicast group behavior in the Internet's multicast backbone (MBone)

  1997cited by this paper
• Building shared trees using a one-to-many joining mechanism

  1997cited by this paper
• Modeling Internet topology

  1997cited by this paper
• The PIM architecture for wide-area multicast routing

  1996cited by this paper
• How to model an internetwork

  1996cited by this paper
• Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics

  1995cited by this paper
• Pareto process as a model of self-similar packet traffic

  1995cited by this paper
• BGP-4 Protocol Analysis

  1995influential reference
• Core based trees

  1993cited by this paper
• How bad is naive multicast routing?

  1993cited by this paper
• Core based trees (CBT)

  1993cited by this paper
• Performance comparison of routing protocols using MaRS: distance-vector versus link-state

  1992cited by this paper
• Scalable inter-domain routing architecture

  1992cited by this paper
• Connectivity database overhead for inter-domain policy routing

  1991cited by this paper
• Multicast routing in datagram internetworks and extended LANs

  1990influential reference
• Distance Vector Multicast Routing Protocol

  1988cited by this paper
• Routing of multipoint connections

  1988cited by this paper
• The New Routing Algorithm for the ARPANET

  1980cited by this paper
• November

  1890cited by this paper

• Lazy Flooding: A New Technique for Information Dissemination in Distributed Network Systems

  2007cites this paper
• Evaluating the impact of flooding schemes on best-effort traffic

  2005cites this paper
• Near receiver branching point multicast protocol

  2003cites this paper
• On the Degree of Multicast Bandwidth Sharing in Existing Internet Routing

  year unknowncites this paper