Skip to main content
Log in

A robust optimization approach for multicast network coding under uncertain link costs

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Network coding is a technique that can be used to improve the performance of communication networks by performing mathematical operations at intermediate nodes. An important problem in coding theory is that of finding an optimal coding subgraph for delivering network data from a source node throughout intermediate nodes to a set of destination nodes with the minimum transmission cost. However, in many real applications, it can be difficult to determine exact values or specific probability distributions of link costs. Establishing minimum-cost multicast connections based on erroneous link costs might exhibit poor performance when implemented. This paper considers the problem of minimum-cost multicast using network coding under uncertain link costs. We propose a robust optimization approach to obtain solutions that protect the system against the worst-case value of the uncertainty in a prespecified set. The simulation results show that a robust solution provides significant improvement in worst-case performance while incurring a small loss in optimality for specific instances of the uncertainty.

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
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Koetter, R., Médard, M.: An algebraic approach to network coding. IEEE/ACM Trans. Netw. 11(5), 782–795 (2003)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Oliveira, C.A.S., Pardalos, P.M.: Mathematical Aspects of Network Routing Optimization. Springer, Berlin (2011)

    Book  MATH  Google Scholar 

  7. Raayatpanah, M.A., Salehi Fathabadi, H., Khalaj, B.H., Khodayifar, S.: Minimum cost multiple multicast network coding with quantized rates. Comput. Netw. 57, 1113–1123 (2012)

    Article  MATH  Google Scholar 

  8. Raayatpanah, M.A., Salehi Fathabadi, H., Khalaj, B.H., Khodayifar, S., Pardalos, P.M.: Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks. J. Netw. Comput. Appl. 41, 217–227 (2014)

    Article  Google Scholar 

  9. Dantzig, G.B.: Linear programming under uncertainty. In: Infanger, G. (ed.) Stochastic Programming, pp. 1–11. Springer, New York (2011)

  10. Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin (2011)

    Book  MATH  Google Scholar 

  11. Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154–1157 (1973)

    Article  MATH  Google Scholar 

  12. Falk, J.E.: Exact solutions of inexact linear programs. Oper. Res. 24(4), 783–787 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23(4), 769–805 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1–13 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88(3), 411–424 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. El Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1), 33–52 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  18. Fan, N., Pardalos, P.M.: Robust optimization of graph partitioning and critical node detection in analyzing networks. In: Wu, W., Daescu, O. (eds.) Combinatorial Optimization and Applications, pp. 170–183. Springer, Berlin (2010)

  19. Fan, N., Zheng, Q.P., Pardalos, P.M.: Robust optimization of graph partitioning involving interval uncertainty. Theor. Comput. Sci. 447, 53–61 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  20. Georgiev, G.P., Luc, D.T., Pardalos, P.M.: Robust aspects of solutions in deterministic multiple objective linear programming. Eur. J. Oper. Res. 229(1), 29–36 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  21. Xanthopoulos, P., Guarracino, M.R., Pardalos, P.M.: Robust generalized eigenvalue classifier with ellipsoidal uncertainty. Ann. Oper. Res. 216(1), 327–342 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  22. Xanthopoulos, P., Pardalos, P., Trafalis, T.B.: Robust Data Mining. Springer, Berlin (2012)

    MATH  Google Scholar 

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

    Article  Google Scholar 

  24. Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. Wiley-Interscience, New York (2011)

    MATH  Google Scholar 

Download references

Acknowledgments

This research project has been supported by the office of vice chancellor for research of Islamic Azad University, Kashan Branch. Research of P.M. Pardalos was partially supported by the Paul and Heidi Brown Preeminent Professorship at ISE, University of Florida.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. A. Raayatpanah.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghasvari, H., Raayatpanah, M.A. & Pardalos, P.M. A robust optimization approach for multicast network coding under uncertain link costs. Optim Lett 11, 429–444 (2017). https://doi.org/10.1007/s11590-016-1051-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1051-3

Keywords

Navigation