TY - CHAP AU - Cinkler, Tibor AU - Soproni, Péter Balázs ED - Rak, J ED - Machuca, CM ED - Oki, EJ ED - Papadimitriou, D ED - Vinel, A ED - Walkowiak, K TI - Generalized shared protection (GSP): Simulation results and proof of optimality T2 - 7th Workshop on Reliable Networks Design and Modeling (RNDM) PB - IEEE CY - New York, New York SN - 1467380504 PY - 2015 SP - 112 EP - 119 PG - 8 DO - 10.1109/RNDM.2015.7325217 UR - https://m2.mtmt.hu/api/publication/3042212 ID - 3042212 N1 - Cited By :1 Export Date: 26 February 2020 LA - English DB - MTMT ER - TY - THES AU - Soproni, Péter Balázs TI - Efficient Algorithms for Multi-Layer Unicast and Multicast Routing in Optical Networks PY - 2014 SP - 133 UR - https://m2.mtmt.hu/api/publication/2862746 ID - 2862746 LA - English DB - MTMT ER - TY - CHAP AU - Cinkler, Tibor AU - Réka, Kosznai AU - Soproni, Péter Balázs AU - Németh, Krisztián ED - IEEE, null TI - GSP, the Generalised Shared Protection T2 - 2013 9TH INTERNATIONAL CONFERENCE ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN) PB - IEEE CY - New York, New York SN - 1479900494 PY - 2013 SP - 195 EP - 202 PG - 8 UR - https://m2.mtmt.hu/api/publication/2692911 ID - 2692911 N1 - Cited By :3 Export Date: 26 February 2020 Correspondence Address: High-Speed Networks Laboratory (HSNLab), Department of Telecommunications and Media Informatics (TMIT), Budapest University of Technology and Economics (BME), Budapest, Hungary LA - English DB - MTMT ER - TY - JOUR AU - Babarczi, Péter AU - Biczók, Gergely AU - Harald, Overby AU - Tapolcai, János AU - Soproni, Péter Balázs TI - Realization Strategies of Dedicated Path Protection: A Bandwidth Cost Perspective JF - COMPUTER NETWORKS J2 - COMPUT NETW VL - 57 PY - 2013 IS - 9 SP - 1974 EP - 1990 PG - 17 SN - 1389-1286 DO - 10.1016/j.comnet.2013.03.015 UR - https://m2.mtmt.hu/api/publication/2692674 ID - 2692674 N1 - Megjegyzés-24130651 : Systems; Engineering, Electrical & Electronic; Telecommunications AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Soproni, Péter Balázs AU - Cinkler, Tibor AU - Jacek, Rak TI - Methods for physical impairment constrained routing with selected protection in all-optical networks JF - TELECOMMUNICATION SYSTEMS J2 - TELECOMMUN SYST VL - 56 PY - 2013 SP - 177 EP - 188 PG - 12 SN - 1018-4864 DO - 10.1007/s11235-013-9827-6 UR - https://m2.mtmt.hu/api/publication/2685868 ID - 2685868 N1 - Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics Magyar, Tudósok Körútja 2, 1117 Budapest, Hungary Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Narutowicza 11/12, 80-233 Gdansk, Poland Cited By :3 Export Date: 28 May 2020 Correspondence Address: Rak, J.; Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Narutowicza 11/12, 80-233 Gdansk, Poland; email: jrak@pg.gda.pl WoS:hiba:000336809200014 2020-08-27 08:14 év nem egyezik LA - English DB - MTMT ER - TY - CHAP AU - Balázs, Krisztián AU - Soproni, Péter Balázs AU - Kóczy, T. László ED - Rassa, B. TI - Improving System Reliability in Optical Networks by Failure Localizaton Using Evolutionary Optimization T2 - 2013 7TH ANNUAL IEEE INTERNATIONAL SYSTEMS CONFERENCE (SYSCON 2013) PB - IEEE CY - New York, New York SN - 9781467331074 PY - 2013 SP - 394 EP - 399 PG - 6 DO - 10.1109/SysCon.2013.6549912 UR - https://m2.mtmt.hu/api/publication/2471578 ID - 2471578 N1 - Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tudósok körútja 2., H-1117 Budapest, Hungary Department of Automation, Széchenyi István University, Egyetem tér 1., Gyor, H-9026, Hungary Conference code: 98377 Cited By :1 Export Date: 5 February 2022 Correspondence Address: Department of Telecommunications and Media Informatics, Magyar tudósok körútja 2., H-1117 Budapest, Hungary AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Soproni, Péter Balázs AU - Cinkler, Tibor TI - Preplanned restoration of multicast demands in optical networks JF - COMPUTER NETWORKS J2 - COMPUT NETW VL - 56 PY - 2012 IS - 6 SP - 1847 EP - 1861 PG - 15 SN - 1389-1286 DO - 10.1016/j.comnet.2012.02.001 UR - https://m2.mtmt.hu/api/publication/2685867 ID - 2685867 N1 - Cited By :1 Export Date: 28 May 2020 CODEN: CNETD Correspondence Address: Soproni, P.; Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tudósok körútja 2, H-1117 Budapest, Hungary; email: soproni@tmit.bme.hu AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Hosszu, Éva AU - Tapolcai, János AU - Rónyai, Lajos AU - Soproni, Péter Balázs AU - Babarczi, Péter AU - Ho, PH TI - Fast failure localization in all-optical networks with length-constrained monitoring trails T2 - 4th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) PB - IEEE CY - New York, New York SN - 1467320161 PY - 2012 SP - 677 EP - 683 PG - 7 DO - 10.1109/ICUMT.2012.6459752 UR - https://m2.mtmt.hu/api/publication/2166282 ID - 2166282 N1 - WoS:hiba:000318856700111 2019-11-11 19:43 befoglaló egyiknél nincsenek szerzők, befoglaló cím nem egyezik LA - English DB - MTMT ER - TY - CHAP AU - Soproni, Péter Balázs AU - Cinkler, Tibor AU - Rak, J. ED - Rak, Jacek ED - Jaumard, Brigitte ED - Wessäly, Roland TI - Selective protection for all-optical physical impairment constrained routing T2 - 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) PB - IEEE Press CY - New York, New York SN - 9781457706820 PY - 2011 UR - https://m2.mtmt.hu/api/publication/31327785 ID - 31327785 N1 - Budapest University of Technology and Economics, Magyar tudósok körútja 2, H-1117 Budapest, Hungary Gdansk University of Technology, Narutowicza 11/12, Pl-80-233, Gdansk, Poland Export Date: 28 May 2020 Correspondence Address: Soproni, P.; Budapest University of Technology and Economics, Magyar tudósok körútja 2, H-1117 Budapest, Hungary; email: soproni@tmit.bme.hu LA - English DB - MTMT ER - TY - CONF AU - Soproni, Péter Balázs AU - Cinkler, Tibor AU - Jacek, Rak ED - Jacek, Rak TI - Selective Protection for All-Optical Physical Impairment Constrained Routing T2 - RNDM2011 - 3rd International Workshop on Reliable Networks Design and Modeling PY - 2011 SP - 10 EP - 16 PG - 7 UR - https://m2.mtmt.hu/api/publication/2664996 ID - 2664996 AB - 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. LA - English DB - MTMT ER -