We use cookies to improve your experience with our site.
Manas Ranjan Kabat, Manoj Kumar Patel, Chita Ranjan Tripathy. A Heuristic Algorithm for Core Selection in Multicast Routing[J]. Journal of Computer Science and Technology, 2011, 26(6): 954-961. DOI: 10.1007/s11390-011-1192-x
Citation: Manas Ranjan Kabat, Manoj Kumar Patel, Chita Ranjan Tripathy. A Heuristic Algorithm for Core Selection in Multicast Routing[J]. Journal of Computer Science and Technology, 2011, 26(6): 954-961. DOI: 10.1007/s11390-011-1192-x

A Heuristic Algorithm for Core Selection in Multicast Routing

  • With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return