Abstract
The goal in shortest path tree (SPT) algorithm is to compute a tree rooted at the sender and spanning all the receivers such that the distance between the sender and each receiver along the tree is minimum. The two most well-known algorithms for computing shortest path trees are due to Bellman-Ford and Dijktra [BG92]. These techniques are equivalent to applying point-to-point shortest path algorithm repeatedly, once for each sender-receiver pair. SPTs by definition are per sender. Thus for multiple source multicast, separate multicast trees need to be computed, one for each sender.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
