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

Shad Stafford

dblp:88/3387 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-0719-099XORCID · reported

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

Security and privacy · 2 · 1 first-author · 1 since 2021Computer 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 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention
intrusion detection
0.712023
On the Detection of Smart, Self-Propagating Internet Worms · IEEE Trans. Dependable Secur. Comput. 2023
Network security › intrusion detection and prevention › intrusion detection › malicious traffic detection
worm detection
0.712023
On the Detection of Smart, Self-Propagating Internet Worms · IEEE Trans. Dependable Secur. Comput. 2023
Network measurement and analytics › traffic measurement
traffic monitoring
0.212023
On the Detection of Smart, Self-Propagating Internet Worms · IEEE Trans. Dependable Secur. Comput. 2023

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

quiescent period detection · 1.3burst duration monitoring · 1.3
YearPublicationVenuePosition
2023 On the Detection of Smart, Self-Propagating Internet Worms
abstract
Self-propagating worms can infect millions of computers on the Internet in just several minutes. As witnessed by the recent Mirai and WannaCry worms, worm attacks are real, destructive, and continue to persist. Although many worm detectors exist, most that we studied suffer from three drawbacks: none systematically consider countermeasures from worm authors, potentially causing low effectiveness against evasive worms; all focus on outbound worms leaving a network, leaving their efficacy against inbound worms entering a network unanswered; and many require bi-directional traffic to detect worms, making their placement on the Internet inflexible. We therefore revisit worm detection in this paper, while avoiding the aforementioned drawbacks of existing work. We describe our design of SWORD, a new worm detector that focuses on the fundamental behavior of worms. It includes two complementary modules to monitor connections from and to a protected network, with one module monitoring burst durations and the other ensuring quiescent periods. Via extensive experiments using both simulated worm traffic and a real-world Mirai worm trace, we demonstrate that SWORD is superior to existing detectors at not only detecting both classic and evasive outbound worms, but also inbound worms, especially those that are superspreading or surreptitious.
Jun Li 0001, Devkishen Sisodia, Shad Stafford
IEEE Trans. Dependable Secur. Comput.3
2010 Behavior-Based Worm Detectors Compared
Shad Stafford, Jun Li 0001
RAID1
2004 A framework for architecting peer-to-peer receiver-driven overlays
abstract
This paper presents a simple and scalable framework for architecting peer-to-peer overlays called Peer-to-peer Receiver-driven Overlay (or PRO). PRO is designed for non-interactive streaming applications and its primary design goal is to maximize delivered bandwidth (and thus delivered quality) to peers with heterogeneous and asymmetric bandwidth. To achieve this goal, PRO adopts a receiver-driven approach where each receiver (or participating peer) (i) independently discovers other peers in the overlay through gossiping, and (ii) selfishly determines the best subset of parent peers through which to connect to the overlay to maximize its own delivered bandwidth. Participating peers form an unstructured overlay which is inherently robust to high churn rate. than structured overlay networks. Furthermore, each receiver leverages congestion controlled bandwidth from its parents as implicit signal to detect and react to long-term changes in network or overlay condition without any explicit coordination with other participating peers. Independent parent selection by individual peers dynamically converge to an efficient overlay structure.
Reza Rejaie, Shad Stafford
NOSSDAV2