Sciweavers

7544 search results - page 1087 / 1509
» Network Forensics Analysis
Sort
View
PODC
2003
ACM
16 years 1 days ago
Scaling properties of the Internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
PODC
2003
ACM
16 years 1 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
KDD
2010
ACM
215views Data Mining» more  KDD 2010»
15 years 10 months ago
On the quality of inferring interests from social neighbors
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
Zhen Wen, Ching-Yung Lin
CONEXT
2009
ACM
15 years 8 months ago
BUFFALO: bloom filter forwarding architecture for large organizations
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
Minlan Yu, Alex Fabrikant, Jennifer Rexford
CCS
2010
ACM
15 years 7 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler
« Prev « First page 1087 / 1509 Last » Next »