Name
Affiliation
Papers
JÁNOS TAPOLCAI
Department of Telecommunications and Media Informatics, Budapest University of Technology, Budapest, Hungary
86
Collaborators
Citations 
PageRank 
88
364
41.42
Referers 
Referees 
References 
673
1008
762
Search Limit
1001000
Title
Citations
PageRank
Year
On Network Topology Augmentation for Global Connectivity under Regional Failures10.362021
Adaptive Protection of Scientific Backbone Networks Using Machine Learning00.342021
Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters30.402021
Enumerating Maximal Shared Risk Link Groups of Circular Disk Failures Hitting <italic>k</italic> Nodes10.352021
The earth is nearly flat: Precise and approximate algorithms for detecting vulnerable regions of networks in the plane and on the sphere10.352020
On separating systems with bounded set size00.342020
Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size10.352020
Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding00.342020
The Performance of Multi-Path TCP with Overlapping Paths.00.342019
Scalable and Efficient Multipath Routing via Redundant Trees10.362019
Bloom Filter With a False Positive Free Zone30.372018
Vulnerable Regions of Networks on Sphere10.352018
A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.00.342018
Node Virtualization for IP Level Resilience.20.362018
Unambiguous switching link group failure localization in all-optical networks00.342017
A novel m-trail allocation method for SRLG fault localization in all-optical networks.00.342017
Diversity Coding in Two-Connected Networks.20.402017
Beacon Deployment for Unambiguous Positioning.50.472017
Optimal Rule Caching and Lossy Compression for Longest Prefix Matching60.462017
On Pricing of 5G Services.00.342017
Shared Risk Link Group Enumeration of Node Excluding Disaster Failures10.352016
Enumerating circular disk failures covering a single node10.352016
On Optimal Topology Verification and Failure Localization for Software Defined Networks.30.392016
Signaling free localization of node failures in all-optical networks10.402016
Instantaneous recovery of unicast connections in transport networks: Routing versus coding.90.642015
SRLG fault localization using nested m-trails10.402015
Scalable and Efficient Multipath Routing: Complexity and Algorithms20.382015
Constructions for unambiguous node failure localization in grid topologies00.342015
Combinatorial error detection in linear encoders00.342015
A heuristic algorithm for network-wide local unambiguous node failure localization00.342015
Survivable routing meets diversity coding30.392015
Robust Network Coding in transport networks30.392015
SRLG fault localization in all-optical networks00.342015
On a Parity Based Group Testing Algorithm.00.342015
SRLG failure localization using nested m‐trails and their application to adaptive probing00.342015
Resilient flow decomposition of unicast connections with network coding.50.542014
Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates20.372014
An Information-Theoretic Approach to Routing Scalability00.342014
Survey on out-of-band failure localization in all-optical mesh networks30.402014
Development and Performance Evaluation of Fast Combinatorial Unranking Implementations.00.342014
Shared risk link group failure restoration with in-band approximate failure localization.20.412013
New addressing scheme to increase reliability in MPLS with network coding30.442013
Realization strategies of dedicated path protection: A bandwidth cost perspective80.622013
Memory size bounds of prefix DAGs00.342013
Sufficient conditions for protection routing in IP networks.20.362013
Compressing IP forwarding tables: towards entropy bounds and beyond310.842013
Physical impairments of monitoring trails in all optical transparent networks.40.442013
On Achieving All-Optical Failure Restoration Via Monitoring Trails40.512013
On integrating failure localization with network survivable design00.342013
High Availability in the Future Internet.00.342013
  • 1
  • 2