基于聚类的组播接收端分组算法  

Study of Multicast Receivers Grouping Algorithm Based on Clustering

作　　者：马学文[1] 夏利[1] 刘阳迁[1] 张君雅[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《沈阳建筑大学学报（自然科学版）》2009年第2期375-380,共6页Journal of Shenyang Jianzhu University：Natural Science

基　　金：国家自然科学基金项目(60773219);辽宁省自然科学基金项目(20042012)

摘　　要：目的研究基于聚类的组播接收端分组算法,节约带宽,提高传输效率,保证接收能力不同的各个接收端的公平性.方法将彼此接收能力接近的组播接收端划分到一个组播组,并且在最大最小会话内公平性和社会福利公平性这两个组播会话公平性评价标准下与其他接收端分组算法进行对比.结果在保证公平性的前提下对一个组播会话内的接收端进行分组,并设定了组内数据传输速率,仿真结果显示基于聚类的分组算法在分组数量较少的情况下其最小公平性与公平性和都介于最大最小会话内公平性算法和社会福利算法之间.结论基于聚类的组播接收端分组算法可节约带宽,提高传输效率,保证接收能力不同的各个接收端的公平性.A multicast grouping algorithm based on cluster is proposed in order to save bandwidth,improve transmission efficiency and assure fairness among receivers with different receiving capability. The receivers with similar receiving capability are put into one group. This algorithm is compared with other receiver grouping algorithms under two evaluation criterias of multiple session fairness： max-min intra-session and social welfare fairness. On the premise of fairness,receivers in the same multicast session are divided into different groups with the specific transmission rates. The simulation results show that in case of not having too many groups, the performance of the multicast grouping algorithm based on cluster is between max-rain intra-session and social welfare fairness algorithms. Multicast receiver grouping algorithm based on cluster can save bandwidth, improve transmission efficiency and assure fairness among receivers with different receiving capability.

关 键 词：组播 公平性 接收端分组算法 聚类 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]