Gábor Rétvári
TitleCited byYear
Compressing IP forwarding tables: Towards entropy bounds and beyond
G Rétvári, J Tapolcai, A Kőrösi, A Majdán, Z Heszberger
ACM SIGCOMM Computer Communication Review 43 (4), 111-122, 2013
752013
IP fast reroute: Loop free alternates revisited
G Rétvári, J Tapolcai, G Enyedi, A Császár
2011 Proceedings IEEE INFOCOM, 2948-2956, 2011
652011
IP fast reroute: Lightweight not-via without additional addresses
G Enyedi, P Szilágyi, G Rétvári, A Császár
IEEE INFOCOM 2009, 2771-2775, 2009
492009
Practical OSPF traffic engineering
G Rétvári, T Cinkler
IEEE Communications Letters 8 (11), 689-691, 2004
472004
On shortest path representation
G Rétvári, JJ Bíró, T Cinkler
IEEE/ACM Transactions on Networking (TON) 15 (6), 1293-1306, 2007
402007
Navigable networks as Nash equilibria of navigation games
A Gulyás, JJ Bíró, A Kőrösi, G Rétvári, D Krioukov
Nature communications 6, 7651, 2015
382015
Converging the evolution of router architectures and IP networks
A Császár, G Enyedi, G Retvari, M Hidell, P Sjödin
IEEE Network 21 (4), 8-14, 2007
332007
A precomputation scheme for minimum interference routing: the Least-Critical-Path-First algorithm
G Rétvári, JJ Bíró, T Ciinkler, T Henk
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and …, 2005
302005
A novel loop-free IP fast reroute algorithm
G Enyedi, G Rétvári, T Cinkler
Meeting of the European Network of Universities and Companies in Information …, 2007
272007
Dataplane specialization for high-performance openflow software switching
L Molnár, G Pongrácz, G Enyedi, ZL Kis, L Csikor, F Juhász, A Kőrösi, ...
Proceedings of the 2016 ACM SIGCOMM Conference, 539-552, 2016
262016
On finding maximally redundant trees in strictly linear time
G Enyedi, G Retvaria, A Császár
2009 IEEE Symposium on Computers and Communications, 206-211, 2009
232009
Optimizing IGP link costs for improving IP-level resilience
G Rétvári, L Csikor, J Tapolcai, G Enyedi, A Császár
2011 8th International Workshop on the Design of Reliable Communication …, 2011
222011
Lying your way to better traffic engineering
M Chiesa, G Rétvári, M Schapira
Proceedings of the 12th International on Conference on emerging Networking …, 2016
192016
OSPF for implementing self-adaptive routing in autonomic networks: A case study
G Rétvári, F Németh, R Chaparadza, R Szabó
IEEE International Workshop on Modelling Autonomic Communications …, 2009
192009
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates
L Csikor, J Tapolcai, G Rétvári
Computer Communications 36 (6), 645-655, 2013
172013
Optimal OSPF traffic engineering using legacy Equal Cost Multipath load balancing
K Németh, A Kőrösi, G Rétvári
2013 IFIP Networking Conference, 1-9, 2013
162013
Class-based minimum interference routing for traffic engineering in optical networks
J Tapolcai, P Fodor, G Rétvári, M Maliosz, T Cinkler
Next Generation Internet Networks, 2005, 31-38, 2005
162005
On the representability of arbitrary path sets as shortest paths: Theory, algorithms, and complexity
G Rétvári, R Szabó, JJ Bíró
International Conference on Research in Networking, 1180-1191, 2004
162004
Finding multiple maximally redundant trees in linear time
G Enyedi, G Rétvári
Periodica Polytechnica Electrical Engineering 54 (1-2), 29-40, 2011
132011
IP fast reroute with remote Loop-Free Alternates: The unit link cost case
L Csikor, G Rétvári
2012 IV International Congress on Ultra Modern Telecommunications and …, 2012
122012
The system can't perform the operation now. Try again later.
Articles 1–20