Jump to content

Narada multicast protocol

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Repat (talk | contribs) at 02:21, 28 January 2015. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 managment 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

References

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