Sciweavers

990 search results - page 90 / 198
» An efficient data structure for network anomaly detection
Sort
View
CIKM
2009
Springer
13 years 12 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
CONPAR
1992
14 years 4 days ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
COMCOM
2004
138views more  COMCOM 2004»
13 years 8 months ago
Issues with inferring Internet topological attributes
A number of recent studies of Internet network structure are based on data collected from inter-domain BGP routing tables and tools, such as traceroute, to probe end-to-end paths....
Lisa Amini, Anees Shaikh, Henning Schulzrinne
AUSDM
2008
Springer
225views Data Mining» more  AUSDM 2008»
13 years 10 months ago
Service-independent payload analysis to improve intrusion detection in network traffic
The popularity of computer networks broadens the scope for network attackers and increases the damage these attacks can cause. In this context, Intrusion Detection Systems (IDS) a...
Iñigo Perona, Ibai Gurrutxaga, Olatz Arbela...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...