Jump to content

Narada multicast protocol

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Mccapra (talk | contribs) at 16:21, 20 March 2020 (Successfully de-orphaned! Wikiproject Orphanage: You can help!). 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 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.

  • "Implementation of Narada protocol for End System Multicast". CiteSeerX 10.1.1.125.6895. {{cite journal}}: Cite journal requires |journal= (help)
  • "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.


Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Narada_multicast_protocol&oldid=946507028"