@inproceedings{MTMT:31198098,
	title = {Destination-specific maximally redundant trees: Design, performance comparison, and applications},
	url = {https://m2.mtmt.hu/api/publication/31198098},
	author = {Braun, W. and Merling, D. and Menth, M.},
	booktitle = {21st Conference on Innovation in Clouds, Internet and Networks (ICIN 2018)},
	doi = {10.1109/ICIN.2018.8401580},
	unique-id = {31198098},
	year = {2018},
	pages = {1-8}
}

@book{MTMT:31254731,
	title = {New methods to engineer and seamlessly reconfigure time triggered Ethernet based systems during runtime based on the PROFINET IRT example},
	url = {https://m2.mtmt.hu/api/publication/31254731},
	isbn = {9783662546499},
	author = {Wisniewski, Lukasz},
	doi = {10.1007/978-3-662-54650-5},
	publisher = {Springer Netherlands},
	unique-id = {31254731},
	year = {2017}
}

@misc{MTMT:31254732,
	title = {An Architecture for IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)},
	url = {https://m2.mtmt.hu/api/publication/31254732},
	author = {Atlas, A. and Bowers, C. and Enyedi, G.},
	doi = {10.17487/RFC7812},
	unique-id = {31254732},
	year = {2016}
}

@article{MTMT:25513925,
	title = {Optimizing Robustness in Geometric Routing Via Embedding Redundancy and Regeneration},
	url = {https://m2.mtmt.hu/api/publication/25513925},
	author = {Houthooft, Rein and Sahhaf, Sahel and Tavernier, Wouter and De Turck, Filip and Colle, Didier and Pickavet, Mario},
	doi = {10.1002/net.21630},
	journal-iso = {NETWORKS},
	journal = {NETWORKS: AN INTERNATIONAL JOURNAL},
	volume = {66},
	unique-id = {25513925},
	issn = {0028-3045},
	year = {2015},
	eissn = {1097-0037},
	pages = {320-334}
}

@inproceedings{MTMT:3073778,
	title = {Scalable and efficient multipath routing: Complexity and algorithms},
	url = {https://m2.mtmt.hu/api/publication/3073778},
	author = {Tapolcai, János and Rétvári, Gábor and Babarczi, Péter and Bérczi-Kovács, Erika and Kristof, P and Enyedi, G},
	booktitle = {2015 IEEE 23RD INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP)},
	doi = {10.1109/ICNP.2015.44},
	unique-id = {3073778},
	abstract = {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.},
	keywords = {Computational complexity; Algorithms; complex networks; Network protocols; Trees (mathematics); Heuristic algorithms; Spanning tree; Independent spanning trees; Minimal path; Redundant trees; Protection routing; Not-all-equal 3SAT; Minimal path length},
	year = {2015},
	pages = {376-385},
	orcid-numbers = {Babarczi, Péter/0000-0003-1644-2172; Bérczi-Kovács, Erika/0000-0003-2259-0868}
}

@inproceedings{MTMT:24597583,
	title = {Fault-tolerant Greedy Forest Routing for complex networks},
	url = {https://m2.mtmt.hu/api/publication/24597583},
	author = {Houthooft, Rein and Sahhaf, Sahel and Tavernier, Wouter and De Turck, Filip and Colle, Didier and Pickavet, Mario},
	booktitle = {2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)},
	doi = {10.1109/RNDM.2014.7014924},
	publisher = {Institute of Electrical and Electronics Engineers},
	unique-id = {24597583},
	year = {2014},
	pages = {1-8}
}

@inproceedings{MTMT:32648855,
	title = {Discussion on the combination of loop-free alternates and maximally redundant trees for IP networks fast reroute},
	url = {https://m2.mtmt.hu/api/publication/32648855},
	author = {Kuang, K. and Wang, S. and Wang, X.},
	booktitle = {2014 IEEE International Conference on Communications (ICC)},
	doi = {10.1109/ICC.2014.6883473},
	unique-id = {32648855},
	abstract = {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.},
	keywords = {COMBINATION; COMBINATION; evaluation; COMMUNICATION; COMMUNICATION; Forestry; Forestry; Redundant trees; Resource consumption; Loop-Free Alternates; Loop-Free Alternates; IP Fast Reroute; IP Fast Reroute; Network congestions; Link utilization; Maximally Redundant Trees; Quality of protections},
	year = {2014},
	pages = {1131-1136}
}

@inproceedings{MTMT:25513926,
	title = {Linear Time, Possibly Disjoint Path Search Approach for Ethernet Based Industrial Automation Networks},
	url = {https://m2.mtmt.hu/api/publication/25513926},
	author = {Wisniewski, Lukasz and Schumacher, Markus and Jasperneite, Juergen and Diedrich, Christian},
	booktitle = {2014 IEEE EMERGING TECHNOLOGY AND FACTORY AUTOMATION (ETFA)},
	doi = {10.1109/ETFA.2014.7005135},
	publisher = {Institute of Electrical and Electronics Engineers},
	unique-id = {25513926},
	year = {2014},
	pages = {1-9}
}

@article{MTMT:2660729,
	title = {Finding Multiple Redundant Trees in Linear Time},
	url = {https://m2.mtmt.hu/api/publication/2660729},
	author = {Enyedi, Gábor Sándor and Rétvári, Gábor},
	doi = {10.3311/pp.ee.2010-1-2.04},
	journal-iso = {PERIOD POLYTECH ELECTR ENG},
	journal = {PERIODICA POLYTECHNICA-ELECTRICAL ENGINEERING},
	volume = {54},
	unique-id = {2660729},
	issn = {0324-6000},
	abstract = {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.},
	year = {2010},
	eissn = {1587-3781},
	pages = {29-40}
}

@inproceedings{MTMT:2644763,
	title = {IP Fast ReRoute: Lightweight Not-Via},
	url = {https://m2.mtmt.hu/api/publication/2644763},
	author = {Enyedi, Gábor Sándor and Rétvári, Gábor and Szilágyi, P and Császár, András},
	booktitle = {NETWORKING 2009},
	doi = {10.1007/978-3-642-01399-7_13},
	unique-id = {2644763},
	year = {2009},
	pages = {157-168}
}

@inproceedings{MTMT:2644761,
	title = {IP Fast ReRoute: Lightweight Not-Via without Additional Addresses},
	url = {https://m2.mtmt.hu/api/publication/2644761},
	author = {Enyedi, Gábor Sándor and Szilágyi, P and Rétvári, Gábor and Császár, András},
	booktitle = {28th Conference on Computer Communications, IEEE INFOCOM 2009},
	doi = {10.1109/INFCOM.2009.5062229},
	unique-id = {2644761},
	year = {2009},
	pages = {2771-2775}
}