Improved multicast routing with delay and delay variation constraints

Multi point routing algorithms capable of satisfying quality of service constraints such as delay boundedness and delay variation boundedness are becoming crucial with the advent of high speed networks. This paper addresses the problem of determining minimum cost paths to nodes in a multicast group satisfying delay bounds and delay variation bounds. A routing protocol is proposed and compared with previous schemes like DVMA (delay variation bounded multicast algorithm). The results show that the scheme proposed improves over the DVMA in the variation bounds achieved and is comparatively far more efficient