Deliver Multicast Traffic over VPLS Domain Using Aggregated Multicast Trees

VPLS multicast has always been the focus in today’s network research. But implementing multicast in VPLS is confronted with two major problems, one is the multicast forwarding states that routers must maintain and manage, the other is the bandwidth waste when using aggregate shared tree to deliver multicast traffic. In this paper, we propose a trade-off approach that can be used to reduce the multicast forwarding states while at the same time keep the bandwidth utilized efficiently. We start our proposal with the set up of aggregate default tree, from it we derived all kinds of candidate shared multicast trees. We also suggest group–tree selection algorithm. Our simulation result shows that the proposed approach can achieve better scalability but introduce little overhead in VPLS network.