@article{MTMT:34410435,
	title = {On Routing, Wavelength, Network Coding Assignment, and Protection Configuration Problem in Optical-Processing-Enabled Networks},
	url = {https://m2.mtmt.hu/api/publication/34410435},
	author = {Dao, Thanh Hai},
	doi = {10.1109/TNSM.2023.3283880},
	journal-iso = {IEEE T NETW SERV MANAG},
	journal = {IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT},
	volume = {20},
	unique-id = {34410435},
	issn = {1932-4537},
	year = {2023},
	eissn = {1932-4537},
	pages = {2504-2514}
}

@inproceedings{MTMT:32649767,
	title = {Network Coding in Photonicland: Three Commandments for Future-proof Optical Core Networks},
	url = {https://m2.mtmt.hu/api/publication/32649767},
	author = {Hai, D.T.},
	booktitle = {2021 IEEE Workshop on Microwave Theory and Techniques in Wireless Communications, MTTW 2021},
	doi = {10.1109/MTTW53539.2021.9607182},
	unique-id = {32649767},
	abstract = {The digital transformation has been underway, creating digital shadows of (almost) all physical entities and moving them to the Internet. The era of Internet of Everything has therefore started to come into play, giving rise to unprecedented traffic growths. In this context, optical core networks forming the backbone of Internet infrastructure have been under critical issues of reaching the capacity limit of conventional fibers, a phenomenon widely referred as capacity crunch. For many years, the many-fold increases in fiber capacity is thanks to exploiting physical dimensions for multiplexing optical signals such as wavelength, polarization, time and lately space-division multiplexing using multi-core and/or few-mode fibers and such route seems to come to an end as almost all known ways have been investigated. This necessitates for a departure from traditional approaches to use the fiber capacity more efficiently and thereby improve economics of scale. Indeed, recent leaps-and-bounds progresses in photonic signal processing is expected to pave the way for re-defining the optical networking realm by transforming the convention functions of intermediate nodes from simply regeneration and/or switching to incorporating photonic signal processing functions, notably encoding and decoding ones. To this end, this paper lays out a new perspective to integrate network coding (NC) functions into optical networks to achieve greater capacity efficiency in a pragmatic manner by upgrading intermediate nodes functionalities. In addition to the review of our recent proposals on creating new research problems enabled by NC operations in optical networks, we also report state-of-the-art findings in the literature in an effort to renew the interest of network coding in optical networks and discuss three critical points for pushing forward its applicability and practicality including $i$) network coding as a new dimension for multiplexing optical signals ii) algorithmic aspects of network coding-enabled optical networks design iii) network coding as an entirely fresh way for securing optical signals at physical layers. © 2021 IEEE.},
	keywords = {FIBERS; network coding; network coding; Transparent optical networks; Network layers; Fiber optic networks; Optical transport networks; Optical transport networks; Space division multiple access; Optical signals; physical layer security; physical layer security; elastic optical networks; elastic optical networks; Signal systems; WDM networks; WDM networks; Optical protection; Optical protection; Transparent network; Opaque Networks; Transparent Networks; Fiber capacity; Opaque network; Optical core networks},
	year = {2021},
	pages = {165-170}
}

