Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Accuracy (1)
- Ad hoc networks (1)
- Aggregates (1)
- Arbitrary node lifetime distributions (1)
- Botnet proliferation (1)
-
- Bro (1)
- Chen-Stein theorem (1)
- Classical Poisson convergence analysis (1)
- Computer network security (1)
- Computer viruses (1)
- Convoluted dependency (1)
- Degree-irregular graph (1)
- Degree-regular graph (1)
- Delay (1)
- Distributed systems (1)
- Dynamic random graphs (1)
- Edge-arrival process superposition (1)
- Edge-creation process (1)
- Electronic mail (1)
- Fast scan techniques (1)
- Generic modeling framework (1)
- Graph theory (1)
- Grippers (1)
- Heterogeneous edge process superposition (1)
- Horizontal IP scanning (1)
- Host scanning (1)
- IDS tools (1)
- IP networks (1)
Articles 1 - 2 of 2
Full-Text Articles in Theory and Algorithms
Stochastic Analysis Of Horizontal Ip Scanning, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Stochastic Analysis Of Horizontal Ip Scanning, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
Intrusion Detection Systems (IDS) have become ubiquitous in the defense against virus outbreaks, malicious exploits of OS vulnerabilities, and botnet proliferation. As attackers frequently rely on host scanning for reconnaissance leading to penetration, IDS is often tasked with detecting scans and preventing them. However, it is currently unknown how likely an IDS is to detect a given Internet-wide scan pattern and whether there exist sufficiently fast scan techniques that can remain virtually undetectable at large-scale. To address these questions, we propose a simple analytical model for the window-expiration rules of popular IDS tools (i.e., Snort and Bro) and utilize a …
On Superposition Of Heterogeneous Edge Processes In Dynamic Random Graphs, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
On Superposition Of Heterogeneous Edge Processes In Dynamic Random Graphs, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
Computer Science Faculty Publications
This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive states, which represent churn behavior of modern distributed systems. We prove that despite heterogeneity of node lifetimes, different initial out-degree, non-Poisson arrival/failure dynamics, and complex spatial and temporal dependency among creation of both initial and replacement edges, a superposition of edge-arrival processes to a live node under uniform selection converges to a Poisson process when system size becomes sufficiently large. Due to the convoluted dependency and non-renewal nature of various point processes, this result significantly …