An overview of theoretical solutions for fault-tolerant routing in telecommunication networks

Authors

  • Oleksandra Serhiivna Yeremenko Kharkiv National University of Radio Electronics, Ukraine https://orcid.org/0000-0003-3721-8188
  • Maryna Oleksandrivna Yevdokymenko Kharkiv National University of Radio Electronics, Ukraine

DOI:

https://doi.org/10.30837/pt.2018.1.02

Abstract

In this article, the existing solutions in the field of fault-tolerant routing have been analyzed, which allowed formulating a list of key requirements that prospective solutions should meet, as well as mathematical models and methods on which they are based. These include flow-based traffic nature, which is a distinctive feature of most multimedia services and a compulsory moment when implementing bandwidth protection schemes and other network Quality of Service indicators; optimization problem statement: the focus on optimizing the use of available network resources; high scalability of solutions for fault-tolerant routing; support for basic protection schemes for network elements (node / communication link / path / bandwidth and QoS level for a set of indicators); coordinated solving of specific tasks for fault-tolerant routing, for example, default gateway protection, fast rerouting, etc .; extension of existing solutions to support load balancing associated with the implementation of a multipath routing strategy with appropriate support for protection schemes not single path, but a multipath, that is, the set of paths in which packets of the same flow are transmitted; acceptable computational complexity of routing solutions. The classification of perspective schemes of protection of the Quality of Service (QoS) level is developed, which is important to be implemented during the fault-tolerant routing of multimedia flows. Appropriate routing solutions should provide QoS protection at the same time for a variety of Network Performance (NP) or Quality of Experience (QoE) indicators, requiring the development of new or improved existing mathematical models and fault-tolerant routing methods in accordance with the requirements.

References

CHOLDA, P.; TAPOLCAI, J.; CINKLER, T.; WAJDA, K.; JAJSZCZYK, A. “Quality of resilience as a network reliability characterization tool,” IEEE network, v.23, n.2., p. 11-19, 2009. DOI: https://doi.org/10.1109/MNET.2009.4804331.

TIPPER, D. “Resilient network design: challenges and future directions,” Telecommunication Systems, v.56, n.1., p. 5-16, 2014. DOI: https://doi.org/10.1007/s11235-013-9815-x.

RAK, J. Resilient Routing in Communication Networks (Computer Communications and Networks), 1st edition. Springer International Publishing, 2015.

MAUTHE, A.; HUTCHISON, D.; CETINKAYA, E.K.; GANCHEV, I.; RAK, J.; STERBENZ, J.P.; GUNKELK, M.; SMITH, P.; GOMES, T. “Disaster-resilient communication networks: Principles and best practices,” Proc. of the 8th International Workshop Resilient Networks Design and Modeling (RNDM) 2016, 13-15 September 2016, Halmstad, Sweden. IEEE, 2016, p. 1-10. DOI: https://doi.org/10.1109/RNDM.2016.7608262.

BJÖRCK, F.; HENKEL, M.; STIRNA, J.; ZDRAVKOVIC, J. “Cyber resilience–fundamentals for a definition,” New Contributions in Information Systems and Technologies, v. 353, p. 311-316, Springer, Cham, 2015. DOI: https://doi.org/10.1007/978-3-319-16486-1_31.

FINK, G.A.; GRISWOLD, R.L.; BEECH, Z.W. “Quantifying cyber-resilience against resource-exhaustion attacks,” Proc. of the 7th International Symposium on Resilient Control Systems (ISRCS) 2014, 19-21 August, 2014, Denver, CO, USA. IEEE, 2014, p. 1-8. DOI: https://doi.org/10.1109/ISRCS.2014.6900093.

CHORAS, M.; KOZIK, R.; BRUNA, M.P.T.; YAUTSIUKHIN, A.; CHURCHILL, A.; MACIEJEWSKA, I.; EGUINOA, I.; JOMNI, A. “Comprehensive approach to increase cyber security and resilience,” Proc. of the 10th International Conference Availability, Reliability and Security (ARES) 2015, 24-27 August 2015, Toulouse, France. IEEE, 2015, p. 686-692. DOI: https://doi.org/10.1109/ARES.2015.30.

