Novel Sub-Tree Sharing Based Multicast States Aggregation Scheme
Dong Yang · Jisuanji fangzhen · 2008
Traditional multicast suffers from serious scalability problem which leads that the number of multicast routing states kept in routers is very large.For this reason,multicast can hardly be accepted in wide area networks efficiently.A Sub-tree Sharing based MPLS Multicast scheme(SSMM) was proposed.By aggregating multiple overlapped sub-trees of different multicast trees to one sharing sub-tree and depending on MPLS only,SSMM could reduce a lot of multicast forwarding states.At the same time,no special servers were needed by SSMM to calculate the sharing sub-trees.Analysis and simulation show that SSMM outperforms its counterparts and solves multicast scalability problem significantly.