Sender-initiated Configuration of an ACK-Tree for Reliable Multicast Transport

Tree-based ACK mechanism for reliable multicast service is well -known to provide high scalabil ity as well as reliability. However, it should be followed an eff icient ACK-Tree construction mechanism. The ERS(Expanding Ring Search) mechanism which is a receiver-driven bottom-up approach has been mainly used to construct an ACK-tree. However, it is known to cause heavy message overhead and to have possibili ty to cause loop during tree creation process. In the other hand, top-down approach can guarantee loop-free tree, but it cannot provide concurrent tree creation, so it takes long time to create an ACK-tree. This paper proposes a loop-free ACK-tree creation mechanism that supports semi-concurrent tree creation using sender-initiated approach. In addition, this paper proposes a tree reconfiguration method which can lessen unbalanced and abnormal tree shape which may caused by dynamic group join and leave.

[1]  Kurt Rothermel,et al.  Building Multicast Acknowledgment Trees , 1999 .

[2]  J. J. Garcia-Luna-Aceves,et al.  The case for reliable concurrent multicasting using shared ACK trees , 1997, MULTIMEDIA '96.

[3]  J. J. Garcia-Luna-Aceves,et al.  A comparison of known classes of reliable multicast protocols , 1996, Proceedings of 1996 International Conference on Network Protocols (ICNP-96).

[4]  Sanjoy Paul,et al.  RMTP: a reliable multicast transport protocol , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.