Advertisement

Multiobjective Multicast Routing Algorithm

  • J. Crichigno
  • B. Barán
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3124)

Abstract

This paper presents a new multiobjective multicast routing algorithm (MMA) based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. Simulation results show that MMA is able to find Pareto optimal solutions. They also show that for the constrained end-to-end delay problem in which the traffic demands arrive one by one, MMA outperforms the shortest path algorithm in maximum link utilization and total cost metrics.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tanenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs (2003)Google Scholar
  2. 2.
    Lee, Y., Seok, Y., Choi, Y.: Explicit Multicast Routing Algorithm for Constrained Traffic Engineering. In: Proc. of 7th Int. Symp. on Computer and Comm, ISCC 2002 (2002)Google Scholar
  3. 3.
    Kompella, V., Gupta, A.: Multicast routing in multimedia communication. IEEE/ACM Transactions on Networking 1(3), 286–291 (1993)CrossRefGoogle Scholar
  4. 4.
    Ravikumar, C.P., Bajpai, R.: Source-based delay bounded multicasting in multimedia networks. Computer Communications 21, 126–132 (1998)CrossRefGoogle Scholar
  5. 5.
    Zhengying, W., Bingxin, S., Erdun, Z.: Bandwidth-delay-constraint least-cost multicast routing based on heuristic genetic algorithm. Computer Communications 24, 685–692 (2001)CrossRefGoogle Scholar
  6. 6.
    de Araujo, P.T., Barbosa, G.M.: Proceedings of the VII Brazilian Symposium on Neural Networks (SBRN 2002). In: Proceedings of the VII Brazilian Symposium on Neural Networks, SBRN 2002 (2002)Google Scholar
  7. 7.
    Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A comparative Case Study and the Strength Pareto Approach. IEEE Trans. Evolutionary Computation 3(4), 257–271 (1999)CrossRefGoogle Scholar
  8. 8.
    Goldberg, D.: Genetic Algorithm is Search, Optimization & Machine Learning. Addison-Wesley, Reading (1989)Google Scholar
  9. 9.
    Hwang, R.H., Do, W.Y., Yang, S.C.: Multicast Routing Based on Genetic Algorithms. Journal of Information Science and Engineering 16, 885–901 (2000)Google Scholar
  10. 10.
    Yen, J.: Finding the k shortest loopless path in a network. Management Science 17, 712–716 (1971)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • J. Crichigno
    • 1
  • B. Barán
    • 1
  1. 1.National University of AsuncionAsunciónParaguay

Personalised recommendations