Advertisement

Efficient Heuristic for Minimum Cost Trees Construction in Multi-Groups Multicast

  • Keen-Mun Yong
  • Gee-Swee Poo
  • Tee-Hiang Cheng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4982)

Abstract

We propose an efficient and fast heuristic algorithm (MGST) to construct minimum cost tree for each multicast-group in multi-groups multicast. The idea is to construct just one spanning shared-tree that allows minimum cost tree of each multicast-group to be computed from this shared-tree. MGST is compared with the low overheads Core-Based Tree algorithm (CBT) and approximate optimal cost Minimum Cost Tree heuristic (MCT) through simulations. The results showed that MGST constructs trees with average cost close to the approximate optimal (7% difference). The overheads incurred from MGST are also comparable to CBT and much lesser than MCT. In addition, MGST has also shown to construct minimum cost trees much faster than MCT and comparable to CBT.To further improve the performance, “trace back” method is introduced to MGST and denoted as MGST-T. MGST-T yields average cost performance of only 2% difference from the optimal and with almost the same overheads and trees’ construction time as MGST.

Keywords

Multicast Multi-groups Minimum cost tree Shared-Tree 

References

  1. 1.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)CrossRefGoogle Scholar
  2. 2.
    Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner Trees. Acta Informatica 15, 141–145 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Striegel, A., Manimaran, G.: A survey of QoS Multicasting Issues. IEEE Comm. Magazine, 82–85 (June 2002)Google Scholar
  4. 4.
    Raghavan, S., Manimaran, G., Murthy, C.S.R.: A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees. IEEE/ACM Transactions on Networking 7(4), 514–529 (1999)CrossRefGoogle Scholar
  5. 5.
    Bauer, F., Verma, A.: ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE J. of Selected Areas in Comm. 15, 382–397 (1997)CrossRefGoogle Scholar
  6. 6.
    Ballardie, A., Francis, P., Crowcroft, J.: Core Based Trees (CBT) and Architecture for Scalable Inter-domain Multicast Routing. In: ACM SIGCOMM 1993, August 1993, pp. 85–89 (1993)Google Scholar
  7. 7.
    Waxman, B.: Routing of multipoint connections. IEEE Journal of Selected Areas in Communication 6, 1617–1622 (1988)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Keen-Mun Yong
    • 1
  • Gee-Swee Poo
    • 1
  • Tee-Hiang Cheng
    • 1
  1. 1.Network Technology Research Centre (NTRC) School of Electrical and Electronic EngineeringNanyang Technological UniversitySingapore

Personalised recommendations