Multimedia Traffic Distribution Using Capacitated Multicast Tree

  • Yong-Jin Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4317)


This study deals with the capacitated multicast tree (CMT) problem, which consists of finding a set of minimum cost multicasting trees rooted at a source node satisfying the traffic requirements at end-nodes. This paper proposes a dynamic programming based algorithm with two phases. In the first phase, the algorithm generates feasible solutions to satisfy the traffic capacity constraint. It finds the optimal multicast trees using matching procedure in the second phase. The proposed algorithm for the CMT problem can be used for efficient multimedia traffic distribution in local area network. Performance evaluation shows that the proposed algorithm has good efficiency for small network with light traffic.


Execution Time Source Node Traffic Volume Local Area Network Exact Algorithm 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lee, Y., Atiquzzaman, M.: Least Cost Multicast Multicasting Tree Algorithm for Local Computer Network. In: Lu, X., Zhao, W. (eds.) ICCNMC 2005. LNCS, vol. 3619, pp. 268–275. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Lee, Y., Atiquzzaman, M.: Least Cost Heuristic for the Delay-Constrained Capacitated Minimum Multicasting Tree Problem. Computer Communications 28(11), 1371–1379 (2005)CrossRefGoogle Scholar
  3. 3.
    Chandy, K., Lo, T.: The Capacitated Minimum Multicasting Tree Networks. Networks 3, 173–181 (1973)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gavish, B.: Augmented Based Algorithm for Centralized Network Design. IEEE Trans. on. Comm 33(12), 1247–1257 (1985)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Gavish, B.: Topological Design of Centralized Computer Networks Formulations and Algorithms. Networks 12, 55–357 (1982)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Kershenbaum, A., Boorstyn, R.: Centralized Teleprocessing Network Design. Networks 13, 279–293 (1983)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Papadimitriou, C.: The Complexity of the Capacitated Tree Problem. Networks 8, 217–230 (1978)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Lee, Y., Atiquzzaman, M.: Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds.) EUC 2005. LNCS, vol. 3824, pp. 1099–1106. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Cheng, G., Ansari, N.: On Multiple Additively Constrained Path Selection. IEE Proc. Communications 149(5), 237–241 (2002)CrossRefGoogle Scholar
  10. 10.
    Cheng, G., Ansari, N.: Finding All Hop(s) Shortest Path. IEEE Communications Letters 8(2), 122–124 (2004)CrossRefGoogle Scholar
  11. 11.
    Cheng, G., Ansari, N.: Achieving 100% Success Ratio in Finding the Delay Constrained Least Cost Path. In: Proc. of IEEE GLOBECOM 2004, pp. 1505–1509 (2004)Google Scholar
  12. 12.
    Juttner, A., Szyiatowszki, M.I., Rajko, Z.: Lagrange relaxation based method for the QoS ruoting problem. In: Proc. IEEE INFOCOM 2001, pp. 859–869 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yong-Jin Lee
    • 1
  1. 1.Department of Technology EducationKorea National University of EducationChungbukKorea

Personalised recommendations