支持不可排序QoS的可扩展组播方案  

Scalable multicasting mechanism for unordered QoS

作　　者：李锁钢[1] 吴建平[1] 徐恪[1] 刘莹[2] 

机构地区：[1]清华大学计算机科学与技术系,北京100084 [2]清华大学网络中心,北京100084

出　　处：《清华大学学报（自然科学版）》2007年第1期104-107,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金资助项目(60303006);国家"八六三"高技术项目(2003CB314801)

摘　　要：在支持QoS(quality of service)的IP组播中,为了解决由于并发组数量的增加造成的路由器状态爆炸问题以及由于接收者请求不同级别QoS而带来的困难,提出一种支持不可排序QoS的可扩展组播机制。此机制考虑了QoS级别的排序性,使用启发式算法为组播组选择适当的组播树,让属于不同组播组、请求相同QoS级别的组播接收者共享使用组播树。模拟实验结果显示,该方案可以有效地改善组播状态可扩展性,在一定的实验设置情况下,组播树与组播组数量之比可低于1/8;同时满足接收者的不同QoS需求。In IP multicasting supporting QoS （quality of service）, to solve the number of router states increases rapidly as the number of active multicast groups increases with different multicast receivers likely requiring various QoS levels. This paper defines an order for the QoS levels with a scalable multicasting mechanism for unordered QoS. This approach shares delivery trees among receivers with the same required QoS level, even though they are associated with different groups, using a heuristic algorithm that selecting trees for the groups. Simulations demonstrate that the mechanism efficiently improves multicast state scalability in the router with the ratio of the number of multicast trees to the number of active multicast groups less than 1/8 in some environments while supporting different QoS levels.

关 键 词：计算机网络 组播 服务质量 

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