Multicast tree construction algorithms for multimedia service are largely classified into Source based tree Shared. The Shared tree based multicast is known to show better performance in the aspect of scalability than source based tree. Generally, there have been lots of researches on the algorithm to satisfy QoS constraints through proper Rendezvous Point (RP) in the shared tree. In addition, as the multicast group members join and leave dynamically during the session, the RP shared tree should be reselected to satisfy the QoS of the new members. But, there is not much previous works on the RP reselection algorithm to guarantee peer-to-peer service quality. In this thesis, both of new initial RP selection (iRPSA) and RP reselection (nRPSA) algorithms are proposed, which use RTCP(REAL Time Control Protocol) report packet fields.
Conventional RP selection algorithm can be classified into two algorithms depending on multiple QoS constraints. Multiple QoS constraints based RP selection algorithm considers multiple QoS constraints such as delay, delay jitter, and bandwidth simultaneously. RP selection algorithm without QoS constraints can be divided into three areas, which are random, topology based, and group based RP selection, respectively. Conventional RP selection algorithms, such as, Random, Topology based, and Group based algorithm cannot fully guarantee QoS constraints.
Recent studies on RP selection report the RP selection algorithm considering multiple QoS constraints. In order to provide the real time multimedia service, the complexity of QoSconstraint algorithms should be reduced considerably.
As the multicast group members join and leave dynamically during the session, it is difficult to guarantee the QoS constraints for some of newly joining members. In that case, new RP should be selected to guarantee QoS for every group member. There are two algorithms to select new RP. One is to select new RP considering member dynamic sensitivity that indica...