Skip to main content
SpringerLink
Log in

A Heuristic Algorithm for Core Selection in Multicast Routing

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Cain B, Ballardie A, Zhang Z. Core based trees (CBT version 3) multicast routing, protocol specification. Inter-Domain Multicast Routing, 2003, Internet Draft, http://tools.ietf.org/id/draft-ietf-idmr-cbt-spec-v3-01.txt.

  2. Fenner B. Protocol independent multicast-sparse mode (PIM-SM): Protocol specification (revised). Internet RFC 4601, August 2008.

  3. Wall D W. Mechanisms for broadcast and selective broadcast [Ph.D. Dissertation], Stanford University, 1980.

  4. Oliveira C A S, Pardalos P M. A survey of combinatorial optimization problems in multicast routing. Computers and Operations Research, 2005, 32(8): 1953–1981.

    Article  MATH  Google Scholar 

  5. Chung S M, Youn C H. Core selection algorithm for multicast routing under multiple QoS constraints. Electronics Letters, 2000, 36(4): 378–379.

    Article  Google Scholar 

  6. Kim M, Bang Y C et al. On efficient core selection for reducing multicast delay variation under delay constraints. IEICE Trans. Communications, 2006, E89-B(9): 2385–2393.

    Article  Google Scholar 

  7. Harutyunyan H A, Dong X. A new algorithm for RP selection in PIM-SM multicast routing. In Proc. Int. Conf. Wireless and Optical Communications, Banff, Canada, Jul. 14–16, 2003, pp.208-216.

  8. Lee D L, Youn C H, Jeong S J. RP reselection scheme for realtime applications in delay-constrained multicast networks. In Proc. IEEE International Conference on Communications, New York, USA, Apr. 28-May 2, 2002, pp.1290-1294.

  9. Mukherjee R, Atwood J W. Rendezvous point relocation in protocol independent multicast-sparse mode. Telecommunication Systems, 2003, 24(2–4): 207–220.

    Article  Google Scholar 

  10. Putthividhya W, Tavanapong Wet al. selection with QoS support. In Proc. IEEE Int. Conf. Communications, Paris, France, Jun. 20–24, 2004, pp.2132-2137.

  11. Font F, Mlynek D. Applying clustering algorithms as core selection methods for multiple core trees. In Proc. IEEE Int. Conf. Communications, Paris, France, Jun. 20–24, 2004, pp.2030-2035.

  12. Rouskas G N, Baldine I. Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Area in Communications, 1997, 15(3): 346–356.

    Article  Google Scholar 

  13. Sheu P R, Chen S T. A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem. Computer Communications, 2002, 25(8): 825–833.

    Article  Google Scholar 

  14. Ahn Y, Kim M, Bang Y C, Choo H. On algorithm for the delay-and delay variation-bounded multicast trees based on estimation. In Proc. HPCC2005, Sorrento, Italy, Sept. 21-23, 2005, pp.277-282.

  15. Ahn S, Kim M, Choo H. Efficient algorithm for reducing delay variation on delay-bounded multicast trees in heterogeneous networks. In Proc. WCNC, Las Vegas, USA, Mar. 31-Apr. 3, 2008, pp.2741-2746.

  16. Zhao J, Hassanein H, Wu J, Gu G. End-to-end QoS routing framework for differentiated services networks. Computer Communications, 2003, 26(6): 566–578.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Veer Surendra Sai University of Technology, Burla, 768018, India

    Manas Ranjan Kabat, Manoj Kumar Patel & Chita Ranjan Tripathy

Authors
  1. Manas Ranjan Kabat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manoj Kumar Patel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chita Ranjan Tripathy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manas Ranjan Kabat.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(PDF 119 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kabat, M.R., Patel, M.K. & Tripathy, C.R. A Heuristic Algorithm for Core Selection in Multicast Routing. J. Comput. Sci. Technol. 26, 954–961 (2011). https://doi.org/10.1007/s11390-011-1192-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-011-1192-x

Keywords

Search

Navigation