Study Of Multicast Receivers Grouping Algorithm Based On Cluster

With the rapid development of the network technology, some new type multimedia traffics come into being, such as video-on-demand and distance education. These traffics usually have the characters of "point to multipoint" or "multipoint to multipoint" and need high-bandwidth. Multicast communication achieves scalability by sending data to multiple receivers at the same time. In order to improve efficiency, these are more than one group in a multicast session. It's important that how to divide receivers into groups exactly and set appropriate group rates. This paper mainly discussed fairness of the multicast grouping problem.Two fairness evaluation criteria are introduced, social welfare and max-min intra-session fairness. A new grouping method is proposed, called receivers merging method, RMM for short. Based on cluster receivers are divided into groups by the capability to receive data. Under some strategies, the total of receivers decreases by merging process. Grouping is finished when the number of receivers is equal to the number of the intending groups. Some trachea of the RMM is flexible, so it can adapt the actual situation better. RMM can be utilized as preprocessing process for other grouping methods. It can reduce the number of receivers disposed by Algorithm. Recursion is adopted to deal with the issue when the RMM is used in network topology.In this paper, QoS, multicast and fairness evaluation criteria are introduced at first. Then, a new grouping Algorithm is proposed based on cluster. Some improvements have been done to an existing grouping method. At last, three grouping methods are compared and analyzed by MATLAB.