Preply — Study more efficiently by working with a personal tutor. Get 50% off.Affiliate

Wikipedia

Narada multicast protocol

The Narada multicast protocol is a set of specifications which can be used to implement overlay multicast functionality on computer networks. It constructs an overlay tree from a redundantly meshed graph of nodes, source specific shortest path trees are then constructed from reverse paths. The group management is equally distributed on all nodes because each overlay node keeps track of all its group members through periodic heartbeats of all members. The discovery and tree building is similar to DVMRP.

External links Kulkarni, Ajit; Venkatachalam, Logambigai; Gaat, Tilottama. "Implementation of Narada protocol for End System Multicast". CiteSeerX 10.1.1.125.6895. Retrieved August 23, 2023. {{cite web}}: Cite uses deprecated parameter |citeseerx= (help)CS1 maint: miscellaneous url (link) "An Evaluation of Three Application-Layer Multicast Protocols" "Overlay Multicast & Content distribution"

References Yang-hua Chu, et al. A case for end system multicast, IEEE Journal on selected areas in communications, 2002.

Tags

  • Computer network stubs
  • Computer networking
  • Routing protocols