Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pierfrancesco Urbano

dblp:133/3856 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

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
Network measurement and analytics · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics
traffic analysis
0.212013
Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs · INFOCOM 2013
Network security › intrusion detection and prevention › intrusion detection › malicious traffic detection
botnet detection
0.212013
Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs · INFOCOM 2013
Network security › intrusion detection and prevention
intrusion detection
0.212013
Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs · INFOCOM 2013
Network security › intrusion detection and prevention › bot detection
p2p botnet detection
0.212013
Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs · INFOCOM 2013
Network security
anonymity networks
0.012013
Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs · INFOCOM 2013
Network security › traffic analysis
encrypted traffic analysis
0.012013
Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs · INFOCOM 2013

Methods — techniques the papers use, named apart from their topics

meta-graph analysis · 0.3graph-based detection · 0.3community detection · 0.3
YearPublicationVenuePosition
2013 Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs
abstract
In this paper we review state-of-the-art botnet detection algorithms that reveal the control traffic of malicious peer-topeer (P2P) networks by targeting topological properties of their interconnectivity graph. This class of detection methods does not rely on the exchanged content and therefore is also applicable to encrypted control traffic. However, in practice, an ISP monitoring customer traffic over an edge router will usually see only a fraction of the overall botnet, thus restricting the available bot connectivity information and limiting the applicability of general community detection approaches. In this paper we critically review graph based detection methods suitable for edge router monitoring using two types of real network traces. We show experimentally that using meta-graphs of mutual contacts proposed by Coskun et al. 2010 has the highest potential on result quality. We improve this approach by presenting a computationally less complex algorithm with similar result quality. Furthermore we explain ways to alleviate the cost of dealing with false positives in the result set.
Stefan Rührup, Pierfrancesco Urbano, Andreas Berger, Alessandro D'Alconzo
INFOCOM2