@article{MTMT:31132648,
	title = {Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding},
	url = {https://m2.mtmt.hu/api/publication/31132648},
	author = {Pašić, Alija and Babarczi, Péter and Tapolcai, János and Bérczi-Kovács, Erika and Király, Zoltán and Rónyai, Lajos},
	doi = {10.1109/TNET.2019.2963574},
	journal-iso = {IEEE ACM T NETWORK},
	journal = {IEEE-ACM TRANSACTIONS ON NETWORKING},
	volume = {28},
	unique-id = {31132648},
	issn = {1063-6692},
	year = {2020},
	eissn = {1558-2566},
	pages = {289-300},
	orcid-numbers = {Pašić, Alija/0000-0001-6346-496X; Babarczi, Péter/0000-0003-1644-2172; Bérczi-Kovács, Erika/0000-0003-2259-0868; Király, Zoltán/0000-0002-9815-5793}
}

@article{MTMT:30828984,
	title = {On solving the 1+1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model},
	url = {https://m2.mtmt.hu/api/publication/30828984},
	author = {Dao Thanh Hai},
	doi = {10.1007/s11235-018-0474-9},
	journal-iso = {TELECOMMUN SYST},
	journal = {TELECOMMUNICATION SYSTEMS},
	volume = {71},
	unique-id = {30828984},
	issn = {1018-4864},
	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.},
	keywords = {integer linear programming; Routing and wavelength assignment; Dedicated path protection; All-optical XOR network coding; Transparent WDM networks; Multi-objective pptimization},
	year = {2019},
	eissn = {1572-9451},
	pages = {155-165}
}

@article{MTMT:31259592,
	title = {On routing, spectrum and network coding assignment problem for transparent flex-grid optical networks with dedicated protection},
	url = {https://m2.mtmt.hu/api/publication/31259592},
	author = {Hai, Dao Thanh},
	doi = {10.1016/j.comcom.2019.08.005},
	journal-iso = {COMPUT COMMUN},
	journal = {COMPUTER COMMUNICATIONS},
	volume = {147},
	unique-id = {31259592},
	issn = {0140-3664},
	year = {2019},
	eissn = {1873-703X},
	pages = {198-208}
}

@article{MTMT:32649769,
	title = {A Bi-objective integer linear programming model for the routing and network coding assignment problem in WDM optical networks with dedicated protection},
	url = {https://m2.mtmt.hu/api/publication/32649769},
	author = {Hai, D.T.},
	doi = {10.1016/j.comcom.2018.08.006},
	journal-iso = {COMPUT COMMUN},
	journal = {COMPUTER COMMUNICATIONS},
	volume = {133},
	unique-id = {32649769},
	issn = {0140-3664},
	abstract = {The explosive traffic growths are pushing the transport network close to its capacity limitation, raising critical issues about fiber capacity crunch. In this context, network coding has been emerging as the promising technique to improve the network capacity efficiency thanks to the capability of better resources utilization. The application of network coding to the realms of failure recovery in optical networks has paved the new way for more efficient protection schemes and indeed, XOR network coding combined with dedicated protection has been proposed, investigated and developed to challenge the well-established understanding of trading capacity efficiency for recovery speed and vice versa. In order to maximize the benefits empowered by network coding in this case, the problem of 1+1 routing and network coding assignment (1+1 RNCA) has to be optimally solved. Apart from traditional 1+1 routing, the decision of network coding information has also to be taken into account including the selection of pair of demands for encoding and the respective coding node and coding links. In this paper, we propose a bi-objective integer linear programming model of the 1+1 RNCA problem aiming at minimizing the conventional routing cost as the primary objective and furthermore minimizing the number of nodes with coding capabilities as the secondary objective. Our formulation uses a weighting method to combine two objectives into an integrated one and we provide a rigorous analysis on configuring the weight coefficients to capture the desired priority of individual objectives. The efficiency of our integrated objective model in comparison with reference designs based on the single-objective model, 1+1 routing and 1+1 RNCA, is numerically evaluated on different realistic topologies and traffic sets. Extensive simulation demonstrates that our proposal outperforms traditional approaches when it could achieve the lowest routing cost while simultaneously employing minimal number of coding nodes, albeit with a slightly higher computation time. We furthermore provide a parametric study on the impact of number of coding nodes to the achievable routing cost improvement and it turns out that having two coding nodes is already sufficient to realize most of the benefits enabled by network coding. © 2018 Elsevier B.V.},
	keywords = {EFFICIENCY; TOPOLOGY; network coding; network coding; Integer programming; Network routing; Codes (symbols); Combinatorial optimization; Routing; Routing; integer linear programming; integer linear programming; Fiber optic networks; Computer system recovery; Dedicated protection; Dedicated protections; Biobjective model; WDM optical Networks; WDM optical Networks; Bi-objective model},
	year = {2019},
	eissn = {1873-703X},
	pages = {51-58}
}

@article{MTMT:30827163,
	title = {Performance Modeling of Diversity Coded Path Protection in OBS/OPS Networks},
	url = {https://m2.mtmt.hu/api/publication/30827163},
	author = {Li, Shuo and Wong, Eric Wing Ming and Overby, Harald and Zukerman, Moshe},
	doi = {10.1109/JLT.2019.2911651},
	journal-iso = {J LIGHTWAVE TECHNOL},
	journal = {JOURNAL OF LIGHTWAVE TECHNOLOGY},
	volume = {37},
	unique-id = {30827163},
	issn = {0733-8724},
	abstract = {In bufferless optical burst/packet switched (OBS/OPS) networks, data (bursts or packets) may be lost due to contention or equipment failure. Diversity coding-based path protection schemes can he used to protect data from a single-trunk failure with potentially more efficient resource utilization compared to dedicated (e.g., 1 + 1) path protection schemes and help reduce the burst/packet loss ratio. This paper provides a scalable and accurate burst/packet loss ratio approximation based on the Erlang fixed-point approximation for networks that employ protection based on diversity coding and for networks that employ protection based on both diversity coding and 1 + 1 path protection. We use discrete event simulations to assess the accuracy of the approximation based on a wide range of scenarios in a 10-node circular lattice and NSFNet networks. Further, we discuss the effect of parameter settings and the effect of the choice of the wavelength selection method on the accuracy of the approximation. We consider scenarios without wavelength conversion and with full wavelength conversion and two types of users: premium and regular. The premium users, typically of mission critical services, receive protection while the regular users do not. We compare diversity coding and 1 + 1 path protection in a 10-node circular lattice network. The results show that for this example network, for the premium users and under low traffic load, the burst/packet loss ratio in OBS/OPS networks is lower for diversity coding compared to 1 + 1 path protection. However, under heavy traffic load, we observe a lower loss ratio for the case of 1 + 1 path protection.},
	keywords = {Optical burst switching; diversity coding; Path protection; Burst loss ratio; Erlang fixed-point approximation},
	year = {2019},
	eissn = {1558-2213},
	pages = {3138-3152},
	orcid-numbers = {Li, Shuo/0000-0002-0357-8284; Zukerman, Moshe/0000-0001-6190-5020}
}

@article{MTMT:27399005,
	title = {On optimal designs of transparent WDM networks with 1+1 protection leveraged by all-optical XOR network coding schemes},
	url = {https://m2.mtmt.hu/api/publication/27399005},
	author = {Hai, DT},
	doi = {10.1016/j.yofte.2017.11.009},
	journal-iso = {OPT FIBER TECHNOL},
	journal = {OPTICAL FIBER TECHNOLOGY},
	volume = {40},
	unique-id = {27399005},
	issn = {1068-5200},
	year = {2018},
	eissn = {1095-9912},
	pages = {93-100}
}

@article{MTMT:27409961,
	title = {Bounds for energy-efficient survivable IP over WDMnetworks with network coding},
	url = {https://m2.mtmt.hu/api/publication/27409961},
	author = {Musa, M and Elgorashi, T and Elmirghani, J},
	doi = {10.1364/JOCN.10.000471},
	journal-iso = {J OPT COMMUN NETW},
	journal = {JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING},
	volume = {10},
	unique-id = {27409961},
	issn = {1943-0620},
	year = {2018},
	eissn = {1943-0639},
	pages = {471-481}
}

@article{MTMT:27399006,
	title = {An Optimal Design Framework for 1+1 Routing and Network Coding Assignment Problemin WDM Optical Networks},
	url = {https://m2.mtmt.hu/api/publication/27399006},
	author = {Hai, DT},
	doi = {10.1109/ACCESS.2017.2761809},
	journal-iso = {IEEE ACCESS},
	journal = {IEEE ACCESS},
	volume = {5},
	unique-id = {27399006},
	issn = {2169-3536},
	year = {2017},
	eissn = {2169-3536},
	pages = {22291-22298}
}

@article{MTMT:25913561,
	title = {Cost Optimization of a Path Protection System with Partial Bandwidth Using Petri Nets},
	url = {https://m2.mtmt.hu/api/publication/25913561},
	author = {Shen, Victor RL and Shen, Rong-Kuan and Yang, Cheng-Ying and others},
	doi = {10.1007/s11277-016-3389-3},
	journal-iso = {WIRELESS PERS COMMUN},
	journal = {WIRELESS PERSONAL COMMUNICATIONS},
	volume = {90},
	unique-id = {25913561},
	issn = {0929-6212},
	year = {2016},
	eissn = {1572-834X},
	pages = {1239-1259}
}

@article{MTMT:26421211,
	title = {Link failure recovery over large arbitrary networks: The case of coding},
	url = {https://m2.mtmt.hu/api/publication/26421211},
	author = {Avci, SN and Ayanoglu, E},
	doi = {10.1109/TCOMM.2015.2417567},
	journal-iso = {IEEE T COMMUN},
	journal = {IEEE TRANSACTIONS ON COMMUNICATIONS},
	volume = {63},
	unique-id = {26421211},
	issn = {0090-6778},
	year = {2015},
	eissn = {1558-0857},
	pages = {1726-1740}
}

@inproceedings{MTMT:32661935,
	title = {Coded Packet Transport for Optical Packet/Burst Switched Networks},
	url = {https://m2.mtmt.hu/api/publication/32661935},
	author = {Kralevska, Katina and Overby, Harald and Gligoroski, Danilo},
	booktitle = {2015 IEEE Global Communications Conference, GLOBECOM 2015},
	doi = {10.1109/GLOCOM.2015.7417372},
	unique-id = {32661935},
	abstract = {This paper presents the Coded Packet Transport (CPT) scheme, a novel transport mechanism for Optical Packet/Burst Switched (OPS/OBS) networks. The CPT scheme exploits the combined benefits of source coding by erasure codes and path diversity to provide efficient means for recovering from packet loss due to contentions and path failures, and to provide non-cryptographic secrecy. In the CPT scheme, erasure coding is employed at the OPS/OBS ingress node to form coded packets, which are transmitted on disjoint paths from the ingress node to an egress node in the network. The CPT scheme allows for a unified view of Quality of Service (QoS) in OPS/OBS networks by linking the interactions between survivability, performance and secrecy. We provide analytical models that illustrate how QoS aspects of CPT are affected by the number of disjoint paths, packet overhead and processing delay.},
	keywords = {source coding; SURVIVABILITY; Engineering, Electrical & Electronic; Secrecy; optical packet/burst switching},
	year = {2015},
	orcid-numbers = {Gligoroski, Danilo/0000-0002-7078-6139}
}

@article{MTMT:2845913,
	title = {Instantaneous Recovery of Unicast Connections in Transport Networks: Routing versus Coding},
	url = {https://m2.mtmt.hu/api/publication/2845913},
	author = {Babarczi, Péter and Pašić, Alija and Tapolcai, János and Németh, Felicián Bálint and Ladóczki, Bence},
	doi = {10.1016/j.comnet.2015.02.010},
	journal-iso = {COMPUT NETW},
	journal = {COMPUTER NETWORKS},
	volume = {82},
	unique-id = {2845913},
	issn = {1389-1286},
	year = {2015},
	eissn = {1872-7069},
	pages = {68-80},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172; Pašić, Alija/0000-0001-6346-496X; Németh, Felicián Bálint/0000-0001-7903-5406}
}

@article{MTMT:24902764,
	title = {Managing resilience in carrier grade networks: Survey, open issues and trends},
	url = {https://m2.mtmt.hu/api/publication/24902764},
	author = {Ramirez, Wilson and Masip-Bruin, Xavier and Marin-Tordera, Eva and Sanchez-Lopez, Sergi},
	doi = {10.1016/j.comcom.2015.02.015},
	journal-iso = {COMPUT COMMUN},
	journal = {COMPUTER COMMUNICATIONS},
	volume = {61},
	unique-id = {24902764},
	issn = {0140-3664},
	year = {2015},
	eissn = {1873-703X},
	pages = {1-16}
}

@mastersthesis{MTMT:24414118,
	title = {Reliable Route Design Schemes in Coding Capable Networks},
	url = {https://m2.mtmt.hu/api/publication/24414118},
	author = {Abu, Hena Al Muktadir},
	unique-id = {24414118},
	year = {2014}
}

@article{MTMT:24406696,
	title = {Optimum Route Design in 1+ 1 Protection with Network Coding for Instantaneous Recovery},
	url = {https://m2.mtmt.hu/api/publication/24406696},
	author = {Al, Muktadir Abu Hena and Eiji, OKI},
	doi = {10.1587/transcom.E97.B.87},
	journal-iso = {IEICE T COMMUN},
	journal = {IEICE TRANSACTIONS ON COMMUNICATIONS},
	volume = {97},
	unique-id = {24406696},
	issn = {0916-8516},
	year = {2014},
	eissn = {1745-1345},
	pages = {87-104}
}

@CONFERENCE{MTMT:24406637,
	title = {Link failure recovery in large arbitrary networks via network coding},
	url = {https://m2.mtmt.hu/api/publication/24406637},
	author = {Avci, SN and Ayanoglu, E},
	booktitle = {Information Theory and Applications Workshop (ITA), 2014},
	doi = {10.1109/ITA.2014.6804248},
	unique-id = {24406637},
	year = {2014},
	pages = {1-10}
}

@inproceedings{MTMT:25914455,
	title = {Joint balanced source and network coding},
	url = {https://m2.mtmt.hu/api/publication/25914455},
	author = {Kralevska, K and Øverby, H and Gligoroski, D},
	booktitle = {22nd Telecommunications Forum, TELFOR 2014},
	doi = {10.1109/TELFOR.2014.7034478},
	publisher = {IEEE},
	unique-id = {25914455},
	year = {2014},
	pages = {589-592}
}

@inproceedings{MTMT:26427194,
	title = {A techno-economie study of network coding protection schemes},
	url = {https://m2.mtmt.hu/api/publication/26427194},
	author = {Ramirez, W and Masip-Bruin, X and Marin-Tordera, E and Yannuzzi, M and Martinez, A and Sanchez, S and Siddiqui, MS and Lopez, V},
	booktitle = {2014 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2014)},
	doi = {10.1109/GLOCOM.2014.7037126},
	publisher = {IEEE},
	unique-id = {26427194},
	year = {2014},
	pages = {2148-2153}
}

@inproceedings{MTMT:25207319,
	title = {Network coding-based protection scheme for elastic optical networks},
	url = {https://m2.mtmt.hu/api/publication/25207319},
	author = {Ramirez, W and Masip-Bruin, X and Yannuzzi, M and Montero, D and Martinez, A and Lopez, V},
	booktitle = {2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)},
	doi = {10.1109/DRCN.2014.6816136},
	publisher = {IEEE Computer Society},
	unique-id = {25207319},
	year = {2014}
}

@inproceedings{MTMT:32649770,
	title = {Improving reliability in multi-layer networks with Network Coding Protection},
	url = {https://m2.mtmt.hu/api/publication/32649770},
	author = {Ramirez, W. and Masip-Bruin, X. and Marin-Tordera, E. and Yannuzzi, M. and Siddiqui, M.S. and Martinez, A. and Lopez, V.},
	booktitle = {18th International Conference on Optical Network Design and Modeling (ONDM)},
	unique-id = {32649770},
	abstract = {A major concern among network providers is to endow their networks with the ability to withstand and recover from failures. In recent years, there is a trend in network research referred to as Network Coding Protection (NCP). NCP combines the use of network coding techniques with a proactive protection scheme with the aim of improving network reliability. Although today's network backbone is a multi-layer network formed by the convergence of IP/MPLS and Optical technologies, the information available in the literature related to the performance of NCP schemes in multi-layer network scenarios is yet scarce. In this paper, we propose a novel NCP scheme referred to as DPNC+. The novelty of DPNC+ is that it exploits cross-layer information in order to improve the reliability of multi-layer (IP/MPLS over Optical) networks against link failures. Our evaluation results show that reduction up to 50% -related to protection cost- can be obtained when using the proposed scheme compared to conventional proactive protection techniques. © 2014 IFIP.},
	keywords = {Reliability; network coding; Evaluation results; NETWORK RELIABILITY; Coding techniques; multi-layer networks; network backbones; Cross-layer; Multi-layer network; Optical technology; Cross-Layer Information; Network Coding Protection; Pro-active protection},
	year = {2014},
	pages = {240-245}
}

@mastersthesis{MTMT:24414088,
	title = {Resilience mechanisms for carrier-grade networks},
	url = {https://m2.mtmt.hu/api/publication/24414088},
	author = {Ramírez, Wilson},
	unique-id = {24414088},
	year = {2014}
}

@inproceedings{MTMT:25259878,
	title = {Network coding-based link failure recovery over large arbitrary networks},
	url = {https://m2.mtmt.hu/api/publication/25259878},
	author = {Avci, Serhat Nazim and Ayanoglu, Ender},
	booktitle = {2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)},
	doi = {10.1109/GLOCOM.2013.6831289},
	unique-id = {25259878},
	year = {2013},
	pages = {1519-1525}
}

@article{MTMT:23957219,
	title = {Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding},
	url = {https://m2.mtmt.hu/api/publication/23957219},
	author = {Avci, S N and Ayanoglu, E},
	doi = {10.1109/TCOMM.2013.071013.120817},
	journal-iso = {IEEE T COMMUN},
	journal = {IEEE TRANSACTIONS ON COMMUNICATIONS},
	volume = {61},
	unique-id = {23957219},
	issn = {0090-6778},
	year = {2013},
	eissn = {1558-0857},
	pages = {3878-3893}
}

@article{MTMT:26427197,
	title = {Coded path protection: Efficient conversion of sharing to coding},
	url = {https://m2.mtmt.hu/api/publication/26427197},
	author = {Avci, SN and Ayanoglu, E},
	doi = {10.1109/TCOMM.2013.093013.120607},
	journal-iso = {IEEE T COMMUN},
	journal = {IEEE TRANSACTIONS ON COMMUNICATIONS},
	volume = {61},
	unique-id = {26427197},
	issn = {0090-6778},
	year = {2013},
	eissn = {1558-0857},
	pages = {4294-4309}
}

@article{MTMT:24406648,
	title = {A mathematical model for network coding aware optimum routing in 1+1 protection for instantaneous recovery with relaxing destination’s node degree constraint},
	url = {https://m2.mtmt.hu/api/publication/24406648},
	author = {MuktadirAbu, Hena Al and PhongPham, Vu and Oki, Eiji},
	doi = {10.1587/comex.2.512},
	journal-iso = {IEICE Communication Express},
	journal = {IEICE Communication Express},
	volume = {2},
	unique-id = {24406648},
	abstract = {A conventional model to determine network coding (NC) aware minimum cost routes, for employing 1+1 protection in scenarios with two sources and a common destination (2S-D), was addressed. When the common destination’s node degree is only two, NC cannot be employed, because failure of an adjacent link carrying original data restricts recovery operation at the destination. This letter presents a mathematical model for optimum NC aware 1+1 protection routing in 2S-D scenarios with destination’s node degree ≥2. Numerical results observe that our presented model achieves 5.5% of resource saving, compared to the conventional model, in our examined networks.},
	year = {2013},
	eissn = {2187-0136},
	pages = {512-517}
}

@article{MTMT:2692674,
	title = {Realization Strategies of Dedicated Path Protection: A Bandwidth Cost Perspective},
	url = {https://m2.mtmt.hu/api/publication/2692674},
	author = {Babarczi, Péter and Biczók, Gergely and Harald, Overby and Tapolcai, János and Soproni, Péter Balázs},
	doi = {10.1016/j.comnet.2013.03.015},
	journal-iso = {COMPUT NETW},
	journal = {COMPUTER NETWORKS},
	volume = {57},
	unique-id = {2692674},
	issn = {1389-1286},
	abstract = {Communication networks have to provide a high level of availability and instantaneous recovery after failures in order to ensure sufficient survivability for mission-critical services. Currently, dedicated path protection (or 1 + 1) is implemented in backbone networks to provide the necessary resilience and instantaneous recovery against single link failures with remarkable simplicity. However, in order to satisfy strict availability requirements, connections also have to be resilient against Shared Risk Link Group (SRLG) failures. In addition, switching matrix reconfigurations have to be avoided after a failure in order to guarantee instantaneous recovery. For this purpose, there are several possible realization strategies improving the characteristics of traditional 1 + 1 path protection by lowering reserved bandwidth while conserving all its favorable properties. These methods either utilize diversity coding, network coding, or generalize the disjoint-path constraint of 1 + 1. In this paper, we consider the cost aspect of the traditional and the alternative 1 + 1 realization strategies. We evaluate the bandwidth cost of different schemes both analytically and empirically in realistic network topologies. As the more complex realizations lead to NP-complete problems even in the single link failure case, we propose both Integer Linear Programming (ILP) based optimal methods, as well as heuristic and meta-heuristic approaches to solve them. Our findings provide a tool and guidelines for service providers for selecting the path protection method with the lowest bandwidth cost for their network corresponding to a given level of reliability. © 2013 Elsevier B.V. All rights reserved.},
	year = {2013},
	eissn = {1872-7069},
	pages = {1974-1990},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@inproceedings{MTMT:26427198,
	title = {An efficient protection strategy using multiple network coding},
	url = {https://m2.mtmt.hu/api/publication/26427198},
	author = {Ramirez, W and Masip-Bruin, X and Yannuzzi, M and Serral-Gracia, R and Martinez, A},
	booktitle = {2013 International Conference on Smart Communications in Network Technologies, SaCoNeT 2013},
	doi = {10.1109/SaCoNeT.2013.6654559},
	publisher = {Institute of Electrical and Electronics Engineers},
	unique-id = {26427198},
	year = {2013}
}

@inproceedings{MTMT:24406141,
	title = {Coded path protection: Efficient conversion of sharing to coding},
	url = {https://m2.mtmt.hu/api/publication/24406141},
	author = {Avci, SN and Ayanoglu, E},
	booktitle = {Communications (ICC), 2012 IEEE International Conference on},
	doi = {10.1109/ICC.2012.6363902},
	unique-id = {24406141},
	year = {2012},
	pages = {1198-1203}
}

@inproceedings{MTMT:25207605,
	title = {Optimal algorithms for near-hitless network restoration via diversity coding},
	url = {https://m2.mtmt.hu/api/publication/25207605},
	author = {Avci, SN and Ayanoglu, E},
	booktitle = {2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)},
	doi = {10.1109/GLOCOM.2012.6503389},
	publisher = {Institute of Electrical and Electronics Engineers},
	unique-id = {25207605},
	year = {2012},
	pages = {1877-1883}
}