MUSMAN, S. “Assessing prescriptive improvements to a system's cyber security and resilience,” Proc. of the Annual IEEE Systems Conference (SysCon) 2016, 18-21 April 2016, Orlando, FL, USA. IEEE, 2016, p. 1-6. DOI: https://doi.org/10.1109/SYSCON.2016.7490660.

GALINEC, D.; STEINGARTNER, W. “Combining cybersecurity and cyber defense to achieve cyber resilience,” Proc. of the IEEE 14th International Scientific Conference on Informatics 2017, 14-16 November 2017, Poprad, Slovakia. IEEE, 2017, p. 87-93. DOI: https://doi.org/10.1109/INFORMATICS.2017.8327227.

RAK, J.; PAPADIMITRIOU, D.; NIEDERMAYER, H.; ROMERO, P. “Information-driven network resilience: Research challenges and perspectives,” Optical Switching and Networking, v.23, Part 2, p. 156-178, 2017. DOI: https://doi.org/10.1016/j.osn. 2016.06.002.

CHIU, C.W.; HUANG, K.S.; YANG, C.B.; TSENG, C.T. “An adaptive heuristic algorithm with the probabilistic safety vector for fault-tolerant routing on the (n, k)-star graph,” International Journal of Foundations of Computer Science, v.25, n.06, p. 723-743, 2014.

SOLEIMANY, A.; AZMOODEH, S. “More Improvement by Helping Ant to Fault-Tolerant Heuristic Routing Algorithm in Mesh Networks,” Research Journal of Applied Sciences, Engineering and Technology, v.6, n.4, p. 622-630, 2013. DOI: https://doi.org/10.19026/rjaset.6.4172.

ARAI, J.; LI, Y. “Fault-Tolerant Routing Algorithms for Hierarchical Dual-Nets with Limited and Arbitrary Number of Faulty Nodes,” International Journal of Networking and Computing, v.5, n.2, p. 329-346, 2015.

ELHOURANI, T.; GOPALAN, A.; RAMASUBRAMANIAN, S. “IP fast rerouting for multi-link failures,” IEEE/ACM Transactions on Networking, v.24, n.5, p. 3014-3025, 2016. DOI: https://doi.org/10.1109/TNET.2016.2516442.

GOPALAN, A.; RAMASUBRAMANIAN, S. “IP fast rerouting and disjoint multipath routing with three edge-independent spanning trees,” IEEE/ACM Transactions on Networking, v.24, n.3, p. 1336-1349, 2016. DOI: https://doi.org/10.1109/TNET.2015.2440179.

MARTINS, L.; GOMES, T.; TIPPER, D. “An efficient heuristic for calculating a protected path with specified nodes,” Proc. of the 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 13-15 September 2016, Halmstad, Sweden. IEEE, 2016, p. 150-157. DOI: https://doi.org/10.1109/RNDM.2016.7608281.

ANTONAKOPOULOS, S.; BEJERANO, Y.; KOPPOL, P. “Full protection made easy: The DisPath IP fast reroute scheme,” IEEE/ACM Transactions on Networking, v.23, n.4, p. 1229-1242, 2015. DOI: https://doi.org/10.1109/TNET.2014.2369855.

KUANG, K.; WANG, S.; WANG, X. “Discussion on the combination of loop-free alternates and maximally redundant trees for IP networks fast reroute,” Proc. of the International Conference on Communications (ICC), 10-14 June 2014, Sydney, NSW, Australia. IEEE, 2014, p. 1131-1136. DOI: https://doi.org/10.1109/ICC.2014.6883473.

MENTH, M.; BRAUN, W. “Performance comparison of not-via addresses and maximally redundant trees (MRTs),” Proc. of the IFIP/IEEE International Symposium on Integrated Network Management (IM 2013), 27-31 May 2013, Ghent, Belgium. IEEE, 2013, p. 218-225.

BRAUN, W.; MENTH, M. “Loop-free alternates with loop detection for fast reroute in software-defined carrier and data center networks,” Journal of Network and Systems Management, v.24, n.3, p. 470-490, 2016. DOI: https://doi.org/10.1007/s10922-016-9369-9.

