Sciweavers

1278 search results - page 196 / 256
» Attack Graph Based Evaluation of Network Security
Sort
View
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 9 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
SIGCOMM
2004
ACM
14 years 2 months ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
MOBIHOC
2001
ACM
14 years 8 months ago
Comparison between graph-based and interference-based STDMA scheduling
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
Anders Hansson, Jimmi Grönkvist
CEC
2008
IEEE
14 years 3 months ago
DCA for bot detection
Abstract— Ensuring the security of computers is a nontrivial task, with many techniques used by malicious users to compromise these systems. In recent years a new threat has emer...
Yousof Al-Hammadi, Uwe Aickelin, Julie Greensmith