For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Multicast Routing Method for Layered Streams
IEICE TRANSACTIONS on Communications
Publication Date: 1999/05/25
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Services
multicast routing, layered stream, packet filtering, weighted greedy algorithm, shared tree type routing protocols,
Full Text: PDF(688.3KB)>>
In this paper, a new multicast routing method for layered streams is proposed. This method is an extension of the weighted greedy algorithm (WGA) and uses two kinds of weight values to refine the link distance. It can cope with dynamic change in the group members without multicast tree re-construction. The method is compatible with the RSVP and can be utilized in existing shared tree type routing protocols such as CBT and PIM sparse mode. The network resources can be utilized efficiently; furthermore, the loss rate of member's requests to receive more layers can be reduced by this routing method when a sufficient number of nodes have the packet filtering function and a sufficient number of hops is permitted.