@inproceedings{MTMT:3042212,
	title = {Generalized shared protection (GSP): Simulation results and proof of optimality},
	url = {https://m2.mtmt.hu/api/publication/3042212},
	author = {Cinkler, Tibor and Soproni, Péter Balázs},
	booktitle = {7th Workshop on Reliable Networks Design and Modeling (RNDM)},
	doi = {10.1109/RNDM.2015.7325217},
	unique-id = {3042212},
	keywords = {SEGMENT PROTECTION; WDM MESH NETWORKS},
	year = {2015},
	pages = {112-119}
}

@mastersthesis{MTMT:2862746,
	title = {Efficient Algorithms for Multi-Layer Unicast and Multicast Routing in Optical Networks},
	url = {https://m2.mtmt.hu/api/publication/2862746},
	author = {Soproni, Péter Balázs},
	unique-id = {2862746},
	year = {2014}
}

@inproceedings{MTMT:2692911,
	title = {GSP, the Generalised Shared Protection},
	url = {https://m2.mtmt.hu/api/publication/2692911},
	author = {Cinkler, Tibor and Réka, Kosznai and Soproni, Péter Balázs and Németh, Krisztián},
	booktitle = {2013 9TH INTERNATIONAL CONFERENCE ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN)},
	unique-id = {2692911},
	year = {2013},
	pages = {195-202}
}

@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}
}

@article{MTMT:2685868,
	title = {Methods for physical impairment constrained routing with selected protection in all-optical networks},
	url = {https://m2.mtmt.hu/api/publication/2685868},
	author = {Soproni, Péter Balázs and Cinkler, Tibor and Jacek, Rak},
	doi = {10.1007/s11235-013-9827-6},
	journal-iso = {TELECOMMUN SYST},
	journal = {TELECOMMUNICATION SYSTEMS},
	volume = {56},
	unique-id = {2685868},
	issn = {1018-4864},
	year = {2013},
	eissn = {1572-9451},
	pages = {177-188}
}

@inproceedings{MTMT:2471578,
	title = {Improving System Reliability in Optical Networks by Failure Localizaton Using Evolutionary Optimization},
	url = {https://m2.mtmt.hu/api/publication/2471578},
	author = {Balázs, Krisztián and Soproni, Péter Balázs and Kóczy, T. László},
	booktitle = {2013 7TH ANNUAL IEEE INTERNATIONAL SYSTEMS CONFERENCE (SYSCON 2013)},
	doi = {10.1109/SysCon.2013.6549912},
	unique-id = {2471578},
	abstract = {This paper proposes a novel approach for cost-effective link failure localization in optical networks in order to improve the reliability of telecommunication systems. In such failure localization problems the optical network is usually represented by a graph, where the task is to form connected edge sets, so-called monitoring trails (m-trails), in a way that the failure of a link causes the failure of such a combination of m-trails, which unambiguously identifies the failed link. Every m-trail consumes a given amount of resources (like bandwidth, detectors, amplifiers, etc.). Thus, operators of optical network may prefer a set of paths, whose paths can be established in an easy and cost-effective way, while minimizing the interference with the route of the existing demands, i.e. may maximize the revenue. In this paper, unlike most existing techniques dealing with failure localization in this context, the presently proposed method considers a predefined set of paths in the graph as m-trails. This way the task can also be formulated as a special Set Covering Problem (SCP), whose general form is a frequently used formulation in a certain type of operations research problems (e.g. resource assignment). Since for the SCP task evolutionary algorithms, like Ant Colony Optimization (ACO), has been successfully applied in the operations research field, in this work the failure localization task is solved by using ACO on the SCP formulation of the described covering problem, which is a rather unique combination of approaches of different fields (telecommunication, operations research and evolutionary computation) placing our investigation in the multi-field scope of complex systems.},
	year = {2013},
	pages = {394-399},
	orcid-numbers = {Kóczy, T. László/0000-0003-1316-4832}
}

@article{MTMT:2685867,
	title = {Preplanned restoration of multicast demands in optical networks},
	url = {https://m2.mtmt.hu/api/publication/2685867},
	author = {Soproni, Péter Balázs and Cinkler, Tibor},
	doi = {10.1016/j.comnet.2012.02.001},
	journal-iso = {COMPUT NETW},
	journal = {COMPUTER NETWORKS},
	volume = {56},
	unique-id = {2685867},
	issn = {1389-1286},
	abstract = {The evolution of multicast applications has speeded up. providers have to offer cheap and reliable services for their customers. One way to achieve this is to use a restoration method that provides relatively fast restoration calculated upon a failure, where nearly the minimal amount of resources is allocated. In this paper we propose a new, faster way of restoring multicast demands after link failure that is based on preplaning. We prove its optimality if a few preconditions hold. To do so a new formalization of the wavelength graph transformation (WGT) is presented. We show, based on simulations, that the beneficial properties of our method hold even when one or more preconditions are not kept. © 2012 Elsevier B.V. All rights reserved.},
	year = {2012},
	eissn = {1872-7069},
	pages = {1847-1861}
}

@inproceedings{MTMT:2166282,
	title = {Fast failure localization in all-optical networks with length-constrained monitoring trails},
	url = {https://m2.mtmt.hu/api/publication/2166282},
	author = {Hosszu, Éva and Tapolcai, János and Rónyai, Lajos and Soproni, Péter Balázs and Babarczi, Péter and Ho, PH},
	booktitle = {4th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)},
	doi = {10.1109/ICUMT.2012.6459752},
	unique-id = {2166282},
	year = {2012},
	pages = {677-683},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172}
}

@inproceedings{MTMT:31327785,
	title = {Selective protection for all-optical physical impairment constrained routing},
	url = {https://m2.mtmt.hu/api/publication/31327785},
	author = {Soproni, Péter Balázs and Cinkler, Tibor and Rak, J.},
	booktitle = {3rd International Workshop on Reliable Networks Design and Modeling (RNDM2011) co-located with 3rd international congress on ultra modern telecommunications and control systems and workshops (ICUMT 2011)},
	unique-id = {31327785},
	year = {2011}
}

@CONFERENCE{MTMT:2664996,
	title = {Selective Protection for All-Optical Physical Impairment Constrained Routing},
	url = {https://m2.mtmt.hu/api/publication/2664996},
	author = {Soproni, Péter Balázs and Cinkler, Tibor and Jacek, Rak},
	booktitle = {RNDM2011 - 3rd International Workshop on Reliable Networks Design and Modeling},
	unique-id = {2664996},
	abstract = {In optical networks, according to the latest tendencies, the goal is to route all demands in all-optical way. However, in the near future, this will still not be possible due to technical constraints and backward compatibility. In the meantime, operators may decide to reserve a given percent of their power budget for all-optical routing, while the rest of the budget is used as it is done now. This introduces a new, additional problem. Namely, operators have to select which demands should be routed in all-optical way. This problem is even more complex for demands that need protection. In this paper, we present a method that may help the operators to maximize the number of demands with protection routed in all-optical way. Based on simulations, we show the beneficial properties of the proposed approach.},
	year = {2011},
	pages = {10-16}
}