BRAUN, W.; ALBERT, M.; ECKERT, T.; MENTH, M. “Performance comparison of resilience mechanisms for stateless multicast using bier,” Proc. of the IFIP/IEEE Symposium on Integrated Network and Service Management (IM), 8-12 May 2017, Lisbon, Portugal. IEEE, 2017, p. 230-238. DOI: https://doi.org/10.23919/INM.2017.7987284.

DUONG, T.D.; KANEKO, K. “Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes,” In: Xiang Y., Cuzzocrea A., Hobbs M., Zhou W. (eds) Algorithms and Architectures for Parallel Processing, ICA3PP 2011. Lecture Notes in Computer Science, v.7016, Springer, Berlin, Heidelberg, p. 106-116. DOI: https://doi.org/10.1007/978-3-642-24650-0_10.

LU, C.; HU, D. “A Fault-Tolerant Routing Algorithm for Wireless Sensor Networks Based on the Structured Directional de Bruijn Graph,” Cybernetics and Information Technologies, v.16, n.2, p. 46-59, 2016. DOI: https://doi.org/10.1515/cait-2016-0019.

YEH, S.I.; YANG, C.B.; CHEN, H.C. “Fault-tolerant routing on the star graph with safety vectors,” Proc. of the International Symposium on Parallel Architectures, Algorithms and Networks 2002 (I-SPAN'02), 22-24 May 2002, Makati City, Metro Manila, Philippines. IEEE, 2002, p. 301-306. DOI: https://doi.org/10.1109/ISPAN.2002.1004298.

NISHIYAMA, Y.; HIRAI, Y.; KANEKO, K. “Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs,” Proc. of the 15th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) 2014, 9-11 December 2014, Hong Kong, China. IEEE, 2014, p. 76-81. DOI: https://doi.org/10.1109/PDCAT.2014.20.

NISHIYAMA, Y.; SASAKI, Y.; HIRAI, Y.; NAKAJO, H.; KANEKO, K. “Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph,” Journal of Information Science and Engineering, p. 1-13, 2017.

WANG, D.; MCNAIR, J. “Circulant-graph-based fault-tolerant routing for all-optical WDM LANs,” Proc. of the Global Telecommunications Conference GLOBECOM 2010, 6-10 December 2010, Miami, FL, USA. IEEE, 2010, p. 1-5. DOI: https://doi.org/10.1109/GLOCOM.2010.5683293.

PIÓRO, M.; TOMASZEWSKI, A.; ŻUKOWSKI, C.; HOCK, D.; HARTMANN, M.; MENTH, M. “Optimized IP-based vs. explicit paths for one-to-one backup in MPLS fast reroute,” Proc. of the 14th International Telecommunications Network Strategy and Planning Symposium NETWORKS 2010, 27-30 September 2010, Warsaw, Poland. IEEE, 2010, p. 1-6. DOI: https://doi.org/10.1109/NETWKS.2010.5624923.

ADDIS, B.; CARELLO, G.; MATTIA, S. “Survivable green traffic engineering with shared protection,” Networks, v.69, n.1, p. 6-22, 2017. DOI: https://doi.org/10.1002/net.21717.

GOMES, T.; MARTINS, L.; FERREIRA, S.; PASCOAL, M.; TIPPER, D. “Algorithms for determining a node-disjoint path pair visiting specified nodes,” Optical Switching and Networking, v.23, p. 189-204, 2017. DOI: https://doi.org/10.1016/ j.osn.2016.05.002.

LIU, V.Y.; TIPPER, D. “Spare capacity allocation using shared backup path protection for dual link failures,” Computer Communications, v.36, n.6, p. 666-677, 2013. DOI: https://doi.org/10.1016/j.comcom.2012.09.007.

MYSLITSKI, K.; RAK, J.; KUSZNER, Ł. “Toward fast calculation of communication paths for resilient routing,” Networks, v.70, n.4, p. 308-326, 2017. DOI: https://doi.org/10.1002/net.21789.

GOMES, T.; TIPPER, D.; ALASHAIKH, A. “A novel approach for ensuring high end-to-end availability: The spine concept,” Proc. of the 10th International Conference on Design of Reliable Communication Networks (DRCN) 2014, 1-3 April 2014, Ghent, Belgium. IEEE, 2014, p. 1-8. DOI: https://doi.org/10.1109/DRCN.2014.6816142.

