Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks

(Work in Progress)
  • Vincent Reinhard
  • Joanna Tomasik
  • Dominique Barth
  • Marc-Antoine Weisser
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5550)


The CARRIOCAS project aims to guarantee QoS connectivity services to distributed applications in a Telecom carrier network. A large number of these applications (for example video applications) use a multicast service packet delivery. Multicast which minimizes the total used bandwidth in the MPLS network has become an important subject. We study multicast routing in the network where only some routers can duplicate packets. We prove that the construction of a multicast tree minimizing the bandwidth used in such a network is a NP-complete problem and we propose an heuristic algorithm to solve it. We evaluate the performance of the heuristic in terms of total bandwidth used by the multicast for different network sizes.


Multicast bandwidth optimization MPLS networks 


  1. 1.
    The CARRIOCAS website,
  2. 2.
    Verchere, D.: Orchestrating optimally IT and network resource allocations for stringent distributed applications over ultrahigh bit rate transmission networks. In: ECOC 2007 (2007)Google Scholar
  3. 3.
    Audouin, O.: CARRIOCAS description and how it will require changes in the network to support Grids. OGF (2007)Google Scholar
  4. 4.
    Reinhard, V., Tomasik, J.: A mechanism of application-network interactions in a high-speed optical network. In: CISIS 2008 (2008)Google Scholar
  5. 5.
    Zhang, X., Wei, J., Qiao, C.: Constrained Multicast Routing in WDM Networks with Sparse Light Splitting. In: INFOCOM 2000 (2000)Google Scholar
  6. 6.
    Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of Multicast Routing Algorithms forReal-Time Communication on High-Speed Networks. IEEE J. on Sel. Areas in Comm. 15(3) (April 1997)Google Scholar
  7. 7.
    Myoungki, J., Yijun, X., Cankaya, H.C., Vandenhoute, M., Qiao, C.: Efficient multicast schemes for optical burst-switched WDM networks. In: IEEE ICC 2000 (2000)Google Scholar
  8. 8.
    Malli, R., Zhang, X., Qiao, C.: Benefits of multicasting in all-optical networks. In: SPIE Proceedings, All Optical Networking, November 1998, pp. 209–220 (1998)Google Scholar
  9. 9.
    Beasly, J.: An SST-based algorithm for the Steiner problem in graphs. Networks 19, 1–16 (1989)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Hwang, F., Richards, D.: Steiner tree problems. Networks 22, 55–89 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kompella, V., Pasquale, J., Polyzos, G.: Multicasting for multimedia applications. In: INFOCOM 1992 (1992)Google Scholar
  12. 12.
    Bharath-Kumar, K., Jaffe: Routing to multiple destinations in computer networks. IEEE Transactions on Communications 31(3), 343–351 (1983)CrossRefzbMATHGoogle Scholar
  13. 13.
    Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An Approach to Universal Topology Generation. In: MASCOTS 2001 (2001)Google Scholar
  14. 14.
    Mannie, E. (ed.): Generalized Multi-Protocol Label Switching (GMPLS) Architecture, IETF RFC 3945 (Ocotber 2004)Google Scholar
  15. 15.
    Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol label switching architecture, IETF RFC 3031 (January 2001)Google Scholar
  16. 16.
    Mihelic, J., Robic, B.: Solving the k-center Problem Efficiently with a Dominating Set Algorithm. J. of Comp. and Info. Tech. - CIT 13, 3, 225–233 (2005)CrossRefGoogle Scholar
  17. 17.
    Karp, R.M.: Reducibility Among Combinatorial Problems. In: Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2009

Authors and Affiliations

  • Vincent Reinhard
    • 1
  • Joanna Tomasik
    • 1
  • Dominique Barth
    • 2
  • Marc-Antoine Weisser
    • 1
  1. 1.Computer Science DepartmentSUPELECGif sur YvetteFrance
  2. 2.PRiSMUniversité de Versailles-St-Quentin. VersaillesFrance

Personalised recommendations