TY - JOUR AU - Hai, Dao Thanh TI - On Routing, Wavelength, Network Coding Assignment, and Protection Configuration Problem in Optical-Processing-Enabled Networks JF - IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT J2 - IEEE T NETW SERV MANAG VL - 20 PY - 2023 IS - 3 SP - 2504 EP - 2514 PG - 11 SN - 1932-4537 DO - 10.1109/TNSM.2023.3283880 UR - https://m2.mtmt.hu/api/publication/34410435 ID - 34410435 N1 - Cited By :3 Export Date: 1 December 2023 Correspondence Address: Hai, D.T.; RMIT University Vietnam, Viet Nam; email: hai.dao5@rmit.edu.vn LA - English DB - MTMT ER - TY - CHAP AU - Hai, D.T. ED - Aboltins, A. TI - Network Coding in Photonicland: Three Commandments for Future-proof Optical Core Networks T2 - 2021 IEEE Workshop on Microwave Theory and Techniques in Wireless Communications, MTTW 2021 PB - Institute of Electrical and Electronics Engineers (IEEE) CY - Piscataway (NJ) SN - 9781665424691 PY - 2021 SP - 165 EP - 170 PG - 6 DO - 10.1109/MTTW53539.2021.9607182 UR - https://m2.mtmt.hu/api/publication/32649767 ID - 32649767 N1 - IEEE Latvia Section Communications, Microwave Theory and Techniques, and Antennas and Propagation Joint Societies Chapter Conference code: 174644 Export Date: 6 February 2022 Correspondence Address: Hai, D.T.; Posts and Telecommunications Institute of TechnologyViet Nam; email: haidt102@gmail.com Funding details: National Foundation for Science and Technology Development, NAFOSTED, 102.02-2018.09 Funding text 1: This research is funded by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under the grant number 102.02-2018.09 for the project entitled, Network Coding for Spectrum-Efficient and Reliable Optical Core Networks (CEO) AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Lindner, Steffen AU - Merling, Daniel AU - Häberle, Marco AU - Menth, Michael TI - P4-Protect: 1+1 Path Protection for P4 T2 - EuroP4'20 PB - Association for Computing Machinery (ACM) CY - New York, New York SN - 9781450381819 PY - 2020 SP - 21 EP - 27 PG - 7 DO - 10.1145/3426744.3431327 UR - https://m2.mtmt.hu/api/publication/35076339 ID - 35076339 LA - English DB - MTMT ER - TY - JOUR AU - Pašić, Alija AU - Babarczi, Péter AU - Tapolcai, János AU - Bérczi-Kovács, Erika AU - Király, Zoltán AU - Rónyai, Lajos TI - Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding JF - IEEE-ACM TRANSACTIONS ON NETWORKING J2 - IEEE ACM T NETWORK VL - 28 PY - 2020 IS - 1 SP - 289 EP - 300 PG - 12 SN - 1063-6692 DO - 10.1109/TNET.2019.2963574 UR - https://m2.mtmt.hu/api/publication/31132648 ID - 31132648 N1 - MTA-BME Future Internet Research Group, Budapest University of Technology and Economics, Budapest, Hungary MTA-BME Information Systems Research Group, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics (BME), Budapest, 1111, Hungary Department of Operations Research, Eötvös Loránd University, Budapest, Hungary MTA-ELTE Egerváry Research Group on Combinatorial Optimization (EGRES), Eötvös Loránd University, Budapest, 1053, Hungary Department of Computer Science, Eötvös Loránd University, Budapest, Hungary Institute for Computer Science and Control, Budapest, Hungary Department of Algebra, Budapest University of Technology and Economics (BME), Budapest, 1111, Hungary Cited By :4 Export Date: 6 February 2022 CODEN: IEANE Correspondence Address: Pasic, A.; MTA-BME Future Internet Research Group, Hungary; email: pasic@tmit.bme.hu Funding details: BME FIKP-MI/SC Funding details: K115288, K124171, K128062, KH129589 Funding details: ED_18-1-2019-0030, FK 132524 Funding text 1: Manuscript received July 23, 2019; revised November 18, 2019; accepted December 7, 2019; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor P. P. C. Lee. Date of publication January 23, 2020; date of current version February 14, 2020. This work was supported in part by the High Speed Networks Laboratory (HSNLab), through the National Research, Development, and Innovation Fund of Hungary, under Project K124171, Project K128062, Project K115288, Project KH129589, and TUDFO/51757/2019-ITM Thematic Excellence Program, in part by the BME-Artificial Intelligence FIKP of EMMI under Grant BME FIKP-MI/SC, in part by the Industry and Digitization Subprogramme, NRDI Office, in 2019, in part by the National Development Agency of Hungary based on a source from the Research and Technology Innovation Fund under Grant FK 132524, and in part Project no. ED_18-1-2019-0030 (Application-specific highly reliable IT solutions) that has been implemented with the support provided from the National Research, Development and Innovation Fund of Hungary, financed under the Thematic Excellence Programme funding scheme. This article was presented at the IFIP Networking Conference, Toulouse, France, May 2015. (Corresponding author: Alija Pašić.) Alija Pašić, Péter Babarczi, and János Tapolcai are with the MTA-BME Future Internet Research Group, Budapest University of Technology and Economics, 1111 Budapest, Hungary, and also with the MTA-BME Information Systems Research Group, Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics (BME), 1111 Budapest, Hungary (e-mail: pasic@tmit.bme.hu; babarczi@tmit.bme.hu; tapolcai@tmit.bme.hu). LA - English DB - MTMT ER - TY - JOUR AU - Hai, Dao Thanh TI - On routing, spectrum and network coding assignment problem for transparent flex-grid optical networks with dedicated protection JF - COMPUTER COMMUNICATIONS J2 - COMPUT COMMUN VL - 147 PY - 2019 SP - 198 EP - 208 PG - 11 SN - 0140-3664 DO - 10.1016/j.comcom.2019.08.005 UR - https://m2.mtmt.hu/api/publication/31259592 ID - 31259592 N1 - Faculty of Computer Science, Phenikaa University, Hanoi, 100000, Viet Nam Phenikaa Institute for Advanced Study, Phenikaa University, Hanoi, 100000, Viet Nam Cited By :14 Export Date: 6 February 2022 CODEN: COCOD Funding details: National Foundation for Science and Technology Development, NAFOSTED, 102.02-2018.09 Funding text 1: This work is funded by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under the grant number 102.02-2018.09 . LA - English DB - MTMT ER - TY - JOUR AU - Hai, Dao Thanh TI - On solving the 1+1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model JF - TELECOMMUNICATION SYSTEMS J2 - TELECOMMUN SYST VL - 71 PY - 2019 IS - 2 SP - 155 EP - 165 PG - 11 SN - 1018-4864 DO - 10.1007/s11235-018-0474-9 UR - https://m2.mtmt.hu/api/publication/30828984 ID - 30828984 N1 - Cited By :11 Export Date: 6 February 2022 Correspondence Address: Hai, D.T.; Institute of Technology, Viet Nam; email: haidt102@gmail.com AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Hai, D.T. TI - A Bi-objective integer linear programming model for the routing and network coding assignment problem in WDM optical networks with dedicated protection JF - COMPUTER COMMUNICATIONS J2 - COMPUT COMMUN VL - 133 PY - 2019 SP - 51 EP - 58 PG - 8 SN - 0140-3664 DO - 10.1016/j.comcom.2018.08.006 UR - https://m2.mtmt.hu/api/publication/32649769 ID - 32649769 N1 - Cited By :10 Export Date: 6 February 2022 CODEN: COCOD Funding details: National Foundation for Science and Technology Development, NAFOSTED, 102.02-2018.09 Funding text 1: The author would like to acknowledge in advance the support from National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.02-2018.09 . AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Li, Shuo AU - Wong, Eric Wing Ming AU - Overby, Harald AU - Zukerman, Moshe TI - Performance Modeling of Diversity Coded Path Protection in OBS/OPS Networks JF - JOURNAL OF LIGHTWAVE TECHNOLOGY J2 - J LIGHTWAVE TECHNOL VL - 37 PY - 2019 IS - 13 SP - 3138 EP - 3152 PG - 15 SN - 0733-8724 DO - 10.1109/JLT.2019.2911651 UR - https://m2.mtmt.hu/api/publication/30827163 ID - 30827163 N1 - School of Engineering, RMIT University, Melbourne, VIC 3000, Australia Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong Department of Information Security and Communication Technology, Norwegian University of Science and Technology, Norway Cited By :1 Export Date: 6 February 2022 CODEN: JLTED Correspondence Address: Zukerman, M.; Department of Electronic Engineering, Hong Kong; email: m.zu@cityu.edu.hk AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Hai, DT TI - On optimal designs of transparent WDM networks with 1+1 protection leveraged by all-optical XOR network coding schemes JF - OPTICAL FIBER TECHNOLOGY J2 - OPT FIBER TECHNOL VL - 40 PY - 2018 SP - 93 EP - 100 PG - 8 SN - 1068-5200 DO - 10.1016/j.yofte.2017.11.009 UR - https://m2.mtmt.hu/api/publication/27399005 ID - 27399005 N1 - Cited By :17 Export Date: 6 February 2022 CODEN: OFTEF Funding text 1: This research was partially supported by the Hanoi University of Industry. 1 LA - English DB - MTMT ER - TY - JOUR AU - Musa, M AU - Elgorashi, T AU - Elmirghani, J TI - Bounds for energy-efficient survivable IP over WDMnetworks with network coding JF - JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING J2 - J OPT COMMUN NETW VL - 10 PY - 2018 IS - 5 SP - 471 EP - 481 PG - 11 SN - 1943-0620 DO - 10.1364/JOCN.10.000471 UR - https://m2.mtmt.hu/api/publication/27409961 ID - 27409961 N1 - Cited By :38 Export Date: 6 February 2022 Funding details: Internet Society, ISOC Funding details: Star Scientific Foundation Funding details: Engineering and Physical Sciences Research Council, EPSRC, EP/H040536/1, EP/K016873/1 Funding text 1: The authors would like to acknowledge funding from the Engineering and Physical Sciences Research Council (EPSRC), INTERNET (EP/H040536/1), and STAR (EP/ K016873/1). All data is provided in full in the results section of this paper. LA - English DB - MTMT ER - TY - JOUR AU - Hai, DT TI - An Optimal Design Framework for 1+1 Routing and Network Coding Assignment Problemin WDM Optical Networks JF - IEEE ACCESS J2 - IEEE ACCESS VL - 5 PY - 2017 SP - 22291 EP - 22298 PG - 8 SN - 2169-3536 DO - 10.1109/ACCESS.2017.2761809 UR - https://m2.mtmt.hu/api/publication/27399006 ID - 27399006 N1 - OA gold LA - English DB - MTMT ER - TY - JOUR AU - Shen, Victor RL AU - Shen, Rong-Kuan AU - Yang, Cheng-Ying AU - others, null TI - Cost Optimization of a Path Protection System with Partial Bandwidth Using Petri Nets JF - WIRELESS PERSONAL COMMUNICATIONS J2 - WIRELESS PERS COMMUN VL - 90 PY - 2016 IS - 3 SP - 1239 EP - 1259 PG - 21 SN - 0929-6212 DO - 10.1007/s11277-016-3389-3 UR - https://m2.mtmt.hu/api/publication/25913561 ID - 25913561 N1 - Cited By :1 Export Date: 6 February 2022 CODEN: WPCOF Correspondence Address: Yang, C.-Y.; Department of Computer Science, 1, Ai-Kao W. Rd., Taiwan; email: cyang@utaipei.edu.tw LA - English DB - MTMT ER - TY - JOUR AU - Avci, SN AU - Ayanoglu, E TI - Link failure recovery over large arbitrary networks: The case of coding JF - IEEE TRANSACTIONS ON COMMUNICATIONS J2 - IEEE T COMMUN VL - 63 PY - 2015 IS - 5 SP - 1726 EP - 1740 PG - 15 SN - 0090-6778 DO - 10.1109/TCOMM.2015.2417567 UR - https://m2.mtmt.hu/api/publication/26421211 ID - 26421211 N1 - N1 Funding details: 0917176, NSF, National Science Foundation Megjegyzés-25207356 N1 Funding Details: 0917176, NSF, National Science Foundation LA - English DB - MTMT ER - TY - JOUR AU - Babarczi, Péter AU - Pašić, Alija AU - Tapolcai, János AU - Németh, Felicián Bálint AU - Ladóczki, Bence TI - Instantaneous Recovery of Unicast Connections in Transport Networks: Routing versus Coding JF - COMPUTER NETWORKS J2 - COMPUT NETW VL - 82 PY - 2015 IS - 1 SP - 68 EP - 80 PG - 13 SN - 1389-1286 DO - 10.1016/j.comnet.2015.02.010 UR - https://m2.mtmt.hu/api/publication/2845913 ID - 2845913 N1 - MTA-BME Future Internet Research Group, Budapest University of Technology and Economics, Hungary MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Hungary Cited By :17 Export Date: 3 February 2022 CODEN: CNETD Correspondence Address: Babarczi, P.; MTA-BME Future Internet Research Group, Budapest University of Technology and EconomicsHungary Funding details: European Commission, EC Funding details: Hungarian Scientific Research Fund, OTKA, K108947 Funding details: Magyar Tudományos Akadémia, MTA Funding details: Seventh Framework Programme, FP7, 605243 Funding text 1: This work was supported by the High Speed Networks Laboratory (HSNLab) at BME. Péter Babarczi was supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences (MTA). Research of Péter Babarczi and János Tapolcai was partially supported by the Hungarian Scientific Research Fund (OTKA Grant K108947 ). This document has been produced with the financial assistance of the European Union under the FP7 GÉANT Project Grant Agreement Number 605243 as part of the MINERVA Open Call Project. LA - English DB - MTMT ER - TY - CHAP AU - Kralevska, Katina AU - Overby, Harald AU - Gligoroski, Danilo TI - Coded Packet Transport for Optical Packet/Burst Switched Networks T2 - 2015 IEEE Global Communications Conference, GLOBECOM 2015 PB - Institute of Electrical and Electronics Engineers (IEEE) CY - New York, New York SN - 9781479959525 PY - 2015 PG - 6 DO - 10.1109/GLOCOM.2015.7417372 UR - https://m2.mtmt.hu/api/publication/32661935 ID - 32661935 AB - 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. LA - English DB - MTMT ER - TY - JOUR AU - Ramirez, Wilson AU - Masip-Bruin, Xavier AU - Marin-Tordera, Eva AU - Sanchez-Lopez, Sergi TI - Managing resilience in carrier grade networks: Survey, open issues and trends JF - COMPUTER COMMUNICATIONS J2 - COMPUT COMMUN VL - 61 PY - 2015 SP - 1 EP - 16 PG - 16 SN - 0140-3664 DO - 10.1016/j.comcom.2015.02.015 UR - https://m2.mtmt.hu/api/publication/24902764 ID - 24902764 N1 - Cited By :6 Export Date: 6 February 2022 CODEN: COCOD Correspondence Address: Ramirez, W.; Advanced Network Architectures Lab (CRAAX), Rambla Exposició 61-69, Spain; email: wramirez@ac.upc.edu Funding details: Ministerio de Ciencia e Innovación, MICINN, TEC2012-34682 Funding details: European Regional Development Fund, FEDER Funding text 1: This work was supported by the Spanish Ministry of Science and Innovation under contract TEC2012-34682, project partially funded by FEDER. LA - English DB - MTMT ER - TY - CONF AU - Avci, SN AU - Ayanoglu, E TI - Link failure recovery in large arbitrary networks via network coding T2 - Information Theory and Applications Workshop (ITA), 2014 PY - 2014 SP - 1 EP - 10 PG - 10 DO - 10.1109/ITA.2014.6804248 UR - https://m2.mtmt.hu/api/publication/24406637 ID - 24406637 N1 - Conference code: 105159 Cited By :2 Export Date: 6 February 2022 LA - English DB - MTMT ER - TY - CHAP AU - Kralevska, K AU - Øverby, H AU - Gligoroski, D TI - Joint balanced source and network coding T2 - 22nd Telecommunications Forum, TELFOR 2014 PB - Institute of Electrical and Electronics Engineers (IEEE) SN - 9781479961900 PB - Institute of Electrical and Electronics Engineers (IEEE) PY - 2014 SP - 589 EP - 592 PG - 4 DO - 10.1109/TELFOR.2014.7034478 UR - https://m2.mtmt.hu/api/publication/25914455 ID - 25914455 N1 - A4 ERICSSON - Belgrade; et al.; International Business Machines d.o.o. (IBM) - Belgrade; IRITEL a.d. BEOGRAD; Ministry of Education, Science and Technological Development; University of Belgrade, ETF - School of Electrical Engineering LA - English DB - MTMT ER - TY - JOUR AU - Muktadir, Abu Hena Al AU - Oki, Eiji TI - Optimum Route Design in 1+ 1 Protection with Network Coding for Instantaneous Recovery JF - IEICE TRANSACTIONS ON COMMUNICATIONS J2 - IEICE T COMMUN VL - 97 PY - 2014 IS - 1 SP - 87 EP - 104 PG - 18 SN - 0916-8516 DO - 10.1587/transcom.E97.B.87 UR - https://m2.mtmt.hu/api/publication/24406696 ID - 24406696 N1 - Cited By :4 Export Date: 6 February 2022 CODEN: ITRCE LA - English DB - MTMT ER - TY - THES AU - Muktadir, Abu Hena Al TI - Reliable Route Design Schemes in Coding Capable Networks PY - 2014 SP - 178 UR - https://m2.mtmt.hu/api/publication/35076410 ID - 35076410 N1 - The University of Electro-Communications (Chōfu, Japan) LA - English DB - MTMT ER - TY - CHAP AU - Ramirez, W AU - Masip-Bruin, X AU - Marin-Tordera, E AU - Yannuzzi, M AU - Martinez, A AU - Sanchez, S AU - Siddiqui, MS AU - Lopez, V TI - A techno-economie study of network coding protection schemes T2 - 2014 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2014) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - New York, New York SN - 9781479935123 T3 - IEEE Global Communications Conference PB - Institute of Electrical and Electronics Engineers (IEEE) PY - 2014 SP - 2148 EP - 2153 PG - 6 DO - 10.1109/GLOCOM.2014.7037126 UR - https://m2.mtmt.hu/api/publication/26427194 ID - 26427194 N1 - A4 LA - English DB - MTMT ER - TY - CHAP AU - Ramirez, W AU - Masip-Bruin, X AU - Yannuzzi, M AU - Montero, D AU - Martinez, A AU - Lopez, V ED - IEEE, null TI - Network coding-based protection scheme for elastic optical networks T2 - 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - New York, New York SN - 9781479940097 PB - IEEE Computer Society PY - 2014 DO - 10.1109/DRCN.2014.6816136 UR - https://m2.mtmt.hu/api/publication/25207319 ID - 25207319 N1 - A4 LA - English DB - MTMT ER - TY - CHAP AU - Ramirez, W. AU - Masip-Bruin, X. AU - Marin-Tordera, E. AU - Yannuzzi, M. AU - Siddiqui, M.S. AU - Martinez, A. AU - Lopez, V. TI - Improving reliability in multi-layer networks with Network Coding Protection T2 - 18th International Conference on Optical Network Design and Modeling (ONDM) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - New York, New York SN - 9783901882609 T3 - ONDM 2014 PY - 2014 SP - 240 EP - 245 PG - 6 UR - https://m2.mtmt.hu/api/publication/32649770 ID - 32649770 N1 - Advanced Network Architectures Lab (CRAAX), Technical University of Catalonia (UPC), Spain Networking and Information Technology Lab, NetIT Lab, Technical University of Catalonia (UPC), Spain Telefonica I+D, Spain Conference code: 106692 Cited By :2 Export Date: 6 February 2022 AB - 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. LA - English DB - MTMT ER - TY - THES AU - Ramírez, Wilson TI - Resilience mechanisms for carrier-grade networks PY - 2014 UR - https://m2.mtmt.hu/api/publication/24414088 ID - 24414088 LA - English DB - MTMT ER - TY - CHAP AU - Avci, Serhat Nazim AU - Ayanoglu, Ender TI - Network coding-based link failure recovery over large arbitrary networks T2 - 2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - New York, New York SN - 9781479913534 PY - 2013 SP - 1519 EP - 1525 PG - 7 DO - 10.1109/GLOCOM.2013.6831289 UR - https://m2.mtmt.hu/api/publication/25259878 ID - 25259878 N1 - Conference code: 106172 Cited By :6 Export Date: 6 February 2022 Funding details: Directorate for Computer and Information Science and Engineering, CISE, 0917176 LA - English DB - MTMT ER - TY - JOUR AU - Avci, S N AU - Ayanoglu, E TI - Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding JF - IEEE TRANSACTIONS ON COMMUNICATIONS J2 - IEEE T COMMUN VL - 61 PY - 2013 IS - 9 SP - 3878 EP - 3893 PG - 16 SN - 0090-6778 DO - 10.1109/TCOMM.2013.071013.120817 UR - https://m2.mtmt.hu/api/publication/23957219 ID - 23957219 N1 - Cited By :6 Export Date: 3 February 2022 CODEN: IECMB Correspondence Address: Pervasive Communications and Computing, , California Irvine, United States LA - English DB - MTMT ER - TY - JOUR AU - Avci, SN AU - Ayanoglu, E TI - Coded path protection: Efficient conversion of sharing to coding JF - IEEE TRANSACTIONS ON COMMUNICATIONS J2 - IEEE T COMMUN VL - 61 PY - 2013 IS - 10 SP - 4294 EP - 4309 PG - 16 SN - 0090-6778 DO - 10.1109/TCOMM.2013.093013.120607 UR - https://m2.mtmt.hu/api/publication/26427197 ID - 26427197 N1 - CODEN: IECMB Correspondence Address: Center for Pervasive Communications and Computing, , Irvine, CA 92697-2625, United States LA - English DB - MTMT ER - TY - JOUR AU - Babarczi, Péter AU - Biczók, Gergely AU - Overby, Harald 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 - Muktadir, Abu Hena Al AU - Phong, Pham Vu AU - Oki, Eiji TI - A mathematical model for network coding aware optimum routing in 1+1 protection for instantaneous recovery with relaxing destination’s node degree constraint JF - IEICE Communication Express J2 - IEICE Communication Express VL - 2 PY - 2013 IS - 12 SP - 512 EP - 517 PG - 6 SN - 2187-0136 DO - 10.1587/comex.2.512 UR - https://m2.mtmt.hu/api/publication/24406648 ID - 24406648 N1 - : Provider: Japan Science and Technology Agency : Database: J-STAGE : Content:text/plain; charset="utf-8" AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Ramirez, W AU - Masip-Bruin, X AU - Yannuzzi, M AU - Serral-Gracia, R AU - Martinez, A ED - Zhijing, Qin ED - Luca, Iannario ED - Carlo, Giannelli ED - Paolo, Bellavista ED - Nalini, Venkatasubramanian TI - An efficient protection strategy using multiple network coding T2 - 2013 International Conference on Smart Communications in Network Technologies, SaCoNeT 2013 PB - Institute of Electrical and Electronics Engineers (IEEE) CY - [s.l.] SN - 9781479906949 PB - Institute of Electrical and Electronics Engineers (IEEE) PY - 2013 DO - 10.1109/SaCoNeT.2013.6654559 UR - https://m2.mtmt.hu/api/publication/26427198 ID - 26427198 N1 - Conference code: 102013 Cited By :4 Export Date: 6 February 2022 Correspondence Address: Advanced Network Architectures Lab (CRAAX)Spain LA - English DB - MTMT ER - TY - CHAP AU - Avci, SN AU - Ayanoglu, E ED - IEEE, null TI - Coded path protection: Efficient conversion of sharing to coding T2 - 2012 IEEE International Conference on Communications, ICC 2012 PB - Institute of Electrical and Electronics Engineers (IEEE) CY - Piscataway (NJ) SN - 9781457720529 PY - 2012 SP - 1198 EP - 1203 PG - 6 DO - 10.1109/ICC.2012.6363902 UR - https://m2.mtmt.hu/api/publication/24406141 ID - 24406141 LA - English DB - MTMT ER - TY - CHAP AU - Avci, SN AU - Ayanoglu, E TI - Optimal algorithms for near-hitless network restoration via diversity coding T2 - 2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) PB - Institute of Electrical and Electronics Engineers (IEEE) CY - New York, New York SN - 9781467309202 T3 - IEEE Global Communications Conference, ISSN 2334-0983 PB - Institute of Electrical and Electronics Engineers (IEEE) PY - 2012 SP - 1877 EP - 1883 PG - 7 DO - 10.1109/GLOCOM.2012.6503389 UR - https://m2.mtmt.hu/api/publication/25207605 ID - 25207605 N1 - Conference code: 96872 Cited By :4 Export Date: 3 February 2022 Correspondence Address: Center for Pervasive Communications and Computing, , Irvine, CA 92697-2625, United States LA - English DB - MTMT ER -