ALASHAIKH, A.; TIPPER, D.; GOMES, T. “Supporting differentiated resilience classes in multilayer networks,” Proc. of the 12th International Conference on Design of Reliable Communication Networks (DRCN) 2016, 15-17 March 2017, Paris, France. IEEE, 2016, p. 31-38. DOI: https://doi.org/10.1109/DRCN.2016.7470832.

ZHANG, X.; CHENG, Z.; LIN, R.; HE, L.; YU, S.; LUO, H. “Local Fast Reroute With Flow Aggregation in Software Defined Networks,” IEEE Communications Letters, v.21, n.4, p. 785-788, 2017. DOI: https://doi.org/10.1109/LCOMM.2016.2638430.

MALIK, A.; AZIZ, B.; ADDA, M.; KE, C.H. “Optimisation methods for fast restoration of software-defined networks,” IEEE Access, v.5., p. 16111-16123, 2017. DOI: https://doi.org/10.1109/ACCESS.2017.2736949.

RZYM, G.; WAJDA, K.; CHOŁDA, P. “SDN-based WAN optimization: PCE implementation in multi-domain MPLS networks supported by BGP-LS,” Image Processing & Communications, v.22, n.1, p. 35-48, 2017. DOI: https://doi.org/10.1515/ipc-2017-0004.

WANG, N.; HO, K.; PAVLOU, G.; HOWARTH, M. “An overview of routing optimization for internet traffic engineering,” IEEE Communications Surveys & Tutorials, v.10, n.1, p. 36-56, 2008. DOI: https://doi.org/10.1109/COMST.2008.4483669.

HASAN, H.; COSMAS, J.; ZAHARIS, Z.; LAZARIDIS, P.; KHWANDAH, S. “Development of FRR mechanism by adopting SDN notion,” Proc. of the 24th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), 22-24 September 2016, Split, Croatia. IEEE, 2016, p. 1-7. DOI: https://doi.org/10.1109/SOFTCOM.2016.7772133.

LEMESHKO, A.V.; YEREMENKO, O.S.; TARIKI, N. “Improvement of flow-oriented fast reroute model based on scalable protection solutions for telecommunication network elements,” Telecommunications and Radio Engineering, v.76, n.6, p. 477–490, 2017. DOI: https://doi.org/10.1615/TelecomRadEng.v76.i6.30.

YEREMENKO, O.S.; LEMESHKO, O.V.; TARIKI, N. “Fast ReRoute Scalable Solution with Protection Schemes of Network Elements,” Proc. of the First Ukraine Conference on Electrical and Computer Engineering (UKRCON), 29 May – 2 June 2017, Kiev, Ukraine. IEEE, 2017, p. 783-788. DOI: https://doi.org/10.1109/UKRCON.2017.8100353.

LEMESHKO, O.; YEREMENKO, O. “Enhanced method of fast re-routing with load balancing in software-defined networks,” Journal of ELECTRICAL ENGINEERING, v.68, n.6, p. 444–454, 2017. DOI: https://doi.org/10.1515/jee-2017-0079.

LEMESHKO, O.V.; YEREMENKO, O.S. “Rozrobka ta doslidzhennya liniynoyi optymizatsiynoyi modeli shvydkoyi peremarshrutyzatsiyi z balansuvannyam navantazhennya v telekomunikatsiynykh merezhakh [Development and research of linear optimization model of fast reroute with load balancing in telecommunication networks],” Radioelektronika i informatika, n.4(79). p. 18–25, 2017. (In Ukrainian).

LEMESHKO, O.; YEREMENKO, O.; NEVZOROVA, O. “Hierarchical Method of Inter-Area Fast Rerouting,” Transport and Telecommunication Journal, v.18, n.2, p. 155–167, 2017. DOI: https://doi.org/10.1515/ttj-2017-0015.

LEMESHKO, O.; YEREMENKO, O.; TARIKI, N. “Solution for the Default Gateway Protection within Fault-Tolerant Routing in an IP Network,” International Journal of Electrical and Computer Engineering Systems, v.8, n.1, p. 19–26, 2017.

