Hierarchical pruning to improve bandwidth utilization of RPF-based broadcasting

Abstract

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.

Candidate core selection for load-balanced multicore shared tree multicasting

“…In the present work, we have considered DVR-based networks. In [8][9][10] we have given a new and very important interpretation of the information present in the DVR tables of routers. This interpretation has resulted in the concept of pseudo-diameter.…”

“…routers do not have knowledge of entire network topology. We shall use the concept of pseudo diameter [8][9][10] to approximate the idea used in OCBT to select the candidate cores such that the core with the lowest pseudo diameter will be the first to be selected, followed by the next lowest one and so on. Note that multiple cores always can be used to add an element of robustness.…”