No abstract

Many distributed multimedia applications involve data delivery from a source to multiple destinations, the participating nodes forming a multicast group. In the naive solution, separate connections can be established from each source to other group members. However a tree can be established for each source with the participants as the leaf nodes or just have one tree spanning all the participants. In this paper, we introduce the data forwarding model to support such shared multicast trees over the ATM networks called SPAM (a Simple Protocol for ATM Multicast). Our work will allow the recently proposed wide area multicast protocols (like CBT and PIM) to be supported in ATM networks. Further, SPAM improves on error detection and allows for leaf initiated join of UN1 4.0.

No abstract

Multicast service is a n important part of a n y modern routing architecture. Motivations for many-to-many multicast include general unpredictability of membership in m a n y real applications; simplicity of the rendezvous f o r the application programmer; and low cost t o end syst e m s and switches in t e m s of state t o maintain for the delivery tree. Shared trees have a n even greater advantage over source based trees in the latter respect. Shared trees (as in the CBT model for Internet) are supported in the form of a single logical VC per multicast group (i.e., multipoint-to-multipoint VC or m p -m p V C ) in the A T M networks. Recently C R A M , SEAM and S P A M have been proposed f o r supporting m p -m pVC. T h e work in this paper does a performance comparison of these three schemes, with respect to buffer requirements, end-to-end delay, packet jitter and t r a f i c overhead. Our evaluation is carried out through extensive simulations with digerent topologies and sender traffic types.

No abstract