Traditional multicast routing protocols use RPF (Reverse Path Forwarding) concept to build multicast trees. This concept is based upon the idea that an actual delivery path to a node is the reverse of the path from this node to the source. This concept fits well in symmetric environments, but in a routing environment where Quality of Service is considered the guarantee that a symmetrical path will exist between two network addresses is broken. Available network resources impose specific Quality of Service asymmetries, therefore reverse path routing may not be used. In this paper a new multicast routing strategy is proposed, enabling directed trees establishment, instead of reverse path ones. This new strategy, DTMP- Directed Trees Multicast Routing, is then implemented and simulated using Network Simulator. Simulation results, driven from several scenarios are presented, analyzed and compared with PIM-SM. ; (undefined)


    Access

    Download


    Export, share and cite



    Title :

    Directed trees in multicast routing


    Contributors:

    Publication date :

    2003-05-24


    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629 / 000



    Cluster-Based MANET Multicast Routing Scheme

    Nargunam, A.S. / Sebastian, M.P. | British Library Online Contents | 2010


    Class-based multicast routing in interdomain scenarios

    Nicolau, Maria João / Costa, António / Macedo, Joaquim et al. | BASE | 2008

    Free access

    Optimizing application level multicast trees over wireless networks

    Johnston, D. / Wolff, F. / Papachristou, C. et al. | IEEE | 2011


    A MST Algorithm of Supporting QoS Multicast Routing

    Wei, F. / Layuan, L. | British Library Online Contents | 2003


    Dynamic Multicast Routing Algorithm Satisfying Multiple QoS Constraints

    Li, W. / Zengzhi, L. / Chengqian, S. | British Library Online Contents | 2004