Skip to main content
SpringerLink
Log in

On solving the 1 + 1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Network coding techniques have been viewed as the promising venue to improve the network efficiency and indeed, have been widely explored in the realm of failure recovery in optical networks. The combination of near-instantaneous recovery achieved by dedicated protections and capacity efficiency enabled by network coding brings about new opportunities to challenge the well-established trade-off of trading speed recovery for capacity efficiency and vice versa. In this context, the use of all-optical XOR network coding has reshaped the traditional 1 + 1 optical path protection in transparent WDM optical networks and established a new problem, called, 1 + 1 routing, wavelength and network coding assignment (1 + 1 RWNCA) as the extension of the conventional 1 + 1 routing and wavelength assignment (1 + 1 RWA). In this paper, we propose a bi-objective integer linear programming model of the 1 + 1 RWNCA problem aiming at minimizing the wavelength resources as the primary objective and simultaneously minimizing the wavelength link usage as the secondary objective. Our formulation uses a weighting method to combine two objectives into an integrated one and we provide insights on setting up the weight vectors to capture the priority of individual objectives. The effectiveness of our integrated objective model in comparison with reference designs based on the single-objective model, 1 + 1 RWA and 1 + 1 RWNCA, is numerically evaluated on different realistic topologies and traffic sets. Extensive simulation highlights that our proposal uses as efficient as around \(60\%\) of the required wavelength link resources of reference designs and simultaneously achieve the highest performance on the primary objective of minimizing the wavelength resources while its computation time is a few time longer than its single objective counterpart model.

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

Access this article

