Skip to main content
SpringerLink
Log in

Optimization Algorithms for Shared Groups in Multicast Routing

  • Conference paper
  • First Online:
Models, Algorithms and Technologies for Network Analysis (NET 2014)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 156))

Included in the following conference series:

  • 721 Accesses

Abstract

Multicast group routing is a combinatorial optimization problem occurring in the field of communication networks. Given a graph G = (V, E), a set of data sources S ⊂ V and destinations D ⊂ V, the problem requires the construction of one or more routing trees such that each destination has its demand satisfied by one or more data sources. The MGR can be viewed as a generalization of the multicast routing problem with a single data source. This problem has important applications in the design of collaborative communication networks, among other uses. While the MGR problem is NP-hard, it is possible to determine algorithms for its solution that approximate the result in practice. In this paper, we discuss existing techniques for solving MGR. We also propose some fast heuristics for this problem and show that computational experiments support the quality of the results achieved by these algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)

    MATH  Google Scholar 

  2. Ballardie, A., Francis, P., Crowcroft, J.: Core-based trees (CBT) – an architecture for scalable inter-domain multicast routing. Comput. Commun. Rev. 23 (4), 85–95 (1993)

    Article  Google Scholar 

  3. Chen, S., Günlük, O., Yener, B.: Optimal packing of group multicastings. In: Proceedings of IEEE INFOCOM’98, San Francisco, CA, pp. 980–987. IEEE, New York (1998)

    Google Scholar 

  4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/McGraw-Hill, Cambridge (2001)

    MATH  Google Scholar 

  5. Deering, S., Estrin, D.L., Farinacci, D., Jacobson, V., Liu, C.-G., Wei, L.: The PIM architecture for wide-area multicast routing. IEEE ACM Trans. Netw. 4 (2), 153–162 (1996)

    Article  Google Scholar 

  6. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1 (1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  7. Du, D.-Z., Lu, B., Ngo, H., Pardalos, P.M.: Steiner tree problems. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, vol. 5, pp. 227–290. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  8. Gupta, S.K.S., Srimani, P.K.: Adaptive core selection and migration method for multicast routing in mobile ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 14 (1), (2003)

    Google Scholar 

  9. Hong, S., Lee, H., Park, B.H.: An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership. In: Proceedings of IEEE INFOCOM’98, pp. 1433–1440 (1998)

    Google Scholar 

  10. Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Optimal multicast routing with quality of service constraints. J. Netw. Syst. Manag. 4 (2), 107–131 (1996)

    Article  Google Scholar 

  11. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15 (2), 141–145 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  12. Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. (2004)

    MATH  Google Scholar 

  13. Oliveira, C.A.S., Pardalos, P.M.: Mathematical Aspects of Network Routing Optimization. Springer, New York (2010)

    MATH  Google Scholar 

  14. Oliveira, C.A.S., Pardalos, P.M.: A hybrid metaheuristic for routing on multicast networks. In: Batsyn, M.V., Kalyagin, V.A., Pardalos, P.M. (eds.) Models, Algorithms and Technologies for Network Analysis, pp. 97–110. Springer, Berlin (2014)

    Google Scholar 

  15. Oliveira, C.A.S., Prokopyev, O.A., Pardalos, P.M., Resende, M.G.C.: Streaming cache placement problems: Complexity and algorithms. Int. J. Comput. Sci. Eng. 3 (3), 173–183 (2007)

    Article  Google Scholar 

  16. Prytz, M.: On optimization in design of telecommunications networks with multicast and unicast traffic. Ph.D. thesis, Dept. of Mathematics, Royal Institute of Technology, Stockholm (2002)

    Google Scholar 

  17. Salama, H., Reeves, D., Viniotis, Y.: A distributed algorithm for delay-constrained unicast routing. In: Proceedings of IEEE INFOCOM’97, Kobe (1997)

    Google Scholar 

  18. Sriram, R., Manimaran, G., Siva Ram Murthy, C.: A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Trans. Netw. 7 (4), 514–529 (1999)

    Google Scholar 

  19. Vadera, A.: SCAMP: SCAlable multicast protocol for communication in large groups. Ph.D. thesis, India Institute of Technology, Kanpur (1999)

    Google Scholar 

  20. Wang, C.-F., Liang, C.-T., Jan, R.-H.: Heuristic algorithms for packing of multiple-group multicasting. Comput. Oper. Res. 29 (7), 905–924 (2002)

    Article  MATH  Google Scholar 

  21. Zhuge, H., Zhang, J.: Topological centrality and its e-science applications. J. Am. Soc. Inf. Sci. Technol. 61 (9), 1824–1841 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Quantitative Research Department, F-Squared Investments Inc., Ewing, NJ, USA

    Carlos A. S. Oliveira

  2. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL, 32608, USA

    Panos M. Pardalos

  3. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Panos M. Pardalos

Authors
  1. Carlos A. S. Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carlos A. S. Oliveira .

Editor information

Editors and Affiliations

  1. Laboratory of Algorithms and Technologies for Network Analysis (LATNA), National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Valery A. Kalyagin

  2. Laboratory of Algorithms and Technologies for Network Analysis (LATNA), National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Petr A. Koldanov

  3. Department of Industrial and System Engineering, Center for Applied Optimization University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Oliveira, C.A.S., Pardalos, P.M. (2016). Optimization Algorithms for Shared Groups in Multicast Routing. In: Kalyagin, V., Koldanov, P., Pardalos, P. (eds) Models, Algorithms and Technologies for Network Analysis. NET 2014. Springer Proceedings in Mathematics & Statistics, vol 156. Springer, Cham. https://doi.org/10.1007/978-3-319-29608-1_4

Download citation

Publish with us

Policies and ethics

Search

Navigation