YEREMENKO, O. “Tenzorna model' vidmovostiykoyi marshrutyzatsiyi z pidtrymkoyu yakosti obsluhovuvannya v mul'tyservisniy telekomunikatsiyniy merezhi [Tensor model of fault-tolerant routing with support of quality of service in multiservice telecommunication network],” Problemy telekomunіkacіj, n.2(21), p. 16-31, 2017. URI: http://pt.journal.kh.ua/2017/2/1/172_yeremenko_qosfrr.pdf. (In Ukrainian).

LEMESHKO, O.V.; YEVDOKYMENKO, M.O.; YEREMENKO, O.S. “ Potokova model' shvydkoyi peremarshrutyzatsiyi iz zakhystom rivnya obsluhovuvannya za pokaznykamy propusknoyi zdatnosti ta ymovirnosti vtrat [Flow-based fast re-route model with the protection of the indicators of quality of service as bandwith and probability of packet lost],” in Materialy VII mizhnarodnoyi naukovo-praktychnoyi konferentsiyi “Fizyko-tekhnolohichni problemy peredavannya, obroblennya ta zberihannya informatsiyi v infokomunikatsiynykh systemakh, PREDT-2018” [Proc. of VII International Scientific and Practical Conference on “Physical and Technological Problems of Transmission, Processing and Storage of Information in Infocommunication Systems”, PREDT-2018], 8-10 November 2018, Chernivtsi, Ukraine. “Misto”, 2018, p. 18-20. (In Ukrainian).

ITU-T. “Recommendation G. 107. The e-model, a computational model for use in transmission planning.” 2015.

ITU T. “Recommendation P. 1070. Opinion model for video-telephony applications.” 2018.

Пристатейна бібліографія

Cholda P., Tapolcai J., Cinkler T., Wajda K., Jajszczyk A. Quality of resilience as a network reliability characterization tool // IEEE network. – 2009. – Vol. 23, No.2. – P. 11-19. – DOI: 10.1109/MNET.2009.4804331.

Tipper D. Resilient network design: challenges and future directions // Telecommunication Systems. – 2014. – Vol.56, No.1. – P. 5-16. – DOI: 10.1007/s11235-013-9815-x.

Rak J. Resilient Routing in Communication Networks (Computer Communications and Networks), 1st edition. – Springer, 2015. – 181 p.

Mauthe A., Hutchison D., Cetinkaya E.K., Ganchev I., Rak J., Sterbenz J.P., Gunkelk M., Smith P., Gomes T. Disaster-resilient communication networks: Principles and best practices // Resilient Networks Design and Modeling (RNDM) 2016: Proceedings of the 8th International Workshop. Halmstad, Sweden, 13-15 September, 2016. – IEEE, 2016. – P. 1-10. DOI: 10.1109/RNDM.2016.7608262.

Björck F., Henkel M., Stirna J., Zdravkovic J. Cyber resilience–fundamentals for a definition // New Contributions in Information Systems and Technologies. – 2015. – Vol. 353. Springer, Cham. – P. 311-316. – DOI: https://doi.org/10.1007/978-3-319-16486-1_31.

Fink G. A., Griswold R. L., Beech Z. W. Quantifying cyber-resilience against resource-exhaustion attacks // Resilient Control Systems (ISRCS) 2014: Proceedings of the 7th International Symposium, Denver, CO, USA, 19-21 August, 2014. – IEEE, 2014. – P. 1-8. – DOI: 10.1109/ISRCS.2014.6900093.

Choras M., Kozik R., Bruna M.P.T., Yautsiukhin A., Churchill A., Maciejewska I., Eguinoa I., Jomni A. Comprehensive approach to increase cyber security and resilience // Availability, Reliability and Security (ARES) 2015: Proceedings of the 10th International Conference. Toulouse, France, 24-27 August, 2015. – IEEE, 2015. – P. 686-692. – DOI: 10.1109/ARES.2015.30.

Musman S. Assessing prescriptive improvements to a system's cyber security and resilience // Systems Conference (SysCon) 2016: Proceedings of the Annual IEEE Conference. Orlando, FL, USA, 18-21 April, 2016. – IEEE, 2016. – P. 1-6. – DOI: 10.1109/SYSCON.2016.7490660.

Galinec D., Steingartner W. Combining cybersecurity and cyber defense to achieve cyber resilience // Informatics 2017: Proceedings of the IEEE 14th International Scientific Conference. Poprad, Slovakia, 14-16 November, 2017. – IEEE, 2017. – P. 87-93. – DOI: 10.1109/INFORMATICS.2017.8327227.

