Comparison of Different Path Composition Approaches to Multicast Optimization

  • Krzysztof Stachowiak
  • Piotr Zwierzykowski
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 233)


In this paper the different algorithms that are based on the different interpretations of the path composition have been evaluated and compared. A new technique – the Aggregated MLARAC has been proposed and described. Two different ways of the algorithm performance evaluation have been utilized in order to present the different aspects of the considered algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River (1993)MATHGoogle Scholar
  2. 2.
    Chen, S., Nahrstedt, K.: An overview of quality of service routing for next-generation high-speed networks: problems and solutions. IEEE Network 12, 64–79 (1998)CrossRefGoogle Scholar
  3. 3.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Feng, G.: A multi-constrained multicast QoS routing algorithm. Computer Communications 29(10), 1811–1822 (2006)CrossRefGoogle Scholar
  5. 5.
    Feng, G.: The revisit of QoS routing based on non-linear Lagrange relaxation: Research Articles. Int. J. Commun. Syst. 20, 9–22 (2007)CrossRefGoogle Scholar
  6. 6.
    Jiang, H., Yan, P.-L., Zhou, J.-G., Chen, L.-J., Wu, M.: Multi-constrained least cost qoS routing algorithm. In: de Souza, J.N., Dini, P., Lorenz, P. (eds.) ICT 2004. LNCS, vol. 3124, pp. 704–710. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Land, A.H., Doig, A.G.: An Automatic Method of Solving Discrete Programming Problems. Econometrica 28(3), 497–520 (1960)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Piechowiak, M., Zwierzykowski, P., Stasiak, M.: Multicast routing algorithm for packet networks with the application of the lagrange relaxation. In: NETWORKS 2010, 14th International Telecommunications Network Strategy and Planning Symposium, Warsaw, Poland, pp. 197–202 (September 2010)Google Scholar
  9. 9.
    Stachowiak, K., Zwierzykowski, P.: Architektura i Implementacja Wielokryterialnego Algorytmu Routingu Dla Ruchu Rozgałęźnego. In: The International Science Conference: Computer Networks – CN 2013, Lwówek Śląski, Poland (accepted, June 2013)Google Scholar
  10. 10.
    Stachowiak, K., Zwierzykowski, P.: Innovative Method of the Evaluation of Multicriterial Multicast Routing Algorithms. Journal of Telecommunications and Information Technology 1, 49–55 (2013)Google Scholar
  11. 11.
    Stachowiak, K., Zwierzykowski, P.: Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm. International Journal of Electronics and Telecommunications 58(4), 307–314 (2013)Google Scholar
  12. 12.
    Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Chair of Telecommunications and Computer Networks, Faculty of Electronics and TelecommunicationsPoznan University of TechnologyPoznańPoland

Personalised recommendations