Resource allocation for multicast connections, policies and performance

by Anpalagan, Subramaniam Alagan

Given a set of receivers and their end-to-end quality ofservice (QoS ) demands in a multicast session, QoS requirements have to be divided among the participating links so that cd admission control can be applied and resources reserved. We characterize the optimal solution for a static multicast session by partial first derivative test (PFDT) and propose an iterative algorithm to divide the end-t-d QoS optimally. Each node in the multicast tree is assigned a cumulative QoS (CQoS) value and is adjusted in eadi iteration untiI no more resource cm be decreased. Each iteration attempts to optimize locally witk a virtual source and receivers and can be done fiom the source to the receiver or vice versa. The proposed algoritkm can also be implemented distributively. Two properties at optimal allocation were revealed as the result of the characterization. A simple resource allocation policy that increasesthejoining probability of new receivers is given. The optimal and the proposed simple dgorithm are compared against a recently reported Equal Allocation with Reclaim (EAR) algorithm. Finally, simulation studies are also done for evaluating the performance.