Hierarchical pruning to improve bandwidth utilization of RPF-based broadcasting

Some of the attractive features of using Reverse Path Forwarding (RPF) method for broadcasting include reasonably low amount of memory necessary for storing the data structures in a router required by the protocol and ease of its implementation as it does not look for shortest path delivery. However, it generates quite a large number of duplicate packets resulting in poor bandwidth utilization. In this paper we have introduced a novel hierarchical pruning mechanism to improve bandwidth utilization for broadcasting using the RPF method. Experimental results support our theoretical findings of achieving very high reduction in the number of the duplicate packets generated.