Narada multicast protocol
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 .
- "An Evaluation of Three Application-Layer Multicast Protocols"
- "Overlay Multicast & Content distribution"
- Yang-hua Chu, et al. A case for end system multicast, IEEE Journal on selected areas in communications, 2002.
|This computer networking article is a stub. You can help Wikipedia by expanding it.|