Log in via an institution

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. Cisco. (2016). The Zettabyte Era: Trends and analysis. http://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/vni-hyperconnectivity-wp.pdf. Accessed 5 November 2016.

  2. Saleh, A., & Simmons, J. M. (2012). All-optical networking: Evolution, benefits, challenges, and future vision. Proceedings of the IEEE, 100(5), 1105–1117. https://doi.org/10.1109/JPROC.2011.2182589.

    Article  Google Scholar 

  3. Thanh, H. D., Morvan, M., Gravey, P., Cugini, F., & Cerutti, I. (2014). On the spectrum-efficiency of transparent optical transport network design with variable-rate forward error correction codes. In 16th International conference on advanced communication technology (pp. 1173–1177). https://doi.org/10.1109/ICACT.2014.6779143.

  4. Saleh, A., & Simmons, J. M. (2011). Technology and architecture to enable the explosive growth of the internet. IEEE Communications Magazine, 49(1), 126–132. https://doi.org/10.1109/MCOM.2011.5681026.

    Article  Google Scholar 

  5. Amazons multi-million dollar server outage caused by it worker typo. https://www.rt.com/news/379398-amazon-server-outage-typo/. Accessed 30 April 2017.

  6. Zhou, D., & Subramaniam, S. (2000). Survivability in optical networks. IEEE Network, 14(6), 16–23. https://doi.org/10.1109/65.885666.

    Article  Google Scholar 

  7. Skorin-Kapov, N., Furdek, M., Zsigmond, S., & Wosinska, L. (2016). Physical-layer security in evolving optical networks. IEEE Communications Magazine, 54(8), 110–117. https://doi.org/10.1109/MCOM.2016.7537185.

    Article  Google Scholar 

  8. Hai, D. T., & Hoang, K. M. (2017). On the efficient use of multi-line rate transponder for shared protection in wdm network. In 2017 International conference on recent advances in signal processing, telecommunications computing (SigTelCom) (pp. 181–186). https://doi.org/10.1109/SIGTELCOM.2017.7849819.

  9. Dao, H., Morvan, M., & Gravey, P. (2018). An efficient network-side path protection scheme in OFDM-based elastic optical networks. International Journal of Communication Systems,. https://doi.org/10.1002/dac.3410.

    Google Scholar 

  10. Gravey, P., Hai, D., & Morvan, M. (2014). On the advantages of co-OFDM transponder in network-side protection. In Advanced photonics for communications (p. PW1B.3). Optical Society of America. https://doi.org/10.1364/PS.2014.PW1B.3, http://www.osapublishing.org/abstract.cfm?URI=PS-2014-PW1B.3.

  11. Li, Y., Ni, W., Zhang, H., Li, Y., & Zheng, X. (2012). Availability analytical model for permanent dedicated path protection in wdm networks. IEEE Communications Letters, 16(1), 95–97. https://doi.org/10.1109/LCOMM.2011.110711.111382.

    Article  Google Scholar 

  12. Xu, Z., Archambault, E., Tremblay, C., Chen, J., Wosinska, L., Belanger, M. P., et al. (2014). 1+1 Dedicated optical-layer protection strategy for filterless optical networks. IEEE Communications Letters, 18(1), 98–101. https://doi.org/10.1109/LCOMM.2013.111113.132000.

    Article  Google Scholar 

  13. Hai, D. T. (2017). A novel adaptive operation of multi-line rate transponder for dedicated protection in WDM network. In 2017 Seventh international conference on information science and technology (ICIST) (pp. 69–74). https://doi.org/10.1109/ICIST.2017.7926494

  14. Ahlswede, R., et al. (2000). Network information flow. IEEE Transactions on Information Theory, 46(4), 1204–1216. https://doi.org/10.1109/18.850663.

    Article  Google Scholar 

  15. Agarwal, A., & Charikar, M. (2004). On the advantage of network coding for improving network throughput. In Information theory workshop, 2004 (pp. 247–249). IEEE. https://doi.org/10.1109/ITW.2004.1405308.

  16. Kim, M., Médard, M., & O’Reilly, U. M. (2009). Network coding and its implications on optical networking. In Optical fiber communication conference and national fiber optic engineers conference (p. OThO3). Optical Society of America. https://doi.org/10.1364/OFC.2009.OThO3, http://www.osapublishing.org/abstract.cfm?URI=OFC-2009-OThO3.

  17. Koetter, R., & Medard, M. (2003). An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11(5), 782–795. https://doi.org/10.1109/TNET.2003.818197.

    Article  Google Scholar 

  18. Liu, Z., Li, M., Lu, L., Chan, C. K., Liew, S. C., & Chen, L. K. (2012). Optical physical-layer network coding. IEEE hotonics Technology Letters, 24(16), 1424–1427. https://doi.org/10.1109/LPT.2012.2204972.

    Article  Google Scholar 

  19. Hai, D. T. (2017). Leveraging the survivable all-optical WDM network design with network coding assignment. IEEE Communications Letters, 21(10), 2190–2193. https://doi.org/10.1109/LCOMM.2017.2720661.

    Article  Google Scholar 

  20. Dao, T. H. (2018). On optimal designs of transparent WDM networks with 1 + 1 protection leveraged by all-optical XOR network coding schemes. Optical Fiber Technology, 40, 93–100. https://doi.org/10.1016/j.yofte.2017.11.009.

    Article  Google Scholar 

  21. Jaumard, B., Meyer, C., Thiongane, B., & Yu, X. (2004). Ilp formulations and optimal solutions for the RWA problem. In Global telecommunications conference, 2004. GLOBECOM ’04 (vol. 3, pp. 1918–1924). IEEE. https://doi.org/10.1109/GLOCOM.2004.1378328.

  22. Hai, D. T., Morvan, M., & Gravey, P. (2018). Combining heuristic and exact approaches for solving the routing and spectrum assignment problem. IET Optoelectronics, 12(2), 65–72. https://doi.org/10.1049/iet-opt.2017.0013.

    Article  Google Scholar 

  23. Hai, D. T. & Hoang, K. M. (2017). An efficient genetic algorithm approach for solving routing and spectrum assignment problem. 2017 International Conference on Recent Advances in Signal Processing, Telecommunications & Computing (SigTelCom), Da Nang (pp. 187–192). https://doi.org/10.1109/SIGTELCOM.2017.7849820.

  24. Kamal, A. E., & Mohandespour, M. (2014). Network coding-based protection. Optical Switching and Networking, 11(Part B), 189–201. https://doi.org/10.1016/j.osn.2013.06.006.

    Article  Google Scholar 

  25. Aly, S. A., & Kamal, A. E. (2008). Network protection codes against link failures using network coding. In IEEE GLOBECOM 2008—2008 IEEE global telecommunications conference (pp. 1–6). https://doi.org/10.1109/GLOCOM.2008.ECP.516.

  26. Kamal, A. E. (2010). 1 + n Network protection for mesh networks: Network coding-based protection using p-cycles. IEEE/ACM Transactions on Networking, 18(1), 67–80. https://doi.org/10.1109/TNET.2009.2020503.

    Article  Google Scholar 

  27. Kamal, A. E., & Al-Kofahi, O. (2011). Efficient and agile 1 + n protection. IEEE Transactions on Communications, 59(1), 169–180. https://doi.org/10.1109/TCOMM.2011.102910.090178.

    Article  Google Scholar 

  28. Aly, S. A., & Kamal, A. E. (2009) Network coding-based protection strategy against node failures. In 2009 IEEE international conference on communications (pp. 1–5). https://doi.org/10.1109/ICC.2009.5199219.

  29. Barla, I. B., Rambach, F., Schupke, D. A. & Thakur, M. (2010) Network coding for protection against multiple link failures in multi-domain networks. In 2010 IEEE International conference on communications (pp. 1–6). https://doi.org/10.1109/ICC.2010.5502271.

  30. Belzner, M., & Haunstein, H. (2009). Performance of network coding in transport networks with traffic protection. In 2009 ITG symposium on photonic networks (pp. 1–7).

  31. Muktadir, A. H. A., & Oki, E. (2012). A mathematical model for routing in 1 + 1 protection with network coding for instantaneous recovery. IEICE Communications Express, 1(6), 228–233. https://doi.org/10.1587/comex.1.228.

    Article  Google Scholar 

  32. Babarczi, P., et al. (2013). Realization strategies of dedicated path protection: A bandwidth cost perspective. Computer Networks, 57(9), 1974–1990. https://doi.org/10.1016/j.comnet.2013.03.015.

    Article  Google Scholar 

  33. Overby, H., et al. (2012). Cost comparison of 1 + 1 path protection schemes: A case for coding. In ICC 2012, IEEE (pp. 3067–3072). https://doi.org/10.1109/ICC.2012.6363928.

  34. Al Muktadir, A. H., & Oki, E. (2016). A coding-aware reliable route design scheme for instantaneous recovery. Telecommunication Systems, 62(3), 495–509. https://doi.org/10.1007/s11235-015-0089-3.

    Article  Google Scholar 

  35. Muktadir, A. H. A., & Oki, E. (2014). A heuristic routing algorithm for network coding aware 1 + 1 protection route design for instantaneous recovery. In 2014 IEEE 15th international conference on high performance switching and routing (HPSR) (pp. 84–89). https://doi.org/10.1109/HPSR.2014.6900886.

  36. Hai, D. T. (2017). An optimal design framework for 1 + 1 routing and network coding assignment problem in wdm optical networks. IEEE Access, 5, 22291–22298. https://doi.org/10.1109/ACCESS.2017.2761809.

    Article  Google Scholar 

  37. Al Muktadir, A. H., & Oki, E. (2017). Differential delay aware instantaneous recovery scheme with traffic splitting. International Journal of Communication Systems, 30(5), e3075. https://doi.org/10.1002/dac.3075.E3075dac.3075.

    Article  Google Scholar 

  38. Phong, P. V., Muktadir, A. H. A., & Oki, E. (2015). A hybrid instantaneous recovery route design scheme with two different coding aware scenarios. IEICE Communications Express, 4(1), 8–13. https://doi.org/10.1587/comex.4.8.

    Article  Google Scholar 

  39. Ramirez, W., Masip-Bruin, X., Yannuzzi, M., Montero, D., Martinez, A., & Lopez, V. (2014). Network coding-based protection scheme for elastic optical networks. In 2014 10th international conference on the design of reliable communication networks (DRCN) (pp. 1–8). https://doi.org/10.1109/DRCN.2014.6816136.

  40. Yang, L., Gong, L., & Zhu, Z. (2016). Incorporating network coding to formulate multicast sessions in elastic optical networks. In 2016 International conference on computing, networking and communications (ICNC) (pp. 1–5). https://doi.org/10.1109/ICCNC.2016.7440672.

  41. Manley, E. D., Deogun, J., Xu, L., & Alexander, D. R. (2010). All-optical network coding. IEEE/OSA Journal of Optical Communications and Networking, 2(4), 175–191. https://doi.org/10.1364/JOCN.2.000175.

    Article  Google Scholar 

  42. Hai, D., Morvan, M., & Gravey, P. (2014). On the routing and spectrum assignment with multiple objectives. In Advanced photonics for communications (p. JT3A.12). Optical Society of America. http://www.opticsinfobase.org/abstract.cfm?URI=PS-2014-JT3A.12.

  43. Hai, D. T. (2017). Multi-objective genetic algorithm for solving routing and spectrum assignment problem. In 2017 Seventh international conference on information science and technology (ICIST) (pp. 177–180). https://doi.org/10.1109/ICIST.2017.7926753.

  44. Monoyios, D., & Vlachos, K. (2011). Multiobjective genetic algorithms for solving the impairment-aware routing and wavelength assignment problem. IEEE/OSA Journal of Optical Communications and Networking, 3(1), 40–47. https://doi.org/10.1364/JOCN.3.000040.

    Article  Google Scholar 

  45. Rubio-Largo, l., Vega-Rodrguez, M., Gmez-Pulido, J., & Snchez-Prez, J. (2010). Solving the routing and wavelength assignment problem in WDM networks by using a multiobjective variable neighborhood search algorithm. In E. Corchado, P. Novais, C. Analide, J. Sedano (Eds.), Soft computing models in industrial and environmental applications, 5th international workshop (SOCO 2010). Advances in intelligent and soft computing (Vol. 73, pp. 47–54). Berlin: Springer. https://doi.org/10.1007/978-3-642-13161-5-7.

  46. Marler, R., & Arora, J. (2010). The weighted sum method for multi-objective optimization: New insights. Structural and Multidisciplinary Optimization, 41(6), 853–862. https://doi.org/10.1007/s00158-009-0460-7.

    Article  Google Scholar 

  47. lvaro, R.-L., & Vega-Rodrguez, M. A. (2013). Applying MOEAs to solve the static routing and wavelength assignment problem in optical WDM networks. Engineering Applications of Artificial Intelligence, 26(56), 1602–1619. https://doi.org/10.1016/j.engappai.2013.03.005.

    Google Scholar 

  48. Clímaco, J., Craveirinha, J., & Girão-Silva, R. (2016). Multicriteria analysis in telecommunication network planning and design: A survey (pp. 1167–1233). New York: Springer.

    Google Scholar 

  49. Chen, L. K., Li, M., & Liew, S. C. (2015). Breakthroughs in photonics 2014: Optical physical-layer network coding, recent developments, and challenges. IEEE Photonics Journal, 7(3), 1–6. https://doi.org/10.1109/JPHOT.2015.2418264.

    Google Scholar 

  50. Kong, D., Li, Y., Wang, H., Zhou, S., Zang, J., Zhang, J., et al. (2013). All-optical XOR gates for QPSK signal based optical networks. Electronics Letters, 49(7), 486–488. https://doi.org/10.1049/el.2013.0010.

    Article  Google Scholar 

  51. Porzi, C., et al. (2009). All-optical XOR gate by means of a single semiconductor optical amplifier without assist probe light. In LEOS ’09 (pp. 617–618). IEEE. https://doi.org/10.1109/LEOS.2009.5343425.

  52. Thanh, H. D., Morvan, M., & Gravey, P. (2014). On the usage of flexible transponder in survivable transparent flex-grid optical network. In 2014 9th International symposium on communication systems, networks digital sign (CSNDSP) (pp. 1123–1127). https://doi.org/10.1109/CSNDSP.2014.6923998.

  53. CPLEX, I. I. (2016). High-performance mathematical programming engine. http://www.ibm.com.

Download references

Author information

Authors and Affiliations

  1. Institute of Technology, Hanoi University of Industry, Hanoi, Vietnam

    Dao Thanh Hai

Authors
  1. Dao Thanh Hai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dao Thanh Hai.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hai, D.T. On solving the 1 + 1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model. Telecommun Syst 71, 155–165 (2019). https://doi.org/10.1007/s11235-018-0474-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-018-0474-9

Keywords

Search

Navigation