Sciweavers

1807 search results - page 307 / 362
» Resilient Overlay Networks
Sort
View
RAID
2005
Springer
14 years 2 months ago
Polymorphic Worm Detection Using Structural Information of Executables
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
Christopher Krügel, Engin Kirda, Darren Mutz,...
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 10 months ago
Clustering wavelets to speed-up data dissemination in structured P2P MANETs
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
Mihai Lupu, Jianzhong Li, Beng Chin Ooi, Shengfei ...
PODS
2006
ACM
96views Database» more  PODS 2006»
14 years 8 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
SAC
2009
ACM
14 years 3 months ago
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
Gian Paolo Jesi, Edoardo Mollona, Srijith K. Nair,...
P2P
2009
IEEE
114views Communications» more  P2P 2009»
14 years 3 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...