Rak J., Papadimitriou D., Niedermayer H., Romero P. Information-driven network resilience: Research challenges and perspectives // Optical Switching and Networking, 2017. – Vol. 23, Part 2. – P. 156-178. – DOI: https://doi.org/10.1016/j.osn. 2016.06.002.

Chiu C.W., Huang K.S., Yang C.B., Tseng C.T. An adaptive heuristic algorithm with the probabilistic safety vector for fault-tolerant routing on the (n, k)-star graph // International Journal of Foundations of Computer Science. – 2014. – Vol.25, No.06. – P. 723-743.

Soleimany A., Azmoodeh S. More Improvement by Helping Ant to Fault-Tolerant Heuristic Routing Algorithm in Mesh Networks // Research Journal of Applied Sciences, Engineering and Technology. – 2013. – Vol.6, No.4. – P. 622-630. – DOI: 10.19026/rjaset.6.4172.

Arai J., Li Y. Fault-Tolerant Routing Algorithms for Hierarchical Dual-Nets with Limited and Arbitrary Number of Faulty Nodes // International Journal of Networking and Computing. – 2015. – Vol.5, No.2. – P. 329-346.

Elhourani T., Gopalan A., Ramasubramanian S. IP fast rerouting for multi-link failures // IEEE/ACM Transactions on Networking. – 2016. – Vol.24, No.5. – P. 3014-3025. – DOI: 10.1109/TNET.2016.2516442.

Gopalan A., Ramasubramanian S. IP fast rerouting and disjoint multipath routing with three edge-independent spanning trees // IEEE/ACM Transactions on Networking. – 2016. – Vol.24, No.3. – P. 1336-1349. – DOI: 10.1109/TNET.2015.2440179.

Martins L., Gomes T., Tipper D. An efficient heuristic for calculating a protected path with specified nodes // Resilient Networks Design and Modeling (RNDM): Proceedings of the 8th International Workshop, Halmstad, Sweden, 13-15 September, 2016. – IEEE, 2016. – P. 150-157. – DOI: 10.1109/RNDM.2016.7608281.

Antonakopoulos S., Bejerano Y., Koppol P. Full protection made easy: The DisPath IP fast reroute scheme // IEEE/ACM Transactions on Networking. – 2015. – Vol.23, No.4. – P. 1229-1242. – DOI: 10.1109/TNET.2014.2369855.

Kuang K., Wang S., Wang X. Discussion on the combination of loop-free alternates and maximally redundant trees for IP networks fast reroute // Communications (ICC): Proceedings of the International Conference, Sydney, NSW, Australia, 10-14 June, 2014. – IEEE, 2014. – P. 1131-1136. – DOI: 10.1109/ICC.2014.6883473.

Menth M., Braun W. Performance comparison of not-via addresses and maximally redundant trees (MRTs) // Integrated Network Management (IM 2013): Proceedings of the IFIP/IEEE International Symposium, Ghent, Belgium, 27-31 May, 2013. – IEEE, 2013. – P. 218-225.

Braun W., Menth M. Loop-free alternates with loop detection for fast reroute in software-defined carrier and data center networks // Journal of Network and Systems Management. – 2016. – Vol.24, No.3. – P. 470-490. – DOI: 10.1007/s10922-016-9369-9.

Braun W., Albert M., Eckert T., Menth M. Performance comparison of resilience mechanisms for stateless multicast using bier // Integrated Network and Service Management (IM): Proceedings of the IFIP/IEEE Symposium, Lisbon, Portugal, 8-12 ay, 2017. – IEEE, 2017. – P. 230-238. – DOI: 10.23919/INM.2017.7987284.

Duong T.D., Kaneko K. Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes // In: Xiang Y., Cuzzocrea A., Hobbs M., Zhou W. (eds) Algorithms and Architectures for Parallel Processing. – ICA3PP 2011. Lecture Notes in Computer Science, Vol. 7016. – Springer, Berlin, Heidelberg. – P. 106-116. – DOI: https://doi.org/10.1007/978-3-642-24650-0_10.

