Obserwuj
Janos Tapolcai
Janos Tapolcai
Full Professor of Budapest University of Technology and Economics, MTA-BME Future Internet Research
Zweryfikowany adres z tmit.bme.hu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels
PH Ho, J Tapolcai, T Cinkler
IEEE/ACM Transactions on Networking 12 (6), 1105-1118, 2004
1492004
On batch verification with group testing for vehicular communications
C Zhang, PH Ho, J Tapolcai
Wireless Networks 17 (8), 1851-1865, 2011
1412011
A survey of strategies for communication networks to protect against large-scale natural disasters
T Gomes, J Tapolcai, C Esposito, D Hutchison, F Kuipers, J Rak, ...
2016 8th international workshop on resilient networks design and modeling …, 2016
1182016
Optimal relay station placement in broadband wireless access networks
B Lin, PH Ho, LL Xie, X Shen, J Tapolcai
IEEE Transactions on Mobile Computing 9 (2), 259-269, 2009
1182009
Compressing IP forwarding tables: Towards entropy bounds and beyond
G Rétvári, J Tapolcai, A Kőrösi, A Majdán, Z Heszberger
Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, 111-122, 2013
1112013
On monitoring and failure localization in mesh all-optical networks
J Tapolcai, B Wu, PH Ho
IEEE INFOCOM 2009, 1008-1016, 2009
92*2009
Quality of resilience as a network reliability characterization tool
P Cholda, J Tapolcai, T Cinkler, K Wajda, A Jajszczyk
IEEE network 23 (2), 11-19, 2009
902009
IP Fast ReRoute: Loop Free Alternates Revisited
G Rétvári, J Tapolcai, G Enyedi, A Császár
IEEE INFOCOM, available online: http://opti. tmit. bme. hu/~ enyedi/ipfrr …, 2011
872011
On achieving optimal survivable routing for shared protection in survivable next-generation Internet
PH Ho, J Tapolcai, HT Mouftah
Reliability, IEEE Transactions on 53 (2), 216-225, 2004
782004
RECODIS: Resilient communication services protecting end-user applications from disaster-based failures
J Rak, D Hutchison, E Calle, T Gomes, M Gunkel, P Smith, J Tapolcai, ...
2016 18th International Conference on Transparent Optical Networks (ICTON), 1-4, 2016
692016
Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks
P Laborczi, J Tapolcai, PH Ho, T Cinkler, A Recski, HT Mouftah
Proceedings of design of reliable communication networks (DCRN 2001), 220-227, 2001
60*2001
A novel approach for failure localization in all-optical mesh networks
J Tapolcai, B Wu, PH Ho, L Rónyai
IEEE/ACM Transactions on Networking 19 (1), 275-285, 2010
522010
A new shared segment protection method for survivable networks with guaranteed recovery time
J Tapolcai, PH Ho, D Verchére, T Cinkler, A Haque
IEEE Transactions on Reliability 57 (2), 272-282, 2008
522008
Beacon deployment for unambiguous positioning
W He, PH Ho, J Tapolcai
IEEE Internet of Things Journal 4 (5), 1370-1379, 2017
512017
Optical layer monitoring schemes for fast link failure localization in all-optical networks
B Wu, PH Ho, KL Yeung, J Tapolcai, HT Mouftah
IEEE Communications Surveys & Tutorials 13 (1), 114-125, 2010
462010
Optimal allocation of monitoring trails for fast SRLG failure localization in all-optical networks
B Wu, PH Ho, J Tapolcai, P Babarczi
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 1-5, 2010
422010
Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails
J Tapolcai, PH Ho, L Rónyai, B Wu
IEEE/ACM Transactions on Networking 20 (6), 1762-1773, 2012
412012
Failure localization for shared risk link groups in all-optical mesh networks using monitoring trails
J Tapolcai, PH Ho, L Rónyai, P Babarczi, B Wu
Journal of Lightwave Technology 29 (10), 1597-1606, 2011
392011
Adjacent link failure localization with monitoring trails in all-optical mesh networks
P Babarczi, J Tapolcai, PH Ho
IEEE/ACM transactions on networking 19 (3), 907-920, 2011
382011
Bloom filter with a false positive free zone
SZ Kiss, É Hosszu, J Tapolcai, L Rónyai, O Rottenstreich
IEEE Transactions on Network and Service Management 18 (2), 2334-2349, 2021
372021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20