Demo Data from EDBT 2026 / reviewers in the wild / expert
Jianhong Xia
dblp:02/1230
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 2007
0000-0002-2593-9423ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 first-authorSecurity and privacy · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Network security · 100% | |
| Computer networks
1 paper |
Routing and switching · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network security › attack strategy
denial-of-service attack |
0.1 | 1 | 2005 | Flooding Attacks by Exploiting Persistent Forwarding Loops · Internet Measurement Conference 2005 |
Routing and switching › packet forwarding
forwarding loops |
0.0 | 1 | 2005 | Flooding Attacks by Exploiting Persistent Forwarding Loops · Internet Measurement Conference 2005 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | A measurement study of persistent forwarding loops on the Internet
Jianhong Xia, Lixin Gao 0001 |
Comput. Networks | 1 |
| 2006 | Effective worm detection for various scan techniquesabstractIn recent years, the threats and damages caused by active worms have become more and more serious. In order to reduce the loss caused by fast-spreading active worms, an effective detection mechanism to quickly detect worms is desired. In this paper, we first explore various scan strategies used by worms on finding vulnerable hosts. We show that targeted worms spread much faster than random scan worms. We then present a generic worm detection architecture to monitor malicious worm activities. We propose and evaluate our detection mechanism called Victim Number Based Algorithm. We show that our detection algorithm is effective and able to detect worm events before 2% of vulnerable hosts are infected for most scenarios. Furthermore, in order to reduce false alarms, we propose an integrated approach using multiple parameters as indicators to detect worm events. The results suggest that our integrated approach can differentiate worm attacks from DDoS attacks and benign scans. Jianhong Xia, Sarma Vangala, Lixin Gao 0001, Kevin A. Kwiat |
J. Comput. Secur. | 1 |
| 2005 | Flooding Attacks by Exploiting Persistent Forwarding Loops
Jianhong Xia, Lixin Gao 0001 |
Internet Measurement Conference | 1 |
| 2004 | On the evaluation of AS relationship inferences [Internet reachability/traffic flow applications]abstractThe commercial contractual relationship among autonomous systems (ASs) is important for understanding the reachability and traffic flow in the Internet. Several heuristic algorithms have been proposed for inferring AS relationships by extracting information from border gateway protocol (BGP) routing tables. However, there is no evaluation of the AS relationships inferred from existing algorithms. In this paper, we present the methodology for obtaining partial AS relationships, and use them to evaluate these algorithms. Our result shows that although existing algorithms achieve good overall accuracy, the accuracy on the peer-to-peer relationships is quite poor. Furthermore, we propose an algorithm for inferring AS relationships by taking advantage of this partial information. We show that our proposed algorithm outperforms existing algorithms for inferring peer-to-peer relationships by 1.8/spl sim/3.8 times in accuracy. In addition, the overall accuracy of our algorithm is higher than that of existing algorithms. Jianhong Xia, Lixin Gao 0001 |
GLOBECOM | 1 |