Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

On Minimum Cost Multicast Routing Based on Cost Prediction

  • Kim, Moon-Seong (Department of Computer Science and Engineering, Michigan State University) ;
  • Mutka, Matt W. (Department of Computer Science and Engineering, Michigan State University) ;
  • Hwang, Dae-Jun (School of Information and Communication Engineering, Sungkyunkwan University) ;
  • Choo, Hyun-Seung (School of Information and Communication Engineering, Sungkyunkwan University)
  • Published : 2009.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.

Keywords

References

  1. H. Takahashi and A. Matsuyama, "An approximate solution for the Steinerproblem in graphs," Mathematica Japonica , vol. 24, no. 6, pp. 573-577,1980
  2. B. Wang and J. C. Hou, "Multicast routing and its QoS extension: Problems,algorithms, and protocols," IEEE Network, vol. 14, no. 1, pp. 22-36,2000
  3. D. Z. Du, B. Lu, H. Ngo, and P. M. Pardalos, "Steiner tree problems," Encyclopedia of Optimization, vol. 5, pp. 227-290, 2001
  4. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steinertrees," Acta Informatica, vol 15, pp. 141-145, 1981 https://doi.org/10.1007/BF00288961
  5. S. Ramanathan, "Multicast tree generation in networks with asymmetriclinks," IEEE/ACM Trans. Netw. , vol. 4, no. 4, pp. 558-568, 1996 https://doi.org/10.1109/90.532865
  6. F. Bauer and A. Varma, "Distributed algorithms for multicast path setup indata networks," IEEE/ACM Trans. Netw. , vol. 4, no. 2, pp. 181-191, 1996 https://doi.org/10.1109/90.490746
  7. C. P. Low and N. Wang, "On finding feasible solutions for the group multicastrouting problem," IEICE Trans. Commun. , vol. E85-B, no. 1, pp268-277, 2002
  8. M. Doar and I. Leslie, "How bad is naive multicast routing?" in Proc. IEEE INFOCOM, 1993, pp. 82-89
  9. Y.-C. Bang, S. Chung, M. Kim, and S.-S. Joo, "On multicast communication swith minimum resources," Springer- Verlag, LNCS 3726, pp. 4-13,2005
  10. M. Kim, M. Kang, H. Choo, J. S. Yang, and Y.-c. Bang, "On efficiencygroup multicasting algorithm with multiple minimum Steinertrees," Springer- Verlag, LNCS 4489, pp. 432-439, 2007
  11. B. W. Waxman, "Routing of multipoint connections," IEEE J. Sel. AreasCommun. , vol. 6, no. 9, pp. 1617-1622, Dec. 1988 https://doi.org/10.1109/49.12889
  12. M. Doar, Multicast in the ATM environment, Ph.D. Dissertation, CambridgeUniv., Computer Lab., Sept. 1993
  13. M. Doar, "A better mode for generating test networks," in Proc. IEEE GLOBECOM, 1996, pp. 86-93
  14. C.-K. Toh, "Performance evaluation of crossover switch discovεry algorithms for wireless ATM LANs," in Proc. IEEE INFOCOM, 1993, pp1380-1387
  15. E.W. Zegura, K. L. Calvert, and S. Bhattacharjee, "How to model anInter network," in Proc. IEEE INFOCOM‘1996, pp.594-602
  16. K. L. Calvert, M. Doar, and M.Doar, "Modelling Internet topology," IEEECommun. Mag. , pp. 160-163, June 1997
  17. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, andE. Upfal, "Stochastic models for the web graph," in Proc. 41st AnnualSymposium on Foundations of Computer Science, 2000, pp. 57-65
  18. A. S. Rodionov and H. Choo, "On generating random network structures:Connected graphs," Lecture Notes in Computer Sciece, vol. 3090, pp. 483-491, 2004