Skip to main content
Log in

Optimal-constrained multicast sub-graph over coded packet networks

Journal of Combinatorial Optimization Aims and scope Submit manuscript

Cite this article


Network coding is a technique which can be used to improve the performance of multicast communications by performing encoding operations at intermediate nodes. In real-time multimedia communication applications, there are usually several weights associated with links, such as cost, delay, jitter, loss ratio, security, and so on. In this paper, we consider the problem of finding an optimal multicast sub-graph over coded packet networks, where the longest end-to-end weight from the source to each destination does not exceed an upper bound. First, a mixed integer programming model is proposed to formulate the problem which is NP-hard. Then, a column-generation approach is described for this problem, in which the problem is decomposed into a master linear programming problem and several integer programming sub-problems. Moreover, two methods based on linear and Lagrangian relaxation are proposed to compute a tight lower bound of the optimal solution value. Computational results show that the proposed algorithm provides an efficient way for solving the problem, even for relatively large networks.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others


  • Ahlswede R, Cai N, Li S, Yeung R (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204–1216

    Article  MATH  MathSciNet  Google Scholar 

  • Ahuja R, Magnanti T, Orlin J (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Bazaraa M, Sherali H, Shetty C (2006) Nonlinear programming: theory and algorithms. Wiley-interscience, Hoboken

  • Cai N, Yeung R (2002) Secure network coding. In: Proceedings of the IEEE International Symposium on Information Theory, pp 323–229

  • Desaulniers G, Desrosiers J, Solomon M (2005) Column generation. Springer, New York

  • Desrochers M, Soumis F (1986) A generalized permanent labelling algorithm for the shortest path problem with time windows. Université de Montréal, Centre de recherche surles transports, Montréal

  • Fragouli C, Soljanin E (2008) Network coding applications. Now Publishers

  • Garey M, Johnson D (1979) Computers and interatability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York

    MATH  Google Scholar 

  • Ghasvari H, Raayatpanah M, Khalaj B, Bakhshi H (2011) Optimal sub-graph selection over coded networks with delay and limited-size buffering the authors consider. IET Commun 5(11):1497–1505

    Article  MATH  MathSciNet  Google Scholar 

  • Gupta O, Ravindran A (1985) Branch and bound experiments in convex nonlinear integer programming. Manag Sci 31(12):1533–1546

    Article  MATH  MathSciNet  Google Scholar 

  • Jaggi S, Sanders P, Chou P, Effros M, Egner S, Jain K, Tolhuizen L (2005) Polynomial time algorithms for multicast network code construction. IEEE Trans Inf Theory 51(6):1973–1982

    Article  MATH  MathSciNet  Google Scholar 

  • Lee W, Hluchyi M, Humblet P (1995) Routing subject to quality of service constraints in integrated communication networks. IEEE Netw 9(4):46–55

    Article  Google Scholar 

  • Li S, Yeung R, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49(2):371–381

    Article  MATH  MathSciNet  Google Scholar 

  • Lun D, Médard M, Koetter R, Effros M (2008) Linear network coding. Phys Commun 1(1):3–20

    Article  Google Scholar 

  • Lun D, Ratnakar N, Médard M, Koetter R, Karger D, Ho T, Ahmed E, Zhao F (2006) Minimum-cost multicast over coded packet networks. IEEE Trans Inf Theory 52(6):2608–2623

    Article  MATH  Google Scholar 

  • ILOG Inc (2005) Using the CPLEX callable library and CPLEX mixed integer library. ILOG Inc.

  • Oliveira CAS, Pardalos PM (2011) Mathematical aspects of network routing optimization. Springer, New York

  • Raayatpanah M, Fathabadi HS (2012) Minimum cost multiple multicast network coding with quantized rates. Comput Netw 57:1113–1123

    Google Scholar 

  • Resende MGC, Pardalos PM (2006) Handbook of optimization in telecommunications. Springer, New York

  • Sahinidis N (1996) Baron: a general purpose global optimization software package. J Glob Optim 8(2):201–205

    Article  MATH  MathSciNet  Google Scholar 

  • Xi Y, Yeh EM (2010) Distributed algorithms for minimum cost multicast with network coding. IEEE/ACM Trans Netw 18(2):379–392

    Article  Google Scholar 

  • Yeung R, Li S, Cai N, Zhang Z (2005) Network coding theory: single sources. Found Trends Commun Inf Theory 2(4):241–329

    Article  Google Scholar 

  • Ziegelmann M (2007) Constrained shortest paths and related problems-constrained network optimization. VDM Verlag

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to P. M. Pardalos.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Raayatpanah, M.A., Salehi Fathabadi, H., Bahramgiri, H. et al. Optimal-constrained multicast sub-graph over coded packet networks. J Comb Optim 29, 723–738 (2015).

Download citation

  • Published:

  • Issue Date:

  • DOI: