TY - CHAP AU - Braun, W. AU - Merling, D. AU - Menth, M. TI - Destination-specific maximally redundant trees: Design, performance comparison, and applications T2 - 21st Conference on Innovation in Clouds, Internet and Networks (ICIN 2018) PB - IEEE CY - New York, New York SN - 9781538634592 T3 - International Conference on Intelligence in Next Generation Networks, ISSN 2162-3414 PY - 2018 SP - 1 EP - 8 PG - 8 DO - 10.1109/ICIN.2018.8401580 UR - https://m2.mtmt.hu/api/publication/31198098 ID - 31198098 N1 - Cited By :1 Export Date: 27 February 2020 LA - English DB - MTMT ER - TY - BOOK AU - Wisniewski, Lukasz TI - New methods to engineer and seamlessly reconfigure time triggered Ethernet based systems during runtime based on the PROFINET IRT example PB - Springer Netherlands CY - Berlin CY - Heidelberg PY - 2017 SN - 9783662546505 DO - 10.1007/978-3-662-54650-5 UR - https://m2.mtmt.hu/api/publication/31254731 ID - 31254731 LA - English DB - MTMT ER - TY - GEN AU - Atlas, A. AU - Bowers, C. AU - Enyedi, G. TI - An Architecture for IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR) PY - 2016 DO - 10.17487/RFC7812 UR - https://m2.mtmt.hu/api/publication/31254732 ID - 31254732 LA - English DB - MTMT ER - TY - JOUR AU - Houthooft, Rein AU - Sahhaf, Sahel AU - Tavernier, Wouter AU - De Turck, Filip AU - Colle, Didier AU - Pickavet, Mario TI - Optimizing Robustness in Geometric Routing Via Embedding Redundancy and Regeneration JF - NETWORKS: AN INTERNATIONAL JOURNAL J2 - NETWORKS VL - 66 PY - 2015 IS - 4 SP - 320 EP - 334 PG - 15 SN - 0028-3045 DO - 10.1002/net.21630 UR - https://m2.mtmt.hu/api/publication/25513925 ID - 25513925 LA - English DB - MTMT ER - TY - CHAP AU - Tapolcai, János AU - Rétvári, Gábor AU - Babarczi, Péter AU - Bérczi-Kovács, Erika AU - Kristof, P AU - Enyedi, G ED - IEEE, null TI - Scalable and efficient multipath routing: Complexity and algorithms T2 - 2015 IEEE 23RD INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP) PB - IEEE Computer Society CY - Piscataway (NJ) SN - 9781467382953 PY - 2015 SP - 376 EP - 385 PG - 10 DO - 10.1109/ICNP.2015.44 UR - https://m2.mtmt.hu/api/publication/3073778 ID - 3073778 N1 - MTA-BME Future Internet Research Group, Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics (BME), Hungary Department of Operations Research, Eötvös University, Budapest, Hungary TrafficLab, Ericsson Research, Hungary Cited By :7 Export Date: 26 February 2020 MTA-BME Future Internet Research Group, Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics (BME), Hungary Department of Operations Research, Eötvös University, Budapest, Hungary TrafficLab, Ericsson Research, Hungary Cited By :7 Export Date: 27 February 2020 WoS:hiba:000378856600035 2020-08-29 07:49 befoglaló egyiknél nincsenek szerzők, befoglaló cím nem egyezik AB - A fundamental unsolved challenge in multipath routing is to provide disjoint end-to-end paths, each one satisfying certain operational goals (e.g., shortest possible), without overwhelming the data plane with prohibitive amount of forwarding state. In this paper, we study the problem of finding a pair of shortest disjoint paths that can be represented by only two forwarding table entries per destination. Building on prior work on minimum length redundant trees, we show that the underlying mathematical problem is NP-complete and we present heuristic algorithms that improve the known complexity bounds from cubic to the order of a single shortest path search. Finally, by extensive simulations we find that it is possible to very closely attain the absolute optimal path length with our algorithms (the gap is just 1 - 5%), eventually opening the door for wide-scale multipath routing deployments. © 2015 IEEE. LA - English DB - MTMT ER - TY - CHAP AU - Houthooft, Rein AU - Sahhaf, Sahel AU - Tavernier, Wouter AU - De Turck, Filip AU - Colle, Didier AU - Pickavet, Mario ED - IEEE, , TI - Fault-tolerant Greedy Forest Routing for complex networks T2 - 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) PB - IEEE CY - New York, New York SN - 1479970395 PB - IEEE PY - 2014 SP - 1 EP - 8 PG - 8 DO - 10.1109/RNDM.2014.7014924 UR - https://m2.mtmt.hu/api/publication/24597583 ID - 24597583 LA - English DB - MTMT ER - TY - CHAP AU - Kuang, K. AU - Wang, S. AU - Wang, X. ED - Jamalipour, A ED - Deng, DJ TI - Discussion on the combination of loop-free alternates and maximally redundant trees for IP networks fast reroute T2 - 2014 IEEE International Conference on Communications (ICC) PB - IEEE CY - Piscataway (NJ) SN - 9781479920037 PY - 2014 SP - 1131 EP - 1136 PG - 6 DO - 10.1109/ICC.2014.6883473 UR - https://m2.mtmt.hu/api/publication/32648855 ID - 32648855 N1 - Conference code: 107408 Cited By :7 Export Date: 5 February 2022 AB - IP Fast Reroute (IP FRR) is the IETF standard for providing fast reaction to failures in IP and MPLS/LDP networks. In the past decade, several IP FRR proposals have been proposed, and among them Loop-Free Alternates (LFA) is the simplest, but it cannot achieve 100% single failure coverage. In contrast, Maximally Redundant Trees (MRT) can provide 100% single failure coverage and seems a promising scheme. However, MRT has some drawbacks as it can lead to long backup detours and heavy network congestion. In this paper we combine MRT with LFA to merge their advantages and improve the quality of protection. Observations of performance evaluation suggest that with almost same time and resource consumption as MRT, our mechanism can greatly enhance the quality of protection in terms of backup path length and maximum link utilization. © 2014 IEEE. LA - English DB - MTMT ER - TY - CHAP AU - Wisniewski, Lukasz AU - Schumacher, Markus AU - Jasperneite, Juergen AU - Diedrich, Christian ED - Grau, Antoni ED - Martinez, Herminio TI - Linear Time, Possibly Disjoint Path Search Approach for Ethernet Based Industrial Automation Networks T2 - 2014 IEEE EMERGING TECHNOLOGY AND FACTORY AUTOMATION (ETFA) PB - IEEE CY - New York, New York CY - Piscataway (NJ) SN - 9781479948451 PB - IEEE PY - 2014 SP - 1 EP - 9 PG - 9 DO - 10.1109/ETFA.2014.7005135 UR - https://m2.mtmt.hu/api/publication/25513926 ID - 25513926 LA - English DB - MTMT ER - TY - JOUR AU - Enyedi, Gábor Sándor AU - Rétvári, Gábor TI - Finding Multiple Redundant Trees in Linear Time JF - PERIODICA POLYTECHNICA-ELECTRICAL ENGINEERING J2 - PERIOD POLYTECH ELECTR ENG VL - 54 PY - 2010 IS - 1-2 SP - 29 EP - 40 PG - 12 SN - 0324-6000 DO - 10.3311/pp.ee.2010-1-2.04 UR - https://m2.mtmt.hu/api/publication/2660729 ID - 2660729 AB - Redundant trees are directed spanning trees, which provide disjoint paths towards their roots. Therefore, this concept is widely applied in the literature both for providing protection and load sharing. The fastest algorithm can find multiple redundant trees, a pair of them rooted at each vertex, in linear time. Unfortunately, edge- or vertex-redundant trees can only be found in 2-edge- or 2-vertex-connected graphs respectively. Therefore, the concept of maximally redundant trees was introduced, which can overcome this problem, and provides maximally disjoint paths towards the common root. In this paper, we propose the first linear time algorithm, which can compute a pair of maximally redundant trees rooted at not only one, but at each vertex. LA - English DB - MTMT ER - TY - CHAP AU - Enyedi, Gábor Sándor AU - Rétvári, Gábor AU - Szilágyi, P AU - Császár, András ED - Fratta, L ED - Schulzrinne, H ED - Takahashi, Y ED - Spaniol, O TI - IP Fast ReRoute: Lightweight Not-Via T2 - NETWORKING 2009 PB - Springer Netherlands CY - Berlin SN - 9783642013980 T3 - Lecture Notes in Computer Science, ISSN 0302-9743 ; 5550. PY - 2009 SP - 157 EP - 168 PG - 12 DO - 10.1007/978-3-642-01399-7_13 UR - https://m2.mtmt.hu/api/publication/2644763 ID - 2644763 N1 - WoS:hiba:000267377300013 2020-08-27 05:50 befoglaló cím nem egyezik LA - English DB - MTMT ER - TY - CHAP AU - Enyedi, Gábor Sándor AU - Szilágyi, P AU - Rétvári, Gábor AU - Császár, András ED - Ziviani, A. TI - IP Fast ReRoute: Lightweight Not-Via without Additional Addresses T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009 PB - IEEE CY - Piscataway (NJ) SN - 1424435137 T3 - IEEE Infocom PY - 2009 SP - 2771 EP - 2775 PG - 5 DO - 10.1109/INFCOM.2009.5062229 UR - https://m2.mtmt.hu/api/publication/2644761 ID - 2644761 LA - English DB - MTMT ER -