Lu C., Hu D. A Fault-Tolerant Routing Algorithm for Wireless Sensor Networks Based on the Structured Directional de Bruijn Graph // Cybernetics and Information Technologies. – 2016. – Vol.16, No.2. – P. 46-59. – DOI: 10.1515/cait-2016-0019.

Yeh S.I., Yang C.B., Chen H.C. Fault-tolerant routing on the star graph with safety vectors // Parallel Architectures, Algorithms and Networks 2002 (I-SPAN'02): Proceedings of the International Symposium. Makati City, Metro Manila, Philippines, 22-24 May, 2002. – IEEE, 2002. – P. 301-306. – DOI: 10.1109/ISPAN.2002.1004298.

Nishiyama Y., Hirai Y., Kaneko K. Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs // Parallel and Distributed Computing, Applications and Technologies (PDCAT) 2014: Proceedings of the 15th International Conference. Hong Kong, China, 9-11 December, 2014. – IEEE, 2014. – P. 76-81. – DOI: 10.1109/PDCAT.2014.20.

Nishiyama Y., Sasaki Y., Hirai Y., Nakajo H., Kaneko K. Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph // Journal of Information Science and Engineering. – 2017. – P. 1-13.

Wang D., McNair J. Circulant-graph-based fault-tolerant routing for all-optical WDM LANs // GLOBECOM 2010: Proceedings of the Global Telecommunications Conference. Miami, FL, USA, 6-10 December, 2010. – IEEE, 2010. – P. 1-5. – DOI: 10.1109/GLOCOM.2010.5683293.

Pióro M., Tomaszewski A., Żukowski C., Hock D., Hartmann M., Menth M. Optimized IP-based vs. explicit paths for one-to-one backup in MPLS fast reroute // NETWORKS 2010: Proceedings of the 14th International Telecommunications Network Strategy and Planning Symposium. Warsaw, Poland. 27-30 September, 2010. – IEEE, 2010. – P. 1-6. – DOI: 10.1109/NETWKS.2010.5624923.

Addis B., Carello G., Mattia S. Survivable green traffic engineering with shared protection // Networks. – 2017. – Vol.69, No.1. – P. 6-22. – DOI: https://doi.org/10.1002/net.21717.

Gomes T., Martins L., Ferreira S., Pascoal M., Tipper D. Algorithms for determining a node-disjoint path pair visiting specified nodes // Optical Switching and Networking. – 2017. – Vol.23. – P. 189-204. – DOI: https://doi.org/10.1016/ j.osn.2016.05.002.

Liu V.Y., Tipper D. Spare capacity allocation using shared backup path protection for dual link failures // Computer Communications. – 2013. – Vol.36, No.6. – P. 666-677. – DOI: 10.1016/j.comcom.2012.09.007.

Myslitski K., Rak J., Kuszner Ł. Toward fast calculation of communication paths for resilient routing // Networks. – 2017. – Vol.70, No.4. – P. 308-326. – DOI: https://doi.org/10.1002/net.21789.

Gomes T., Tipper D., Alashaikh A. A novel approach for ensuring high end-to-end availability: The spine concept // Design of Reliable Communication Networks (DRCN) 2014: Proceedings of the 10th International Conference. Ghent, Belgium, 1-3 April, 2014. – IEEE, 2014. – P. 1-8. – DOI: 10.1109/DRCN.2014.6816142.

Alashaikh A., Tipper D., Gomes T. March, 2016. Supporting differentiated resilience classes in multilayer networks // Design of Reliable Communication Networks (DRCN) 2016: Proceedings of the 12th International Conference. Paris, France. 15-17 March, 2017. – IEEE, 2016. – P. 31-38. – DOI: 10.1109/DRCN.2016.7470832.

Zhang X., Cheng Z., Lin R., He L., Yu S., Luo H. Local Fast Reroute With Flow Aggregation in Software Defined Networks // IEEE Communications Letters. – 2017. – Vol.21, No.4. – P. 785-788. – DOI: 10.1109/LCOMM.2016.2638430.

Malik A., Aziz B., Adda M., Ke C.H. Optimisation methods for fast restoration of software-defined networks // IEEE Access. – 2017. – Vol.5. – P. 16111-16123. DOI: 10.1109/ACCESS.2017.2736949.

