Advertisement

On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds

  • Moonseong Kim
  • Young-Cheol Bang
  • Hyunseung Choo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3042)

Abstract

With the proliferation of multimedia group applications, the construction of multicast trees satisfying the quality of service (QoS) requirements is becoming a problem of the prime importance. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete [8]. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that our proposed scheme outperforms that of DDVCA [18] that is known to be most effective so far in any network topology. The enhancement is up to about 11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn2).

Keywords

Destination Node Delay Variation Multicast Tree Multicast Group Core Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    K. Bharath-Kumar and J. M. Jaffe, “Routing to multiple destinations in computer networks,” IEEE Trans. Commun., vol. COMM-31, no. 3, pp. 343–351, March 1983.CrossRefGoogle Scholar
  2. 2.
    T. Ballardie, P. Francis, and J. Crowcroft, “Core based trees (CBT): An architecture for scalable inter-domain multicast routing,”. Computer Commun Rev., vol. 23, no. 4, pp. 85–95, 1993.CrossRefGoogle Scholar
  3. 3.
    A. Ballardie, B. Cain, and Z. Zhang, “Core Based Trees (CBT Version 3) Multicast Routing,” Internet draft, 1998.Google Scholar
  4. 4.
    Y.-C. Bang and H. Choo, “On multicasting with minimum costs for the Internet topology,” Springer-Verlag Lecture Notes in Computer Science, vol. 2400, pp. 736–744, August 2002.CrossRefGoogle Scholar
  5. 5.
    S. Deering et al., “Protocol Independent Multicast-Sparse Mode (PIM-SM): Motivation and Architecture,” Internet draft, 1998.Google Scholar
  6. 6.
    E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959.CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    D. Estrin et al., “Protocol Independent Multicast (PIM) Sparse Mode/Dense Mode,” Internet draft, 1996.Google Scholar
  8. 8.
    M. R. Garey, R. L. Graham, and D. S. Johnson, “The complexity of computing steiner minimal trees,” SIAM J. Appl. Math., vol. 32, no. 4, pp. 835–859, June 1977.CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    E. N. Gilbert and H. O. Pollak, “Steiner minimal tree,” SIAM J. Appl. Math., vol. 16, 1968.Google Scholar
  10. 10.
    S. L. Hakimi, “Steiner’s problem in graphs and its implication,” Networks, vol. 1, pp. 113–133, 1971.CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, “Multicast routing for multimedia communication,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286–292, June 1993.CrossRefGoogle Scholar
  12. 12.
    L. Kou, G. Markowsky, and L. Berman, “A fast algorithm for steiner trees,” Acta Informatica, vol. 15, pp. 141–145, 1981.CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    J. Moy, “Multicast Extension to OSPF,” Internet draft, 1998.Google Scholar
  14. 14.
    T. Pusateri, “Distance Vector Routing Protocol”, draft-ietf-idmr-dvmrp-v3–07, 1998.Google Scholar
  15. 15.
    A.S. Rodionov and H. Choo, “On generating random network structures: Trees,” Springer-Verlag Lecture Notes in Computer Science, vol. 2658, pp. 879–887, June 2003.CrossRefMathSciNetGoogle Scholar
  16. 16.
    A.S. Rodionov and H. Choo, “On generating random network structures: Connected Graphs,” International Conference on Information Networking 2004, Proc. ICOIN-18, pp. 1145–1152, February 2003.Google Scholar
  17. 17.
    G. N. Rouskas and I. Baldine, “Multicast routing with end-to-end delay and delay variation constraints,” IEEE JSAC, vol. 15, no. 3, pp. 346–356, April 1997.Google Scholar
  18. 18.
    P.-R. Sheu and S.-T. Chen, “A fast and efficient heuristic algorithm for the delay-and delay variation bound multicast tree problem,” Information Networking, Proc. ICOIN-15, pp. 611–618, January 2001.Google Scholar
  19. 19.
    H. Takahashi and A. Matsuyame, “An approximate solution for the steiner problem in graphs,” Mathematica Japonica, vol. 24, no. 6, pp. 573–577, 1980.zbMATHGoogle Scholar
  20. 20.
    B. Wang and J. C. Hou, “Multicast Routing and its QoS Extension: Problems, Algorithms, and Protocols,” IEEE Networks, Jan./Feb, 2000.Google Scholar
  21. 21.
    B. W. Waxman, “Routing of multipoint connections,” IEEE JSAC, vol. 6, no. 9, pp. 1617–1622, December 1988Google Scholar
  22. 22.
    Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, “A source-based algorithm for near-optimum delay-constrained multicasting,” Proc. IEEE INFOCOM’95, pp. 377–385, March 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Moonseong Kim
    • 1
  • Young-Cheol Bang
    • 2
  • Hyunseung Choo
    • 1
  1. 1.School of Information and Communication EngineeringSungkyunkwan UniversitySuwonKorea
  2. 2.Department of Computer EngineeringKorea Polytechnic UniversityGyeonggi-DoKorea

Personalised recommendations