Heterogeneous QoS multicast in DiffServ-like networks

Multicasting in DifjServ networks is a challenging problem due to the architectural conflicts between them, namely, stateful vs. stateless core. In this paper we assurne an edge-based multicast (EBM) model wherein the multicast tree is constructed such that the branching occurs only at the edge routers. We propose an algorithm to solve the problem of dynamic member join/leave in heterogeneous QoS multicasting under EBM model. We formally state the problem and propose an algorithm for it, which is optimal when the constraint on the member join/leave requires that there can be no service disruption for on-tree nodes. We, then evaluate the performance of our algorithm with respect to a static multticast tree construction heuristic and a source-based shortest path algorithm using "Tree QoS Cost" as a primary metric. Our studies show that the proposed algorithm achieves good performance in terms of Tree QoS Cost, time taken for member join/leave, and number of sera vice disruptions with acceptable storage overhead.