We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Signature-based schemes for detecting Internet worms often fail on zero-day worms, and their ability to rapidly react to new threats is typically limited by the requirement of som...
David Whyte, Paul C. van Oorschot, Evangelos Krana...
There have been various secure routing protocols proposed for mobile ad hoc networks. Most of these protocols are analyzed by two standard techniques: simulation and security anal...
Yuxia Lin, Amir Hamed Mohsenian Rad, Vincent W. S....
In order to understand the evolution of online identities, we measured the correlation between past and current representations of self on the MySpace social network. We applied s...
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...