Hubbry Logo
search button
Sign in
Narada multicast protocol
Narada multicast protocol
Comunity Hub
History
arrow-down
starMore
arrow-down
bob

Bob

Have a question related to this hub?

bob

Alice

Got something to say related to this hub?
Share it here.

#general is a chat channel to discuss anything related to the hub.
Hubbry Logo
search button
Sign in
Narada multicast protocol
Community hub for the Wikipedia article
logoWikipedian hub
Welcome to the community hub built on top of the Narada multicast protocol Wikipedia article. Here, you can discuss, collect, and organize anything related to Narada multicast protocol. The purpose of the...
Add your contribution
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.

[edit]
  • Kulkarni, Ajit; Venkatachalam, Logambigai; Gaat, Tilottama. "Implementation of Narada protocol for End System Multicast". CiteSeerX 10.1.1.125.6895. Retrieved August 23, 2023.
  • "An Evaluation of Three Application-Layer Multicast Protocols"
  • "Overlay Multicast & Content distribution"

References

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