In this paper, we extend the hierarchical PNNI point-topoint routing protocols[.?] t o support multicast routing in A T M networks. O u r idea i s based o n the Core-Based Tree idea f o r inter-domain multicast routing in the internet[l]. OUT idea uses multiple core nodes connected o n a backbone tree. T h e destination nodes attach t o the core nodes using the shortest path. O u r algorithm i s scalable because the multicast tree i s shared among all senders. Also, only the core node information has t o be flooded within each peergroup. O u r algorithm supports dynamic changes t o the set of destinations. T h e backbone tree itself can be reconstructed depending o n the current link and node states, thus, guaranteeing quality-of-service requirements. T h e cost of the multicast tree built incrementally f o r a given set of destinations i s comparable t o the cost of the Steiner Tree constructed using standard heuristics. Using simulations, we show that the process of addition or deletion nodes i s simplified, thereby reducing overheads. Moreover, the routing algorithm i s recursive, that is, the nodes at each level of hierarchy execute the same algorithm. This m a k e s the algorithm suitable for a distributed implementation.

No abstract

No abstract

Delay-tolerant networks have the great potential to connecting devices and regions of the world that are being presently under-served by current networks.