Rzym G., Wajda K., Chołda P. SDN-based WAN optimization: PCE implementation in multi-domain MPLS networks supported by BGP-LS // Image Processing & Communications. – 2017. – Vol.22, No.1. – P. 35-48. – DOI: https://doi.org/10.1515/ipc-2017-0004.

Wang N., Ho K., Pavlou G., Howarth M. An overview of routing optimization for internet traffic engineering. IEEE Communications Surveys & Tutorials. 2008. Vol. 10, No. 1. P. 36-56. DOI: 10.1109/COMST.2008.4483669.

Hasan H., Cosmas J., Zaharis Z., Lazaridis P., Khwandah S. Development of FRR mechanism by adopting SDN notion // Software, Telecommunications and Computer Networks (SoftCOM): Proceedings of the 24th International Conference. Split, Croatia, 22-24 September, 2016. – IEEE, 2016. – P. 1-7. – DOI: 10.1109/SOFTCOM.2016.7772133.

Lemeshko A. V., Yeremenko O. S., Tariki N. Improvement of flow-oriented fast reroute model based on scalable protection solutions for telecommunication network elements // Telecommunications and Radio Engineering. – 2017. – Vol.76, Issue6. – P. 477–490. – DOI: 10.1615/TelecomRadEng.v76.i6.30.

Yeremenko O. S., Lemeshko O. V., Tariki N. Fast ReRoute Scalable Solution with Protection Schemes of Network Elements // Electrical and Computer Engineering (UKRCON): Proceedings of the First Ukraine Conference, Kiev, Ukraine, 29 May – 2 June 2017. – IEEE, 2017. – P. 783–788. – DOI: 10.1109/UKRCON.2017.8100353.

Lemeshko O., Yeremenko O. Enhanced method of fast re-routing with load balancing in software-defined networks // Journal of ELECTRICAL ENGINEERING. – 2017. – Vol.68, Issue 6. – P. 444–454. – DOI: 10.1515/jee-2017-0079.

Лемешко О.В., Єременко О.С. Розробка та дослідження лінійної оптимізаційної моделі швидкої перемаршрутизації з балансуванням навантаження в телекомунікаційних мережах // Радиоэлектроника и информатика. – 2017. – № 4 (79). – С. 18–25.

Lemeshko O., Yeremenko O., Nevzorova O. Hierarchical Method of Inter-Area Fast Rerouting // Transport and Telecommunication Journal. – 2017. – Vol.18, Issue 2. – P. 155–167. – DOI: 10.1515/ttj-2017-0015.

Lemeshko O., Yeremenko O., Tariki N. Solution for the Default Gateway Protection within Fault-Tolerant Routing in an IP Network // International Journal of Electrical and Computer Engineering Systems. – 2017. – Volume 8, Number 1. – P. 19–26.

Єременко О.С. Тензорна модель відмовостійкої маршрутизації з підтримкою якості обслуговування в мультисервісній телекомунікаційній мережі [Електронний ресурс] / О.С. Єременко // Проблеми телекомунікацій. – 2017. – № 2 (21). – С. 16 - 31. – Режим доступу до журн.: http://pt.journal.kh.ua/2017/2/1/172_yeremenko_qosfrr.pdf.

Лемешко О.В., Євдокименко М.О., Єременко О.С. Потокова модель швидкої перемаршрутизації із захистом рівня обслуговування за показниками пропускної здатності та ймовірності втрат // Фізико-технологічні проблеми передавання, оброблення та зберігання інформації в інфокомунікаційних системах: Матеріали VІІ-ої міжнародної науково-практичної конференції (м. Чернівці, 8-10 листопада 2018 р.). – Чернівці: «Місто», 2018. – С. 18-20.

ITU-T. The e-model, a computational model for use in transmission planning // ITU-T Recommendation G. 107. – 2015. – 24 р.

ITU T. Opinion model for video-telephony applications // ITU-T Recommendation P. 1070. – 2018. – 25 р.

Проблеми телекомунікацій № 1(22) (2018)

Downloads

Published

2018-12-11

Issue

No. 1(22) (2018)

Section

Articles

License

Copyright (c) 2019 Problemi telekomunìkacìj

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Authors who publish with this journal agree to the following terms:
  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).